The design of efficient cellular array architecture in GF(2^m)

The design of efficient cellular array architecture in GF(2^m)

博士 === 國立清華大學 === 資訊工程學系 === 89 ===

Bibliographic Details
Main Authors:	Chung-Hsin Liu, 劉仲鑫
Other Authors:	Nen-Fu Huang
Format:	Others
Language:	en_US
Published:	2001
Online Access:	http://ndltd.ncl.edu.tw/handle/30367074837222129891

Similar Items

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

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

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

Design of Efficient Self-Timed Circuit for Inversions and Divisions in GF(2m)
by: I-hsiang Huang, et al.
Published: (2003)

Scalable Hardware Architectures for Computing Multiplications over GF(2m)
by: Chin-Chin Chen, et al.
Published: (2009)

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

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

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)

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

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

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

GfM Tagung 2017
by: Katharina Kaiser-Müller
Published: (2017-06-01)

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

A Study and Implementation of Exponentiation in GF(2^m)
by: Wen-Ching Pong, et al.
Published: (1994)

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

A Gate-Level C-Testable GF(2^m) Multiplier
by: Wei,Yeong Chung, et al.
Published: (1994)

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

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

Design of application specific instruction set processors for the domain of GF(2'm)
by: Lim, Wei Ming
Published: (2004)

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)

An Efficient Architecture for Using Standard Basis Multiplier and Inverse Operation in large field GF(2^163)
by: Shuei-lai Jhuang, et al.
Published: (2014)

High-Performance VLSI Design for Elliptic Curve Cryptography over GF(2^m)
by: Hung, Tzu-Yu, et al.
Published: (2010)

Design of Polynomial Basis Multipliers over GF(2m) with Concurrent Error Detection
by: Chih Hsiang Chang, et al.
Published: (2011)

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

GfM Jahrestagung 2020: EXPERIMENTIEREN
by: Katharina Kaiser-Müller
Published: (2020-09-01)

A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF(2m) Based on Montgomery Arithmetic
by: Martin Schramm, et al.
Published: (2018-01-01)

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

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

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)

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

Call: GfM-Jahrestagung 2018 "Industrie"
by: Katharina Kaiser-Müller
Published: (2018-03-01)

Design of Polynomial Basis Multiplier over GF(2m) with Error Detection and Confusion Capabilities
by: Chia-Jen Wu, et al.
Published: (2009)

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

Karatsuba-Ofman Multiplier with Integrated Modular Reduction for GF(2m)
by: CUEVAS-FARFAN, E., et al.
Published: (2013-05-01)

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

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

Implementation of Three-Level Inverters using Field Programmable Gate Array
by: Chung-Hsin Huang, et al.
Published: (2007)

Fusing China GF-5 Hyperspectral Data with GF-1, GF-2 and Sentinel-2A Multispectral Data: Which Methods Should Be Used?
by: Kai Ren, et al.
Published: (2020-03-01)