Algorithms for Multi-Exponentiation Based on Complex Arithmetic

V.S. Dimitrov; G.A. Jullien; W.C. Miller

doi:10.1109/ARITH.1997.614897

Previous
Next
Table of Contents

Computer Arithmetic, IEEE Symposium on

Algorithms for Multi-Exponentiation Based on Complex Arithmetic

Year: 1997, Pages: 208

DOI Bookmark: 10.1109/ARITH.1997.614897

Authors

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

Abstract

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.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!