Complexity and fast algorithms for multiexponentiations

Vassil S. Dimitrov

doi:10.1109/12.833110

Complexity and fast algorithms for multiexponentiations

2000-01-01

39

PRE

AI

DOI：10.1109/12.833110

Original

Original request for help

Save

Abstract

En 中文

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 multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by Pekmestzi and generalized in this paper.

Keywords:

modular exponentiation

cryptography

complex arithmetic

Complexity and fast algorithms for multiexponentiations

Abstract

Journal

Organization