A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3813755 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New directions in cryptography / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3141896 / 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: Bit-serial Reed - Solomon encoders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3765876 / rank | |||
Normal rank | |||
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: Q5585021 / rank | |||
Normal rank |
Latest revision as of 19:02, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) |
scientific article |
Statements
A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (English)
0 references
11 March 2008
0 references
public-key cryptosystem
0 references
exponentiation
0 references
modular multiplication
0 references
irreducible all one polynomial
0 references
inner products
0 references
0 references