A practical attack to Bouftass's cryptosystem
arXiv:1605.00987v1
Originality Incremental advance
AI Analysis
This work addresses a security problem for users of Bouftass's cryptosystem, showing it is vulnerable and thus incremental in cryptanalysis.
The authors tackled the security of Bouftass's new public key exchange protocol by developing a practical attack using Closest Vector Problem (CVP) and Gaussian lattice reduction, successfully breaking the cryptosystem.
Recently, a new fast public key exchange protocol was presented by S. Bouftass. The protocol is based on the difficulty of inverting the function $F(x)=\lfloor (zx \mod 2^p)/ 2^q \rfloor$. In this paper, we describe a practical attack against this protocol based on Closest Vector Problem (CVP) and Gaussian lattice reduction.