CryptoDB
Geometric Key Establishment
Authors: | |
---|---|
Download: | |
Abstract: | We propose a new class of key establishment schemes which are based on geometric generalizations of the classical Diffie-Hellman. The simplest of our schemes ? based on the geometry of the unit circle ? uses only multiplication of rational numbers by integers and addition of rational numbers in its key creation. Its first computer implementation works significantly faster than all known implementations of Diffie-Hellman. Preliminary estimations show that our schemes are resistant to attacks. This resistance follows the pattern of the discrete logarithm problem and hardness of multidimensional lattice problems |
BibTeX
@misc{eprint-2004-12208, title={Geometric Key Establishment}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / a new class of key establishment protocols}, url={http://eprint.iacr.org/2004/239}, note={to appear in the AMS series ''Comtemporary Mathematics'' arkadiy@math.uoregon.edu 13175 received 14 Sep 2004, last revised 26 Jan 2006}, author={Arkady Berenstein and Leon Chernyak}, year=2004 }