An Escalation Implementation of RSD based ECC Processor

D. Moulika, M. Jasmine, N. Sudhakar Redd .


Elliptic Curve Cryptography (ECC) is a standout amongst the most interested exploration themes in VLSI. System security is turning out to be increasingly significant as the volume of information being traded on the Internet increments. Point addition and doubling are key operations which choose the Performance of ECC. we proposed an 8-bit multiplier using a Vedic Mathematics (Urdhva Tiryakbhyam sutra) for generating the partial products.Here the design with the information way which can perform either prime field G(p) operations or binary field G(2m) operations for arbitrary prime numbers has been proposed. Utilizing this design we can accomplish the high throughput of the both fields that is prime and binary fields. a high throughput modular divider(mod 4n) which results in maximum operating frequency and modular multiplier in the processor is optimized based on throughput and modular reduction. The adder is focused for optimization as the addition is needed for accumulation process in multiplication and division. The Xilinx Virtex 5 field programmable gate array has been utilized.

Full Text:



G. B. Agnew, R. C. Mullin, and S. A. Vanstone. An Implementation of Elliptic Curve Cryptosystems over F2155 .IEEE Journal on Selected Areas in Communications, 11(5):804{813, June 1993.

Avizienis. Signed-digit number representations for fast parallel arithmetic. IRE Trans. Electron. Computers, EC(10):389{400, September 1961.

E. Berlekamp. Algebraic Coding Theory. McGraw-Hill, New York, NY,1968.

D. Boneh and M. Franklin. Identity-based Encryption from the Weil Pairing. In Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213{229. Springer-Verlag, 2001.

G. Bertoni, J. Guajardo, S. Kumar, G. Orlando, C. Paar, and T. Wollinger. Efficient GF(pm) Arithmetic Architectures for Crypto-C.E. graphic Applications. In Topics in Cryptology - CT RSA 2003, volume 2612 of Lecture Notes in Computer Science, pages 158{175. Springer-Verlag, 2003.

R. E. Crandall. Method and Apparatus for Public Key Exchange in a Cryptographic System. U.S. Patent Number 5,159,632, October 1992.

W. Diffe and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22:644{654, November 1976.

B. S. Kaliski Jr. The Montgomery Inverse and its Applications. IEiEE Transactions on Computers, 44(8):1064{1065, 1995.

N. Koblitz. Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177):203{209, January 1987.



  • There are currently no refbacks.

© International Journals of Advanced Research in Computer Science and Software Engineering (IJARCSSE)| All Rights Reserved | Powered by Advance Academic Publisher.