% d Z ddlmZ ddlmZ ddlmZ dZdZddZ d Z
dd l m Z
ee
dd
Zdd Zd Zd
ZdS )zHFunctions to create and test prime numbers.
:undocumented: __package__
)Random)Integer)
iter_range Nc t | t st | } | dv rt S | rt S t d }t | dz
}|t j j }t | }d}| r |dz }|dz
}| t | D ]}d}|||fv r4t j d| dz
| }d|cxk r | dz
k sn J |||fv 4t ||| } | ||fv rVt d| D ],}
t | d| } | |k r n| |k r t c c S -t c S t S )a: Perform a Miller-Rabin primality test on an integer.
The test is specified in Section C.3.1 of `FIPS PUB 186-4`__.
:Parameters:
candidate : integer
The number to test for primality.
iterations : integer
The maximum number of iterations to perform before
declaring a candidate a probable prime.
randfunc : callable
An RNG function where bases are taken from.
:Returns:
``Primality.COMPOSITE`` or ``Primality.PROBABLY_PRIME``.
.. __: http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf
r r Nr r )
min_inclusive
max_inclusiverandfunc)
isinstancer PROBABLY_PRIMEis_even COMPOSITEr newreadr random_rangepow) candidate
iterationsr one minus_onemaibasezjs w/builddir/build/BUILD/imunify360-venv-2.6.2/opt/imunify360/venv/lib64/python3.11/site-packages/Crypto/Math/Primality.pymiller_rabin_testr" - s ( i ) ) 'I&& L
!**C A
&&I:<<$ A A
))++ a Q ))++
#
# sI&&&'a"+a- %' ' 'D ---- A
------ sI&&&
a # # i Aq!! AAq)$$AI~~Cxx c t | t st | } | dv rt S | s| rt
S d } | D ]6}| || fv r
t j || }|dk r t
c S |dk r n7| dz }| dz
}t d }t d }t d }t d } t |dz
dd D ]F}
| | ||z }|| z }| | | |z } | |z } |
|| | r| | z
} | dz } | | z } | |
r| | || z
}| r|| z
}|dz }|| z }| | |
|| | r|| z
}|dz }|| z } | | | | H|dk rt S t
S )a_ Perform a Lucas primality test on an integer.
The test is specified in Section C.3.3 of `FIPS PUB 186-4`__.
:Parameters:
candidate : integer
The number to test for primality.
:Returns:
``Primality.COMPOSITE`` or ``Primality.PROBABLY_PRIME``.
.. __: http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf
r c 3 > K d} | V | dk r| dz
} n| dz } | } )Nr Tr r )values r! alternatez lucas_test..alternate sB KKKqyy
FE
r# r r )
r r r r is_perfect_squarer
jacobi_symbol size_in_bitsr setmultiply_accumulateis_oddget_bit) r r( DjsKrU_iV_iU_tempV_tempr s r!
lucas_testr9 w s i ) ) 'I&& L i 9 9 ; ; Y[[ QB
"1i
0
0
77
88 E A
A 1 A !**C
!**C
QZZF
QZZF
Ar2
&
& ! !
3#
)
3#
! ""3,,, ==?? i F1 ) 99Q<< GGFOOO 6MCzz||
!y AIC 9 C GGFOOO # #FA . . .zz||
!y AIC 9 CC GGFOOO GGFOOOO
axx r# )
sieve_based c \ |t j j }t | t st | } t | t v rt S t | j t n# t $ r
t cY S w xY wd}| t t fd| d d }n# t $ r d}Y nw xY wt! | || t k rt S t# | t k rt S t S )a Test if a number is prime.
A number is qualified as prime if it passes a certain
number of Miller-Rabin tests (dependent on the size
of the number, but such that probability of a false
positive is less than 10^-30) and a single Lucas test.
For instance, a 1024-bit candidate will need to pass
4 Miller-Rabin tests.
:Parameters:
candidate : integer
The number to test for primality.
randfunc : callable
The routine to draw random bytes from to select Miller-Rabin bases.
:Returns:
``PROBABLE_PRIME`` if the number if prime with very high probability.
``COMPOSITE`` if the number is a composite.
For efficiency reasons, ``COMPOSITE`` is also returned for small primes.
N)
) )i )i )i
)il )i )iz r )i )i r
)it r c | d k S )Nr r& )xbit_sizes r! z%test_probable_prime.. s h1o r# r r r )r r r r r int _sieve_baser mapfail_if_divisible_by
ValueErrorr r, listfilter
IndexErrorr" r9 )r r mr_ranges
mr_iterationsrG s @r! test_probable_primerT s_ , :<<$ i ) ) 'I&& 9~~$$ I *K8888 'I %%''H V$=$=$=$=$- / / 0 0013346
M"*, , ,/89 9) )) s$ A9 9B
B
',C C#"C#c | dd }| dd }| dd }| r$t d| z |t d |dk rt d |t j j }t }|t k r@t j ||
d z } || s0t || }|t k @|S ) ax Generate a random probable prime.
The prime will not have any specific properties
(e.g. it will not be a *strong* prime).
Random numbers are evaluated for primality until one
passes all tests, consisting of a certain number of
Miller-Rabin tests with random bases followed by
a single Lucas test.
The number of Miller-Rabin iterations is chosen such that
the probability that the output number is a non-prime is
less than 1E-30 (roughly 2^{-100}).
This approach is compliant to `FIPS PUB 186-4`__.
:Keywords:
exact_bits : integer
The desired size in bits of the probable prime.
It must be at least 160.
randfunc : callable
An RNG function where candidate primes are taken from.
prime_filter : callable
A function that takes an Integer as parameter and returns
True if the number can be passed to further primality tests,
False if it should be immediately discarded.
:Return:
A probable prime in the range 2^exact_bits > p > 2^(exact_bits-1).
.. __: http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.186-4.pdf
exact_bitsNr prime_filterc dS )NTr& )rF s r! rH z)generate_probable_prime..< s r# Unknown parameters: z Missing exact_bits parameter z Prime number is not big enough.rV r r )
poprN keysr r r r r randomrT )kwargsrV r rW resultr s r! generate_probable_primera s D L$//Jzz*d++H::nnn==L
A/&++--?@@@7888C:;;;:<<$
F
I
Nj,46 6 689: |I&& $Y99 I
r# c | dd }| dd }| r$t d| z |t j j }t }|t k rQt |dz
| }|dz dz }| |k r@t || }|t k Q|S ) a Generate a random, probable safe prime.
Note this operation is much slower than generating a simple prime.
:Keywords:
exact_bits : integer
The desired size in bits of the probable safe prime.
randfunc : callable
An RNG function where candidate primes are taken from.
:Return:
A probable safe prime in the range
2^exact_bits > p > 2^(exact_bits-1).
rV Nr rY r r[ r rI )
r\ rN r] r r r r ra r, rT )r_ rV r r` qr s r! generate_probable_safe_primerd R s L$//Jzz*d++H
A/&++--?@@@:<<$
F
I
#zA~ Q Q QEAI ! ! # #z 1 1 $YBBB I
r# )N)__doc__Cryptor Crypto.Math.Numbersr Crypto.Util.py3compatr r r r" r9 Crypto.Util.numberr: _sieve_base_larger- rK rT ra rd r& r# r! rk s >
' ' ' ' ' ' , , , , , ,
G G G GT^ ^ ^B ? > > > > > c#DSD)** 7 7 7 7t7 7 7t r#