Pages that link to "Item:Q3102180"

The following pages link to Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ (Q3102180):

Displaying 39 items.

• Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
• Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
• On solving LPN using BKW and variants, Implementation and analysis (Q276557) (← links)
• Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
• Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
• Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
• Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
• Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
• Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem (Q2056746) (← links)
• Cryptanalysis of LEDAcrypt (Q2102071) (← links)
• Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric (Q2118524) (← links)
• Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN (Q2129007) (← links)
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
• Structural properties of self-dual monomial codes with application to code-based cryptography (Q2149783) (← links)
• Information-set decoding with hints (Q2163764) (← links)
• McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
• A code-based signature scheme from the Lyubashevsky framework (Q2192378) (← links)
• Reproducible families of codes and cryptographic applications (Q2239799) (← links)
• Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
• Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece'' hardware reference implementation (Q2692373) (← links)
• Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
• On the dimension and structure of the square of the dual of a Goppa code (Q2697482) (← links)
• Inner-product functional encryption from random linear codes: trial and challenges (Q2697925) (← links)
• Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
• A sieve algorithm based on overlattices (Q2878827) (← links)
• Cryptography from Learning Parity with Noise (Q2891361) (← links)
• Optimization of $$\mathsf {LPN}$$ Solving Algorithms (Q2958144) (← links)
• Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
• Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
• Syndrome Decoding Estimator (Q5087253) (← links)
• Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026) (← links)
• Generalization of the Ball-Collision Algorithm (Q5855596) (← links)
• TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
• On the hardness of the Lee syndrome decoding problem (Q6089464) (← links)
• An algorithm for generalized syndrome decoding problem (Q6112190) (← links)
• Breaking Goppa-based McEliece with hints (Q6116182) (← links)
• Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)