Scalable Hardware Architectures for Computing Multiplications over GF(2m)

Scalable Hardware Architectures for Computing Multiplications over GF(2m)

博士 === 長庚大學 === 電機工程學研究所 === 97 === Abstract Finite (Galois) field GF(2m) has widely applied to error control coding and public-key cryptography. Important operations of finite fields are addition, multiplication and inversion. Addition is very simple and can be implemented using XOR gates circuit....

Full description

Bibliographic Details
Main Authors:	Chin-Chin Chen, 陳進欽
Other Authors:	E. H. Lu
Format:	Others
Published:	2009
Online Access:	http://ndltd.ncl.edu.tw/handle/10719954545662263777

Similar Items

Fault Tolerant Architecture for Computing Division Over GF(2m)
by: Yu-Chih Liu, et al.
Published: (2012)

Hardware Implementation of Elliptic Curve Cryptosystem over Finite Fields GF(p) and GF(2^m)
by: Guan-Zhou Lu, et al.
Published: (2004)

Multiple Bit Error Tolerant Galois Field Architectures Over GF (2m)
by: Mahesh Poolakkaparambil, et al.
Published: (2012-06-01)

Multiplication inverse and Division over GF(2^m)
by: Tzung-li Yang, et al.
Published: (2008)

A Hardware-Efficient Elliptic Curve Cryptographic Architecture over GF (p)
by: Chao Cui, et al.
Published: (2021-01-01)

Low-Complexity Bit-Parallel Systolic Architecture for Computing Multiplication and Exponentiation over Finite Field GF(2^m)
by: chiou-yng lee, et al.
Published: (2001)

Low-Complexity Multiplication Algorithms over GF(2^m) and Its Concurrent Detection Architectures
by: Jenn-Shyong Horng, et al.
Published: (2009)

Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>)
by: Daneshbeh, Amir
Published: (2006)

Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>)
by: Daneshbeh, Amir
Published: (2006)

Efficient Scalable Digit-Serial Inverter Over GF( $2^{m}$ ) for Ultra-Low Power Devices
by: Atef Ibrahim, et al.
Published: (2016-01-01)

A Low Hardware Consumption Elliptic Curve Cryptographic Architecture over GF(p) in Embedded Application
by: Xianghong Hu, et al.
Published: (2018-07-01)

High-Performance Architecture Design for Elliptic Curve Cryptosystems over GF(2^m)
by: Wen-Ching Lin, et al.
Published: (2007)

VHDL Implementation of PPR Systolic Array Architecture for Polynomial GF(2^m) Multiplication
by: Nia, Ali
Published: (2013)

Low complexity systolic architectures for multiplications, exponentiations, inversions and divisions in GF(2^m)
by: YING-CHIEH KUO, et al.
Published: (2000)

Low-Complexity Bit-Parallel Multiplier Architecture over Finite Field GF(2^m)
by: Yeun-Renn Ting, et al.
Published: (2005)

A VLSI Architecture of Arithmetic Unit for Finite Field GF(2m)
by: Chen, Dong-Zhou, et al.
Published: (1996)

STUDIES ON HARDWARE-ASSISTED IMPLEMENTATION OF ARITHMETIC OPERATIONS IN GALOIS FIELD GF(2^m)
by: Kobayashi, Katsuki, et al.
Published: (2009)

The design of efficient cellular array architecture in GF(2^m)
by: Chung-Hsin Liu, et al.
Published: (2001)

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)

Performance Evaluation of IC Design for Systolic Multipliers over GF(2^m)
by: Chen, Kuan-Han, et al.
Published: (2018)

VLSI Architecture to Implement Computations in GF(28)
by: Lai Chien-Kuo, et al.
Published: (1998)

Hardware Implementation of New Scalable Architecture Design for Montgomery Modular Multiplication Using Recoding Techniques
by: 陳志誠
Published: (2013)

Progressive product reduction for polynomial basis multiplication over GF(3m)
by: Moeen, Kareem
Published: (2016)

VLSI Implementation of Arithmetic Unit over GF(2m)
by: Jacky Tsai, et al.
Published: (1997)

The Characterization of Irreducible Polynomials over GF(2)
by: Wei-Chih Chen, et al.
Published: (2000)

Lookup Table Based Multiplication Technique for GF(2^m)
by: Hou-Chun He, et al.
Published: (2013)

Scalable Hardware Architecture for the Bidiagonalization of Matrices with Arbitrary Sizes
by: Yang, Meng-Li, et al.
Published: (2018)

New Linear Codes over $GF(3)$, $GF(11)$, and $GF(13)$
by: Nuh Aydin, et al.
Published: (2019-01-01)

Performance Evaluation of FPGA Design for Multiplier over GF(2^m)
by: 黃科郝
Published: (2015)

Pascal polynomials over GF(2)
by: Fernandez, Carlos K.
Published: (2012)

A Combined Circuit for Multiplication and Inversion in ${rm GF}(2^{m})$
by: Kobayashi, Katsuki, et al.
Published: (2008)

Fast Hardware Algorithm for Division in GF(2m) Based on the Extended Euclid's Algorithm With Parallelization of Modular Reductions
by: Kobayashi, Katsuki, et al.
Published: (2009)

Modelo de Criptoprocesador de Curvas Elípticas en GF(2m) Basado en Hardware Reconfigurable
by: Brotons, Francisco Javier
Published: (2016)

A Software and Hardware IPTV Architecture for Scalable DVB Distribution
by: Georg Acher, et al.
Published: (2009-01-01)

Scalable parallel architecture for biological neural simulation on hardware platforms
by: Pourhaj, Peyman
Published: (2010)

A Scalable Architecture for IP Security (IPsec) Hardware Accelerator
by: Chia-Yen Hsieh, et al.
Published: (2005)

Design of Low-Complexity and Error-Detection Multipliers over GF(2m)
by: Hung-Wei Chang, et al.
Published: (2013)

FPGA Realization of Low Register Systolic Multipliers over GF(2^m)
by: Shao, Qiliang
Published: (2016)

Novel Systolic Mastrovito Polynomial Basis Multiplier over GF(2m)
by: Ma, Chi-Ting, et al.
Published: (2011)

Fault-Tolerant Gaussian Normal Basis Multiplier over GF(2m)
by: Tai-Pao Chuang, et al.
Published: (2010)