On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography (Q5503300): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2706552 / 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: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast quantum modular exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms and the Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Galois Switching Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing elliptic curve logarithms to logarithms in a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536202 / rank
 
Normal rank

Latest revision as of 22:46, 28 June 2024

scientific article; zbMATH DE number 5490409
Language Label Description Also known as
English
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
scientific article; zbMATH DE number 5490409

    Statements

    On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2009
    0 references

    Identifiers