AOP arithmetic architectures over GF(2\(^m\)) (Q1888264): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1038726 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Dimitris Voukalis / rank | |||
Normal rank |
Revision as of 02:03, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | AOP arithmetic architectures over GF(2\(^m\)) |
scientific article |
Statements
AOP arithmetic architectures over GF(2\(^m\)) (English)
0 references
23 November 2004
0 references
This paper presents bit-serial AOP (all one polynomial-AOP) arithmetic architectures over GF\((2^m)\). The proposed architectures have certain advantages related to circuit complexity over some previous architectures. Using a modular multiplier (inner producting-IM-LSB- first exponentiation, MSB-first exponentiation, AB-multiplier)/squarer (squaring circuit -SM-multiplication and squaring-ISM) for the circuit of Altera's MAX+Plus II programs for performing exponentiation, inversion and division, we can implement cryptosystems with low hardware complexity. Using these it is easy to implement VLSI hardware and IC cards of Altera Max+PLUS II SW programs which have a simple architecture.
0 references
All one polynomial
0 references
Bit serial architecture
0 references
Cryptography
0 references
Standard basis representation
0 references