Quantum linearization attacks
From MaRDI portal
Publication:6157500
DOI10.1007/978-3-030-92062-3_15zbMath1522.81069MaRDI QIDQ6157500
Gaëtan Leurent, André Schrottenloher, Xavier Bonnetain, María Naya-Plasencia
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92062-3_15
Bernstein-Vazirani algorithm; quantum cryptanalysis; Simon's algorithm; Shor's algorithm; Deutsch's algorithm; MACs; superposition query model
94A60: Cryptography
81R30: Coherent states
94A62: Authentication, digital signatures and secret sharing
68Q12: Quantum algorithms and complexity in the theory of computing
81P94: Quantum cryptography (quantum-theoretic aspects)
Related Items
New results on quantum boomerang attacks, QCB is blindly unforgeable, Quantum circuit implementation and resource analysis of LBlock and LiCi, Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks, Optimizing the depth of quantum implementations of linear layers, Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits, Simon's algorithm and symmetric crypto: generalizations and automatized applications, Quantum attacks on beyond-birthday-bound MACs, On the post-quantum security of classical authenticated encryption schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lightweight alternative to PMAC
- On quantum slide attacks
- How to stretch random functions: The security of protected counter sums
- Hidden shift quantum cryptanalysis and implications
- ZMAC: a fast tweakable block cipher mode for highly secure message authentication
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- Blockcipher-based MACs: beyond the birthday bound without message length
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum key-recovery on full AEZ
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Tight security bounds for double-block hash-then-sum MACs
- Quantum-access-secure message authentication via blind-unforgeability
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Tight bounds for Simon's algorithm
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum attacks on some Feistel block ciphers
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- The Software Performance of Authenticated-Encryption Modes
- Quantum Computation and Quantum Information
- MAC Reforgeability
- Full PRF-Secure Message Authentication Code Based on Tweakable Block Cipher
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- MMH: Software message authentication in the Gbit/second rates
- A MAC Mode for Lightweight Block Ciphers
- 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
- Quantum-Secure Message Authentication Codes
- The Sum of CBC MACs Is a Secure PRF
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Fast Software Encryption
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- QCB: efficient quantum-secure authenticated encryption
