Paper 2016/171 Original: eprint.iacr.org/2016/171 ↗
Commutativity, Associativity, and Public Key Cryptography
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2017-10-18: last updated
- 2016-02-22: published
- Short URL
- https://ia.cr/2016/171
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2016/171}
}