Programmable cellular automata based Montgomery hardware architecture (Q876683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5598073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Multiplication Without Trial Division / 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: Q4536232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Montgomery multiplier and squarer for a class of finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields / rank
 
Normal rank

Revision as of 17:17, 25 June 2024

scientific article
Language Label Description Also known as
English
Programmable cellular automata based Montgomery hardware architecture
scientific article

    Statements

    Programmable cellular automata based Montgomery hardware architecture (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    Montgomery algorithm
    0 references
    programmable cellular automata
    0 references
    Reed-Solomon code
    0 references
    multiplication and squaring
    0 references
    irreducible all one polynomial
    0 references

    Identifiers