arno
/
rsatest-crt
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
RSA and Chinese Remainder Theorem (CRT)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
3 Commits
1 Branch
0 Tags
118 KiB
 
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'master'
${ noResults }
Go to file
Andy 4890ceae1d
minor updates 		10 years ago
README.md minor updates 10 years ago
rsatest-crt-run.png minor updates 10 years ago
rsatest-ctr.py Initial commit 10 years ago

README.md

RSA and Chinese Remainder Theorem (CRT)

Using the Chinese Remainder Theorem you can run the decryption operation faster.

You can use as reference OpenSSL's RSA module that can produce following output, e.g.

$ openssl genrsa 32 |openssl rsa -noout -text
Generating RSA private key, 32 bit long modulus
.+++++++++++++++++++++++++++
.+++++++++++++++++++++++++++
e is 65537 (0x10001)
Private-Key: (32 bit)
modulus: 2719120549 (0xa2127ca5)
publicExponent: 65537 (0x10001)
privateExponent: 1790467441 (0x6ab85d71)
prime1: 53267 (0xd013)
prime2: 51047 (0xc767)
exponent1: 37383 (0x9207)
exponent2: 28991 (0x713f)
coefficient: 16388 (0x4004)

$ openssl genrsa 32 |openssl asn1parse