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)

Related topics

Related topics

49 relations
AlgorithmBQPBerlekamp's algorithmBirthday attack

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
On Limitations of Designing Leakage-Resilient Password Systems: Attacks, Principals and Usability
The design of leakage-resilient password systems (LRPSes) in the absence of trusted devices remains a challenging problem today… 
Highly Cited
2010
Highly Cited
2010
New dynamic ID authentication scheme using smart cards
Recently, Yoon et al. and Wang et al. independently proposed a dynamic ID authentication scheme and claimed that their schemes… 
2010
2010
Fixed Points for Discrete Logarithms
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… 
2008
2008
Elementary thoughts on discrete logarithms
We give an introduction to the discrete logarithm problem in cyclic groups and treat the most important methods for solving them… 
Highly Cited
2006
Highly Cited
2006
A novel efficient (t, n) threshold proxy signature scheme
2005
2005
Designated-Verifier Proxy Signature Schemes
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
RSA-based fail-stop signature schemes
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
An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms
A verifiable encryption scheme (VES) is useful for many cryptographic protocols. A VES may be either for (encryption of) discrete… 
Highly Cited
1994
Highly Cited
1994
Test embedding with discrete logarithms
When using Built-In Self Test (BIST) for testing VLSI circuits, a major concern is the generation of proper test patterns that… 
Highly Cited
1990
Highly Cited
1990
A discrete logarithm implementation of perfect zero-knowledge blobs
Brassard and Crépeau [BCr] introduced a simple technique for producing zero-knowledge proof systems based on blobs. As is to be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)