Python Pycrypto Generate Key 2019

Posted on 09.12.202022.08.2017by admin

Python Pycrypto Windows Installer
Download Pycrypto
Python Pycrypto Generate Key 2019 Free

The following are code examples for showing how to use Crypto.PublicKey.RSA.They are from open source Python projects. You can vote up the examples you. The pycrypto library in Python can generate random n-bit prime numbers. The syntax I use is as follows: from Crypto.Util import number number.getPrime(2048) The above functions has a very impressive performance and returns primes with a very small delay.

Python helper class to perform RSA encryption, decryption, signing, verifying signatures & generate new keys

rsa.py

# RSA helper class for pycrypto

# Copyright (c) Dennis Lee

# Date 21 Mar 2017

# Description:

# Python helper class to perform RSA encryption, decryption,

# signing, verifying signatures & keys generation

# Dependencies Packages:

# pycrypto

# Documentation:

# https://www.dlitz.net/software/pycrypto/api/2.6/

# Sample usage:

import rsa

from base64 import b64encode, b64decode

msg1 = 'Hello Tony, I am Jarvis!'

msg2 = 'Hello Toni, I am Jarvis!'

keysize = 2048

(public, private) = rsa.newkeys(keysize)

encrypted = b64encode(rsa.encrypt(msg1, private))

decrypted = rsa.decrypt(b64decode(encrypted), private)

signature = b64encode(rsa.sign(msg1, private, 'SHA-512'))

verify = rsa.verify(msg1, b64decode(signature), public)

print(private.exportKey('PEM'))

print(public.exportKey('PEM'))

print('Encrypted: ' + encrypted)

