Semirings, Semigroup Actions and their use for Cryptographic Protocols
![Thumbnail](/static/img/default.jpg)
Event details
Date | 19.02.2015 |
Hour | 14:15 › 15:15 |
Speaker | Joachim Rosenthal |
Location | |
Category | Conferences - Seminars |
Many cryptographic protocols such as the Diffie-Hellman key exchange and the ElGamal protocol rely on the hardness of the discrete logarithm problem in a finite group. These algorithms are then the basis for exchanging secret keys, provide digital signatures or authenticate some user.
In this talk we will give a generalization of the usual Diffie-Hellman key exchange and ElGamal protocols. Crucial for this generalizations will be semigroup actions on finite sets. Our main focus point will be semigroup actions built from semi-rings and several examples will be provided.
In order to come up with new protocols it is desirable to study matrix semigroups over finite simple semirings and their actions on finite semimodules.
In this talk we will give a generalization of the usual Diffie-Hellman key exchange and ElGamal protocols. Crucial for this generalizations will be semigroup actions on finite sets. Our main focus point will be semigroup actions built from semi-rings and several examples will be provided.
In order to come up with new protocols it is desirable to study matrix semigroups over finite simple semirings and their actions on finite semimodules.
Practical information
- Informed public
- Free
Organizer
- Prof. Eva Bayer
Contact
- Natascha Fontana