On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W

I
ICCD
2000
2000 IEEE International Conference on Computer Design (ICCD'00)
Abstract - On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by H. Ploog Articles by D. Timmerman

2000 IEEE International Conference on Computer Design (ICCD'00)

Austin, Texas

September 17-September 20

ISBN: 0-7695-0801-4

	ASCII Text	x
	H. Ploog, D. Timmerman, "On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W," Computer Design, International Conference on, pp. 589, 2000 IEEE International Conference on Computer Design (ICCD'00), 2000.

	BibTex	x
	@article{ 10.1109/ICCD.2000.878350, author = {H. Ploog and D. Timmerman}, title = {On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W}, journal ={Computer Design, International Conference on}, volume = {0}, year = {2000}, issn = {1063-6404}, pages = {589}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCD.2000.878350}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Design, International Conference on TI - On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W SN - 1063-6404 SP EP A1 - H. Ploog, A1 - D. Timmerman, PY - 2000 VL - 0 JA - Computer Design, International Conference on ER -

H. Ploog, University of Rostock

D. Timmerman, University of Rostock

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.2000.878350

An efficient implementation of modular exponentiation, i.e., the main building block of many public key cryptographic devices, is achieved by algorithmic optimization of the Montgomery modular multiplication algorithm based on multiple precision such that pre-computation of N0? = - N0 -1 mod W can be avoided. This can be attained by modifications of the multiplier used.

Citation:

H. Ploog, D. Timmerman, "On Multiple Precision Based Montgomery Multiplication without Precomputation of N0? = -N0-1 mod W," iccd, pp.589, 2000 IEEE International Conference on Computer Design (ICCD'00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.