In the present repository we provide code in order to support our paper,
E. Poimenidou, M. Adamoudis, K. Draziotis, K. Tsichlas, Message Recovery Attack in NTRU through VFK Lattices
https://arxiv.org/abs/2311.17022. The code is given in SageMath ver. 9.8. Directory ntru-hps
contains the basic experiments providedd in the paper.
Here is a description of the repository:
├── auxiliary
│ └── find_max_k_and_P.sage
├── cvp-naive-attack
│ └── clasic_cvp_attack_ntru.ipynb
├── LICENSE
├── ntru-hps
│ ├── experiments.ipynb
├── README.md
- In
cvp-naive-attack
we provide code for the classic cvp attack to ntru. We remark that this attack is not successful for N>50. - Directory
ntru-hps
contains code for the NTRUhps (foollowing the recomendations of the NIST's submission) and a comparison with a previous attack - Directory
ntru-prime
as previous, but for NTRU-Prime. ntru-lattice-vfk-cvp.ipynb
contains the implementation of a polynomial CVP exact algorithm for VFK lattices.svp-ntru-vfk.ipynb
contains sagemath code for a polynomial algorithm for SVP over VFK lattices.
- K. A. Draziotis (drazioti@gmail.com)
- Marios Adamoudis (marios.p7@hotmail.com )
- Eirini Poimenidou
credits: Some functions are from https://latticehacks.cr.yp.to/ntru.html
This project is licensed under the GPLv2 License
The images are provided with CC BY 2.0