Security Bounds for the Design of Code-Based Cryptosystems
From MaRDI portal
Publication:3650687
DOI10.1007/978-3-642-10366-7_6zbMath1267.94058OpenAlexW1897146492MaRDI QIDQ3650687
Matthieu Finiasz, Nicolas Sendrier
Publication date: 15 December 2009
Published in: Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10366-7_6
Related Items (47)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Information set decoding in the Lee metric with applications to cryptography ⋮ Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes ⋮ Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Generalization of the Ball-Collision Algorithm ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ A rank metric code-based group signature scheme ⋮ Syndrome Decoding Estimator ⋮ Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications] ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ The return of the SDitH ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ An algorithm for generalized syndrome decoding problem ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Public key compression for constrained linear signature schemes ⋮ Quantum-assisted QD-CFS signatures ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ Quantum Resistant Public Key Encryption Scheme polarRLCE ⋮ Faster 2-Regular Information-Set Decoding ⋮ A code-based group signature scheme ⋮ An algorithmic framework for the generalized birthday problem ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ Interpreting Hash Function Security Proofs ⋮ A Secure and Efficient Code-Based Signature Scheme ⋮ Zero-Sum Distinguishers for Iterated Permutations and Application to Keccak-f and Hamsi-256 ⋮ Wild McEliece ⋮ Parallel-CFS ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ Full Cryptanalysis of the Chen Identification Protocol ⋮ Decoding One Out of Many ⋮ An Efficient Attack on All Concrete KKS Proposals ⋮ Monoidic Codes in Cryptography ⋮ Unnamed Item ⋮ Cryptanalysis of the binary permuted kernel problem
This page was built for publication: Security Bounds for the Design of Code-Based Cryptosystems
