Sciweavers

202 search results - page 9 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
MOC
2010
13 years 3 months ago
Proving modularity for a given elliptic curve over an imaginary quadratic field
We present an algorithm to determine if the L-series associated to an automorphic representation and the one associated to an elliptic curve over an imaginary quadratic field agree...
Luis Dieulefait, Lucio Guerberoff, Ariel Pacetti
EUROCRYPT
2001
Springer
14 years 1 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
ASIACRYPT
2008
Springer
13 years 10 months ago
Twisted Edwards Curves Revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...
INDOCRYPT
2003
Springer
14 years 1 months ago
On the Construction of Prime Order Elliptic Curves
We consider a variant of the Complex Multiplication (CM) method for constructing elliptic curves (ECs) of prime order with additional security properties. Our variant uses Weber po...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
14 years 1 months ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...