Estimate All the {LWE, NTRU} Schemes!
| Autor: | Rachel Player, Alex Davidson, Fernando Virdia, Thomas Wunderer, Benjamin R. Curtis, Amit Deo, Eamonn W. Postlethwaite, Martin R. Albrecht |
|---|---|
| Jazyk: | angličtina |
| Předmět: |
NTRU
business.industry Computer science Estimator Cryptography 0102 computer and information sciences 02 engineering and technology Encryption 01 natural sciences Digital signature 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering NIST 020201 artificial intelligence & image processing Key encapsulation Lattice reduction business Algorithm Computer Science::Cryptography and Security |
| Zdroj: | Lecture Notes in Computer Science Lecture Notes in Computer Science-Security and Cryptography for Networks Lecture Notes in Computer Science ISBN: 9783319981123 SCN Security and Cryptography for Networks-11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-319-98113-0_19 |
| Popis: | We consider all LWE- and NTRU-based encryption, key encapsulation, and digital signature schemes proposed for standardisation as part of the Post-Quantum Cryptography process run by the US National Institute of Standards and Technology (NIST). In particular, we investigate the impact that different estimates for the asymptotic runtime of (block-wise) lattice reduction have on the predicted security of these schemes. Relying on the “LWE estimator” of Albrecht et al., we estimate the cost of running primal and dual lattice attacks against every LWE-based scheme, using every cost model proposed as part of a submission. Furthermore, we estimate the security of the proposed NTRU-based schemes against the primal attack under all cost models for lattice reduction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|