Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
From MaRDI portal
Publication:6652985
DOI10.1007/978-3-031-68391-6_6MaRDI QIDQ6652985
Publication date: 13 December 2024
Cites Work
- Decoding linear codes with high error rate and its impact for LPN security
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Stein's method and the rank distribution of random matrices over finite fields
- Analysis of Information Set Decoding for a Sub-linear Error Weight
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- New Algorithms for Learning in Presence of Errors
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- On Ideal Lattices and Learning with Errors over Rings
- New Generic Algorithms for Hard Knapsacks
- Security Bounds for the Design of Code-Based Cryptosystems
- Lapin: An Efficient Authentication Protocol Based on Ring-LPN
- Linearization Attacks Against Syndrome Based Hashes
- Progress in Cryptology – Mycrypt 2005
- TinyKeys: a new approach to efficient multi-party computation
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Short signatures from regular syndrome decoding in the head
- Statistical decoding 2.0: reducing decoding to LPN
- Revisiting nearest-neighbor-based information set decoding
- The hardness of LPN over any integer ring and field for PCG applications
This page was built for publication: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
