Giophantus distinguishing attack is a low dimensional learning with errors problem

Jintai Ding University of Cincinnati, Cincinnati, OH 45219, USA Joshua Deaton University of Cincinnati, Cincinnati, OH 45219, USA Kurt Schmidt University of Cincinnati, Cincinnati, OH 45219, USA

Information Theory mathscidoc:2207.19002

Advances in Mathematics of Communications, 14, (4), 573-577, 2020.11
In this paper, we attack the recent NIST submission Giophantus, a public key encryption scheme. We find that the complicated structure of Giophantus's ciphertexts leaks information via a correspondence from a low dimensional lattice. This allows us to distinguish encrypted data from random data by the LLL algorithm. This is a more efficient attack than previous proposed attacks.
No keywords uploaded!
[ Download ] [ 2022-07-15 11:11:21 uploaded by dingjt ] [ 53 downloads ] [ 0 comments ]
@inproceedings{jintai2020giophantus,
  title={Giophantus distinguishing attack is a low dimensional learning with errors problem},
  author={Jintai Ding, Joshua Deaton, and Kurt Schmidt},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220715111121202743672},
  booktitle={Advances in Mathematics of Communications},
  volume={14},
  number={4},
  pages={573-577},
  year={2020},
}
Jintai Ding, Joshua Deaton, and Kurt Schmidt. Giophantus distinguishing attack is a low dimensional learning with errors problem. 2020. Vol. 14. In Advances in Mathematics of Communications. pp.573-577. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20220715111121202743672.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved