Optimizing point Doubling Operations in ECC Zp

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. General Terms Wireless network,security system and dependent and independent operations.

[1]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[2]  Mohammed Benaissa,et al.  Fast Elliptic Curve Cryptography on FPGA , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Chih-Tsun Huang,et al.  Elixir: High-Throughput Cost-Effective Dual-Field Processors and the Design Framework for Elliptic Curve Cryptography , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[4]  Kimmo Järvinen,et al.  On Parallelization of High-Speed Processors for Elliptic Curve Cryptography , 2008, IEEE Trans. Very Large Scale Integr. Syst..

[5]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[6]  Ingrid Verbauwhede,et al.  Multicore Curve-Based Cryptoprocessor with Reconfigurable Modular Arithmetic Logic Units over GF(2^n) , 2007, IEEE Transactions on Computers.

[7]  Catherine H. Gebotys Design of secure cryptography against the threat of power-attacks in DSP-embedded processors , 2004, TECS.

[8]  Wei Wang,et al.  Hardware Organization to Achieve High-Speed Elliptic Curve Cryptography for Mobile Devices , 2007, Mob. Networks Appl..

[9]  Cristina Alcaraz,et al.  A Survey of Cryptographic Primitives and Implementations for Hardware-Constrained Sensor Network Nodes , 2007, Mob. Networks Appl..

[10]  Mark Allen Weiss,et al.  Data structures and algorithm analysis in C , 1991 .

[11]  Volker Müller Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two , 1998, Journal of Cryptology.

[12]  Carmen Sánchez Ávila,et al.  A comparison of the standardized versions of ECIES , 2010, 2010 Sixth International Conference on Information Assurance and Security.

[13]  Pradeep Kumar Mishra,et al.  Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems , 2004, CHES.

[14]  Christos D. Zaroliagis,et al.  On the Efficient Generation of Prime-Order Elliptic Curves , 2010, Journal of Cryptology.

[15]  Nigel P. Smart Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic , 1999, Journal of Cryptology.

[16]  Mark Allen Weiss,et al.  Data structures and algorithm analysis , 1991 .

[17]  Steven D. Galbraith,et al.  Elliptic Curve Paillier Schemes , 2001, Journal of Cryptology.

[18]  William Stallings,et al.  Cryptography and network security , 1998 .

[19]  Roberto Giorgi,et al.  Effects of Instruction-Set Extensions on an Embedded Processor: A Case Study on Elliptic Curve Cryptography over GF(2/sup m/) , 2008, IEEE Transactions on Computers.

[20]  Michael D. Smith,et al.  Implementing public-key infrastructure for sensor networks , 2008, TOSN.

[21]  Carmen Sánchez Ávila,et al.  Analysis of ECIES and Other Cryptosystems Based on Elliptic Curves , 2011 .

[22]  Manuel Barbosa,et al.  Constructive and Destructive Use of Compilers in Elliptic Curve Cryptography , 2009, Journal of Cryptology.

[23]  Patrick Longa,et al.  Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields , 2008, IEEE Transactions on Computers.