Breaking News: Grepper is joining You.com. Read the official announcement!

python rsa

Add Answer

Jerome Scott answered on May 9, 2020 Popularity 9/10 Helpfulness 5/10

answer python rsa

related python rsa

related RSA with python

python rsa

Comment

from cryptography.hazmat.primitives.asymmetric import rsa, padding
from cryptography.hazmat.primitives import serialization, hashes

# Generates a new RSA private key with 2048-bit key size and a public exponent of 65537
def generate_rsa_key():
    private_key = rsa.generate_private_key(
        public_exponent=65537, # commonly used value for RSA encryption
        key_size=2048 # key size in bits
    )
    return private_key

# Encrypts a message using RSA and the OAEP padding scheme
def encrypt_rsa(message, public_key):
    ciphertext = public_key.encrypt(
        message,
        padding.OAEP(
            mgf=padding.MGF1(algorithm=hashes.SHA256()), # MGF1 with SHA-256 hash function
            algorithm=hashes.SHA256(), # SHA-256 hash function
            label=None # label for OAEP
        )
    )
    return ciphertext

# Decrypts a ciphertext using RSA and the OAEP padding scheme
def decrypt_rsa(ciphertext, private_key):
    message = private_key.decrypt(
        ciphertext,
        padding.OAEP(
            mgf=padding.MGF1(algorithm=hashes.SHA256()), # MGF1 with SHA-256 hash function
            algorithm=hashes.SHA256(), # SHA-256 hash function
            label=None # label for OAEP
        )
    )
    return message

# Example usage

private_key = generate_rsa_key()
public_key = private_key.public_key()

message = b"Hello World!"
ciphertext = encrypt_rsa(message, public_key)
print(ciphertext)

decrypted_message = decrypt_rsa(ciphertext, private_key)
print(decrypted_message)

Popularity 9/10 Helpfulness 5/10 Language python

Source: Grepper

Tags: 2048 python rsa

Link to this answer
Share Copy Link

Contributed on Feb 08 2023

Jerome Scott

0 Answers Avg Quality 2/10

Closely Related Answers

python rsa

Comment

import Crypto
from Crypto.PublicKey import RSA
from Crypto import Random

random_generator = Random.new().read
key = RSA.generate(1024, random_generator) #generate public and private keys

publickey = key.publickey # pub key export for exchange

encrypted = publickey.encrypt('encrypt this message', 32)
#message to encrypt is in the above line 'encrypt this message'

print 'encrypted message:', encrypted #ciphertext

f = open ('encryption.txt', 'w'w)
f.write(str(encrypted)) #write ciphertext to file
f.close()

#decrypted code below

f = open ('encryption.txt', 'r')
message = f.read()

decrypted = key.decrypt(message)

print 'decrypted', decrypted

f = open ('encryption.txt', 'w')
f.write(str(message))
f.write(str(decrypted))
f.close()

Popularity 10/10 Helpfulness 5/10 Language python

Source: stackoverflow.com

Tags: python py

Link to this answer
Share Copy Link

Contributed on May 09 2020

Mysterious Mallard

0 Answers Avg Quality 2/10

python rsa

Comment

>>> import rsa
>>> (bob_pub, bob_priv) = rsa.newkeys(512)

Popularity 10/10 Helpfulness 3/10 Language python

Source: stuvel.eu

Tags: python py

Link to this answer
Share Copy Link

Contributed on Aug 19 2021

Annoyed Alligator

0 Answers Avg Quality 2/10

RSA with python

Comment

-2

#Par Mouad En-nasiry
dic1={chr(i+96):i for i in range (1,27)}
dic1['+'],dic1['-']=27,28

def get_key(dic,val):
    for key, value in dic.items():
         if val == value:
                return key
            #trouver la cle d'un valuer
def exp(A, P):
    #on a suppose que A>=1 P>=0
    result = 1
    while P >= 1:
        result = result * A
        P -= 1
    return result #touver la puissance rapidement

def Mod(A, P, M):
    return exp(A,P)%29  # donner le rest de la division euclidienne de A**P Par 29



def chiffrer(M):
    Code = str()
    for i in M.lower():
        X=Mod(dic1[i],17,29)
        Code+=get_key(dic1,X)
    return Code.upper()

def decrypter(C):
    Message = str()
    for i in C.lower():
        X=Mod(dic1[i],5,29)
        Message+=get_key(dic1,X)
    return Message.upper()

Msg=input('pour chiffrer Entrez 1 pour Decrypter Entrez 2:')

if Msg=='1':
    Msg=input('entrer le message: ')
    print(chiffrer(Msg))
elif Msg=='2':
    Msg=input('entrer le message codé: ')
    print(decrypter(Msg))

Popularity 9/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: python py

Link to this answer
Share Copy Link

Contributed on Feb 26 2022

Mouad En-naciry

0 Answers Avg Quality 2/10

python rsa

Contents

More Related Answers

python rsa

Closely Related Answers

python rsa

python rsa

RSA with python

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.