Quantum attacks on beyond-birthday-bound MACs
From MaRDI portal
Publication:6167739
DOI10.1016/J.PHYSA.2023.129047WikidataQ123347542 ScholiaQ123347542MaRDI QIDQ6167739FDOQ6167739
Authors:
Publication date: 7 August 2023
Published in: Physica A (Search for Journal in Brave)
Recommendations
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- scientific article
- Generic attacks against beyond-birthday-bound MACs
- Attacks on fixed apparatus quantum key distribution schemes
- Quantum attacks on public-key cryptosystems
- Attacking quantum hashing. Protocols and their cryptanalysis
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
Cites Work
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure signatures and chosen ciphertext security in a quantum computing world
- On the Power of Quantum Computation
- Quantum Complexity Theory
- PRESENT: An Ultra-Lightweight Block Cipher
- Progress in Cryptology - INDOCRYPT 2004
- The security of the cipher block chaining message authentication code
- Probability distributions of correlation and differentials in block ciphers
- Title not available (Why is that?)
- OMAC: one-key CBC MAC.
- The LED block cipher
- The sum of CBC MACs is a secure PRF
- Quantum-secure message authentication codes
- Grover meets Simon -- quantumly attacking the FX-construction
- Breaking symmetric cryptosystems using quantum period finding
- Improved BV-based quantum attack on block ciphers
- Quantum attacks on some Feistel block ciphers
- Generic attacks against beyond-birthday-bound MACs
- Tight bounds for Simon's algorithm
- Blockcipher-based MACs: beyond the birthday bound without message length
- Quantum discriminant analysis for dimensionality reduction and classification
- Beyond quadratic speedups in quantum attacks on symmetric schemes
- Tight security bounds for double-block hash-then-sum MACs
- Parallelizable MACs based on the sum of PRPs with security beyond the birthday bound
- Quantum data compression by principal component analysis
- Quantum algorithms for anomaly detection using amplitude estimation
- Using Bernstein-Vazirani algorithm to attack block ciphers
- Attacks on beyond-birthday-bound MACs in the quantum setting
- How to build optimally secure PRFs using block ciphers
- Full PRF-secure message authentication code based on tweakable block cipher
- Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication
- PMAC with parity: minimizing the query-length influence
- Quantum linearization attacks
Cited In (1)
This page was built for publication: Quantum attacks on beyond-birthday-bound MACs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167739)
