On a new fast public key cryptosystem
This addresses the need for efficient cryptographic systems, but appears incremental as it builds on existing mathematical constructs without broad validation.
The paper tackles the problem of designing a fast public key cryptosystem by introducing a new function based on modulo and integer division operations, and presents key exchange, encryption, and signature algorithms built on it, with an evaluation of its hardness via reduction to SAT.
This paper presents a new fast public key cryptosystem namel : 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 )$. We define p and q values for which ModDiv2Inv can be the hardest. We then present ModDiv2Kex, a new fast key exchange algorithm based on ModDiv2Inv. In this paper we also evaluate the hardness of this problem by reducing it to SAT .