Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (Q3511179): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4387319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast fault-tolerant digital convolution using a polynomial residue number system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the importance of eliminating errors in cryptographic computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic curve cryptosystems in the presence of permanent and transient faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastrovito multiplier for general irreducible polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant computations over replicated finite rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elliptic Curve Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Montgomery multiplication in \(\text{GF}(2^ k)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3718617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Multiplication Without Trial Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Codes Over Certain Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4343015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding of redundant residue polynomial codes using Euclid's algorithm / rank
 
Normal rank

Latest revision as of 12:11, 28 June 2024

scientific article
Language Label Description Also known as
English
Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
scientific article

    Statements

    Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (English)
    0 references
    0 references
    0 references
    8 July 2008
    0 references
    finite field
    0 references
    fault tolerant computation
    0 references
    fault attacks
    0 references

    Identifiers