Year: 2016
Type: preprint
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 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.
Source: arXiv (Cornell University)
Author: Zhang, Yang
Institution: Texas Tech University
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2345724596