Cryptanalysis of the binary permuted kernel problem
DOI10.1007/978-3-030-78375-4_16zbMATH Open1497.94110OpenAlexW3157255480MaRDI QIDQ2117060FDOQ2117060
Thales Bandiera Paiva, Routo Terada
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78375-4_16
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- Security bounds for the design of code-based cryptosystems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Smaller Decoding Exponents: Ball-Collision Decoding
- PKP-based signature scheme
- Some remarks on the security of the identification scheme based on permuted kernels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
Cited In (7)
- Cryptanalysis of the permutation based algorithm SpoC
- Title not available (Why is that?)
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- Title not available (Why is that?)
- On the number of solutions to a random instance of the permuted kernel problem
- A code-based hybrid signcryption scheme
- Some remarks on the security of the identification scheme based on permuted kernels
Uses Software
This page was built for publication: Cryptanalysis of the binary permuted kernel problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117060)
