Results 271 to 280 of about 3,524 (301)

The Discrete-Logarithm Problem with Preprocessing

2018
This paper studies discrete-log algorithms that use preprocessing. In our model, an adversary may use a very large amount of precomputation to produce an “advice” string about a specific group (e.g., NIST P-256). In a subsequent online phase, the adversary’s task is to use the preprocessed advice to quickly compute discrete logarithms in the group ...
Henry Corrigan-Gibbs, Dmitry Kogan
openaire   +2 more sources

The Discrete Logarithm Problem

1993
There are many public-key cryptosystems whose security lies in the presumed intractability of the discrete logarithm problem in some group G. The discrete logarithm problem has received a great deal of attention in recent years, and numerous algorithms which use a variety of techniques have been devised.
Ian F. Blake, XuHong Gao, Ronald C. Mullin, Scott A. Vanstone, Tomik Yaghoobian   +4 more
openaire   +2 more sources

Arithmetic Circuits for Discrete Logarithms

2004
We introduce a new model of “generic discrete log algorithms” based on arithmetic circuits. It is conceptually simpler than previous ones, is actually applicable to the natural representations of the popular groups, and we can derive upper and lower bounds that differ only by a constant factor, namely 10.
openaire   +1 more source

Discrete Logarithm and Minimum Circuit Size

Information Processing Letters, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Discrete Logarithm Problems with Auxiliary Inputs

Journal of Cryptology, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A new digital signature scheme based on factoring and discrete logarithms

International Journal of Computer Mathematics, 2004
Shiang-Feng Tzeng, Cheng-Ying Yang, Min-Shiang Hwang   +2 more
exaly   +2 more sources

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing, 1997
Peter W Shor
exaly  

A new signature scheme based on factoring and discrete logarithms

Journal of Discrete Mathematical Sciences and Cryptography, 2009
E S Ismail
exaly  

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Review, 1999
Peter W Shor
exaly  

Remarks on some signature schemes based on factoring and discrete logarithms

Applied Mathematics and Computation, 2005
Tzung-Her Chen, Wei-Bin Lee, Gwoboa Horng   +2 more
exaly