Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
Addition-chain exponentiationBinary logarithmCompilerComputational complexity of mathematical operations

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Modification and Optimization of Solovey-Strassen's Fast Exponentiation Probablistic Test Binary Algorithm
This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible… 
2015
2015
Exp-HE: a family of fast exponentiation algorithms resistant to SPA, fault, and combined attacks
Security and privacy are growing concerns in modern embedded software, given the increasing level of connectivity as well as… 
2014
2014
Real time implementation of Elliptic Curve Cryptography over a open source VoIP server
This paper presents the design and the implementation of Elliptic Curve Cryptography in an Asterisk VoIP server which serves as… 
2013
2013
Rate limiting client puzzle schemes for denial-of-service mitigation
Denial-of-service (DoS) attacks are on the rise in recent years and many cryptographic client puzzle schemes have been proposed… 
2012
2012
Design of an 8192-bit RSA cryptoprocessor based on systolic architecture
This paper presents the design of an 8192-bit RSA cryptoprocessor using a radix 2 Montgomery multiplier based on a systolic… 
2012
2012
Massively parallel modular exponentiation method and its implementation in software and hardware for high-performance cryptographic systems
Most cryptographic systems are based on modular exponentiation (ME). It is performed using successive modular multiplications… 
2004
2004
An Improved Algorithm for uP + vQ Using JSF13
Techniques for fast exponentiation (multiplication) in various groups have been extensively studied for use in cryptographic… 
2002
2002
A Protected Division Algorithm
Side-channel analysis is a powerful tool for retrieving secrets embedded in cryptographic devices such as smart cards. Although… 
1995
1995
Parallel Computation of the Modular Cascade Exponentiation
For modern public key cryptographic systems, the modular cascade exponentiation ((πi=1 pxi ni)modu) is one of the most important… 
1995
1995
A new systolic architecture for fast exponentiation in GF(2m)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)