Algorithms for Multi-Exponentiation Based on Complex Arithmetic

A
ARITH
1997
13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97)
Abstract - Algorithms for Multi-Exponentiation Based on Complex Arithmetic

	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 V.S. Dimitrov Articles by G.A. Jullien Articles by W.C. Miller

13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97)

Asilomar, CA

March 06-March 09

ISBN: 0-8186-7846-1

	ASCII Text	x
	V.S. Dimitrov, G.A. Jullien, W.C. Miller, "Algorithms for Multi-Exponentiation Based on Complex Arithmetic," Computer Arithmetic, IEEE Symposium on, pp. 208, 13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97), 1997.

	BibTex	x
	@article{ 10.1109/ARITH.1997.614897, author = {V.S. Dimitrov and G.A. Jullien and W.C. Miller}, title = {Algorithms for Multi-Exponentiation Based on Complex Arithmetic}, journal ={Computer Arithmetic, IEEE Symposium on}, volume = {0}, year = {1997}, issn = {1063-6889}, pages = {208}, doi = {http://doi.ieeecomputersociety.org/10.1109/ARITH.1997.614897}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Arithmetic, IEEE Symposium on TI - Algorithms for Multi-Exponentiation Based on Complex Arithmetic SN - 1063-6889 SP EP A1 - V.S. Dimitrov, A1 - G.A. Jullien, A1 - W.C. Miller, PY - 1997 KW - digital arithmetic KW - multi-exponentiation algorithms KW - binary-like complex arithmetic KW - multiple modular exponentiation operations KW - performance KW - cryptographic protocols VL - 0 JA - Computer Arithmetic, IEEE Symposium on ER -

V.S. Dimitrov, VLSI Res. Group, Windsor University, Canada

G.A. Jullien, VLSI Res. Group, Windsor University, Canada

W.C. Miller, VLSI Res. Group, Windsor University, Canada

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1997.614897

In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multi-exponentiation. The algorithms proposed are based on binary-like complex arithmetic, introduced by K. Pekmestzi (1989) and generalized in this paper.

Index Terms:

digital arithmetic, multi-exponentiation algorithms, binary-like complex arithmetic, multiple modular exponentiation operations, performance, cryptographic protocols

Citation:

V.S. Dimitrov, G.A. Jullien, W.C. Miller, "Algorithms for Multi-Exponentiation Based on Complex Arithmetic," arith, pp.208, 13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97), 1997

Peer Review Notice | Give Us Feedback

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