Skip to main content
Log in

Power map permutations and the discrete log problem

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

For g any generator of the multiplicative subgroup of the integers modulo a prime p, we consider the permutation that maps i to \(g^i\), for \(1 \le i \le p -1\), the inverse of the discrete log map. Such a permutation is the composite of cycles, and if a cycle is of length n and starts with \(g^s\), the last element of the cycle is s, so we can solve the DLP in at most n steps. We characterise all cycles of length 1 (fixpoints) as well as the number of generators for which an element is a fixpoint. In addition, we identify a number of conditions under which there will be orbits of length 2, 3 and 4, and provide a simple formula for switching between generators. Short orbits would all obviously provide keys that would be disastrous in public key schemes such as DSA and Diffie-Hellman and thus should be avoided. This is emerging research, and it remains to be seen if such keys can be avoided by merely using good random bit generators, or whether certain primes and generators are inherently weak.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bourgain J., Konyagin S., Shparlinski I.: Product sets of rationals, multiplicative translates of subgroups in residue rings and fixed points of the discrete logarithm. In: International Mathematics Research Notices (2008).

  2. Guy R.: Unsolved Problems in Number Theory. Problem Books in Mathematics, 3rd edn. Springer, New York (2004).

  3. Holden J., Moree P.: Some heuristics and results for small cycles of the discrete logarithm. Math. Comput. 75, 419–449 (2006).

  4. Levin M., Pomerance C., Soundararajan K.: Fixed points for discrete logarithms. In: Algorithmic Number Theory. Lecture Notes in Computer Science, vol. 6197, pp. 6–15. Springer, Berlin (2010).

  5. Menezes A., van Oorschot P., Vanstone S.: Handbook of Applied Cryptography. CRC Press, New York (1997).

  6. Peirce C.: Collected Papers, Book III, vol. 4, chapter 1. Harvard University Press, Cambridge (1958).

Download references

Acknowledgments

I am grateful to the reviewer for making me aware of some relevant publications and their results.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Landrock.

Additional information

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Cryptography, Codes, Designs and Finite Fields: In Memory of Scott A. Vanstone”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Landrock, P. Power map permutations and the discrete log problem. Des. Codes Cryptogr. 77, 713–724 (2015). https://doi.org/10.1007/s10623-015-0128-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-015-0128-9

Keywords

Mathematics Subject Classification

Navigation