The following pages link to (Q3522477):
Displayed 9 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Low-communication parallel quantum multi-target preimage search (Q1746977) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound (Q2119014) (← links)
- Implementing Grover oracles for quantum key search on AES and LowMC (Q2119015) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound (Q5041235) (← links)
- Implementing Grover oracle for lightweight block ciphers under depth constraints (Q6108773) (← links)