Oj,!ddlmZddlZddlZddlZddlmZmZddlm Z ddl m Z m Z ddlmZddlmZGdd ej& ZeZej-e j.j(Gd d ej& ZeZej-e j.j0e j.j4Ze j.j6Z d dd ZddZddZddZddZ ddZ!ddZ"dZ#ddZ$y)) annotationsN)gcdlcm)openssl)_serializationhashes)AsymmetricPadding)utilscfeZdZejd dZeejd dZejd dZej d dZ ejddZ ej ddZ ejddZ ejddZ y ) RSAPrivateKeycy)z3 Decrypts the provided ciphertext. N)self ciphertextpaddings /var/www/origus_pro_usr/data/www/origus.pro/core/.venv/lib/python3.12/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.pydecryptzRSAPrivateKey.decryptcyz7 The bit length of the public modulus. Nrrs rkey_sizezRSAPrivateKey.key_sizerrcy)zD The RSAPublicKey associated with this private key. Nrrs r public_keyzRSAPrivateKey.public_key rrcy)z! Signs the data. Nr)rdatar algorithms rsignzRSAPrivateKey.sign&rrcy)z/ Returns an RSAPrivateNumbers. Nrrs rprivate_numberszRSAPrivateKey.private_numbers3rrcyz6 Returns the key serialized as bytes. Nr)rencodingformatencryption_algorithms r private_byteszRSAPrivateKey.private_bytes9rrcyz! Returns a copy. Nrrs r__copy__zRSAPrivateKey.__copy__Drrcyz& Returns a deep copy. Nrrmemos r __deepcopy__zRSAPrivateKey.__deepcopy__JrrN)rbytesrr returnr0r1intr1 RSAPublicKey)rr0rr rzEasym_utils.Prehashed | hashes.HashAlgorithm | asym_utils.NoDigestInfor1r0)r1RSAPrivateNumbers)r$_serialization.Encodingr%z_serialization.PrivateFormatr&z)_serialization.KeySerializationEncryptionr1r0)r1r )r.dictr1r )__name__ __module__ __qualname__abcabstractmethodrpropertyrrrr!r'r*r/rrrr r s%            #  "            ) - H           rr ) metaclassceZdZejd dZeejd dZejd dZej ddZ ej ddZ ej ddZ ejddZ ejddZ ejdd Zy )r5cy)z/ Encrypts the given plaintext. Nr)r plaintextrs rencryptzRSAPublicKey.encryptVrrcyrrrs rrzRSAPublicKey.key_size\rrcy)z- Returns an RSAPublicNumbers Nrrs rpublic_numberszRSAPublicKey.public_numberscrrcyr#r)rr$r%s r public_byteszRSAPublicKey.public_bytesirrcy)z5 Verifies the signature of the data. Nr)r signaturerrrs rverifyzRSAPublicKey.verifysrrcy)z@ Recovers the original data from the signature. Nr)rrJrrs rrecover_data_from_signaturez(RSAPublicKey.recover_data_from_signaturerrcy)z" Checks equality. Nr)rothers r__eq__zRSAPublicKey.__eq__rrcyr)rrs rr*zRSAPublicKey.__copy__rrcyr,rr-s rr/zRSAPublicKey.__deepcopy__rrN)rBr0rr r1r0r2)r1RSAPublicNumbers)r$r7r%z_serialization.PublicFormatr1r0) rJr0rr0rr rz+asym_utils.Prehashed | hashes.HashAlgorithmr1None)rJr0rr rz5hashes.HashAlgorithm | asym_utils.NoDigestInfo | Noner1r0)rOobjectr1boolr4)r.r8r1r5)r9r:r;r<r=rCr>rrFrHrKrMrPr*r/rrrr5r5Use         ) ,            #  ?         # I              rr5cZt||tjj||SN)_verify_rsa_parameters rust_opensslrsagenerate_private_key)public_exponentrbackends rr\r\s' ?H5    0 0( KKrcB|dvr td|dkr tdy)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)r]rs rrYrYs6j( ?  $?@@rcxd\}}||}}|dkDr(t||\}}|||zz }||||f\}}}}|dkDr(||zS)zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rr)divmod) emx1x2abqrxns r_modinvrosbFB aqA a%a|1 !b&[!R| 1b" a% 6MrcD|dks|dkr tdt||S)zF Compute the CRT (q ** -1) % p value from RSA primes p and q. rdValues can't be <= 1)rbro)prls r rsa_crt_iqmprss) Ava/00 1a=rc<|dks|dkr td||dz zS)zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rdrqra)private_exponentrrs r rsa_crt_dmp1rv- 1Q/00 q1u %%rc<|dks|dkr td||dz zS)zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rdrqra)rurls r rsa_crt_dmq1ryrwrcn|dks |dks|dkr tdt|t|dz |dz 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. rdrq)rbror)rfrrrls rrsa_recover_private_exponentr{s? Ava16/00 1c!a%Q' ((ric(|dks|dkr tddtd||z|k7r td||zdz }|}|dzdk(r|dz}|dzdk(rd}d}|s|tkrxtjd|dz }|dz }|}||krGt|||} | dk7r*| |dz k7r"t| d|dk(rt | dz|} d}n |dz}||krG|s |tkrx|s td t | \} } | dk(sJt| | 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. rdzd, e can't be <= 1zn, d, e don't matchrFTz2Unable to compute factors p and q from exponent d.)reverse)rbpow_MAX_RECOVERY_ATTEMPTSrandomrandintrresorted) nrfdktottspottedtriesrjkcandrrrlrms rrsa_recover_prime_factorsrsa  Ava-.. SQUA .// q519D A a%1* F a%1*G E%"88 NN1a!e $   $hq!Qrs  # FAHI< ckk< ~"/ |''556E S[[E P!- l&&334 $$66##44 LLLL LA &&)*-r