Montgomery exponent architecture based on programmable cellular automata (Q1010043): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Structure of parallel multipliers for a class of fields \(GF(2^ m)\) / 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: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4718481 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modular Multiplication Without Trial Division / rank | |||
Normal rank |
Revision as of 10:26, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Montgomery exponent architecture based on programmable cellular automata |
scientific article |
Statements
Montgomery exponent architecture based on programmable cellular automata (English)
0 references
3 April 2009
0 references
public-key cryptosystem
0 references
Montgomery multiplication
0 references
programmable cellular automata
0 references
modular exponentiation
0 references
irreducible polynomial
0 references
0 references