mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-02-25 18:38:39 +00:00
fixed rsa doctest import
This commit is contained in:
parent
9f5f4ffcd5
commit
45c6818fa2
@ -2,8 +2,7 @@ import os
|
|||||||
import random
|
import random
|
||||||
import sys
|
import sys
|
||||||
|
|
||||||
import cryptomath_module
|
from . import cryptomath_module, rabin_miller
|
||||||
import rabin_miller
|
|
||||||
|
|
||||||
|
|
||||||
def main() -> None:
|
def main() -> None:
|
||||||
@ -17,9 +16,9 @@ def generate_key(key_size: int) -> tuple[tuple[int, int], tuple[int, int]]:
|
|||||||
>>> random.seed(0) # for repeatability
|
>>> random.seed(0) # for repeatability
|
||||||
>>> public_key, private_key = generate_key(8)
|
>>> public_key, private_key = generate_key(8)
|
||||||
>>> public_key
|
>>> public_key
|
||||||
(46513, 197)
|
(26569, 239)
|
||||||
>>> private_key
|
>>> private_key
|
||||||
(46513, 2573)
|
(26569, 2855)
|
||||||
"""
|
"""
|
||||||
p = rabin_miller.generate_large_prime(key_size)
|
p = rabin_miller.generate_large_prime(key_size)
|
||||||
q = rabin_miller.generate_large_prime(key_size)
|
q = rabin_miller.generate_large_prime(key_size)
|
||||||
|
Loading…
x
Reference in New Issue
Block a user