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

Category / Keywords: public-key cryptography / discrete logarithm problem,public-key cryptography ,digital signatures ,polynomial over finite fields

Date: received 23 Jul 2014

Contact author: gurgenkh at aua am

Available format(s): PDF | BibTeX Citation

Version: 20140724:125029 (All versions of this report)

Short URL: ia.cr/2014/573

Discussion forum: Show discussion | Start new discussion