B

��c�
�@s<dZd
dl
mZ
d
dlmZ
d
dd�
ZGdd	�d	ej�ZdS)z$Id$�)
�pubkey)
�numberN�

cCs�t�}t
|�
|_|r|d
�

d}}xFt�||�
|krjt�|d?|jd|
�}t�||d?|jd|
�}q&W||kr~||}}||_||_|r�|d�

t�	|j|j�|_
|j|j|_|r�|d�

t�	|j|jd|jd�|_|d|��k
s�t
d�
�
|S)a
generate(bits:int, randfunc:callable, progress_func:callable, e:int)

    Generate an RSA key of length 'bits', public exponent 'e'(which must be
    odd), using 'randfunc' to get random data and 'progress_func',
    if present, to display the progress of the key generation.
    zp,q
�
g�-���q=zu
zd
zGenerated key is too small)�RSAobj�int�
er�sizerZgetStrongPrime�
p�
qZinverse�
u�
n�
d�AssertionError)�bitsZrandfuncZ
progress_funcr�objr
r�r�H/opt/alt/python37/lib64/python3.7/site-packages/Crypto/PublicKey/_RSA.py�generate_py s*














 rc@seZ
dZd
d�ZdS)rc

Cst�
|j�
d
S)z`size() : int
        Return the maximum number of bits that can be handled by this key.
        r)rr	r
)
�selfrrrr	LszRSAobj.sizeN)�__name__�
__module__�__qualname__r	rrrrrJsr)Nr)Z__revision__ZCrypto.PublicKeyrZCrypto.Utilrrrrrrr�<module>s

*