print('Decrypted: '%s' % decrypted)

print('Signature: ' + signature)

print('Verify: %s' % verify)

rsa.verify(msg2, b64decode(signature), public)

fromCrypto.PublicKeyimportRSA

fromCrypto.CipherimportPKCS1_OAEP

fromCrypto.SignatureimportPKCS1_v1_5

fromCrypto.HashimportSHA512, SHA384, SHA256, SHA, MD5

fromCryptoimportRandom

frombase64importb64encode, b64decode

hash='SHA-256'

defnewkeys(keysize):

random_generator=Random.new().read

key=RSA.generate(keysize, random_generator)

private, public=key, key.publickey()

returnpublic, private

defimportKey(externKey):

returnRSA.importKey(externKey)

defgetpublickey(priv_key):

returnpriv_key.publickey()

defencrypt(message, pub_key):

#RSA encryption protocol according to PKCS#1 OAEP

cipher=PKCS1_OAEP.new(pub_key)

returncipher.encrypt(message)

defdecrypt(ciphertext, priv_key):

#RSA encryption protocol according to PKCS#1 OAEP

cipher=PKCS1_OAEP.new(priv_key)

returncipher.decrypt(ciphertext)

defsign(message, priv_key, hashAlg='SHA-256'):

globalhash

hash=hashAlg

signer=PKCS1_v1_5.new(priv_key)

if (hash'SHA-512'):

digest=SHA512.new()

elif (hash'SHA-384'):

digest=SHA384.new()

elif (hash'SHA-256'):

digest=SHA256.new()

elif (hash'SHA-1'):

digest=SHA.new()

else:

digest=MD5.new()

digest.update(message)

returnsigner.sign(digest)

defverify(message, signature, pub_key):

signer=PKCS1_v1_5.new(pub_key)

if (hash'SHA-512'):

digest=SHA512.new()

elif (hash'SHA-384'):

digest=SHA384.new()

elif (hash'SHA-256'):

digest=SHA256.new()

elif (hash'SHA-1'):

digest=SHA.new()

else:

digest=MD5.new()

digest.update(message)

returnsigner.verify(digest, signature)

RSA is the most widespread and used public key algorithm. Its security isbased on the difficulty of factoring large integers. The algorithm haswithstood attacks for more than 30 years, and it is therefore consideredreasonably secure for new designs.

The algorithm can be used for both confidentiality (encryption) andauthentication (digital signature). It is worth noting that signing anddecryption are significantly slower than verification and encryption.

The cryptographic strength is primarily linked to the length of the RSA modulus n.In 2017, a sufficient length is deemed to be 2048 bits. For more information,see the most recent ECRYPT report.

Both RSA ciphertexts and RSA signatures are as large as the RSA modulus n (256bytes if n is 2048 bit long).

The module Crypto.PublicKey.RSA provides facilities for generating new RSA keys,reconstructing them from known components, exporting them, and importing them.

Python Pycrypto Windows Installer

As an example, this is how you generate a new RSA key pair, save it in a filecalled mykey.pem, and then read it back:

Crypto.PublicKey.RSA.generate(bits, randfunc=None, e=65537)¶

Create a new RSA key pair.

The algorithm closely follows NIST FIPS 186-4 in itssections B.3.1 and B.3.3. The modulus is the product oftwo non-strong probable primes.Each prime passes a suitable number of Miller-Rabin testswith random bases and a single Lucas test.

Parameters:

Parameters:	bits (integer) – Key length, or size (in bits) of the RSA modulus.It must be at least 1024, but 2048 is recommended.The FIPS standard only defines 1024, 2048 and 3072. randfunc (callable) – Function that returns random bytes.The default is `Crypto.Random.get_random_bytes()`. e (integer) – Public RSA exponent. It must be an odd positive integer.It is typically a small number with very few ones in itsbinary representation.The FIPS standard requires the public exponent to beat least 65537 (the default).

bits (integer) – Key length, or size (in bits) of the RSA modulus.It must be at least 1024, but 2048 is recommended.The FIPS standard only defines 1024, 2048 and 3072.
randfunc (callable) – Function that returns random bytes.The default is Crypto.Random.get_random_bytes().
e (integer) – Public RSA exponent. It must be an odd positive integer.It is typically a small number with very few ones in itsbinary representation.The FIPS standard requires the public exponent to beat least 65537 (the default).

Returns: an RSA key object (RsaKey, with private key).

Crypto.PublicKey.RSA.construct(rsa_components, consistency_check=True)¶

Construct an RSA key from a tuple of valid RSA components.

The modulus n must be the product of two primes.The public exponent e must be odd and larger than 1.

In case of a private key, the following equations must apply:

[begin{split}begin{align}p*q &= n e*d &equiv 1 ( text{mod lcm} [(p-1)(q-1)]) p*u &equiv 1 ( text{mod } q)end{align}end{split}]

Parameters:

Parameters:	rsa_components (tuple) – A tuple of integers, with at least 2 and nomore than 6 items. The items come in the following order: RSA modulus n. Public exponent e. Private exponent d.Only required if the key is private. First factor of n (p).Optional, but the other factor q must also be present. Second factor of n (q). Optional. CRT coefficient q, that is (p^{-1} text{mod }q). Optional. consistency_check (boolean) – If `True`, the library will verify that the provided componentsfulfil the main RSA properties.
Raises:	`ValueError` – when the key being imported fails the most basic RSA validity checks.

rsa_components (tuple) –
A tuple of integers, with at least 2 and nomore than 6 items. The items come in the following order:
1. RSA modulus n.
2. Public exponent e.
3. Private exponent d.Only required if the key is private.
4. First factor of n (p).Optional, but the other factor q must also be present.
5. Second factor of n (q). Optional.
6. CRT coefficient q, that is (p^{-1} text{mod }q). Optional.
consistency_check (boolean) – If True, the library will verify that the provided componentsfulfil the main RSA properties.

Raises:

ValueError – when the key being imported fails the most basic RSA validity checks.

Returns: An RSA key object (RsaKey).

Crypto.PublicKey.RSA.import_key(extern_key, passphrase=None)¶

Import an RSA key (public or private).

Parameters:

Parameters:	extern_key (string or byte string) – The RSA key to import. The following formats are supported for an RSA public key: X.509 certificate (binary or PEM format) X.509 `subjectPublicKeyInfo` DER SEQUENCE (binary or PEMencoding) PKCS#1`RSAPublicKey` DER SEQUENCE (binary or PEM encoding) An OpenSSH line (e.g. the content of `~/.ssh/id_ecdsa`, ASCII) The following formats are supported for an RSA private key: PKCS#1 `RSAPrivateKey` DER SEQUENCE (binary or PEM encoding) PKCS#8`PrivateKeyInfo` or `EncryptedPrivateKeyInfo`DER SEQUENCE (binary or PEM encoding) OpenSSH (text format, introduced in OpenSSH 6.5) For details about the PEM encoding, see RFC1421/RFC1423. passphrase (string or byte string) – For private keys only, the pass phrase that encrypts the key.

extern_key (string or byte string) –
The RSA key to import.
The following formats are supported for an RSA public key:
- X.509 certificate (binary or PEM format)
- X.509 subjectPublicKeyInfo DER SEQUENCE (binary or PEMencoding)
- PKCS#1RSAPublicKey DER SEQUENCE (binary or PEM encoding)
- An OpenSSH line (e.g. the content of ~/.ssh/id_ecdsa, ASCII)
The following formats are supported for an RSA private key:
- PKCS#1 RSAPrivateKey DER SEQUENCE (binary or PEM encoding)
- PKCS#8PrivateKeyInfo or EncryptedPrivateKeyInfoDER SEQUENCE (binary or PEM encoding)
- OpenSSH (text format, introduced in OpenSSH 6.5)
For details about the PEM encoding, see RFC1421/RFC1423.
passphrase (string or byte string) – For private keys only, the pass phrase that encrypts the key.

Returns: An RSA key object (RsaKey).

Raises:	`ValueError/IndexError/TypeError` – When the given key cannot be parsed (possibly because the passphrase is wrong).

class Crypto.PublicKey.RSA.RsaKey(**kwargs)¶

Class defining an actual RSA key.Do not instantiate directly.Use generate(), construct() or import_key() instead.

Variables:	n (integer) – RSA modulus e (integer) – RSA public exponent d (integer) – RSA private exponent p (integer) – First factor of the RSA modulus q (integer) – Second factor of the RSA modulus u – Chinese remainder component ((p^{-1} text{mod } q))

Download Pycrypto

exportKey(format='PEM', passphrase=None, pkcs=1, protection=None, randfunc=None)¶

Export this RSA key.

Parameters:	format (string) – The format to use for wrapping the key: ’PEM’. (Default) Text encoding, done according to RFC1421/RFC1423. ’DER’. Binary encoding. ’OpenSSH’. Textual encoding, done according to OpenSSH specification.Only suitable for public keys (not private keys). passphrase (string) – (For private keys only) The pass phrase used for protecting the output. pkcs (integer) – (For private keys only) The ASN.1 structure to use forserializing the key. Note that even in case of PEMencoding, there is an inner ASN.1 DER structure. With `pkcs=1` (default), the private key is encoded in asimple PKCS#1 structure (`RSAPrivateKey`). With `pkcs=8`, the private key is encoded in a PKCS#8 structure(`PrivateKeyInfo`). Note This parameter is ignored for a public key.For DER and PEM, an ASN.1 DER `SubjectPublicKeyInfo`structure is always used. protection (string) – (For private keys only)The encryption scheme to use for protecting the private key. If `None` (default), the behavior depends on `format`: For ‘DER’, the PBKDF2WithHMAC-SHA1AndDES-EDE3-CBCscheme is used. The following operations are performed: A 16 byte Triple DES key is derived from the passphraseusing `Crypto.Protocol.KDF.PBKDF2()` with 8 bytes salt,and 1 000 iterations of `Crypto.Hash.HMAC`. The private key is encrypted using CBC. The encrypted key is encoded according to PKCS#8. For ‘PEM’, the obsolete PEM encryption scheme is used.It is based on MD5 for key derivation, and Triple DES for encryption. Specifying a value for `protection` is only meaningful for PKCS#8(that is, `pkcs=8`) and only if a pass phrase is present too. The supported schemes for PKCS#8 are listed in the`Crypto.IO.PKCS8` module (see `wrap_algo` parameter). randfunc (callable) – A function that provides random bytes. Only used for PEM encoding.The default is `Crypto.Random.get_random_bytes()`.
Returns:	the encoded key
Return type:	byte string
Raises:	`ValueError` – when the format is unknown or when you try to encrypt a privatekey with DER format and PKCS#1.

Warning

If you don’t provide a pass phrase, the private key will beexported in the clear!