Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography

Libey Djath
  • Fonction : Auteur
  • PersonId : 1045480
Karim Bigou
Arnaud Tisserand

Résumé

Base extension is a critical operation in RNS implementations of asymmetric cryptosystems. In this paper, we propose a new way to perform base extensions using a hierarchical approach for computing the Chinese remainder theorem. For well chosen parameters, it significantly reduces the computational cost and still ensures a high level of internal parallelism. We illustrate the interest of the proposed approach on the cost of typical arithmetic primitives used in asymmetric cryptography. We also demonstrate improvements in FPGA implementations of base extensions on typical elliptic curve cryptography field sizes using high-level synthesis tools.
Fichier principal
Vignette du fichier
arith26.pdf (389.72 Ko) Télécharger le fichier
arith26-slides.pdf (2.48 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02096353 , version 1 (11-04-2019)

Identifiants

  • HAL Id : hal-02096353 , version 1

Citer

Libey Djath, Karim Bigou, Arnaud Tisserand. Hierarchical Approach in RNS Base Extension for Asymmetric Cryptography. ARITH: 2019 IEEE 26th Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. ⟨hal-02096353⟩
280 Consultations
442 Téléchargements

Partager

Gmail Facebook X LinkedIn More