Generating Residue Number System Bases - Sorbonne Université Access content directly
Conference Papers Year : 2021

Generating Residue Number System Bases


Residue number systems provide efficient techniques for speeding up calculations and/or protecting against side channel attacks when used in the context of cryptographic engineering. One of the interests of such systems is their scalability, as the existence of large bases for some specialized systems is often an open question. In this paper, we present highly optimized methods for generating large bases for residue number systems and, in some cases, the largest possible bases. We show their efficiency by demonstrating their improvement over the state-of-the-art bases reported in the literature. This work make it possible to address the problem of the scalability issue of finding new bases for a specific system that arises whenever a parameter changes, and possibly open new application avenues.
Fichier principal
Vignette du fichier
5YVTBPLZ_main_edited_final.pdf (273.55 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03457951 , version 1 (01-12-2021)



Jean-Claude Bajard, Kazuhide Fukushima, Shinsaku Kiyomoto, Thomas Plantard, Arnaud Sipasseuth, et al.. Generating Residue Number System Bases. ARITH 2021- IEEE 28th Symposium on Computer Arithmetic, Jun 2021, Virtual, France. pp.86-93, ⟨10.1109/ARITH51176.2021.00027⟩. ⟨hal-03457951⟩
49 View
206 Download



Gmail Mastodon Facebook X LinkedIn More