Depth-optimized quantum implementation of ARIA
From MaRDI portal
Cites work
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases
- Implementing Grover oracles for quantum key search on AES and LowMC
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Quantum resource estimates of Grover's key search on ARIA
This page was built for publication: Depth-optimized quantum implementation of ARIA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547850)