An Efficient Attack on All Concrete KKS Proposals
From MaRDI portal
Publication:3102786
DOI10.1007/978-3-642-25405-5_7zbMath1298.94100WikidataQ62039173 ScholiaQ62039173MaRDI QIDQ3102786
Jean-Pierre Tillich, Ayoub Otmani
Publication date: 25 November 2011
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25405-5_7
94A60: Cryptography
94A62: Authentication, digital signatures and secret sharing
81P94: Quantum cryptography (quantum-theoretic aspects)
Related Items
Attack on a code-based signature scheme from QC-LDPC codes, Interleaved Prange: a new generic decoder for interleaved codes, Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields, An algebraic approach to the rank support learning problem, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound on the probability of a union
- Decoding One Out of Many
- Suboptimal decoding of linear codes: partition technique
- Security Bounds for the Design of Code-Based Cryptosystems
- A digital signature scheme based on random error-correcting codes
- Random codes: minimum distances and error exponents
- Smaller Decoding Exponents: Ball-Collision Decoding
- A Distinguisher for High-Rate McEliece Cryptosystems
- On Kabatianskii-Krouk-Smeets Signatures