Geometric Key Establishment

Arkady Berenstein; Leon Chernyak

Paper 2004/239 Original: eprint.iacr.org/2004/239 ↗

Geometric Key Establishment

Arkady Berenstein

Leon Chernyak

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

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2006-01-27: last updated; 2004-09-16: published
Short URL: https://ia.cr/2004/239
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2004/239,
      author = {Arkady Berenstein and Leon Chernyak},
      title = {Geometric Key Establishment},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/239},
      year = {2004},
      url = {https://eprint.iacr.org/2004/239}
}