Paper 2016/171

Commutativity, Associativity, and Public Key Cryptography

Jacques Patarin and 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.

Note: Revised version with more details for some sections.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Diffie-Hellman algorithmsTchebychev PolynomialsNew Public Key Algorithms
Contact author(s)
valerie nachef @ u-cergy fr
History
2017-10-18: revised
2016-02-22: received
See all versions
Short URL
https://ia.cr/2016/171
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/171,
      author = {Jacques Patarin and Valérie Nachef},
      title = {Commutativity, Associativity, and Public Key Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2016/171},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/171}},
      url = {https://eprint.iacr.org/2016/171}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.