231 search results - page 3 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
MOC
1998
13 years 7 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 ...
SACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
ISMVL
2008
IEEE
14 years 1 months ago
2008
IEEE
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
ISMVL
2002
IEEE
14 years 12 days ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
CRYPTO
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...