Recursion enabled: improved cryptanalysis of the permuted kernel problem

DOI10.1007/978-3-032-22698-3_7MaRDI QIDQ7319505zbMATH OpenFDO

Authors Alessandro Budroni, Marco Defranceschi, Federico Pintore

Publication date 25 August 2026

Full work available at URL https://doi.org/10.1007/978-3-032-22698-3_7

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A NP-complete problem in coding theory with application to code based cryptography
• Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems
• Computational hardness of the permuted kernel and subcode equivalence problems
• scientific article; zbMATH DE number 1618047 (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?)
• On the number of solutions to a random instance of the permuted kernel problem
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
• Some remarks on the security of the identification scheme based on permuted kernels

This page was built for publication: Recursion enabled: improved cryptanalysis of the permuted kernel problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319505)