ISSN: 1997-0641
   Quick Links
Calls for Papers
Instructions for Authors
Editorial Board
Contact Us
Evaluation Form
   Search Articles

Research Article

Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog
SSU Res. J. of Engg. & Tech Page 12 -17

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

Volume of Articles

Volume 1 Issue 1 (2011)
Issue 1
Volume 2 Issue 1 (2012)
Issue 1
Volume 3 Issue 1 (2013)
Issue 1
Volume 4 Issue 1 (2014)
Issue 1
Volume 5 Issue 1 (2015)
Issue 1
Volume 6 Issue 1 (2016)
Issue 1
Copyright 2010-2012, Sir Syed University of Engineering and Technology, All Right Reserved.