A fast algorithm for multiplicative inversion in GF(2m) using normal basis
Main Authors: | 高木, 直史, Takagi, Naofumi |
---|---|
Language: | en_US |
Published: |
IEEE
2001
|
Subjects: | |
Online Access: | http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=926155 http://hdl.handle.net/2237/5292 |
Similar Items
-
A Combined Circuit for Multiplication and Inversion in ${rm GF}(2^{m})$
by: Kobayashi, Katsuki, et al.
Published: (2008) -
Low-Complexity Versatile Finite Field Multiplier in Normal Basis
by: Zhang Chang Nian, et al.
Published: (2002-01-01) -
Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography
by: J. Schmidt, et al.
Published: (2005-01-01) -
Normal Bases on Galois Ring Extensions
by: Aixian Zhang, et al.
Published: (2018-12-01) -
Low‐Power and Low‐Hardware Bit‐Parallel Polynomial Basis Systolic Multiplier over GF(2m) for Irreducible Polynomials
by: Sudha Ellison Mathe, et al.
Published: (2017-08-01)