32 search results - page 2 / 7 » Polynomial Interpolation of the Discrete Logarithm |
ALGORITHMICA
2006
13 years 5 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
ARITH
1993
IEEE
13 years 9 months ago
1993
IEEE
This paper describes a logarithmic number system (LNS) arithmetic unit using a new methodfor polynomial interpolation in hardware. The use of an interleaved memory reduces storage...
DCC
1999
IEEE
13 years 5 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
MOC
2002
13 years 5 months ago
2002
Abstract. This article is devoted to the construction of a Hermite-type regularization operator transforming functions that are not necessarily C1 into globally C1 finite-element f...