English

A practical attack to Bouftass's cryptosystem

Cryptography and Security 2016-05-04 v1 Number Theory

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)=(zxmod2p)/2qF(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.

Keywords

Cite

@article{arxiv.1605.00987,
  title  = {A practical attack to Bouftass's cryptosystem},
  author = {Yang Zhang},
  journal= {arXiv preprint arXiv:1605.00987},
  year   = {2016}
}
R2 v1 2026-06-22T13:52:22.977Z