You are looking at a specific version 20140724:125029 of this paper. See the latest version.

Paper 2014/573

A new public key system based on Polynomials over finite fields GF(2)

Gurgen Khachatrian

Abstract

In this paper a new public key system based on polynomials over finite fields GF(2) is developed.The security of the system is based on the difficulty of solving discrete logarithms over GF(2^k) with sufficiently large k. The presented system has all features of ordinary public key schemes such as public key encryption and digital signatures. The security and implementation aspects of the presented system are also introduced along with comparison with other well known public- key systems.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
discrete logarithm problempublic-key cryptographydigital signaturespolynomial over finite fields
Contact author(s)
gurgenkh @ aua am
History
2014-07-24: received
Short URL
https://ia.cr/2014/573
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.