Design and FPGA Implementation of Modular Multiplication Methods Using Cellular Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Design and FPGA Implementation of Modular Multiplication Methods Using Cellular Automata

Abstract

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(2m). 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.
No file

Dates and versions

hal-01265630 , version 1 (01-02-2016)

Identifiers

Cite

Zied Guitouni, Roselyne Chotin-Avot, Mohsen Machhout, Habib Mehrez, Rached Tourki. Design and FPGA Implementation of Modular Multiplication Methods Using Cellular Automata. DTIS IEEE International Conference on Design & Test of Integrated Systems in Nanoscale Technology, Mar 2010, Hammamet, Tunisia. pp.1-5, ⟨10.1109/DTIS.2010.5487586⟩. ⟨hal-01265630⟩
133 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More