Quantum attacks against BBB secure PRFs or MACs built from public random permutations

DOI10.1007/S11128-022-03774-5MaRDI QIDQ2686166zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 February 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-022-03774-5

zbMATH Keywords

pseudorandom functionsmessage authentication codesquantum attacksbeyond-birthday-bound

Mathematics Subject Classification ID

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

Recommendations

• Attacks on beyond-birthday-bound MACs in the quantum setting
• Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
• Quantum linearization attacks
• XOR of PRPs in a quantum world
• Quantum-secure message authentication codes

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 697813 (Why is no real title available?)
• scientific article; zbMATH DE number 1759779 (Why is no real title available?)
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• A new variant of PMAC: beyond the birthday bound
• Applications of Simon's algorithm in quantum attacks on Feistel variants
• Attacks on beyond-birthday-bound MACs in the quantum setting
• BBB secure nonce based MAC using public permutations
• Breaking symmetric cryptosystems using quantum period finding
• Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
• Grover meets Simon -- quantumly attacking the FX-construction
• How to build pseudorandom functions from public random permutations
• How to protect DES against exhaustive key search (an analysis of DESX).
• Information-theoretic indistinguishability via the chi-squared method
• Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
• OMAC: one-key CBC MAC.
• On the Power of Quantum Computation
• Quantum algorithms for the \(k\)-XOR problem
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• Quantum collision attacks on AES-like hashing with low quantum random access memories
• SPONGENT: The Design Space of Lightweight Cryptographic Hashing
• The sum of CBC MACs is a secure PRF
• Tight bounds for Simon's algorithm
• Tight security bounds for double-block hash-then-sum MACs

Cited in

(10)

• XOR of PRPs in a quantum world
• Attacks on beyond-birthday-bound MACs in the quantum setting
• Quantum linearization attacks
• Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
• Breaking symmetric cryptosystems using the offline distributed Grover-Meets-Simon algorithm
• Quantum attacks on PRFs based on public random permutations
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• Quantum key recovery attacks on tweakable Even-Mansour ciphers
• Multi-user BBB security of public permutations based MAC
• Quantum attacks on beyond-birthday-bound MACs

Describes a project that uses

Uses Software

• Keccak
• spongent

This page was built for publication: Quantum attacks against BBB secure PRFs or MACs built from public random permutations

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