Breaking tweakable enciphering schemes using Simon's algorithm
From MaRDI portal
Publication:2043415
DOI10.1007/S10623-021-00893-5zbMath1469.94097OpenAlexW3172679212MaRDI QIDQ2043415
Publication date: 2 August 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00893-5
Cryptography (94A60) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (1)
Cites Work
- Unnamed Item
- Quantum key-recovery on full AEZ
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum attacks on some Feistel block ciphers
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Invertible Universal Hashing and the TET Encryption Mode
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Advances in Cryptology - CRYPTO 2003
- The Security of the Extended Codebook (XCB) Mode of Operation
- Progress in Cryptology - INDOCRYPT 2004
- Topics in Cryptology – CT-RSA 2004
This page was built for publication: Breaking tweakable enciphering schemes using Simon's algorithm