Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding-Reference-Cited by-同舟云学术

Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding

Published:2012 Issue: Volume: Page:520-536
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2012
language:
Short-container-title:

Author:

Becker Anja,Joux Antoine,May Alexander,Meurer Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-29011-4_31.pdf

Reference31 articles.

1. Alekhnovich, M.: More on Average Case vs Approximation Complexity. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 298–307 (2003)

2. Lecture Notes in Computer Science;A. Becker,2011

3. Becker, A., Joux, A., May, A., Meurer, A.: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. Full Version, http://eprint.iacr.org

4. Lecture Notes in Computer Science;D.J. Bernstein,2008

5. Lecture Notes in Computer Science;D.J. Bernstein,2011

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

1. Memory-Efficient Attacks on Small LWE Keys;Journal of Cryptology;2024-08-20

2. Elliptic code-based oblivious polynomial evaluation;Computer Standards & Interfaces;2024-08

3. Tightly-Secure Two-Tier Signatures on Code-Based Digital Signatures with Chameleon Hash Functions;Mathematics;2024-07-30

4. Group encryption: Full dynamicity, message filtering and code-based instantiation;Theoretical Computer Science;2024-07

5. SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07