loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 19th IEEE Symposium on Computer Arithmetic
Selected RNS Bases for Modular Multiplication
Portland, Oregon, USA
June 08-June 10
ISBN: 978-0-7695-3670-5
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.
Index Terms:
modular arithmetic, residue number systems, cryptography application
Citation:
J. C. Bajard, M. Kaihara, T. Plantard, "Selected RNS Bases for Modular Multiplication," arith, pp.25-32, 2009 19th IEEE Symposium on Computer Arithmetic, 2009
Usage of this product signifies your acceptance of the Terms of Use.