olemus
täisarv k, mis on võrrandi b^k = g lahend
(b ja g on mingi rühma elemendid):
tavalise logaritmi analoog, väga raskesti arvutatav,
on avaliku võtmega krüptograafias
mitmete algoritmide alus
=
the non-negative integer k such that b^k = g
(where b and g are elements of a group)

ülevaateid
https://en.wikipedia.org/wiki/Discrete_logarithm

https://mathstats.uncg.edu/sites/pauli/112/HTML/secdisclog.html

https://www.youtube.com/watch?v=bjWOG50PfdI

http://mathworld.wolfram.com/DiscreteLogarithm.html

https://math.dartmouth.edu/~carlp/dltalk09.pdf

http://www.dtc.umn.edu/~odlyzko/doc/discretelogs2014.pdf

rakendusi
http://www.mccurley.org/papers/dlog.pdf

https://www.cs.purdue.edu/homes/ssw/pk.pdf

https://www.esat.kuleuven.be/cosic/publications/talk-78.pdf