Description

The discrete logarithm problem asks to find -- for a pair of elements a,b of a finite field (or more general a residue class ring) an integer c such that a^b=c or to show that no such c can exist.

The current implementation in GAP is Pollard-Rho.

References

• J. M. Pollard, Nordisk Tidskr. Informationsbehandling (BIT) {\bf 15} (1975), n\ o.~3, 331--334; MR {\bf 52} \#13611
• J. M. Pollard, J. Cryptology {\bf 13} (2000), no.~4, 437--447; MR 2001i:94059
• E. Teske, in {\it Algorithmic number theory (Portland, OR, 1998)}, 541--554, Lecture Notes in Comput. Sci., 1423, Springer, Berlin, 1998; MR 2000j:11199
• D. Weber, in {\it Algorithmic number theory (Talence, 1996)}, 391--403, Lecture Notes in Comput. Sci., 1122, Springer, Berlin, 1996; MR 98k:11186
• K. S. McCurley, in {\it Cryptology and computational number theory (Boulder, CO, 1989)}, 49--74, Proc. Sympos. Appl. Math., 42, Amer. Math. Soc., Providence, RI, 1990; MR 92d:11133
• A. Odlyzko, Des. Codes Cryptogr. {\bf 19} (2000), no.~2-3, 129--145; see MR 2000m:94023

GAP home page