Semigroup Action Problem (SAP) and other Generalizations of the DLP

By Joachim Rosenthal

Appears in collection : 2024 - T3 - WS2 - Emerging topics in design and cryptanalysis of post-quantum schemes

The Discrete Logarithm Problem (DLP) in a group has been a corner stone of modern cryptography. In this overview talk we first show that it is possible to relax the group axioms to consider semigroups and Moufang loops to study the DLP problem. Then we concentrate on the Semigroup Action Problem (SAP) which vastly generalizes the DLP. This general concept was introduced by G. Maze, C. Monico and the speaker in 2002. It encompasses many group based public key protocols currently under intense investigation. It turns out that when the acting semigroup is abelian one readily can build a key exchange as well as onway trapdoor function. For general semigroup actions (not necessarily commutative) one still can create a zero knowledge proof and hence a digital signature protocol. The last part is devoted to construction techniques of interesting semigroup actions starting from semirings. Tropical semirings have been employed by J. Chen, D. Grigoriev and V. Shpilrain. In this talk we concentrate on congruence-simple finite semirings which were classified by J. Zumbrägel in 2008.

Information about the video

Citation data

  • DOI 10.57987/IHP.2024.T3.WS2.004
  • Cite this video Rosenthal, Joachim (04/11/2024). Semigroup Action Problem (SAP) and other Generalizations of the DLP. IHP. Audiovisual resource. DOI: 10.57987/IHP.2024.T3.WS2.004
  • URL https://dx.doi.org/10.57987/IHP.2024.T3.WS2.004

Domain(s)

Bibliography

  • G. Maze, C. Monico, and J. Rosenthal : A public key cryptosystem based on actions by semigroups. In 'Proceedings of the 2002 IEEE International Symposium on Information Theory', page 266, Lausanne, Switzerland, 2002.
  • G. Maze, C. Monico, J. Rosenthal, and J.J. Climent : Public key cryptography based on simple modules over simple rings. In D. Gilliam and J. Rosenthal, editors, 'Proceedings of the 15th International Symposium on the Mathematical Theory of Networks and Systems' / University of Notre Dame, August 2002.
  • G. Maze : Algebraic Methods for Constructing One-Way Trapdoor Functions / PhD thesis, University of Notre Dame, May 2003.
  • G. Maze, C. Monico, and J. Rosenthal : Public key cryptography based on semigroup actions / Adv. in Math. of Communications, 1(4):489--507, 2007. arXiv:cs/0501017
  • J. Zumbrägel : Classification of finite congruence-simple semirings with zero / J. Algebra Appl., 7(3):363--377, 2008.

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback