Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations /

Date: received 16 May 2005

Contact author: arkadiy at math uoregon edu

Available format(s): PDF | BibTeX Citation

Note: 28 pages

Version: 20050529:213209 (All versions of this report)

Short URL: ia.cr/2005/158

Discussion forum: Show discussion | Start new discussion