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 QIDQ6652985FDOQ6652985
Authors: Andre Esser, Paolo Santini 
Publication date: 13 December 2024
Cites Work
- On ideal lattices and learning with errors over rings
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- Security bounds for the design of code-based cryptosystems
- New Algorithms for Learning in Presence of Errors
- Lapin: an efficient authentication protocol based on ring-LPN
- Progress in Cryptology – Mycrypt 2005
- New generic algorithms for hard knapsacks
- Decoding linear codes with high error rate and its impact for LPN security
- Analysis of information set decoding for a sub-linear error weight
- On computing nearest neighbors with applications to decoding of binary linear codes
- Stein's method and the rank distribution of random matrices over finite fields
- TinyKeys: a new approach to efficient multi-party computation
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Linearization Attacks Against Syndrome Based Hashes
- Statistical decoding 2.0: reducing decoding to LPN
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- Short signatures from regular syndrome decoding in the head
- The hardness of LPN over any integer ring and field for PCG applications
- Revisiting nearest-neighbor-based information set decoding
This page was built for publication: Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652985)
