RNS modular multiplication through reduced base extensions


The paper describes a new RNS (residue number system) modular multiplication algorithm, for finite field arithmetic over F<sub>P</sub>, based on a reduced number of moduli in base extensions with only 3n=2 moduli instead of 2n for standard ones. Our algorithm reduces both the number of elementary modular multiplications (EMMs) and the number of stored… (More)
DOI: 10.1109/ASAP.2014.6868631
View Slides


6 Figures and Tables

Cite this paper

@article{Bigou2014RNSMM, title={RNS modular multiplication through reduced base extensions}, author={Karim Bigou and Arnaud Tisserand}, journal={2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors}, year={2014}, pages={57-62} }