University of Wollongong
Browse

Selected RNS bases for modular multiplication

Download (481.24 kB)
conference contribution
posted on 2024-11-14, 10:29 authored by Jean-Claude Bajard, Marcello Kaihara, Thomas Plantard
The selection of the elements of the bases in an RNS modular multiplication method is crucial and has a great impact in the overall performance.This work proposes specific sets of optimal RNS moduli with elements of Hamming weight three whose inverses used in the MRS reconstruction have very small Hamming weight. This property is exploited in RNS bases conversions, to completely remove and replace the products by few additions/subtractions and shifts, reducing the time complexity of modular multiplication.These bases are specially crafted to computation with operands of sizes 256 or more and are suitable for cryptographic applications such as the ECC protocols.

History

Citation

Bajard, J., Kaihara, M. E. & Plantard, T. (2009). Selected RNS bases for modular multiplication. 19th IEEE Symposium on Computer Arithmetic (pp. 25-32). Los Alamitos, CA: IEEE Computer Society.

Parent title

Proceedings - Symposium on Computer Arithmetic

Pagination

25-32

Language

English

RIS ID

32467

Usage metrics

    Categories

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC