Are Coarse Grain Reconfigurable Architectures Suitable for Cryptography? - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2003

Are Coarse Grain Reconfigurable Architectures Suitable for Cryptography?

Abstract

Cryptographic algorithms are increasingly used in personal transaction through Internet network, smart card and telecommunication applications. Those algorithms are well known for their high complexity data computing. This paper focuses on Montgomery algorithm, which computes modular multiplication efficiently. This operation is the most time consuming part of public-key cryptosystems. A comparison among different implementations of the Montgomery algorithm in different architectures (GPP 1 , DSP, fine grain FPGA, coarse grain reconfigurable architecture [CGRA]) is presented. It is shown that coarse grain reconfigurable architecture might be good candidate to implement and to execute Montgomery multiplication. The paper also details the CGRA chosen to implement the referred algorithm.
Fichier principal
Vignette du fichier
mesquitaVLSI03final.pdf (395.4 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00269699 , version 1 (06-02-2019)

Identifiers

  • HAL Id : lirmm-00269699 , version 1

Cite

Daniel Mesquita, Lionel Torres, Michel Robert, Gilles Sassatelli, Fernando Gehm Moraes. Are Coarse Grain Reconfigurable Architectures Suitable for Cryptography?. 12th International Conference on Very Large Scale Integration of System-on-Chip (VLSI-SoC), Dec 2003, Darmstadt, Germany. pp.276-281. ⟨lirmm-00269699⟩
108 View
64 Download

Share

Gmail Mastodon Facebook X LinkedIn More