Quantum key search for ternary LWE
From MaRDI portal
Publication:2118530
DOI10.1007/978-3-030-81293-5_7zbMATH Open1489.81023OpenAlexW3140763611MaRDI QIDQ2118530FDOQ2118530
Alexander May, Elena Kirshanova, Iggy van Hoof
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_7
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- On Ideal Lattices and Learning with Errors over Rings
- Search via Quantum Walk
- Title not available (Why is that?)
- Efficient Public Key Encryption Based on Ideal Lattices
- Quantum Walk Algorithm for Element Distinctness
- Classical hardness of learning with errors
- Lattice Signatures without Trapdoors
- A monte carlo method for factorization
- Lattice Signatures and Bimodal Gaussians
- Improved Generic Algorithms for Hard Knapsacks
- Title not available (Why is that?)
- Cycle detection using a stack
- New lattice based cryptographic constructions
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- New Generic Algorithms for Hard Knapsacks
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Estimate all the {LWE, NTRU} schemes!
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- An Improved Claw Finding Algorithm Using Quantum Walk
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Subset-Sum Problem
- Quantum information set decoding algorithms
- NTRU prime: reducing attack surface at low cost
- Coded-BKW: Solving LWE Using Lattice Codes
- High-Speed Key Encapsulation from NTRU
- Lattice Decoding Attacks on Binary LWE
- Improved classical and quantum algorithms for subset-sum
Cited In (2)
Uses Software
This page was built for publication: Quantum key search for ternary LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118530)
