Skip to Main content Skip to Navigation
Conference papers

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

Cited literature [24 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00269699
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, February 6, 2019 - 12:03:57 PM
Last modification on : Thursday, February 7, 2019 - 5:54:43 PM
Long-term archiving on: : Tuesday, May 7, 2019 - 2:07:11 PM

Identifiers

  • HAL Id : lirmm-00269699, version 1

Collections

Citation

Daniel Mesquita, Lionel Torres, Michel Robert, Gilles Sassatelli, Fernando 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⟩

Share

Metrics

Record views

122

Files downloads

36