Improving Euclidean Division and Modular Reduction for Some Classes of Divisors - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2003

Improving Euclidean Division and Modular Reduction for Some Classes of Divisors

Abstract

Modular arithmetic is becoming an area of major importance for many modern applications; RNS is widely used in digital signal processing, and most public-key cryptographic algorithms require very fast modular multiplication , and exponentiation. When such an arithmetic is required, specific values such as Fermat or Mersenne numbers are often chosen since they allow for very efficient implementations. However, there are cases where only very few of those numbers are available. We present an algorithm for the Euclidean division with remainder and we give the classes of divisors for which our algorithm is particularly efficient compared to commonly used method.
Fichier principal
Vignette du fichier
ASILOMAR2003.pdf (138.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00269572 , version 1 (07-06-2019)

Identifiers

Cite

Jean-Claude Bajard, Laurent Imbert, Thomas Plantard. Improving Euclidean Division and Modular Reduction for Some Classes of Divisors. Asilomar Conference on Signals, Systems and Computers, Nov 2003, Asilomar, CA, United States. pp.2218-2221, ⟨10.1109/ACSSC.2003.1292374⟩. ⟨lirmm-00269572⟩
74 View
101 Download

Altmetric

Share

Gmail Facebook X LinkedIn More