Skip to search formSkip to main contentSkip to account menu

Discrete logarithm

Known as: DLOG, GDLP, Generalized discrete logarithm problem 
In mathematics, a discrete logarithm is an integer k solving the equation bk = g, where b and g are elements of a finite group. Discrete logarithms… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Recently, Yoon et al. and Wang et al. independently proposed a dynamic ID authentication scheme and claimed that their schemes… 
2010
2010
We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root g and an integer x in the interval [1… 
2009
2009
2009
The difficulty in solving the discrete logarithm problem (DLP) is very important to the cryptography since it is widely used in… 
2009
2009
We present group-theoretic and cryptographic properties of a generalization of the traditional discrete logarithm problem from… 
2005
2005
In a proxy signature scheme, a user delegates his/her signing capability to another user in such a way that the latter can sign… 
1999
1999
Fail-stop signatures provide security for a sender against a forger with unlimited computational power. In this paper we present… 
Highly Cited
1998
Highly Cited
1998
A verifiable encryption scheme (VES) is useful for many cryptographic protocols. A VES may be either for (encryption of) discrete… 
1998
1998
At present, there are two competing index calculus variants for computing discrete logarithms in (ℤ/pℤ)* in practice. The purpose… 
Highly Cited
1994
Highly Cited
1994
When using Built-In Self Test (BIST) for testing VLSI circuits, a major concern is the generation of proper test patterns that…