Ńņ
”>c @ s d Z d d k l Z d d k Td d k l Z d e f d YZ d Z d d Z
d Z d
e i f d YZ e Z
d S(
s6 $Id: qNEW.py,v 1.8 2003/04/04 15:13:35 akuchling Exp $i’’’’( t pubkey( t *( t SHAt errorc B s e Z RS( ( t __name__t
__module__( ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyR s i c C sā t } | o | d n xt d | | _ t | i | _ } d d h } } } | d t } | d t } d | >}
t t d | d } x| d j o÷ xN t d | d D]9 } t t
i | t | t | i
| | | | }
q"W|
| }
|
|
d | i d }
| |
j o t |
o Pn | d | | d } } q W| d j o Pn | o | d q! q! |
| _ |
d | i } | o | d
n xc t | | |
d } t | | |
} d | j o |
d j n o | d j o Pq q | | _ | o | d n x; t | d } d | j o
| i j n o Pqq| t | | |
| _ | _ | S(
sé generate(bits:int, randfunc:callable, progress_func:callable)
Generate a qNEW key of length 'bits', using 'randfunc' to get
random data and 'progress_func', if present, to display
the progress of the key generation.
s p,q
i i i i l i i’’’’s 4096 values of p tried
s h,g
s x,y
i ( t qNEWobjt getPrimet qt
long_to_bytest seedt HASHBITSt powt longt ranget
bytes_to_longR t newt strt digestt isPrimet pt gt xt y( t bitst randfunct
progress_funct objt St Ct Nt Vt nt bt powbt powL1t kR t powert hR R ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt generate s^
7
/ ! c C sk t } t | d j o
t d n x; t t | D]' } | i | } t | | | | q< W| S( s construct(tuple:(long,long,long,long)|(long,long,long,long,long)
Construct a qNEW object from a 4- or 5-tuple of numbers.
i i s% argument for construct() wrong length( i i ( R t lenR R t keydatat setattr( t tupleR t it field( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt constructk s
R c B s_ e Z d d d d d g Z d d Z d Z d Z d Z d
Z d Z d Z RS(
R R R R R t c C s¦ | i | j o
t d n | d j o
t d n | t d d j o
t d n t | i | | i | i } | | | | i | i | i } | | f S( Ns K is greater than qi s Illegal value of M (<0)i l ” s Illegal value of M (too large)( R R R R R R ( t selft Mt Kt rt s( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt _signz s
#c C sõ | \ } } | d j p- | | i j p | d j p | | i j o d S| d j o
t d n | d j p | t d d j o d St | i | | i } t | i | | | i } | | | i } | | i } | | j o d Sd S( Ni s Illegal value of M (<0)i l ” i ( R R R R R R ( R0 R1 t sigR3 R4 t v1t v2t v( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt _verify s :
#
c C s d S( sB Return the maximum number of bits that can be handled by this key.i ( ( R0 ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt size s c C s
t | d S( sQ Return a Boolean denoting whether the object contains
private components.R ( t hasattr( R0 ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt has_private s c C s d S( sP Return a Boolean value recording whether this algorithm can generate signatures.i ( ( R0 ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt can_sign s c C s d S( sI Return a Boolean value recording whether this algorithm can encrypt data.i ( ( R0 ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt can_encrypt” s c C s" t | i | i | i | i f S( s? Return a new key object containing only the public information.( R. R R R R ( R0 ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt publickey„ s (
R R R) R5 R: R; R= R> R? R@ ( ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyR w s
N( t __revision__t Crypto.PublicKeyR t Crypto.Util.numbert Crypto.HashR t ExceptionR R t NoneR' R. R t object( ( ( s; /usr/lib64/python2.6/site-packages/Crypto/PublicKey/qNEW.pyt
s
S 2