On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer

DOI10.1007/978-3-030-88238-9_3zbMath1497.81037OpenAlexW3203730177MaRDI QIDQ2146073

Robin M. Berger, Marcel Tiepelt

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88238-9_3

zbMATH Keywords

cryptanalysispost-quantum cryptographyresource estimationquantum implementation

Mathematics Subject Classification ID

Searching and sorting (68P10) Cryptography (94A60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)

Uses Software

• GitHub
• SPHINCS
• KeccakTools

Cites Work

• Unnamed Item
• Grafting trees: a fault attack against the SPHINCS framework
• Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Implementing Grover oracles for quantum key search on AES and LowMC
• Quantum Computation and Quantum Information
• Biclique Cryptanalysis of the Full AES
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Sponge-Based Pseudo-Random Number Generators
• Quantum cryptanalysis of hash and claw-free functions

This page was built for publication: On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer