BOOK-CHAPTER

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

Kyo Min KuKyeoung Ju HaWi Hyun YooKee Young Yoo

Year: 2004 Lecture notes in computer science Pages: 196-205   Publisher: Springer Science+Business Media
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

2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
13
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

Related Documents

JOURNAL ARTICLE

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

Arash HaririArash Reyhani-Masoleh

Journal:   IEEE Transactions on Computers Year: 2009 Vol: 58 (10)Pages: 1332-1345
BOOK-CHAPTER

Montgomery Multiplication and Squaring Algorithms in GF(2k)

Nam-Yeun KimKee-Young Yoo

Lecture notes in computer science Year: 2003 Pages: 865-874
JOURNAL ARTICLE

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

Atef Ibrahim

Journal:   Canadian Journal of Electrical and Computer Engineering Year: 2019 Vol: 42 (2)Pages: 114-120
© 2026 ScienceGate Book Chapters — All rights reserved.