Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods

This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable for hardware implementations. Four large sets of moduli for which the proposed methods apply are given and analyzed from...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on computers 2010-12, Vol.59 (12), p.1715-1721
Hauptverfasser:	Knezevic, Miroslav, Vercauteren, Frederik, Verbauwhede, Ingrid
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Architecture Barrett reduction Elliptic curve cryptography Equations Estimation Hardware Modular Modular multiplication Montgomery reduction Multiplication Multipliers Public key cryptography Reduction
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!