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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible… 
2015
2015
Security and privacy are growing concerns in modern embedded software, given the increasing level of connectivity as well as… 
2014
2014
This paper presents the design and the implementation of Elliptic Curve Cryptography in an Asterisk VoIP server which serves as… 
2013
2013
Denial-of-service (DoS) attacks are on the rise in recent years and many cryptographic client puzzle schemes have been proposed… 
2012
2012
This paper presents the design of an 8192-bit RSA cryptoprocessor using a radix 2 Montgomery multiplier based on a systolic… 
2005
2005
We describe data path extensions for general-purpose microprocessors to accelerate the emerging public-key cryptosystem Elliptic… 
2004
2004
Techniques for fast exponentiation (multiplication) in various groups have been extensively studied for use in cryptographic… 
2002
2002
Side-channel analysis is a powerful tool for retrieving secrets embedded in cryptographic devices such as smart cards. Although… 
Highly Cited
2002
Highly Cited
2002
We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the…