Paper 2014/573 Original: eprint.iacr.org/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.
History
2014-07-24: last updated
2014-07-24: published
Short URL
https://ia.cr/2014/573
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/573,
      author = {Gurgen Khachatrian},
      title = {A new public key system based on Polynomials over finite fields GF(2)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/573},
      year = {2014},
      url = {https://eprint.iacr.org/2014/573}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.