The Discrete Logarithm Problem

René Schoof ()
Additional contact information
René Schoof: Università di Roma “Tor Vergata”, Dipartimento di Matematica

A chapter in Open Problems in Mathematics, 2016, pp 403-416 from Springer

Abstract: Abstract For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z∕p Z)∗ is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various algorithms to compute discrete logarithms.

Keywords: Discrete Logarithm; Large Prime Numbers; Primitive Root; Galois Equivariant; Irreducible Degree (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-32162-2_12

Ordering information: This item can be ordered from
http://www.springer.com/9783319321622

DOI: 10.1007/978-3-319-32162-2_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().