[Resource Topic] 2014/946: On a new fast public key cryptosystem

Welcome to the resource topic for 2014/946

On a new fast public key cryptosystem

Authors: Samir Bouftass, Abdelhak Azhari


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 * x)Mod(2 power p)Div(2 power 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 .

ePrint: https://eprint.iacr.org/2014/946

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .