Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

29 relations
Addition-chain exponentiationBinary logarithmCompilerComputational complexity of mathematical operations
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Horizontal Correlation Analysis on Exponentiation
We introduce in this paper a technique in which we apply correlation analysis using only one execution power curve during an… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
2009
2009
On Repeated Squarings in Binary Fields
In this paper, we discuss the problem of computing repeated squarings (exponentiations to a power of 2) in finite fields with… Expand
Is this relevant?
2008
2008
Structured squaring down and zero assignment
The problem of zero assignment by squaring down is considered for a system of p-inputs, n-outputs and n-states (m > p), where not… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
We introduce simple methods to convert a cryptographic algorithm into an algorithm protected against simple side-channel attacks… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Scaling of power corrections for angularities from dressed gluon exponentiation
We study power corrections to a recently introduced family of event shapes, the class of angularities, within the formalism of… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Montgomery Powering Ladder
This paper gives a comprehensive analysis of Montgomery powering ladder. Initially developed for fast scalar multiplication on… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Proxy signatures for delegating signing operation
In this paper a new type of digital proxy signature is proposed. The proxy signature allows a designated person, called a proxy… Expand
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A Practical Theory of Programming
  • E. Hehner
  • Texts and Monographs in Computer Science
  • 1993
    • Corpus ID: 5914094
Understanding programming and programming languages requires knowledge of the underlying theoretical model. This book explores… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Fast Exponentiation with Precomputation (Extended Abstract)
In several cryptographic systems, a fixed element g of a group (generally Z/qZ) is repeatedly raised to many different powers. In… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Exponentiation Cryptosystems on the IBM PC
  • P. Comba
  • IBM Syst. J.
  • 1990
    • Corpus ID: 15260496
Several cryptosystems based on exponentiation have been proposed in recent years. Some of these are of the public key variety and… Expand
  • figure 2
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE