Asymptotics and improvements of sieving for codes
From MaRDI portal
Publication:6637718
DOI10.1007/978-3-031-58754-2_6MaRDI QIDQ6637718
Léo Ducas, Simona Etinski, Elena Kirshanova, Andre Esser
Publication date: 13 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extended \(k\)-tree algorithm
- Decoding linear codes with high error rate and its impact for LPN security
- On iterative collision search for LPN and subset sum
- Dissection-BKW
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Sieve algorithms for the shortest vector problem are practical
- An Improved LPN Algorithm
- Security Bounds for the Design of Code-Based Cryptosystems
- Locality-sensitive Hashing without False Negatives
- New directions in nearest neighbor searching with applications to lattice sieving
- Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW
- Statistical decoding 2.0: reducing decoding to LPN
- Revisiting nearest-neighbor-based information set decoding
This page was built for publication: Asymptotics and improvements of sieving for codes
