Quantum key-recovery on full AEZ
From MaRDI portal
Publication:1746983
DOI10.1007/978-3-319-72565-9_20zbMath1384.94037OpenAlexW2620891730MaRDI QIDQ1746983
Publication date: 26 April 2018
Full work available at URL: https://hal.inria.fr/hal-01650026/file/qAEZ.pdf
authenticated encryptionquantum cryptanalysisCAESAR competitionSimon's algorithmAEZsymmetric cryptanalysis
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (14)
Noisy Simon period finding ⋮ On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ Tight bounds for Simon's algorithm ⋮ Beyond quadratic speedups in quantum attacks on symmetric schemes ⋮ Quantum attacks against type-1 generalized Feistel ciphers and applications to CAST-256 ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ A quantum distinguisher for 7/8-round SMS4 block cipher ⋮ Quantum linearization attacks ⋮ QCB: efficient quantum-secure authenticated encryption ⋮ Applications of Simon's algorithm in quantum attacks on Feistel variants ⋮ Quantum search for scaled hash function preimages ⋮ Quantum attacks on sum of Even-Mansour pseudorandom functions ⋮ Breaking LWC candidates: sESTATE and Elephant in quantum setting ⋮ Breaking tweakable enciphering schemes using Simon's algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- EUROCRYPT 2015. 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26--30, 2015. Proceedings. Part I
- Post-quantum cryptography. 7th international workshop, PQCrypto 2016, Fukuoka, Japan, February 24--26, 2016. Proceedings
- Collision Attacks Against CAESAR Candidates
- Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation
- Post-Quantum Security Models for Authenticated Encryption
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Robust Authenticated-Encryption AEZ and the Problem That It Solves
- SPHINCS: Practical Stateless Hash-Based Signatures
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
This page was built for publication: Quantum key-recovery on full AEZ
