Results 181 to 190 of about 559 (211)
Some of the next articles are maybe not open access.
The Discrete Logarithm Problem
1993There 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 +4 more
openaire +2 more sources
Arithmetic Circuits for Discrete Logarithms
2004We 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 Problems with Auxiliary Inputs
Journal of Cryptology, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Recent progress on the elliptic curve discrete logarithm problem
Designs, Codes, and Cryptography, 2015Steven D Galbraith +2 more
exaly
The discrete logarithm problem in the group of non-singular circulant matrices
Groups, Complexity, Cryptology, 2010AYAN Mahalanobis
exaly
Constructing identity-based cryptosystems for discrete logarithm based cryptosystems
Journal of Network and Computer Applications, 2004Wei-Bin Lee
exaly
Discrete logarithm based additively homomorphic encryption and secure data aggregation
Information Sciences, 2011Licheng Wang, Yun Pan, Zonghua Zhang
exaly
Solving discrete logarithm problems faster with the aid of pre-computation
Discrete Applied Mathematics, 2019Jin Hong, Hyeonmi Lee
exaly
A discrete logarithm problem over composite modulus
Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English Translation of Denshi Tsushin Gakkai Ronbunshi), 1993Yasuyuki Murakami, Masao Kasahara
exaly