Implementing Grover oracle for lightweight block ciphers under depth constraints
From MaRDI portal
Publication:6108773
DOI10.1007/978-3-031-22301-3_5zbMath1529.81055OpenAlexW4313044380MaRDI QIDQ6108773
Amit Kumar Chauhan, Subodh Bijwe, Somitra Kumar Sanadhya
Publication date: 26 July 2023
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22301-3_5
Searching and sorting (68P10) Quantum computation (81P68) Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum reversible circuit of AES-128
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Grover on \(SIMON\)
- Quantum circuit implementations of AES with fewer qubits
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
- Quantum Computation and Quantum Information
- GIFT: A Small Present
- Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks
This page was built for publication: Implementing Grover oracle for lightweight block ciphers under depth constraints