Skip to Main content Skip to Navigation
Conference papers

Redundant Modular Reduction Algorithms

Abstract : 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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01596301
Contributor : Hal Ifip <>
Submitted on : Wednesday, September 27, 2017 - 2:46:24 PM
Last modification on : Tuesday, October 10, 2017 - 1:47:58 PM
Long-term archiving on: : Thursday, December 28, 2017 - 1:59:31 PM

File

978-3-642-27257-8_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

104

Files downloads

1241