Hybrid decoding -- classical-quantum trade-offs for information set decoding

DOI10.1007/978-3-031-17234-2_1zbMath1521.94125OpenAlexW4297042463MaRDI QIDQ6111571

José I. Latorre, Marc Manzano, Andre Esser, Emanuele Bellini, Sergi Ramos-Calderer

Publication date: 7 July 2023

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17234-2_1

zbMATH Keywords

decodinghybrid algorithmscode-based cryptographywidth reduction

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decoding linear codes with high error rate and its impact for LPN security
• Improved quantum information set decoding
• Quantum information set decoding algorithms
• A trade-off between classical and quantum circuit size for an attack against CSIDH
• A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
• Implementing Grover oracles for quantum key search on AES and LowMC
• Deterministic preparation of Dicke states
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
• Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
• Grover vs. McEliece
• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• Syndrome Decoding Estimator

This page was built for publication: Hybrid decoding -- classical-quantum trade-offs for information set decoding