Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication (Q2684220): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114223673, #quickstatements; #temporary_batch_1711234560214
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reducing the Depth of Quantum Circuits Using Additional Circuit Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum reversible circuit of AES-128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Grover’s Algorithm to AES: Quantum Resource Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166025 / 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: Improved reversible and quantum circuits for Karatsuba-based integer multiplication. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel multipliers based on special irreducible pentanomials / rank
 
Normal rank

Latest revision as of 13:04, 31 July 2024

scientific article
Language Label Description Also known as
English
Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication
scientific article

    Statements

    Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication (English)
    0 references
    0 references
    16 February 2023
    0 references
    quantum computing
    0 references
    reversible circuit
    0 references
    optimization
    0 references
    finite field arithmetic
    0 references
    multiplier
    0 references
    cryptography
    0 references

    Identifiers

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