loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE Symposium on Computer Arithmetic (ARITH '07)
Fast Modular Reduction
Montpellier, France
June 25-June 27
ISBN: 0-7695-2854-6
ASCII Text
x 
 
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal, "Fast Modular Reduction," Computer Arithmetic, IEEE Symposium on, pp. 225-229, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ARITH.2007.18,
author = {William Hasenplaugh and Gunnar Gaubatz and Vinodh Gopal},
title = {Fast Modular Reduction},
journal ={Computer Arithmetic, IEEE Symposium on},
volume = {0},
year = {2007},
issn = {1063-6889},
pages = {225-229},
doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.2007.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Arithmetic, IEEE Symposium on
TI - Fast Modular Reduction
SN - 1063-6889
SP225
EP229
A1 - William Hasenplaugh,
A1 - Gunnar Gaubatz,
A1 - Vinodh Gopal,
PY - 2007
KW - null
VL - 0
JA - Computer Arithmetic, IEEE Symposium on
ER -
 
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hyper-) elliptic curve algorithms. In the recent decade, practitioners have relied mainly on two popular methods: Montgomery Multiplication and regular long-integer multiplication in combination with Barrett?s modular reduction technique. In this paper, we propose a modification to Barrett?s algorithm that leads to a significant reduction (25% to 75%) in multiplications and additions.
Citation:
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal, "Fast Modular Reduction," arith, pp.225-229, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.