loading...
Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers
Montpellier, France June 25-June 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2007.2318th IEEE Symposium on Computer Arith ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Jaewook Chung, M. Anwar Hasan, "Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers," Computer Arithmetic, IEEE Symposium on, pp. 230-239, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ARITH.2007.23,
author = {Jaewook Chung and M. Anwar Hasan},
title = {Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers},
journal ={Computer Arithmetic, IEEE Symposium on},
volume = {0},
year = {2007},
issn = {1063-6889},
pages = {230-239},
doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.2007.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer Arithmetic, IEEE Symposium on
TI - Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers
SN - 1063-6889
SP230
EP239
A1 - Jaewook Chung,
A1 - M. Anwar Hasan,
PY - 2007
KW - More generalized Mersenne numbers
KW - Low-weight polynomial form integers
KW - adapted modular number system
KW - polynomial modular number system
KW - Montgomery reduction algorithm
VL - 0
JA - Computer Arithmetic, IEEE Symposium on
ER -
 
Jaewook Chung, University of Waterloo, Ontario, Canada
M. Anwar Hasan, University of Waterloo, Ontario, Canada
In this paper, we extend a recent piece of work on low-weight polynomial form integers (LWPFIs). We present a new coefficient reduction algorithm based on the Montgomery reduction algorithm and provide its detailed analysis results. We give a condition for eliminating the final subtractions at the end of our Montgomery reduction algorithm adapted to perform the coefficient reduction. Our experimental results show that a new coefficient reduction algorithm is indeed more efficient than the one presented in [1].
Index Terms:
More generalized Mersenne numbers, Low-weight polynomial form integers, adapted modular number system, polynomial modular number system, Montgomery reduction algorithm
Citation:
Jaewook Chung, M. Anwar Hasan, "Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers," arith, pp.230-239, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
Usage of this product signifies your acceptance of the Terms of Use.