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.
Document type :
Conference papers
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01265630
Contributor : Roselyne Chotin <>
Submitted on : Monday, February 1, 2016 - 1:41:47 PM
Last modification on : Thursday, March 21, 2019 - 2:44:03 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

122