1024-bit RSA encryption algorithm
2016-08-23
6 0 0
4.0
Other
Earn points
&Description of RSA algorithm: select two large prime numbers P and Q with equal length, and calculate their product: & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; n = PQ & nbsp; then randomly select encryption key e to make e and (P – 1) (Q – 1) mutually prime. &Finally, Euclidean expansion algorithm is used to calculate the decryption key d to satisfy & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; ed = 1 (mod (P – 1) (Q – 1)) & nbsp; that is & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; & nbsp; d = e – 1 mod ((P – 1) (Q – 1)) & nbsp; E and N are public keys and D is private keys & nbsp;
verilog
算法
加密
RSA
Related Source Codes
AXI Host Slave Function Model
0
0
no vote
Axi slave to fifo code
0
0
no vote
DMA Controller Based on AHB
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
Verilog implementation of ldpc code
0
0
no vote
No comment