Cryptanalysis of the binary permuted kernel problem
From MaRDI portal
Publication:2117060
Recommendations
Cites work
- scientific article; zbMATH DE number 1618047 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 708813 (Why is no real title available?)
- scientific article; zbMATH DE number 1024072 (Why is no real title available?)
- scientific article; zbMATH DE number 6319745 (Why is no real title available?)
- An Algorithm for Subgraph Isomorphism
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- PKP-based signature scheme
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- Some remarks on the security of the identification scheme based on permuted kernels
- ``Chinese \& Match, an alternative to Atkin's ``Match and Sort method used in the SEA algorithm
Cited in
(8)- scientific article; zbMATH DE number 708813 (Why is no real title available?)
- Some remarks on the security of the identification scheme based on permuted kernels
- On the number of solutions to a random instance of the permuted kernel problem
- scientific article; zbMATH DE number 1618047 (Why is no real title available?)
- PKP-based signature scheme
- Cryptanalysis of the permutation based algorithm SpoC
- A code-based hybrid signcryption scheme
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
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)