tfddlmZddlZddlZddlmZddlmZddl m Z m Z ddl m Z ddlmZGdd ej ZeZeejjGd d ej ZeZeejjejjZejjZ d%d&dZd'dZd(dZd)dZd*dZd+dZd,dZ d Z!d-d$Z"dS).) annotationsN)gcd)openssl)_serializationhashes)AsymmetricPadding)utilsceZdZejddZeejddZejdd ZejddZ ejddZ ejddZ dS) RSAPrivateKey ciphertextbytespaddingrreturncdS)z3 Decrypts the provided ciphertext. N)selfr rs l/var/www/surfInsights/venv3-11/lib/python3.11/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptintcdSz7 The bit length of the public modulus. Nrrs rkey_sizezRSAPrivateKey.key_sizerr RSAPublicKeycdS)zD The RSAPublicKey associated with this private key. Nrrs r public_keyzRSAPrivateKey.public_keyrrdata algorithm+asym_utils.Prehashed | hashes.HashAlgorithmcdS)z! Signs the data. Nr)rrrr s rsignzRSAPrivateKey.sign%rrRSAPrivateNumberscdS)z/ Returns an RSAPrivateNumbers. Nrrs rprivate_numberszRSAPrivateKey.private_numbers0rrencoding_serialization.Encodingformat_serialization.PrivateFormatencryption_algorithm)_serialization.KeySerializationEncryptioncdSz6 Returns the key serialized as bytes. Nr)rr'r)r+s r private_byteszRSAPrivateKey.private_bytes6rrN)r r rrrr rr)rr)rr rrr r!rr )rr$)r'r(r)r*r+r,rr ) __name__ __module__ __qualname__abcabstractmethodrpropertyrrr#r&r/rrrr r s       X                       rr ) metaclassc eZdZejddZeejddZejdd Zejd dZ ejd!dZ ejd"dZ ejd#dZ dS)$r plaintextr rrrcdS)z/ Encrypts the given plaintext. Nr)rr9rs rencryptzRSAPublicKey.encryptGrrrcdSrrrs rrzRSAPublicKey.key_sizeMrrRSAPublicNumberscdS)z- Returns an RSAPublicNumbers Nrrs rpublic_numberszRSAPublicKey.public_numbersTrrr'r(r)_serialization.PublicFormatcdSr.r)rr'r)s r public_byteszRSAPublicKey.public_bytesZrr signaturerr r!NonecdS)z5 Verifies the signature of the data. Nr)rrCrrr s rverifyzRSAPublicKey.verifydrrhashes.HashAlgorithm | NonecdS)z@ Recovers the original data from the signature. Nr)rrCrr s rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signatureprrotherobjectboolcdS)z" Checks equality. Nr)rrJs r__eq__zRSAPublicKey.__eq__{rrN)r9r rrrr r0)rr=)r'r(r)r@rr ) rCr rr rrr r!rrD)rCr rrr rGrr )rJrKrrL) r1r2r3r4r5r;r6rr?rBrFrIrNrrrrrFs       X                              rrpublic_exponentrrbackend typing.Anyrcbt||tj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)rOrrPs rrWrWs- ?H555   0 0( K KKrrDcV|dvrtd|dkrtddS)N)izopublic_exponent must be either 3 (for legacy compatibility) or 65537. Almost everyone should choose 65537 here!iz$key_size must be at least 1024-bits.) ValueError)rOrs rrTrTsEj(( ?   $?@@@remcd\}}||}}|dkr,t||\}}|||zz }||||f\}}}}|dk,||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) r[r\x1x2abqrxns r_modinvrgshFB aqA a%%a||1 !b&[!R| 1b" a%% 6Mrprdc"t||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rg)rhrds r rsa_crt_iqmprjs 1a==rprivate_exponentc||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. r^r)rkrhs r rsa_crt_dmp1rm q1u %%rc||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. r^r)rkrds r rsa_crt_dmq1rprnrcf|dz |dz zt|dz |dz z}t||S)z Compute the RSA private_exponent (d) given the public exponent (e) and the RSA primes p and q. This uses the Carmichael totient function to generate the smallest possible working value of the private exponent. r^)rrg)r[rhrdlambda_ns rrsa_recover_private_exponentrss="A!a% CAq1u$5$55H 1h  rindtuple[int, int]c||zdz }|}|dzdkr|dz}|dzdkd}d}|s{|tkrp|}||krVt|||}|dkr4||dz kr+t|d|dkrt|dz|} d}n |dz}||kV|dz }|s |tkp|stdt || \} } | dksJt | | 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^rFTz2Unable to compute factors p and q from exponent d.)reverse)_MAX_RECOVERY_ATTEMPTSpowrrZr_sorted) rtr[ruktottspottedrbkcandrhrdres rrsa_recover_prime_factorsrsN q519D A a%1** F a%1**G A!444 $hhq!Q<rs #""""" FFFFFFAAAAAAAAHHHHHHIIIIII. . . . . ck. . . . b"/ |'56669 9 9 9 9 S[9 9 9 9 x!- l&3444 $6#4 LLLLLAAAA    &&&&&&&&    0((((((r