Exponentiation by squaring

Known as: Repeated squaring, Binary exponentation, Repeated squaring algorithm 
In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Power Analysis has been widely studied since Kocher et al. presented in 1998 the initial Simple and Differential Power Analysis… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2010
2010
This paper proposes new chosen-message power-analysis attacks for public-key cryptosystems based on modular exponentiation, where… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei i in commutative groups. We look at the… (More)
  • table 1
Is this relevant?
2000
2000
  • eldsSHUHONG, GAOy, +4 authors AND VICTOR SHOUP
  • 2000
Gauss periods yield (self-dual) normal bases in nite elds, and these normal bases can be used to implement arithmetic eeciently… (More)
Is this relevant?
1998
1998
The well-known binary method computes C = M (mod N) using an average number of 1:5(n 1) multiplications, where n is the number of… (More)
Is this relevant?
1998
1998
Exponentiation of large positive integer with a 512-bit exponent is the basis of several well-known cryptographic algorithms. In… (More)
  • table 1
  • figure 1
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In several crypt,ographic systems, a fixed elcment g of a group (generally z/qz) is repeatedly raised to many different powers… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Several cryptosystems based on exponentiation have been proposed in recent years. Some of these are of the public key variety and… (More)
  • figure 2
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?