Reducing the number of qubits in quantum information set decoding

DOI10.1007/978-981-96-0944-4_10MaRDI QIDQ6965153zbMATH OpenFDO

Authors Clémence Chevignard, Pierre-Alain Fouque, André Schrottenloher

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0944-4_10

zbMATH Keywords

information set decodingPrange's algorithmquantum cryptanalysisquantum search

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Algebraic coding theory
• Asymptotically faster quantum algorithms to solve multivariate quadratic equations
• Asymptotics and improvements of sieving for codes
• Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
• Decoding linear codes with high error rate and its impact for LPN security
• Decoding one out of many
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Faster Multiplication in GF(2)[x]
• Grover vs. McEliece
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1545673 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Hybrid decoding -- classical-quantum trade-offs for information set decoding
• Implementing Grover oracles for quantum key search on AES and LowMC
• Improved quantum information set decoding
• Memory-efficient quantum information set decoding algorithm
• On arithmetical algorithms over finite fields
• On computing nearest neighbors with applications to decoding of binary linear codes
• On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
• On the inherent intractability of certain coding problems (Corresp.)
• Quantum information set decoding algorithms
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Random permutations using switching networks
• Shift-register synthesis and BCH decoding
• Solving sparse linear equations over finite fields
• Time/Space Trade-Offs for Reversible Computation

This page was built for publication: Reducing the number of qubits in quantum information set decoding

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