The following pages link to Decoding One Out of Many (Q3102783):
Displaying 27 items.
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension (Q310244) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- Cryptanalysis of LEDAcrypt (Q2102071) (← links)
- Performance bounds for QC-MDPC codes decoders (Q2163766) (← links)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD (Q2170098) (← links)
- Reproducible families of codes and cryptographic applications (Q2239799) (← links)
- Secure Message Authentication Against Related-Key Attack (Q2946884) (← links)
- A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors (Q2958147) (← links)
- An Efficient Attack on All Concrete KKS Proposals (Q3102786) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- About Low DFR for QC-MDPC Decoding (Q5041211) (← links)
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes (Q5071487) (← links)
- Syndrome Decoding Estimator (Q5087253) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems (Q6057202) (← links)
- Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes (Q6057208) (← links)
- On codes and learning with errors over function fields (Q6104346) (← links)
- Interleaved Prange: a new generic decoder for interleaved codes (Q6111577) (← links)
- Improved information set decoding algorithms over Galois ring in the Lee metric (Q6131036) (← links)
- Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields (Q6134232) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)
- Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks (Q6145941) (← links)
- A new key recovery side-channel attack on HQC with chosen ciphertext (Q6166993) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- A code-based hybrid signcryption scheme (Q6175435) (← links)