Parallel Montgomery Multiplication and Squaring over GF(2 m ) Based on Cellular Automata

Kyo Min Ku; Kyeoung Ju Ha; Wi Hyun Yoo; Kee Young Yoo

doi:10.1007/978-3-540-24768-5_21

ScienceGate Book Chapters

BOOK-CHAPTER

Parallel Montgomery Multiplication and Squaring over GF(2 m ) Based on Cellular Automata

Kyo Min Ku Kyeoung Ju Ha Wi Hyun Yoo Kee Young Yoo

Year: 2004 Lecture notes in computer science Pages: 196-205 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-540-24768-5_21

Get Full-Text PDF Get Analytical Report

Keywords:

Modular exponentiation Exponentiation Computer science Modular arithmetic Multiplication (music) Modular design Cellular automaton Galois theory ElGamal encryption Public-key cryptography Arithmetic Cryptography Parallel computing Mathematics Algorithm Discrete mathematics Encryption Computer network Combinatorics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.14

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Parallel Montgomery Multiplication and Squaring over GF(2 m ) Based on Cellular Automata

Metrics

Citation History

Topics

Related Documents

Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)

Fast and pipelined bit-parallel montgomery multiplication and squaring over GF(2m)

Montgomery Multiplication and Squaring Algorithms in GF(2k)

New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata

Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF(${2^{m}}$ )