:ref:`A <ref-A>` :ref:`B <ref-B>` :ref:`C <ref-C>` :ref:`D <ref-D>` :ref:`E <ref-E>` :ref:`F <ref-F>` :ref:`G <ref-G>` :ref:`H <ref-H>` :ref:`I <ref-I>` :ref:`J <ref-J>` :ref:`K <ref-K>` :ref:`L <ref-L>` :ref:`M <ref-M>` :ref:`N <ref-N>` :ref:`O <ref-O>` :ref:`P <ref-P>` :ref:`Q <ref-Q>` :ref:`R <ref-R>` :ref:`S <ref-S>` :ref:`T <ref-T>` :ref:`U <ref-U>` :ref:`V <ref-V>` :ref:`W <ref-W>` :ref:`X <ref-X>` :ref:`Y <ref-Y>` :ref:`Z <ref-Z>`
A
| [BKW19] | Andreas Björklund, Petteri Kaski, and Ryan Williams. Solving Systems of Polynomial Equations over GF(2) by a Parity-Counting Self-Reduction https://drops.dagstuhl.de/opus/volltexte/2019/10602/pdf/LIPIcs-ICALP-2019-26.pdf |
| [JV18] | Antoine Joux and Vanessa Vitse. A Crossbred Algorithm for Solving Boolean Polynomial Systems https://link.springer.com/chapter/10.1007/978-3-319-76620-1_1 |
| [KPG99] | Aviad Kipnis, Jacques Patarin, and Louis Goubin. Unbalanced Oil and Vinegar Signature Schemes https://link.springer.com/chapter/10.1007/3-540-48910-X_15 |
| [BBPS20] | Alessandro Barenghi, Jean-Francois Biasse, Edoardo Persichetti and Paolo Santini. {LESS-FM:} Fine-Tuning Signatures from the Code Equivalence Problem https://doi.org/10.1007/978-3-030-81293-5_2 |
| [EZ23] | Andre Esser and Floyd Zweydinger. New Time-Memory Trade-Offs for Subset Sum -- Improving ISD in Theory and Practice https://eprint.iacr.org/2022/1329.pdf |
| [EB22] | Andre Esser and Emanuele Bellini. Syndrome Decoding Estimator https://eprint.iacr.org/2021/1243.pdf |
| [MO15] | Alexander May and Ilya Ozerov. On computing nearest neighbors with applications to decoding of binary linear codes https://link.springer.com/chapter/10.1007/978-3-662-46800-5_9 |
| [MMT11] | Alexander May, Alexander Meurer and Enrico Thomae. Decoding random linear codes in 2^(0.054n) https://link.springer.com/chapter/10.1007/978-3-642-25385-0_6 |
| [BJMM12] | Anja Becker, Antoine Joux, Alexander May and Alexander Meurer. Decoding random binary linear codes in 2^(n/20): How 1+ 1= 0 improves information set decoding https://eprint.iacr.org/2012/026.pdf |
B
C
| [Pet11] | Christiane Peters: Information-set decoding for linear codes over Fq. https://link.springer.com/chapter/10.1007/978-3-642-12929-2_7 |
| [BCCCNSY10] | Charles Bouillaguet, Hsieh-Chung Chen, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Adi Shamir, and Bo-Yin Yang. Fast Exhaustive Search for Polynomial Systems in F_2 https://www.iacr.org/archive/ches2010/62250195/62250195.pdf |
D
| [BLP08] | Daniel J. Bernstein and Tanja Lange and Christiane Peters Attacking and Defending the McEliece Cryptosystem https://link.springer.com/chapter/10.1007/978-3-540-88403-3_3 |
| [BLP11] | Daniel J. Bernstein and Tanja Lange and Christiane Peters Smaller decoding exponents: ball-collision decoding https://link.springer.com/chapter/10.1007/978-3-642-22792-9_42 |
| [LPTWY17] | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, Ryan Williams, and Huacheng Yu. Beating Brute Force for Systems of Polynomial Equation over Finite Fields https://people.csail.mit.edu/rrw/polyEqSoda2017Submit.pdf |
E
| [KMP19] | Eliane Koussa, Gilles Macario{-}Rat and Jacques Patarin. On the complexity of the Permuted Kernel Problem https://eprint.iacr.org/2019/412.pdf |
| [Pra62] | Eugene Prange. The use of information sets in decoding cyclic codes https://doi.org/10.1109/TIT.1962.1057777 |
F
G
H
| [MHT13] | Hiroyuki Miura, Yasufumi Hashimoto, and Tsuyoshi Takagi. Extended Algorithm for Solving Underdefined Multivariate Quadratic Equations https://link.springer.com/chapter/10.1007/978-3-642-38616-9_8 |
I
| [Dum91] | Ilya Dumer. On minimum distance decoding of linear codes |
| [Din21a] | Itai Dinur. Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting https://arxiv.org/pdf/2005.04800.pdf |
| [Din21b] | Itai Dinur. Cryptanalytic Applications of the Polynomial Method for Solving Multivariate Equation Systems over GF(2) https://eprint.iacr.org/2021/578.pdf |
J
| [Ste88] | Jacques Stern. A method for finding codewords of small weight https://doi.org/10.1007/BFb0019850 |
| [Dua20] | João Diogo Duarte. On the Complexity of the Crossbred Algorithm |
| [Leo82] | JJeffrey S. Leon. Computing automorphism groups of error-correcting codes https://doi.org/10.1109/TIT.1982.1056498 |
K
L
| [BFP09] | Luk Bettale, Jean-Charles Faugère and Ludovic Perret. Hybrid Approach for Solving Multivariate Systems over Finite Fields https://doi.org/10.1515/JMC.2009.009 |
| [BFP12] | Luk Bettale, Jean-Charles Faugère and Ludovic Perret. Solving Polynomial Systems over Finite Fields: Improved Analysis of the Hybrid Approach https://doi.org/10.1145/2442829.2442843 |
| [BM18] | Leif Both and Alexander May. Decoding Linear Codes with High Error Rate and its Impact for LPN Security https://eprint.iacr.org/2017/1139.pdf |
M
| [BFSS11] | Magali Bardet, Jean-Charles Faugère, Bruno Salvy, and Pierre-Jean Spaenlehauer. On the Complexity of Solving Quadratic Boolean Systems https://www.sciencedirect.com/science/article/pii/S0885064X12000611 |
N
| [CKPS] | Nicolas Courtois, Alexander Klimov, Jacques Patarin, and Adi Shamir. Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations https://www.iacr.org/archive/eurocrypt2000/1807/18070398-new.pdf |
| [CGMT02] | Nicolas Courtois, Louis Goubin, Willi Meier, and Jean-Daniel Tacier. Solving Underdefined Systems of Multivariate Quadratic Equations https://link.springer.com/chapter/10.1007/3-540-45664-3_15 |
| [Sen06] | Nicolas Sendrier The Support Splitting Algorithm https://hal.inria.fr/inria-00073037/document |
O
P
| [LB88] | Pil Joong Lee and Ernest Brickell. An observation on the security of McEliece’s public-key cryptosystem https://doi.org/10.1007/3-540-45961-8_25 |
| [SBC22] | Paolo Santini, Marco Baldi, and Franco Chiaraluce Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems https://eprint.iacr.org/2022/1749.pdf |
Q
R
S
T
U
V
W
| [Beu20] | Ward Beullens. Not enough LESS: An improved algorithm for solving Code Equivalence Problems over Fq https://doi.org/10.1007/978-3-030-81652-0_15 |
X
Y
Z