Systolic architectures for multiplication over finite field GF(2m)

Menouer Diab

doi:10.1007/3-540-54195-0_62

ScienceGate Book Chapters

BOOK-CHAPTER

Systolic architectures for multiplication over finite field GF(2m)

Menouer Diab

Year: 1991 Lecture notes in computer science Pages: 329-340 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-54195-0_62

Get Full-Text PDF Get Analytical Report

Keywords:

GF(2) Finite field Multiplier (economics) Computer science Computation Multiplication (music) Arithmetic Very-large-scale integration Parallel computing Concurrency Mathematics Discrete mathematics Algorithm Combinatorics Embedded system

Metrics

Cited By

1.08

FWCI (Field Weighted Citation Impact)

Refs

0.76

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Data Storage Technologies

Physical Sciences → Computer Science → Computer Networks and Communications

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Systolic architectures for multiplication over finite field GF(2m)

Metrics

Citation History

Topics

Related Documents

Two systolic architectures for multiplication in GF (2m)

Semi-systolic Architecture for Modular Multiplication Over GF(2m)

Digit-Serial Systolic Architectures for Inversions over GF(2m)

Vlsi designs for multiplication over finite fields GF(2m)

Compact Bit-Parallel Systolic Montgomery Multiplication Over GF(2m) Generated by Trinomials