ProV Logo
0

On a new fast public key cryptosystem
Bouftass, Samir...
On a new fast public key cryptosystem by Bouftass, Samir ( Author )
N.A
31-08-2015
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(2p)Div(2q). 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 .
-
Article
pdf
36.88 KB
English
-
MYR 0.00
-
http://arxiv.org/abs/1508.07756
Share this eBook