Redundant Modular Reduction Algorithms - Smart Card Research and Advanced Applications Access content directly
Conference Papers Year : 2011

Redundant Modular Reduction Algorithms

Vincent Dupaquis
  • Function : Author
  • PersonId : 1017801
Alexandre Venelli
  • Function : Author
  • PersonId : 948125


We present modular reduction algorithms over finite fields of large characteristic that allow the use of redundant modular arithmetic. This technique provides constant time reduction algorithms. Moreover, it can also be used to strengthen the differential side-channel resistance of asymmetric cryptosystems. We propose modifications to the classic Montgomery and Barrett reduction algorithms in order to have efficient and resistant modular reduction methods. Our algorithms are called dynamic redundant reductions as random masks are intrinsically added within each reduction for a small overhead. This property is useful in order to thwart recent refined attacks on public key algorithms.
Fichier principal
Vignette du fichier
978-3-642-27257-8_7_Chapter.pdf (312.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01596301 , version 1 (27-09-2017)





Vincent Dupaquis, Alexandre Venelli. Redundant Modular Reduction Algorithms. 10th Smart Card Research and Advanced Applications (CARDIS), Sep 2011, Leuven, Belgium. pp.102-114, ⟨10.1007/978-3-642-27257-8_7⟩. ⟨hal-01596301⟩
56 View
1203 Download



Gmail Facebook X LinkedIn More