Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (Q2516141): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial factorization over ${\mathbb F}_2$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum algorithms for algebraic problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4346406 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3181587 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4718481 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank | |||
Normal rank |
Latest revision as of 16:01, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count |
scientific article |
Statements
Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count (English)
0 references
11 August 2015
0 references
quantum circuits
0 references
finite field arithmetic
0 references
cryptography
0 references
circuit synthesis
0 references
0 references
0 references