Welcome to the resource topic for 2016/171
Title:
Commutativity, Associativity, and Public Key Cryptography
Authors: Jacques Patarin, Valérie Nachef
Abstract: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.
ePrint: https://eprint.iacr.org/2016/171
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .