Attacks on beyond-birthday-bound MACs in the quantum setting
From MaRDI portal
Publication:2118560
DOI10.1007/978-3-030-81293-5_22zbMATH Open1485.94090OpenAlexW3181006038MaRDI QIDQ2118560FDOQ2118560
Authors: Peng Wang, Lei Hu, Dingfeng Ye, Ting-Ting Guo 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_22
Recommendations
- Quantum attacks on beyond-birthday-bound MACs
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Generic attacks against beyond-birthday-bound MACs
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Attacks on fixed apparatus quantum key distribution schemes
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- scientific article
- Attacks and improvement on ``Quantum direct communication with mutual authentication
- Beyond quadratic speedups in quantum attacks on symmetric schemes
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- On the Power of Quantum Computation
- Title not available (Why is that?)
- How to protect DES against exhaustive key search (an analysis of DESX).
- Progress in Cryptology - INDOCRYPT 2004
- Information Security and Cryptology
- Title not available (Why is that?)
- 3kf9: enhancing 3GPP-MAC beyond the birthday bound
- The sum of CBC MACs is a secure PRF
- A new variant of PMAC: beyond the birthday bound
- Adversary lower bound for the \(k\)-sum problem
- Quantum-secure message authentication codes
- Grover meets Simon -- quantumly attacking the FX-construction
- Breaking symmetric cryptosystems using quantum period finding
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum algorithms for the \(k\)-XOR problem
- How to Protect DES Against Exhaustive Key Search
- Generic attacks against beyond-birthday-bound MACs
- Blockcipher-based MACs: beyond the birthday bound without message length
- Tight security bounds for double-block hash-then-sum MACs
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability
- How to build optimally secure PRFs using block ciphers
- Full PRF-secure message authentication code based on tweakable block cipher
Cited In (10)
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Breaking permutation-based pseudorandom cryptographic schemes using distributed exact quantum algorithms
- Quantum attacks on Lai-Massey structure
- Quantum-secure message authentication codes
- Simon's algorithm and symmetric crypto: generalizations and automatized applications
- Quantum linearization attacks
- Quantum attacks on PRFs based on public random permutations
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Quantum key recovery attacks on tweakable Even-Mansour ciphers
- Quantum attacks on beyond-birthday-bound MACs
This page was built for publication: Attacks on beyond-birthday-bound MACs in the quantum setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118560)
