Cryptology ePrint Archive: Report 2014/946

On a new fast public key cryptosystem

Samir Bouftass

Abstract: This paper presents a new fast public key cryptosystem namely : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function : $F(x) =(a\times x)Mod(2^p)Div(2^q)$ .\\* Mod is modulo operation , Div is integer division operation , a , p and q are integers where $( p > q )$ .\\* In this paper we also evaluate the hardness of this problem by reducing it to SAT .

Category / Keywords: key exchange, public key encryption, digital signature, boolean satisfability problem, Multivariate polynomials over F(2) .

Date: received 17 Nov 2014, last revised 20 Jul 2015

Contact author: crypticator at gmail com

Available format(s): PDF | BibTeX Citation

Note: Some refinements and adjustements.

Version: 20150720:083111 (All versions of this report)

Short URL: ia.cr/2014/946

Discussion forum: Show discussion | Start new discussion