Quantum linearization attacks
From MaRDI portal
Publication:6157500
DOI10.1007/978-3-030-92062-3_15zbMATH Open1522.81069OpenAlexW3203547317MaRDI QIDQ6157500FDOQ6157500
Authors: Xavier Bonnetain, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher 
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
Recommendations
- Breaking symmetric cryptosystems using quantum period finding
- QCB: efficient quantum-secure authenticated encryption
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Simon's algorithm and symmetric crypto: generalizations and automatized applications
Bernstein-Vazirani algorithmquantum cryptanalysisSimon's algorithmShor's algorithmDeutsch's algorithmMACssuperposition query model
Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Coherent states (81R30) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- MMH: Software message authentication in the Gbit/second rates
- Fast Software Encryption
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Secure signatures and chosen ciphertext security in a quantum computing world
- Quantum computation and quantum information. 10th anniversary edition
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Rapid solution of problems by quantum computation
- Title not available (Why is that?)
- Progress in Cryptology - INDOCRYPT 2004
- Title not available (Why is that?)
- The software performance of authenticated-encryption modes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- OMAC: one-key CBC MAC.
- 3kf9: enhancing 3GPP-MAC beyond the birthday bound
- The sum of CBC MACs is a secure PRF
- Title not available (Why is that?)
- Quantum-access-secure message authentication via blind-unforgeability
- Quantum-secure message authentication codes
- A lightweight alternative to PMAC
- On quantum slide attacks
- Hidden shift quantum cryptanalysis and implications
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum key-recovery on full AEZ
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Breaking symmetric cryptosystems using quantum period finding
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Quantum attacks on some Feistel block ciphers
- Quantum chosen-ciphertext attacks against Feistel ciphers
- MAC Reforgeability
- How to stretch random functions: The security of protected counter sums
- ZMAC: a fast tweakable block cipher mode for highly secure message authentication
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- Tight bounds for Simon's algorithm
- Blockcipher-based MACs: beyond the birthday bound without message length
- Post-quantum security of the CBC, CFB, OFB, CTR, and XTS modes of operation
- Tight security bounds for double-block hash-then-sum MACs
- A MAC mode for lightweight block ciphers
- QCB: efficient quantum-secure authenticated encryption
- Attacks on beyond-birthday-bound MACs in the quantum setting
- Full PRF-secure message authentication code based on tweakable block cipher
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
Cited In (20)
- Quantum attacks against BBB secure PRFs or MACs built from public random permutations
- Quantum attacks on Lai-Massey structure
- Breaking symmetric cryptosystems using quantum period finding
- Simon's algorithm and symmetric crypto: generalizations and automatized applications
- Quantum attacks on hash constructions with low quantum random access memory
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- Revisiting higher-order differential-linear attacks from an algebraic perspective
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
- QCB is blindly unforgeable
- On the post-quantum security of classical authenticated encryption schemes
- Optimizing the depth of quantum implementations of linear layers
- New results on quantum boomerang attacks
- Quantum circuit implementation and resource analysis of LBlock and LiCi
- Quantum cryptanalysis of OTR and OPP: attacks on confidentiality, and key-recovery
- A quantum-secure partial parallel MAC QPCBC
- QCB: efficient quantum-secure authenticated encryption
- Quantum algorithm for finding impossible differentials and zero-correlation linear hulls of symmetric ciphers
- Quantum attacks on beyond-birthday-bound MACs
- Quantum cryptanalysis of Farfalle and (generalised) key-alternating Feistel networks
This page was built for publication: Quantum linearization attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157500)
