On a new fast public key cryptosystem

2015/08/31 by Samir Bouftass, Bouftass, Samir
Computer Science · #Coding theory and cryptography #Cryptography and Data Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.1508.07756

openalex publication_date 2015/08/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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× 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 .

Citations

• New directions in cryptography

Related

• Fast decipherment algorithm for RSA public-key cryptosystem
• A new key exchange cryptosystem
• A Factoring and Discrete Logarithm based Cryptosystem
• On key exchange protocol based on Two-side multiplication action
• A practical attack to Bouftass's cryptosystem