Sciweavers

22 search results - page 3 / 5
» Construction of Rational Points on Elliptic Curves over Fini...
Sort
View
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
14 years 11 months ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
WAIFI
2010
Springer
194views Mathematics» more  WAIFI 2010»
15 years 2 months ago
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
Naomi Benger, Michael Scott
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
15 years 1 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
ENC
2004
IEEE
15 years 1 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe
81
Voted
CORR
2010
Springer
192views Education» more  CORR 2010»
14 years 6 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev