Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new addition formula for elliptic curves over GF(2/sup n/) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Elliptic and Hyperelliptic Curve Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-coloring bipartite multigraphs in \(O(E \log D)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250817 / 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: Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials / 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
Property / cites work
 
Property / cites work: Q4364563 / rank
 
Normal rank

Latest revision as of 22:19, 9 July 2024

scientific article
Language Label Description Also known as
English
Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references