CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography

by V. Sridhar, Anil Kumar M .n
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 16
Year of Publication: 2012
Authors: V. Sridhar, Anil Kumar M .n
10.5120/7273-0412

V. Sridhar, Anil Kumar M .n . A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography. International Journal of Computer Applications. 47, 16 ( June 2012), 21-25. DOI=10.5120/7273-0412

@article{ 10.5120/7273-0412,
author = { V. Sridhar, Anil Kumar M .n },
title = { A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 16 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number16/7273-0412/ },
doi = { 10.5120/7273-0412 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:42:01.693304+05:30
%A V. Sridhar
%A Anil Kumar M .n
%T A Technique to Speed up the Modular Multiplicative Inversion over GF(P) Applicable to Elliptic Curve Cryptography
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 16
%P 21-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper presents a technique to speed up the computation of inversion of NIST recommended elliptic curve with modulus p521-1. The property of multiplicative inverse between pair of numbers over Meresenne's prime is used to reduce the number of iterations in the Binary Inversion Algorithm in GF(p). This increases the speed requirement for point operations applicable to Elliptic Curve Cryptography. This paper proposes an model of the architecture to achieve the above objective which uses parallelism in multiplicative inversion arithmetic block to speed up the computation.

References
  1. N. Koblitz, "Elliptic curve cryptosystems", Math. comput. , vol. 48,pp. 203-209,1987.
  2. V. Miller, "Use of elliptic curves in cryptography", in Advances in Cryptology (CRYPTO), Newyork:Springer, 1986,vol. 218,pp. 417-426.
  3. A. Daly, W. Marnane, T. Kerins, E. Popovici, An FPGA implementation of a GF(p) ALU for encryption processors, Microprocessors and Microsystems, vol. 28,2004,pages 253-260.
  4. Santhosh Ghosh, Monjur Alam,Indranil Sen Gupta , Dipanwita Roy Chowdhury, IIT Kharagpur,10th Euromicro Conference on Digital System Design Architectures, Methods and Tools(DSD 2007).
  5. G. B. Agnew, R. C. Mullin and S. A Vanstone", An implementation of elliptic curve cryptosystems over F2155", IEEE J. Selected Areas of Communication, vol. 11,n05,pp. 804-813, Jun. 1993.
  6. J. Goodman and A. Chandrakasan, "An energy efficient reconfigurable public-key cryptography processor architecture", in Cryptographic Hardware and Embedded Systems (CHES). New York: Springer, 2000, vol. 1965,pp. 175-190.
  7. A. Satoh and K. Takano, "A Scalable dual-field elliptic curve cryptography processor", IEEE Transaction on Computers, vol. 52,no. 4,pp. 449-460,Apr. 2003
  8. Kimmo Jarvinen and Jorma Skytta, "On Parallellization of High-Speed Processors for Elliptic Curve Cryptography", IEEE transactions on VLSI Systems vol. 16, no. 9,Sept. 2008.
  9. Kendall Anayi,Hamad Alrimeih and Daler Rakhmatov, "Flexible Hardware Processor for Elliptic Curve Cryptography", IEEE Transactions on VLSI Systems, vol. 17,No. 8,August 2009.
  10. A. Satoh and K. Takano, "A scalable dual-field elliptic curve cryptographic processor", IEEE Trans. Comput. , vol. 52,no. 4,pp. 449-460, April 2003.
  11. G. Orlando and C. Paar, " A scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware", pp. 356-371, CHES 2001, LNCS 2162.
  12. S. B. Ors, L. Batina and B. Preneel, " Hardware implementation of elliptic curve processor over GF(p)", in Proc. 14th IEEE International Conference on Application-Specific Systems, Architectures and Processors, Jun 2003, pp. 433-443.
  13. Ciaran J. Mcivor, Marie McLoone, "Hardware Elliptic Curve Cryptographic Processor Over GF(p)", IEEE Trans. On Circuits and Systems-1, vol. 53,No. 9, September 2006.
Index Terms

Computer Science
Information Sciences

Keywords

Elliptic Curve Cryptography Binary Inversion Algorithm Gf(p) Arithmetic Operators

Powered by PhDFocusTM