Sciweavers

76 search results - page 1 / 16
» Pipelining GF(P) Elliptic Curve Cryptography Computation
Sort
View
IAJIT
2006
145views more  IAJIT 2006»
13 years 4 months ago
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
Adnan Abdul-Aziz Gutub
AICCSA
2006
IEEE
142views Hardware» more  AICCSA 2006»
13 years 10 months ago
Pipelining GF(P) Elliptic Curve Cryptography Computation
This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and seri...
Adnan Abdul-Aziz Gutub, Mohammad K. Ibrahim, Ahmad...
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
13 years 10 months ago
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
Pradeep Kumar Mishra
JSC
2011
100views more  JSC 2011»
12 years 7 months ago
Toric forms of elliptic curves and their arithmetic
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
Wouter Castryck, Frederik Vercauteren
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
13 years 10 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange