Quantum circuit implementation for F₂^8 multiplication based on algebraic curve method
From MaRDI portal
Publication:6947413
Cites work
- Algebraic complexities and algebraic curves over finite fields
- Algebraic Function Fields and Codes
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\)
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Five, six, and seven-term Karatsuba-like formulae
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Improved quantum circuits for AES: reducing the depth and the number of qubits
- New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
- On multiplication in finite fields
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
- Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves
- Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
- Quasi-optimal algorithms for multiplication in the extensions of \(\mathbb F_{16}\) of degree 13, 14 and 15
- Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
This page was built for publication: Quantum circuit implementation for \(\mathbb{F}_{2^8}\) multiplication based on algebraic curve method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947413)
