A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions-Reference-Cited by-同舟云学术

A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG Constructions

Published:2023 Issue: Volume: Page:391-422
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2023
language:
Short-container-title:

Author:

Briaud Pierre^ORCID,Øygarden Morten^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-30589-4_14

Reference44 articles.

1. Aguilar-Melchor, C., Blazy, O., Deneuville, J.C., Gaborit, P., Zémor, G.: Efficient encryption from random quasi-cyclic codes. IEEE Trans. Inf. Theory 64(5), 3927–3943 (2018). https://doi.org/10.1109/TIT.2018.2804444

2. Albrecht, M., Cid, C., Faugère, J.C., Fitzpatrick, R., Perret, L.: On the complexity of the arora-ge algorithm against LWE. In: SCC 2012 - Third International Conference on Symbolic Computation and Cryptography, Castro Urdiales, Spain, pp. 93–99 (2012). https://hal.inria.fr/hal-00776434

3. Albrecht, M.R., Cid, C., Faugère, J.C., Perret, L.: Algebraic Algorithms for LWE. Cryptology ePrint Archive, Paper 2014/1018 (2014). https://eprint.iacr.org/2014/1018

4. Lecture Notes in Computer Science;B Applebaum,2017

5. Lecture Notes in Computer Science;S Arora,2011

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Hardness of LPN over Any Integer Ring and Field for PCG Applications;Lecture Notes in Computer Science;2024

2. $$\textsf{ReSolveD} $$: Shorter Signatures from Regular Syndrome Decoding and VOLE-in-the-Head;Lecture Notes in Computer Science;2024

3. Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks;Lecture Notes in Computer Science;2024

4. Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding;Advances in Cryptology – CRYPTO 2023;2023