Polynomial-time key-recovery attacks against \texttt{NTRUReEncrypt} from ASIACCS'15
From MaRDI portal
Publication:6595029
DOI10.1007/S11424-024-2426-7zbMATH Open1544.94264MaRDI QIDQ6595029FDOQ6595029
Yanbin Pan, Jinwei Zheng, Zhen Liu
Publication date: 29 August 2024
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Title not available (Why is that?)
- Ciphertext-only attacks against compact-LWE submitted to NIST PQC project
- New Chosen-Ciphertext Attacks on NTRU
- An Algebraic Broadcast Attack against NTRU
- NTRU prime: reducing attack surface at low cost
- Key-Private Proxy Re-encryption under LWE
- Title not available (Why is that?)
- Choosing Parameters for NTRUEncrypt
- High-Speed Key Encapsulation from NTRU
- Title not available (Why is that?)
- Cryptanalysis of an NTRU-based proxy encryption scheme from ASIACCS'15
This page was built for publication: Polynomial-time key-recovery attacks against \texttt{NTRUReEncrypt} from ASIACCS'15
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595029)