Results 261 to 270 of about 762,592 (290)
Some of the next articles are maybe not open access.
The Discrete Logarithm Problem
1993In [Dif76] Diffie and Hellman propose a public key distribution system which is based on the apparent difficulty of computing logarithms over the finite field GF (p), p prime. The reader, who is not familiar with the theory of finite fields is referred to Appendix B. Let α be a primitive element of GF(p).
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 +2 more sources
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 Galbraith, Pierrick Gaudry
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
Solving discrete logarithm problems faster with the aid of pre-computation
Discrete Applied Mathematics, 2019Hyeonmi Lee, Jin Hong
exaly
Discrete logarithm based additively homomorphic encryption and secure data aggregation
Information Sciences, 2011Yixian Yang, Licheng Wang, Yun Pan
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