/var/opt/nydus/ops/cryptography/hazmat/primitives/asymmetric/__pycache__
Edit: /var/opt/nydus/ops/cryptography/hazmat/primitives/asymmetric/__pycache__/rsa.cpython-312.pyc (16534B)
O j, d dl Z d dlZd dlmZ d dlmZmZ d dlmZ d dl m
Z G d de j Z
e
Z G d d
e j ZeZ d(d ed ed
ej$ de
fdZd ed eddfdZdedededededed ededdfdZdededdfdZded edefd Zdededefd Zdededefd Zdededefd Zd!Zdeded"edej8 eef fd#Z G d$ d% Z G d& d' Z y)) N)gcd)_serializationhashes)AsymmetricPadding)utilsc e Zd Zej dededefd Zeej de fd Z
ej dd Z ej dedede j ej ej" f defd Zej dd
Zej d ej* d ej, d
ej. defd Zy)
RSAPrivateKey
ciphertextpaddingreturnc y)z3
Decrypts the provided ciphertext.
N )selfr
r s ^/opt/nydus/tmp/pip-target-a90h98xg/lib/python/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decrypt c yz7
The bit length of the public modulus.
Nr r s r key_sizezRSAPrivateKey.key_size r r c y)zD
The RSAPublicKey associated with this private key.
Nr r s r
public_keyzRSAPrivateKey.public_key r r data algorithmc y)z!
Signs the data.
Nr )r r r r s r signzRSAPrivateKey.sign# r r c y)z/
Returns an RSAPrivateNumbers.
Nr r s r private_numbersz RSAPrivateKey.private_numbers. r r encodingformatencryption_algorithmc yz6
Returns the key serialized as bytes.
Nr )r r r! r" s r
private_byteszRSAPrivateKey.private_bytes4 r r N)r RSAPublicKey)r RSAPrivateNumbers)__name__
__module__ __qualname__abcabstractmethodbytesr r propertyintr r typingUnion
asym_utils Prehashedr
HashAlgorithmr r r Encoding
PrivateFormatKeySerializationEncryptionr% r r r r r s9 % 2C
#
# <<
4 4f6J6J JK
)) ,, - G G
r r ) metaclassc e Zd Zej dededefd Zeej de fd Z
ej dd Z ej de j de j defd Zej d
ed eded ej" ej& ej* f dd
f
d Zej d
eded ej. ej* defd Zy
)r& plaintextr r c y)z/
Encrypts the given plaintext.
Nr )r r: r s r encryptzRSAPublicKey.encryptD r r c yr r r s r r zRSAPublicKey.key_sizeJ r r c y)z-
Returns an RSAPublicNumbers
Nr r s r public_numberszRSAPublicKey.public_numbersQ r r r r! c yr$ r )r r r! s r public_byteszRSAPublicKey.public_bytesW r r signaturer r Nc y)z5
Verifies the signature of the data.
Nr )r rB r r r s r verifyzRSAPublicKey.verifya r r c y)z@
Recovers the original data from the signature.
Nr )r rB r r s r recover_data_from_signaturez(RSAPublicKey.recover_data_from_signaturem r r r RSAPublicNumbers)r( r) r* r+ r, r- r r< r. r/ r r? r r5 PublicFormatrA r0 r1 r2 r3 r r4 rD OptionalrF r r r r& r& C sh 1B u
#
)) ++
#
<<
4 4f6J6J JK
# ??6#7#78
r r& public_exponentr backendr c J ddl m} t | | |j | | S Nr )rL ),cryptography.hazmat.backends.openssl.backendrL _verify_rsa_parametersgenerate_rsa_private_key)rK r rL ossls r generate_private_keyrS | s%
M?H5 ( ( ( CCr c B | dvr t d |dk r t d y )N) i zopublic_exponent must be either 3 (for legacy compatibility) or 65537. Almost everyone should choose 65537 here!i z#key_size must be at least 512-bits.
ValueError)rK r s r rP rP s6 j(
?
#~>?? r pqprivate_exponentdmp1dmq1iqmpmodulusc |dk r t d | |k\ r t d ||k\ r t d ||k\ r t d ||k\ r t d ||k\ r t d ||k\ r t d |dk s||k\ r t d |d
z d k( r t d |d
z d k( r t d
|d
z d k( r t d | |z |k7 r t d y )NrU zmodulus must be >= 3.zp must be < modulus.zq must be < modulus.zdmp1 must be < modulus.zdmq1 must be < modulus.ziqmp must be < modulus.z#private_exponent must be < modulus.z+public_exponent must be >= 3 and < modulus. r z public_exponent must be odd.zdmp1 must be odd.zdmq1 must be odd.zp*q must equal modulus.rV )rX rY rZ r[ r\ r] rK r^ s r _check_private_key_componentsra s {011G|/00G|/00 w233 w233 w2337">??o 8FGGa 788 ax1},-- ax1},--1u233 r enc t |dk r t d | dk s| |k\ r t d | dz dk( r t d y )NrU zn must be >= 3.ze must be >= 3 and < n.r` r ze must be odd.rV )rb rc s r _check_public_key_componentsre sJ 1u*++1uQ2331uz)** r mc x d\ }}| |}}|dkD r(t || \ }}|||z z
}||||f\ }}}}|dkD r(||z S )zO
Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1
)r` r r )divmod) rb rf x1x2abrY rxns r _modinvro sb FB aqA
a%a|1
!b&[!R| 1b" a% 6Mr c t || S )zF
Compute the CRT (q ** -1) % p value from RSA primes p and q.
)ro )rX rY s r rsa_crt_iqmprq s 1a=r c | |dz
z S )zg
Compute the CRT private_exponent % (p - 1) value from the RSA
private_exponent (d) and p.
r` r )rZ rX s r rsa_crt_dmp1rs
q1u %%r c | |dz
z S )zg
Compute the CRT private_exponent % (q - 1) value from the RSA
private_exponent (d) and q.
r` r )rZ rY s r rsa_crt_dmq1rv rt r i dc ||z dz
}|}|dz dk( r|dz }|dz dk( rd}d}|sh|t k r_|}||k rGt ||| }|dk7 r*|| dz
k7 r"t |d| dk( rt |dz | } d}n |dz }||k rG|dz
}|s
|t k r_|s t d t | \ }
} | dk( sJ t | |
fd \ } }
| |
fS )z
Compute factors p and q from the private exponent d. We assume that n has
no more than two factors. This function is adapted from code in PyCrypto.
r` r FTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowr rW rh sorted) rc rb rw ktottspottedrk kcandrX rY rm s r rsa_recover_prime_factorsr s
q519D
A
a%1*
F a%1* G A! 44
$hq!Q
)r! r s r __repr__zRSAPublicNumbers.__repr__ s 5<r s
A H I. ckk . b "/ 3 S[[ 3 l !- DDD ZZD D@C @3 @4 @,4
,4
,4 ,4 ,4
,4
,4 ,4 ,4
,4^+C +C +D +
s
s
s
C C C &3 &3 &3 &&3 &3 &3 & *
*** \\#s(*Zi
i
X!& !&r