Pages that link to "Item:Q1993901"
From MaRDI portal
The following pages link to Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 (Q1993901):
Displayed 18 items.
- Improvements to quantum search techniques for block-ciphers, with applications to AES (Q832355) (← links)
- Evaluation of Grover's algorithm toward quantum cryptanalysis on ChaCha (Q2099636) (← links)
- \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction (Q2104462) (← links)
- Some efficient quantum circuit implementations of Camellia (Q2107075) (← links)
- Quantum partial search algorithm with smaller oracles for multiple target items (Q2107919) (← links)
- New quantum circuit implementations of SM4 and SM3 (Q2107956) (← links)
- Implementing Grover oracles for quantum key search on AES and LowMC (Q2119015) (← links)
- Quantum search for scaled hash function preimages (Q2690252) (← links)
- Implementation of efficient quantum search algorithms on NISQ computers (Q2690526) (← links)
- Quantum circuit implementations of AES with fewer qubits (Q2692402) (← links)
- Optimization of $S$-boxes GOST R 34.12-2015 «Magma» quantum circuits without ancilla qubits (Q3383107) (← links)
- Quantum circuit implementation and resource analysis of LBlock and LiCi (Q6072528) (← links)
- Optimized quantum implementation of AES (Q6072537) (← links)
- MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits (Q6089492) (← links)
- Implementing Grover oracle for lightweight block ciphers under depth constraints (Q6108773) (← links)
- Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks (Q6157582) (← links)
- Quantum circuit implementations of SM4 block cipher based on different gate sets (Q6171443) (← links)
- Further insights on constructing quantum circuits for Camellia block cipher (Q6182436) (← links)