A new public key system based on Polynomials over finite fields GF(2).
Gurgen H. Khachatrian · IACR Cryptology ePrint Archive · 2014
In this paper a new public key system based on polynomials over fields GF (2) is developed. The security of the system is based on the difficulty of finding discrete logarithms over GF (2) 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.