Design and FPGA implementation of modular multiplication methods using cellular automata

Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. They have been used for various applications, such as parallel processing computations and number theory. In this paper, we studied the applications of cellular automa...

Full description

Saved in:
Bibliographic Details
Main Authors: Guitouni, Z, Chotin-Avot, R, Machhout, M, Mehrez, H, Tourki, R
Format: Conference Proceeding
Language:English
Subjects:
cellular automata
Computational modeling
Computer architecture
Concurrent computing
Cryptography
Field programmable gate arrays
finite field
Galois fields
Hardware
modular multiplication
Parallel processing
Physics computing
programmable cellular automata
Very large scale integration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. They have been used for various applications, such as parallel processing computations and number theory. In this paper, we studied the applications of cellular automata for the modular multiplications; we proposed two new architectures of multipliers based on cellular automata over finite field GF(2 m ). Since they have regularity, modularity and concurrency, they are suitable for VLSI implementation. The proposed architectures can be easily implemented into the hardware design of crypto-coprocessors.
DOI:10.1109/DTIS.2010.5487586