loading
Implementation of point addition & point doubling for Elliptic Curve
2015 Edition, April 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

This paper describes the verilog implementation of point addition and doubling used in Elliptic Curve Point Multiplication. Based on the theory of Elliptic Curve Cryptography, this paper has carried out modular...

Fast elliptic curve point multiplication for WSNs
2013 Edition, April 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Wireless sensor networks facilitate real-time data processing in many applications such as intrusion detection and military surveillance. These applications inherently demand a high level of security. Public key cryptographic techniques such as Elliptic Curve Cryptography (ECC)...

An RNS Implementation of an $F_{p}$ Elliptic Curve Point Multiplier
2009 Edition, Volume 56, June 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Elliptic curve point multiplication is considered to be the most significant operation in all elliptic curve cryptography systems, as it forms the basis of the elliptic curve discrete logarithm problem. Designs for elliptic...

Elliptic Curve arithmetic over extension field to intensify security and privacy
2016 Edition, March 1, 2016 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In modern days security issues play a vital and integral part of information technology and its related applications such as ATM and smart cards. Cryptography has evolved as a important element of security process. Elliptic curve cryptography is used to develop a variety...

Fast point operation architecture for Elliptic Curve Cryptography
2008 Edition, November 1, 2008 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Elliptic curve cryptography (ECC) plays an important role in todaypsilas public key based security systems. Compared with the conventional systems such as RSA, ECC delivers much higher security strength per bit. The implementation of ECC lies in three levels: scalar...

Elliptic Curve Point Multiplication in GF(2n) using Polynomial Residue Arithmetic
2009 Edition, December 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Elliptic Curve Point Multiplication is the main operation employed in all elliptic curve cryptosystems, as it forms the basis of the Elliptic Curve Discrete Logarithm Problem. Therefore, the efficient realization of an Elliptic...

Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
2009 Edition, Volume 58, October 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Galbraith, Lin, and Scott recently constructed efficiently computable endomorphisms for a large family of elliptic curves defined over IFq2 and showed, in the case where q is a prime, that the Gallant-Lambert-Vanstone point multiplication method for these...

SPA resistant Elliptic Curve Cryptosystem using Addition Chains
2007 Edition, April 1, 2007 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication such as the double and add method are prone to such attacks. By making use...

Energy efficient elliptic curve point multiplication for WSN applications
2013 Edition, February 1, 2013 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Wireless Sensor Networks (WSN's) are resource constrained networks, demanding energy efficient cryptographic algorithms in order to extend security to them. When compared with the popular RSA algorithm, Elliptic Curve Cryptography (ECC) offers similar level of security with...

Parallel scalar multiplication for elliptic curve cryptosystems
2005 Edition, Volume 1, January 1, 2005 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

A parallel elliptic curve scalar multiplication algorithm is proposed. The algorithm works at its highest efficiency when a dual-processor hardware system is utilized. The new method has an average computation time of n/3 times of that of one elliptic...

Advertisement