Quantum circuits for $\mathbb F_{2^n}$-multiplication with subquadratic gate count (Q2516141): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11128-015-0993-1
+Normal rank
@@ Property / OpenAlex ID @@
+W853818564
@@ Property / OpenAlex ID: W853818564 / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
+Normal rank
@@ Property / cites work @@
+Polynomial factorization over ${\mathbb F}_2$
@@ Property / cites work: Polynomial factorization over ${\mathbb F}_2$ / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum algorithms for algebraic problems
@@ Property / cites work: Quantum algorithms for algebraic problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4346406
@@ Property / cites work: Q4346406 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3181587
@@ Property / cites work: Q3181587 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
+Normal rank
@@ Property / cites work @@
+Q4718481
@@ Property / cites work: Q4718481 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank

Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141): Difference between revisions