A Subfield Lattice Attack on Overstretched NTRU Assumptions : Cryptanalysis of Some FHE and Graded Encoding Schemes
- Submitting institution
-
Royal Holloway and Bedford New College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 29185385
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-53018-4_6
- Title of conference / published proceedings
- Advances in Cryptology – CRYPTO 2016 : 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I
- First page
- 153
- Volume
- 9814
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 45
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Prior to this work three foundational problems were known for achieving fully homomorphic encryption: NTRU, LWE and AGCD (with the latter two being polynomial-time equivalent). This work gave an attack on the families of parameters required for the NTRU variants, rendering these variants uncompetitive. This work, published at a top-tier venue, then
inspired follow-up work superseding it. This work is the 9th most cited work from the field of cryptography for 2016, according to https://www.sec.cs.tu-bs.de/~konrieck/topnotch/crypto_2010s.html.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -