Font Size: a A A

Research And Implementation Of ECC Public Key Encryption Algorithm

Posted on:2016-10-10Degree:MasterType:Thesis
Country:ChinaCandidate:F ChenFull Text:PDF
GTID:2348330479954637Subject:IC Engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of information technology in recent years,a huge amount of information need to be transfered safely as fast as possible. It is important to transmit information in real time with efficient encryption mechanism. ECC public key cryptography based on elliptic curve discrete logarithm problem excels in the single bit with high security, fast processing speed and taking little storage areas, has been developing rapidly. In order to improve the speed of the ECC, enabling it to meet the needs of high speed communication, this article will develop a smaller and faster fast scalar multiplication algorithm module on the FPGA.This paper introduces a kind of fast scalar multiplication algorithm module programme, using the fast scalar multiplication based on projection coordinates LD Montgomery method. In order to ensure security of information transmission, elliptic curve encryption is based on NIST standards GF(2163) Koblitz curve, the parameter that involved also use NIST standards. Then design and optimize the algorithms that each finite field operation characteristics are considered,using the KOA program to optimize parallel multiplier finite field multiplication,and using a parallel approach to implementation finite fields square because of its particular nature. While finite fields division operation is properly optimized on the basis of Fermat's little theorem. Finally, optimizing the algorithm processes, reducing the number of modules and resource consumption.This paper also takes a simulation for the scalar multiplication modules, using Xilinx XC7VX690 T FPGA chip module, its results show that the highest frequency of the scalar multiplication modules is 266 MHz, taking 12,047 LUTs and 6,821 Registers as resource. Scalar multiplication takes approximately 4,144 clock cycle, which means achieving 64,516 scalar multiplication per second. Final analysis shows that compared to similar documents based on GF(2163) scalar multiplication module, my method has a outstanding improvement of speed while just takes a litte more resources.
Keywords/Search Tags:Elliptic Curve, FPGA, Scalar Multiplication, KOA, Projection coordinates
PDF Full Text Request
Related items