Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog
A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption. This procedure also requires random generatio...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sir Syed University of Engineering and Technology, Karachi.
2018-12-01
|
| Series: | Sir Syed University Research Journal of Engineering and Technology |
| Subjects: | |
| Online Access: | http://www.sirsyeduniversity.edu.pk/ssurj/rj/index.php/ssurj/article/view/68 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new structure to develop 64-bit RSA encryption engine on FPGA is being presented in this paper that can be used as a standard device in the secured communication system. The RSA algorithm has three parts i.e. key generation, encryption and decryption. This procedure also requires random generation of prime numbers, therefore, we are proposing an efficient fast Primality testing algorithm to meet the requirement for generating the key in RSA algorithm. We use right-to-left-binary method for the exponent calculation. This reduces the number of cycles enhancing the performance of the system and reducing the area usage of the FPGA. These blocks are coded in Verilog and are synthesized and simulated in Xilinx 13.2 design suit.
|
|---|---|
| ISSN: | 1997-0641 2415-2048 |