loading...
Fast Modular Multiplication by Operand Changing
Las Vegas, Nevada April 05-April 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286707International Conference on Informati ...
 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 
 
Manfred Schimmler, Viktor Bunimov, "Fast Modular Multiplication by Operand Changing," Information Technology: Coding and Computing, International Conference on, vol. 2, pp. 518, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2, 2004.
 
 
BibTex
x
 
@article{ 10.1109/ITCC.2004.1286707,
author = {Manfred Schimmler and Viktor Bunimov},
title = {Fast Modular Multiplication by Operand Changing},
journal ={Information Technology: Coding and Computing, International Conference on},
volume = {2},
year = {2004},
isbn = {0-7695-2108-8},
pages = {518},
doi = {http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286707},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Information Technology: Coding and Computing, International Conference on
TI - Fast Modular Multiplication by Operand Changing
SN - 0-7695-2108-8
SP
EP
A1 - Manfred Schimmler,
A1 - Viktor Bunimov,
PY - 2004
KW - null
VL - 2
JA - Information Technology: Coding and Computing, International Conference on
ER -
 
Manfred Schimmler, Technical University of Braunschweig, Germany
Viktor Bunimov, Technical University of Braunschweig, Germany
A new algorithm for modular multiplication for public key cryptography is presented. The algorithm is optimised with respect to area and time by use of a combination of adders and fast lookup tables. This leads to a multiplication method that can significantly speed up exponentiation, because the values of the lookup table do not depend on the operands of the individual multiplication. The speedup is achieved by continuous modification of one operand.
Citation:
Manfred Schimmler, Viktor Bunimov, "Fast Modular Multiplication by Operand Changing," itcc, vol. 2, pp.518, International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.