Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IACR
2016

favoriteEmaildiscussreport

47views Biometrics» more IACR 2016»

Commutativity, Associativity, and Public Key Cryptography

8 years 23 days ago

Commutativity, Associativity, and Public Key Cryptography

Download eprint.iacr.org

In this paper, we will study some possible generalizations of the famous Diﬃe-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

Real-time Traffic

Biometrics | IACR 2016 |

claim paper

Related Content

» On the implementation of public keys algorithms based on algebraic graphs over finite comm...

» Using decision problems in public key cryptography

» Public Key Cryptography in Sensor Networks Revisited

» Concurrently NonMalleable Zero Knowledge in the Authenticated PublicKey Model

» Divertible Protocols and Atomic Proxy Cryptography

» Fully selforganized peertopeer key management for mobile ad hoc networks

» Secure Communications over Insecure Channels Based on Short Authenticated Strings

» A Framework for Key Management in Mobile Ad Hoc Networks

» On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC

» IdentityBased Chameleon Hash and Applications

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	IACR
Authors	Jacques Patarin, Valérie Nachef

Comments (0)