Pages that link to "Item:Q5199223"
From MaRDI portal
The following pages link to Smaller Decoding Exponents: Ball-Collision Decoding (Q5199223):
Displaying 41 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)
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Information set decoding in the Lee metric with applications to cryptography (Q825935) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- On the design and security of Lee metric McEliece cryptosystems (Q2115742) (← links)
- Cryptanalysis of the binary permuted kernel problem (Q2117060) (← links)
- Construction of binary Hadamard codes and their \(s\)-PD sets (Q2119850) (← 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)
- Information-set decoding with hints (Q2163764) (← 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)
- Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN (Q2835589) (← links)
- Decoding One Out of Many (Q3102783) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- Monoidic Codes in Cryptography (Q3102791) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- (Q4638056) (← 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)
- Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems (Q6112240) (← links)
- Breaking Goppa-based McEliece with hints (Q6116182) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- High weight code-based signature scheme from QC-LDPC codes (Q6547874) (← links)
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM} (Q6550587) (← links)
- Rigorous foundations for dual attacks in coding theory (Q6587944) (← links)
- Revisiting nearest-neighbor-based information set decoding (Q6595933) (← links)
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm (Q6623311) (← links)
- Integer syndrome decoding in the presence of noise (Q6643248) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)
