DocumentCode
3564010
Title
Montgomery implantation of ECC over RSA on FPGA for public key cryptography application
Author
Bhadada, Rajesh ; Sharma, Aditi
Author_Institution
Dept. of Electron. & Commun. Eng., JNV Univ., Jodhpur, India
fYear
2014
Firstpage
1
Lastpage
5
Abstract
Public-key cryptography is used in information systems for providing confidentiality and authenticity. For secured transmission of data over internet, mobile, wireless in network communication Elliptic Curve Cryptography (ECC) is gaining more acceptances worldwide. RSA and ECC are the most used cryptographic schemes. ECC need employing smaller length keys than RSA, thus offers merit of less bandwidth demand and less computation overhead. This paper presents a design and implementation of a Montgomery multiplier algorithm and compares it with RSA. Implementation of this algorithm on VERTEX 2 XC2VP4 FPGA crypto processor was investigated by the authors in the context of Montgomery Multiplier and results are also discussed in the paper.
Keywords
Internet; computer network security; field programmable gate arrays; logic design; mobile computing; multiplying circuits; public key cryptography; ECC cryptosystems; Internet; Montgomery implantation; Montgomery multiplier algorithm; RSA cryptosystems; VERTEX 2 XC2VP4 FPGA crypto processor; authenticity; bandwidth demand; computation overhead; confidentiality; data transmission security; elliptic curve cryptography; information systems; length keys; network communication; public key cryptography application; Elliptic curve cryptography; Elliptic curves; Encryption; ECC; Key length; Montgomery Multiplier; Public Key Cryptography; RSA;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Technology Trends in Electronics, Communication and Networking (ET2ECN), 2014 2nd International Conference on
Print_ISBN
978-1-4799-6985-2
Type
conf
DOI
10.1109/ET2ECN.2014.7044973
Filename
7044973
Link To Document