Hardware Acceleration of Elliptic Curve Based Cryptographic Algorithms: Design and Simulation
No Thumbnail Available
Date
2008-04
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
Elliptic curve cryptography (ECC) is an alternative to traditional public key
cryptographic systems. Even though, RSA (Rivest-Shamir-Adleman) was the most
prominent cryptographic scheme, it is being replaced by ECC in many systems. This is
due to the fact that ECC gives higher security with shorter bit length than RSA. In
Elliptic curve based algorithms elliptic curve point multiplication is the most
computationally intensive operation. Therefore implementing point multiplication using
hardware makes ECC more attractive for high performance servers and small devices. In
this thesis FPGA accelerator for point multiplication over GF (2163) is proposed. We
designed and synthesized the point accelerator using Xilinx XCV2000 FPGA. Binary
field arithmetic units from which the point accelerator is built are also designed and
synthesized. Experimental results show that a single point multiplication executes in
47μs. This is a 161 fold speed up over software implementation. And it is also better than
the fastest hardware accelerator published in the literature
Description
Keywords
Algorithms