We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Optimizing point Doubling Operations in ECC Zp

by A. Sakthivel, R. Nedunchezhian
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 41 - Number 6
Year of Publication: 2012
Authors: A. Sakthivel, R. Nedunchezhian
10.5120/5546-7614

A. Sakthivel, R. Nedunchezhian . Optimizing point Doubling Operations in ECC Zp. International Journal of Computer Applications. 41, 6 ( March 2012), 29-32. DOI=10.5120/5546-7614

@article{ 10.5120/5546-7614,
author = { A. Sakthivel, R. Nedunchezhian },
title = { Optimizing point Doubling Operations in ECC Zp },
journal = { International Journal of Computer Applications },
issue_date = { March 2012 },
volume = { 41 },
number = { 6 },
month = { March },
year = { 2012 },
issn = { 0975-8887 },
pages = { 29-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume41/number6/5546-7614/ },
doi = { 10.5120/5546-7614 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:28:55.540203+05:30
%A A. Sakthivel
%A R. Nedunchezhian
%T Optimizing point Doubling Operations in ECC Zp
%J International Journal of Computer Applications
%@ 0975-8887
%V 41
%N 6
%P 29-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Today a wireless network has minimum power consume and less security access. Based on these the suitable way of providing a security system for wireless application is to select the Elliptic Curve Cryptography. But this public key cryptography has required more number of clock cycles to compute its point operations. One of the point operations called point multiplication requires a lot of clock cycles to compute result. This proposed technique reduces the number of clock cycles of point multiplication for parallel processing by reducing number of dependent and independent operations.

References
  1. Jyu-Yuan Lai & Chih-Tsun Hung. 2008. Elixir: High-Throughput Cost-Effective Dual-Field Processors and Design Frame work for Elliptic Curve Cryptography. IEEE Transactions on very Large scale Integration Systems,vol. 16,No. 11.
  2. Sandro Bartolini & Roberto Giorgi. 2008. Effects of Instruction-Set Extension on an Embedded processor: A case study on Elliptic-Curve Cryptography over GF(2m). IEEE Transaction on computers, vol. 57,No. 5 . ,pp. 289-302.
  3. William, N. , chelton, mohammed Benaissa. 2008. Fast Elliptic-Curve Cryptography on FPGA, IEEE Transaction on very Large Scale Integration Systems. vol. 16,No. 2, pp. 198-205.
  4. Patrick Longa and Ali Miri. 2008. Fast and Flexible Elliptic Curve Cryptography point arithmetic over Prime fields. IEEE Transactions on computers, vol. 57,No. 3,pp. 289-302.
  5. Kimmo Jarvinen &Jorma Skytta. 2008. On Parallel of High Speed Processors for Elliptic Curve Cryptography. IEEE Transcations on very Large scale Integration Systems,vol 16,No. 9.
  6. Kazuo Sakiyama, Lejila Batina, Bart Preneel AND Ingrid Verauwhede, 2007. Multicore Curve Based Cryptoprocessor with Reconfirurable Modular Arithmetic Logic Units over GF(2n). IEEE Transactions on computers,vol. 57,No. 9. ,pp1269-282.
  7. Sining Liu,Brian King & Wei Wang. 2007. Hardware Organization to achieve High Speed Elliptic Curve Cryptography for Mobile Devices. Springer Science+-Mobile New Appl(2007), vol 12,pp271-279.
  8. John, L. , Hennessy AND David, A. , Patterson. 2006. Computer Architecture a Quantitative Approach. Elsevier,4th Edition.
  9. William Stallings, 2003. Cryptography and Network Security. PHI, 4th Edition.
  10. Mark Allen Weiss. 2006. Data Structures and Algorithm Analysis in C, Pearson Education, 2nd Edition .
  11. Pradeep Kumar Mishra. 2008. Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems. IEEE Transactions on computers, vol 55 ,No. 8,pp1000-1010.
  12. David, J. ,Malan, Matt Welsh, & Michel, D. , Smith. 2004. Implementing Public Key Infrastructure for Sensor Networks. ACM Transactions on Sensor Networks,vol. 4 ,No. 4. Article 22.
  13. Catherine H. Gebotys, 2004. Design of Secure Cryptography Aginst threat of Power-Attacks in DSP-Embedded Processors,ACM Transactions on Embedded Computing Systems, Vol 3,No. 1,pp. 92-113.
  14. Rodrigo Roman, Cristina Alcaraz and Javier Lopez. 2007. A survey of Cryptographic Primitives and Implementations for Hardware-Constrained Sensor Networks Node. Springer Science+-Mobile New Appl(2007), vol 12,pp231-244.
  15. Volker muller, 1998. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two*, J. Cryptology 11: 219–234.
  16. N. P. Smart, 1999. Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic,J. Cryptology,12: 141–151.
  17. Daniel V. Bailey and Christof Paar, 1999 Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography, J. Cryptology 12: 193–196.
  18. Steven D. Galbraith, 2002. Elliptic Curve Paillier Schemes, J. Cryptology, 15:129–138.
  19. Elisavet Konstantinou, Aristides Kontogeorgis, Yannis C Stamatiou and Christos Zaroliagis. 2002. On the Efficient Generation of Prime-Order Elliptic Curves, J. Cryptology,15: 129–138.
  20. M. Barbosa, A. Moss, and D. Page 2002. Constructive and Destructive Use of Compilers in Elliptic Curve Cryptography, J. Cryptology ,5:129-138.
  21. V. Gayoso Martinez, F. Hernandez Alvarez, L. Hernandez Encinas and C. Sanchez Avila 2011. Analysis of ECIES and Other Crypto systems Based on Elliptic Curves.
  22. V. Gayoso Martinez, F. Hernandez Alvarez, L. Hernandez Encinas and C. Sanchez Avila. 2010. A Comparision of the standardized Versions of ECIES. A, IEEE International Conference on IAS. Proceeding. pp. 1-4.
Index Terms

Computer Science
Information Sciences

Keywords

Public Key Cryptography Elliptic Curve Cryptography Point Multiplication Clock Cycles Parallel Processing