An Improved Unified Scalable Radix-2 Montgomery Multiplier

Cape Cod, Massachusetts, USA June 27-June 29

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.9

17th IEEE Symposium on Computer Arith ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by David Harris Articles by Ram Krishnamurthy Articles by Mark Anders Articles by Sanu Mathew Articles by Steven Hsu

	ASCII Text	x
	David Harris, Ram Krishnamurthy, Mark Anders, Sanu Mathew, Steven Hsu, "An Improved Unified Scalable Radix-2 Montgomery Multiplier," Computer Arithmetic, IEEE Symposium on, pp. 172-178, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005.

	BibTex	x
	@article{ 10.1109/ARITH.2005.9, author = {David Harris and Ram Krishnamurthy and Mark Anders and Sanu Mathew and Steven Hsu}, title = {An Improved Unified Scalable Radix-2 Montgomery Multiplier}, journal ={Computer Arithmetic, IEEE Symposium on}, volume = {0}, year = {2005}, issn = {1063-6889}, pages = {172-178}, doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.9}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Arithmetic, IEEE Symposium on TI - An Improved Unified Scalable Radix-2 Montgomery Multiplier SN - 1063-6889 SP172 EP178 A1 - David Harris, A1 - Ram Krishnamurthy, A1 - Mark Anders, A1 - Sanu Mathew, A1 - Steven Hsu, PY - 2005 KW - null VL - 0 JA - Computer Arithmetic, IEEE Symposium on ER -

David Harris, Harvey Mudd College

Ram Krishnamurthy, Intel Circuits Research Laboratory

Mark Anders, Intel Circuits Research Laboratory

Sanu Mathew, Intel Circuits Research Laboratory

Steven Hsu, Intel Circuits Research Laboratory

This paper describes an improved version of the Tenca-Ko? unified scalable radix-2 Montgomery multiplier with half the latency for small and moderate precision operands and half the queue memory requirement. Like the Tenca-Ko? multiplier, this design is reconfigurable to accept any input precision in either GF(p) or GF(2ⁿ) up to the size of the on-chip memory. An FPGA implementation can perform 1024-bit modular exponentiation in 16 ms using 5598 4-input lookup tables, making it the fastest unified scalable design yet reported.

Citation:

David Harris, Ram Krishnamurthy, Mark Anders, Sanu Mathew, Steven Hsu, "An Improved Unified Scalable Radix-2 Montgomery Multiplier," arith, pp.172-178, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005

Peer Review Notice | Give Us Feedback

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