Sciweavers

202 search results - page 3 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
13 years 10 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
SACRYPT
1999
Springer
13 years 9 months ago
Elliptic Curve Pseudorandom Sequence Generators
In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF 2m. We call these sequences elliptic curve...
Guang Gong, Thomas A. Berson, Douglas R. Stinson
EUROCRYPT
2012
Springer
11 years 8 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
IJNSEC
2010
247views more  IJNSEC 2010»
13 years 13 days ago
Hardware Implementation of Efficient Modified Karatsuba Multiplier Used in Elliptic Curves
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...
Sameh M. Shohdy, Ashraf El-Sisi, Nabil A. Ismail
MOC
2000
82views more  MOC 2000»
13 years 5 months ago
Three new factors of Fermat numbers
We report the discovery of a new factor for each of the Fermat numbers F13, F15, F16. These new factors have 27, 33 and 27 decimal digits respectively. Each factor was found by the...
Richard P. Brent, Richard E. Crandall, Karl Dilche...