관리-도구
편집 파일: rsa.cpython-39.opt-1.pyc
a �a . � @ sd d dl Z d dlZd dlmZ d dlmZmZ d dlmZ d dl m Z m Z m Z G dd� de jd�ZeZG d d � d e jd�ZeZd+eeejed �d d �Zeedd�dd�Zeeeeeeeedd� dd�Zeedd�dd�Zeeed�dd�Zeeed�dd �Zeeed �d d �Zeeed �d!d"�Z d#Z eeeej eef d$�d%d&�Z G d'd(� d(e �Z!G d)d*� d*e �Z"dS ),� N)�gcd)�_serialization�hashes)�AsymmetricPadding)�AsymmetricSignatureContext� AsymmetricVerificationContext�utilsc @ s� e Zd Zejeejed�dd��Z eje ee d�dd��Z ej e d�dd ��Zejd d�d d ��Zeje eejejejf e d �dd��Zejdd�dd��Zejejejeje d�dd��ZdS )� RSAPrivateKey)�padding� algorithm�returnc C s dS )zN Returns an AsymmetricSignatureContext used for signing data. N� )�selfr r r r �S/usr/lib64/python3.9/site-packages/cryptography/hazmat/primitives/asymmetric/rsa.py�signer s zRSAPrivateKey.signer)� ciphertextr r c C s dS )z3 Decrypts the provided ciphertext. Nr )r r r r r r �decrypt s zRSAPrivateKey.decrypt�r c C s dS �z7 The bit length of the public modulus. Nr �r r r r �key_size" s zRSAPrivateKey.key_size� RSAPublicKeyc C s dS )zD The RSAPublicKey associated with this private key. Nr r r r r � public_key( s zRSAPrivateKey.public_key)�datar r r c C s dS )z! Signs the data. Nr )r r r r r r r �sign. s zRSAPrivateKey.sign�RSAPrivateNumbersc C s dS )z/ Returns an RSAPrivateNumbers. Nr r r r r �private_numbers9 s z RSAPrivateKey.private_numbers)�encoding�format�encryption_algorithmr c C s dS �z6 Returns the key serialized as bytes. Nr )r r r r r r r � private_bytes? s zRSAPrivateKey.private_bytesN)�__name__� __module__� __qualname__�abc�abstractmethodr r � HashAlgorithmr r �bytesr �abstractproperty�intr r �typing�Union� asym_utils� Prehashedr r r �EncodingZ PrivateFormatZKeySerializationEncryptionr! r r r r r s0 �� �r )� metaclassc @ s� e Zd Zejeeeje d�dd��Z ejeeed�dd��Z ej e d�dd ��Zejd d�d d ��Zejejejed �dd��Zejeeeejejejf dd�dd��Zejeeejej ed�dd��ZdS )r )� signaturer r r c C s dS )zY Returns an AsymmetricVerificationContext used for verifying signatures. Nr �r r1 r r r r r �verifierO s zRSAPublicKey.verifier)� plaintextr r c C s dS )z/ Encrypts the given plaintext. Nr )r r4 r r r r �encryptZ s zRSAPublicKey.encryptr c C s dS r r r r r r r ` s zRSAPublicKey.key_size�RSAPublicNumbersc C s dS )z- Returns an RSAPublicNumbers Nr r r r r �public_numbersf s zRSAPublicKey.public_numbers)r r r c C s dS r r )r r r r r r � public_bytesl s zRSAPublicKey.public_bytesN)r1 r r r r c C s dS )z5 Verifies the signature of the data. Nr )r r1 r r r r r r �verifyv s zRSAPublicKey.verifyc C s dS )z@ Recovers the original data from the signature. Nr r2 r r r �recover_data_from_signature� s z(RSAPublicKey.recover_data_from_signature)r" r# r$ r% r& r( r r r' r r3 r5 r) r* r r7 r r/ Z PublicFormatr8 r+ r, r- r. r9 �Optionalr: r r r r r N s< � � � �r )�public_exponentr �backendr c C s" ddl m} t| |� |�| |�S �Nr )r= )�,cryptography.hazmat.backends.openssl.backendr= �_verify_rsa_parametersZgenerate_rsa_private_key)r< r r= �osslr r r �generate_private_key� s rB )r< r r c C s$ | dvrt d��|dk r t d��d S )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)r< r r r r r@ � s �r@ ) �p�q�private_exponent�dmp1�dmq1�iqmpr< �modulusr c C s� |dk rt d��| |kr t d��||kr0t d��||kr@t d��||krPt d��||kr`t d��||krpt d��|dk s�||kr�t d ��|d @ d kr�t d ��|d @ d kr�t d ��|d @ d kr�t d��| | |kr�t d��d S )NrC 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.rD )rF rG rH rI rJ rK r< rL r r r � _check_private_key_components� s0 rN )�e�nr c C s@ |dk rt d��| dk s | |kr(t d��| d@ dkr<t d��d S )NrC zn must be >= 3.ze must be >= 3 and < n.rM r ze must be odd.rD �rO rP r r r � _check_public_key_components� s rR )rO �mr c C sR d\}}| | }}|dkrJt ||�\}}||| }||||f\}}}}q|| S )zO Modular Multiplicative Inverse. Returns x such that: (x*e) mod m == 1 )rM r r )�divmod) rO rS Zx1Zx2�a�brG �rZxnr r r �_modinv� s rX )rF rG r c C s t || �S )zF Compute the CRT (q ** -1) % p value from RSA primes p and q. )rX )rF rG r r r � rsa_crt_iqmp� s rY )rH rF r c C s | |d S )zg Compute the CRT private_exponent % (p - 1) value from the RSA private_exponent (d) and p. rM r )rH rF r r r � rsa_crt_dmp1� s rZ )rH rG r c C s | |d S )zg Compute the CRT private_exponent % (q - 1) value from the RSA private_exponent (d) and q. rM r )rH rG r r r � rsa_crt_dmq1� s r[ i� )rP rO �dr c C s� || d }|}|d dkr&|d }qd}d}|s�|t k r�|}||k r�t||| �}|dkr�|| d kr�t|d| �dkr�t|d | �} d}q�|d9 }q>|d7 }q.|s�td��t| | �\} } t| | fdd�\} } | | 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. rM � r FTz2Unable to compute factors p and q from exponent d.)�reverse)�_MAX_RECOVERY_ATTEMPTS�powr rE rT �sorted) rP rO r\ Zktot�tZspottedrU �kZcandrF rG rW r r r �rsa_recover_prime_factors s* $ rd c @ s� e Zd Zeeeeeedd�dd�Zedd� �Zedd� �Zedd� �Zed d� �Z ed d� �Z ed d� �Z ed d� �Z de jed�dd�Zdd� Zdd� Zdd� Zd S )r r6 )rF rG r\ rI rJ rK r7 c C s� t |t�r<t |t�r<t |t�r<t |t�r<t |t�r<t |t�sDtd��t |t�sVtd��|| _|| _|| _|| _|| _|| _ || _ d S )NzNRSAPrivateNumbers p, q, d, dmp1, dmq1, iqmp arguments must all be an integers.zFRSAPrivateNumbers public_numbers must be an RSAPublicNumbers instance.) � isinstancer* � TypeErrorr6 �_p�_q�_d�_dmp1�_dmq1�_iqmp�_public_numbers)r rF rG r\ rI rJ rK r7 r r r �__init__9 s4 ������� �zRSAPrivateNumbers.__init__c C s | j S �N)rg r r r r �<lambda>^ � zRSAPrivateNumbers.<lambda>c C s | j S ro )rh r r r r rp _ rq c C s | j S ro )ri r r r r rp ` rq c C s | j S ro )rj r r r r rp a rq c C s | j S ro )rk r r r r rp b rq c C s | j S ro )rl r r r r rp c rq c C s | j S ro )rm r r r r rp d rq N�r= r c C s ddl m} |�| �S r> )r? r= Zload_rsa_private_numbers�r r= rA r r r � private_keyf s z RSAPrivateNumbers.private_keyc C sb t |t�stS | j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j |j kS ro ) re r �NotImplementedrF rG r\ rI rJ rK r7 �r �otherr r r �__eq__m s � � � � � �zRSAPrivateNumbers.__eq__c C s | |k S ro r rv r r r �__ne__{ s zRSAPrivateNumbers.__ne__c C s$ t | j| j| j| j| j| j| jf�S ro )�hashrF rG r\ rI rJ rK r7 r r r r �__hash__~ s ��zRSAPrivateNumbers.__hash__)N)r" r# r$ r* rn �propertyrF rG r\ rI rJ rK r7 r+ �Anyr rt rx ry r{ r r r r r 8 s& � % r c @ sh e Zd Zeed�dd�Zedd� �Zedd� �Zdej e d�d d �Z d d � Z d d� Z dd� Zdd� ZdS )r6 rQ c C s, t |t�rt |t�s td��|| _|| _d S )Nz,RSAPublicNumbers arguments must be integers.)re r* rf �_e�_n)r rO rP r r r rn � s zRSAPublicNumbers.__init__c C s | j S ro )r~ r r r r rp � rq zRSAPublicNumbers.<lambda>c C s | j S ro )r r r r r rp � rq Nrr c C s ddl m} |�| �S r> )r? r= Zload_rsa_public_numbersrs r r r r � s zRSAPublicNumbers.public_keyc C s d� | �S )Nz$<RSAPublicNumbers(e={0.e}, n={0.n})>)r r r r r �__repr__� s zRSAPublicNumbers.__repr__c C s& t |t�stS | j|jko$| j|jkS ro )re r6 ru rO rP rv r r r rx � s zRSAPublicNumbers.__eq__c C s | |k S ro r rv r r r ry � s zRSAPublicNumbers.__ne__c C s t | j| jf�S ro )rz rO rP r r r r r{ � s zRSAPublicNumbers.__hash__)N)r" r# r$ r* rn r| rO rP r+ r} r r r� rx ry r{ r r r r r6 � s r6 )N)#r% r+ Zmathr Z cryptography.hazmat.primitivesr r Z*cryptography.hazmat.primitives._asymmetricr Z)cryptography.hazmat.primitives.asymmetricr r r r- �ABCMetar Z RSAPrivateKeyWithSerializationr Z RSAPublicKeyWithSerializationr* r} rB r@ rN rR rX rY rZ r[ r_ �Tuplerd �objectr r6 r r r r �<module> sL 8@ �� � / � -T