Sciweavers

Share
IACR
2016

Commutativity, Associativity, and Public Key Cryptography

5 years 6 months ago
Commutativity, Associativity, and Public Key Cryptography
In this paper, we will study some possible generalizations of the famous Diffie-Hellman algorithm. As we will see, at the end, most of these generalizations will not be secure or will be equivalent to some classical schemes. However, these results are not always obvious and moreover our analysis will present some interesting connections between the concepts of commutativity, associativity, and public key cryptography.
Jacques Patarin, Valérie Nachef
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Jacques Patarin, Valérie Nachef
Comments (0)
books