Cryptology ePrint Archive: Report 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.
Category / Keywords: public-key cryptography / Diffie-Hellman algorithms, Tchebychev Polynomials, New Public Key Algorithms
Date: received 19 Feb 2016
Contact author: valerie nachef at u-cergy fr
Available format(s): PDF | BibTeX Citation
Version: 20160222:213335 (All versions of this report)
Short URL: ia.cr/2016/171
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]