Geometric Cryptosystem

Arkady Berenstein; Leon Chernyak

Paper 2005/158

Geometric Cryptosystem

Arkady Berenstein and Leon Chernyak

Abstract

In this paper we propose a new class of cryptosystems that utilizes metric continuity. The geometric cryptosystem considered in this paper as the main example of metric cryptosystems has a number of interesting properties such as resistance to several basic cryptographic attacks, efficiency and detection of transmission errors.

Note: 28 pages

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): arkadiy @ math uoregon edu
History: 2005-05-29: received
Short URL: https://ia.cr/2005/158
License: CC BY

BibTeX

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