Block cipher doubling for a post-quantum world
From MaRDI portal
Cites work
- 4-round Luby-Rackoff construction is a qPRP
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- A simplified representation of AES
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- All the AES you need on Cortex-M3 and M4
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Automatic search for related-key differential characteristics in byte-oriented block ciphers: application to AES, Camellia, Khazad and others
- Breaking symmetric cryptosystems using quantum period finding
- Cryptanalytic time-memory-data tradeoffs for FX-constructions with applications to PRINCE and PRIDE
- Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
- Grover meets Simon -- quantumly attacking the FX-construction
- How to protect DES against exhaustive key search (an analysis of DESX).
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1759272 (Why is no real title available?)
- Improved key recovery attacks on reduced-round AES in the single-key setting
- Improved key recovery attacks on reduced-round AES with practical data and memory complexities
- Improved single-key attacks on 8-round AES-192 and AES-256
- Information Security and Cryptology - ICISC 2005
- Information-theoretic indistinguishability via the chi-squared method
- Making the impossible possible
- Minimizing the two-round Even-Mansour cipher
- New Impossible Differential Attacks on AES
- New representations of the AES key schedule
- Offset-based BBB-secure tweakable block-ciphers with updatable caches
- On the Power of Quantum Computation
- Post-quantum security of the Even-Mansour cipher
- Proof of Mirror Theory for ξ max = 2
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Quantum cryptanalysis of hash and claw-free functions
- Quantum key-length extension
- Quantum Walk Algorithm for Element Distinctness
- Revisiting Gilbert's known-key distinguisher
- Structural evaluation of AES and chosen-key distinguisher of 9-round AES-128
- The indistinguishability of the XOR of k permutations
- The retracing boomerang attack
- The sum of PRPs is a secure PRF
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
- Topics in Cryptology – CT-RSA 2004
- Weak-key distinguishers for AES
- Yoyo tricks with AES
This page was built for publication: Block cipher doubling for a post-quantum world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326368)
