On the Soundness of Algebraic Attacks Against Code-Based Assumptions
- 28 April 2025
- book chapter
- Published by Springer Nature
- p. 385-415
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks2024
- The Complexity of Algebraic Algorithms for LWE2024
- The Hardness of LPN over Any Integer Ring and Field for PCG Applications2024
- Short Signatures from Regular Syndrome Decoding in the Head2023
- A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions2023
- Efficient Pseudorandom Correlation Generators from Ring-LPN2020
- Revisiting the Hardness of Binary Error LWE2020
- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More2019
- Hilbert Series for Ideals Generated by Generic FormsJournal of Symbolic Computation, 1994
- Probabilistic algorithms for sparse polynomials1979