2000 character limit reached
A practical attack to Bouftass's cryptosystem (1605.00987v1)
Published 3 May 2016 in cs.CR and math.NT
Abstract: 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 2p)/ 2q \rfloor$. In this paper, we describe a practical attack against this protocol based on Closest Vector Problem (CVP) and Gaussian lattice reduction.