32 search results - page 1 / 7 » Polynomial Interpolation of the Discrete Logarithm |
DCC
2002
IEEE
14 years 10 months ago
2002
IEEE
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
WCC
2005
Springer
14 years 4 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
MOC
1998
13 years 10 months ago
1998
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
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 elli...