Public key cryptography based on semigroup actions
Gérard Maze Chris Monico Joachim Rosenthal
Advances in Mathematics of Communications 2007, 1(4): 489-507 doi: 10.3934/amc.2007.1.489
A generalization of the original Diffie-Hellman key exchange in $(\mathbb Z$∕$p\mathbb Z)$* found a new depth when Miller [27] and Koblitz [16] suggested that such a protocol could be used with the group over an elliptic curve. In this paper, we propose a further vast generalization where abelian semigroups act on finite sets. We define a Diffie-Hellman key exchange in this setting and we illustrate how to build interesting semigroup actions using finite (simple) semirings. The practicality of the proposed extensions rely on the orbit sizes of the semigroup actions and at this point it is an open question how to compute the sizes of these orbits in general and also if there exists a square root attack in general.
   In Section 5 a concrete practical semigroup action built from simple semirings is presented. It will require further research to analyse this system.
keywords: one-way trapdoor functions Public key cryptography semigroup actions Diffie-Hellman protocol simple semirings.

Year of publication

Related Authors

Related Keywords

[Back to Top]