Abstract. This paper compares different approaches for computing power products � 1≤i≤k ge i i in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent recoding usually wins over the conventional method.
A proof of exponentiation (PoE) in a group G of unknown order allows a prover to convince a verifier...
AbstractA list of complex numbers is multiplicatively independent if no integral–exponent power prod...
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There ...
In this lecture, we discuss exponentiation and several exponentiation algorithms. We also give a bri...
Abstract. The most recent left-to-right and right-to-left multibase exp-onentiation methods are comp...
The most common method for computing exponentiation of random elements in Abelian groups are slidin...
Abstract. We present improvements to algorithms for efficient expo-nentiation. The fractional window...
Abstract. This paper describes methods of recoding exponents to allow for regular implementations of...
There are several commutativity theorems in groups and rings which involve power maps f(x) = xn. The...
this paper is to propose new fast exponentiation method based on number system with algebraic intege...
This paper introduces a computational scheme for calculating the exponential bw where b and w a...
Abstract—Finite field is mainly used in communications. In those arithmetic operations, modular expo...
Abstract. The aim of this note is to advertise a method which turns out to be powerful enough to be ...
We show how automorphisms can be used to reduce significantly the resources needed to enforce laws i...
This paper proposes an exponentiation method with Frobenius mappings. Our method is closely related ...
A proof of exponentiation (PoE) in a group G of unknown order allows a prover to convince a verifier...
AbstractA list of complex numbers is multiplicatively independent if no integral–exponent power prod...
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There ...
In this lecture, we discuss exponentiation and several exponentiation algorithms. We also give a bri...
Abstract. The most recent left-to-right and right-to-left multibase exp-onentiation methods are comp...
The most common method for computing exponentiation of random elements in Abelian groups are slidin...
Abstract. We present improvements to algorithms for efficient expo-nentiation. The fractional window...
Abstract. This paper describes methods of recoding exponents to allow for regular implementations of...
There are several commutativity theorems in groups and rings which involve power maps f(x) = xn. The...
this paper is to propose new fast exponentiation method based on number system with algebraic intege...
This paper introduces a computational scheme for calculating the exponential bw where b and w a...
Abstract—Finite field is mainly used in communications. In those arithmetic operations, modular expo...
Abstract. The aim of this note is to advertise a method which turns out to be powerful enough to be ...
We show how automorphisms can be used to reduce significantly the resources needed to enforce laws i...
This paper proposes an exponentiation method with Frobenius mappings. Our method is closely related ...
A proof of exponentiation (PoE) in a group G of unknown order allows a prover to convince a verifier...
AbstractA list of complex numbers is multiplicatively independent if no integral–exponent power prod...
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There ...