Results 1  10
of
1,296
High Performance Methods of Elliptic Curve Scalar Multiplication
"... Elliptic curve scalar multiplication is the operation of successively adding a point along an elliptic curve to itself k times. It is used in elliptic curve cryptography (ECC) as a means of producing a trapdoor function. In this paper, algorithms to compute the elliptic curve scalar multiplication u ..."
Abstract
 Add to MetaCart
Elliptic curve scalar multiplication is the operation of successively adding a point along an elliptic curve to itself k times. It is used in elliptic curve cryptography (ECC) as a means of producing a trapdoor function. In this paper, algorithms to compute the elliptic curve scalar multiplication
High Performance Architecture of Elliptic Curve Scalar Multiplication
 Scalar Multiplication, CACR Research Report
, 2006
"... A high performance architecture of elliptic curve scalar multiplication over finite field GF(2 m) is proposed. A pseudopipelined word serial finite field multiplier with word size w, suitable for the scalar multiplication is also developed. Implemented in hardware, this system performs a scalar mul ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2 m) is proposed. A pseudopipelined word serial finite field multiplier with word size w, suitable for the scalar multiplication is also developed. Implemented in hardware, this system performs a scalar
Atomicity Improvement for Elliptic Curve Scalar Multiplication
 CARDIS
"... Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against sidechannel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some of the ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. In this paper we address the problem of protecting elliptic curve scalar multiplication implementations against sidechannel analysis by using the atomicity principle. First of all we reexamine classical assumptions made by scalar multiplication designers and we point out that some
New Fault Attack on Elliptic Curve Scalar Multiplication
"... In this report we present a new fault attack that applies to some implementations of elliptic curve scalar multiplication (ECSM). We consider the fault model with 'precise control of time', 'loose control of fault location' and 'random number of faulty bits'. We show th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this report we present a new fault attack that applies to some implementations of elliptic curve scalar multiplication (ECSM). We consider the fault model with 'precise control of time', 'loose control of fault location' and 'random number of faulty bits'. We show
Elliptic Curve Scalar Multiplication using Point Halving on Reconfigurable Hardware Platforms
"... Abstract — In this paper, a FPGA arithmetic logic unit architecture for computing elliptic curve scalar multiplication over the binary extension field GF (2 163) is presented. Proposed architecture implements a parallel version of the mixedcoordinate point addition and point doubling formulae. This ..."
Abstract
 Add to MetaCart
Abstract — In this paper, a FPGA arithmetic logic unit architecture for computing elliptic curve scalar multiplication over the binary extension field GF (2 163) is presented. Proposed architecture implements a parallel version of the mixedcoordinate point addition and point doubling formulae
Optimizing Elliptic Curve Scalar Multiplication for small scalars
"... On an elliptic curve, the multiplication of a point P by a scalar k is defined by a series of operations over the field of definition of the curve E, usually a finite field Fq. The computational cost of [k]P = P + P + · · · + P (k times) is therefore expressed as the number of field operations (ad ..."
Abstract
 Add to MetaCart
On an elliptic curve, the multiplication of a point P by a scalar k is defined by a series of operations over the field of definition of the curve E, usually a finite field Fq. The computational cost of [k]P = P + P + · · · + P (k times) is therefore expressed as the number of field operations
Fast GPGPUBased Elliptic Curve Scalar Multiplication
"... Abstract. This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a GeneralPurpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255bit prime fi ..."
Abstract
 Add to MetaCart
Abstract. This paper presents a fast implementation to compute the scalar multiplication of elliptic curve points based on a GeneralPurpose computing on Graphics Processing Units (GPGPU) approach. A GPU implementation using Dan Bernstein's Curve25519, an elliptic curve over a 255bit prime
Survey of Elliptic Curve Scalar Multiplication Algorithms
, 2012
"... The standard bodies accepted elliptic curve cryptography as an efficient and alternative public key cryptosystem for the next generation cryptographic applications. The most dominant operation in this cryptosystem is the scalar multiplication. In this paper, we study various scalar multiplication al ..."
Abstract
 Add to MetaCart
The standard bodies accepted elliptic curve cryptography as an efficient and alternative public key cryptosystem for the next generation cryptographic applications. The most dominant operation in this cryptosystem is the scalar multiplication. In this paper, we study various scalar multiplication
ELLIPTIC CURVES SCALAR MULTIPLICATION COMBINING MBNR WITH POINT HALVING
"... Abstract. Elliptic curves scalar multiplication over some …nite …elds, attractive research area, which paid much attention by researchers in the recent years. Researchs still in progress to improve elliptic curves cryptography implementation and reducing it’s complexity. Elliptic curve pointhalving ..."
Abstract
 Add to MetaCart
Abstract. Elliptic curves scalar multiplication over some …nite …elds, attractive research area, which paid much attention by researchers in the recent years. Researchs still in progress to improve elliptic curves cryptography implementation and reducing it’s complexity. Elliptic curve point
An Efficient Elliptic Curve Scalar Multiplication using Karatsuba Multiplier
"... Abstract — In this era, network security is becoming a great concern.Cryptography offers high security for communication and networking. Elliptic Curve Cryptography is gaining attraction with their high level of security with low cost, small key size and smaller hardware realization. Elliptic curve ..."
Abstract
 Add to MetaCart
scalar multiplication is the most important operation in elliptic curve cryptosystems This paper develops a secure elliptic curve scalar multiplication using Karatsuba multiplier. Initially, three different finite field multipliers are simulated for the construction of an elliptic curve crypto processor
Results 1  10
of
1,296