The Discrete Logarithm Problem

By A. Konheim. 2006

174 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Information Systems, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/7edd4d225bbf94d9c394263256a816bc11a699d2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Mauro Conti
2. George Kollios
3. Hidayet Aksu
4. Abbas Acar
5. Selcuk Uluagac
6. Tibor Juhas
7. Zaid Al-Ars
8. David Enthoven

In Information Systems

1. Mauro Conti
2. Hidayet Aksu
3. Feifei Li
4. Abbas Acar
5. Selcuk Uluagac
6. Tibor Juhas

In Numerical Analysis

1. Mauro Conti
2. Hidayet Aksu
3. Abbas Acar
4. Selcuk Uluagac
5. Tibor Juhas

Citations in the corpus

• The use of elliptic curves in cryptography (2007, methodology): “The discrete logarithm problem in a finite field may then be solved the subexponential running time index calculus method [58].”
• A Survey on Homomorphic Encryption Schemes (2017, methodology): “In 1985, Taher Elgamal proposed a new public key encryption scheme [ElGamal 1985] which is the improved version of the original Diffie-Hellman Key Exchange [Diffie and Hellman 1976] algorithm, which is based on the hardness of certain problems in discrete logarithm [Kevin 1990].”
• Dynamic authenticated index structures for outsourced databases (2006, background): “Collision-resistant hash functions can be built provably based on various cryptographic assumptions, such as hardness of discrete logarithms [17].”