An Efficient Attack on All Concrete KKS Proposals

DOI10.1007/978-3-642-25405-5_7zbMath1298.94100OpenAlexW1674075102WikidataQ62039173 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

zbMATH Keywords

cryptanalysisdigital signaturerandom error-correcting codesCode-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (5)

A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ 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

Uses Software

• Magma
• McEliece

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

This page was built for publication: An Efficient Attack on All Concrete KKS Proposals