Double-Speed Barrett Moduli - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport Technique) Année : 2015

Double-Speed Barrett Moduli

Résumé

Modular multiplication and modular reduction are the atomic constituents of most public-key cryptosystems. Amongst the numerous algorithms for performing these operations, a particularly elegant method was proposed by Barrett. This method builds the operation a mod b from bit shifts, multiplications and additions in Z. This allows to build modular reduction at very marginal code or silicon costs by leveraging existing hardware or software multipliers. This paper presents a method allowing to double the speed of Barrett's algorithm by using specific composite moduli. This is particularly useful for lightweight devices where such an optimization can make a difference in terms of power consumption, cost and processing time. The generation of composite moduli with a predetermined portion is a well-known technique and the use of such moduli is considered, in statu scientiae, as safe as using randomly generated composite moduli.
Fichier principal
Vignette du fichier
785.pdf (495.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01215845 , version 1 (15-10-2015)

Identifiants

  • HAL Id : hal-01215845 , version 1

Citer

Rémi Géraud, Diana Maimuţ, David Naccache. Double-Speed Barrett Moduli. [Technical Report] Cryptology ePrint Archive: Report 2015/785, Ecole normale supérieure. 2015. ⟨hal-01215845⟩
68 Consultations
291 Téléchargements

Partager

Gmail Facebook X LinkedIn More