Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,307 papers from all fields of science
Search
Sign In
Create Free Account
Exponentiation by squaring
Known as:
Repeated squaring
, Binary exponentation
, Repeated squaring algorithm
Expand
In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Addition-chain exponentiation
Binary logarithm
Compiler
Computational complexity of mathematical operations
Expand
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
Nikita Ye. Myzdrikov
,
Ivan Ye. Semeonov
,
+5 authors
V. Porksheyan
East-West Design & Test Symposium
2019
Corpus ID: 207902104
This article will consider the probability test of Solovey-Strassen, to determine the simplicity of the number and its possible…
Expand
2015
2015
Exp-HE: a family of fast exponentiation algorithms resistant to SPA, fault, and combined attacks
Carlos Moreno
,
Moaraj Hasan
,
S. Fischmeister
International Conference on Embedded Software
2015
Corpus ID: 2156097
Security and privacy are growing concerns in modern embedded software, given the increasing level of connectivity as well as…
Expand
2014
2014
Real time implementation of Elliptic Curve Cryptography over a open source VoIP server
T. Subashri
,
Arjun A
,
Ashok S
International Conference on Computing…
2014
Corpus ID: 15591228
This paper presents the design and the implementation of Elliptic Curve Cryptography in an Asterisk VoIP server which serves as…
Expand
2013
2013
Rate limiting client puzzle schemes for denial-of-service mitigation
Jing Yang Koh
,
J. Teo
,
D. Niyato
IEEE Wireless Communications and Networking…
2013
Corpus ID: 15856307
Denial-of-service (DoS) attacks are on the rise in recent years and many cryptographic client puzzle schemes have been proposed…
Expand
2012
2012
Design of an 8192-bit RSA cryptoprocessor based on systolic architecture
Claudia Patricia Renteria-Mejia
,
V. Trujillo-Olaya
,
Jaime Velasco-Medina
VIII Southern Conference on Programmable Logic
2012
Corpus ID: 29438911
This paper presents the design of an 8192-bit RSA cryptoprocessor using a radix 2 Montgomery multiplier based on a systolic…
Expand
2005
2005
Architectural Extensions for Elliptic Curve Cryptography over GF ( 2 m )
H. Eberle
,
A. Wander
,
N. Gura
,
She Sun
,
Casey Aveneue
2005
Corpus ID: 8214705
We describe data path extensions for general-purpose microprocessors to accelerate the emerging public-key cryptosystem Elliptic…
Expand
2004
2004
An Improved Algorithm for uP + vQ Using JSF13
B. Kuang
,
Yuefei Zhu
,
YaJuan Zhang
International Conference on Applied Cryptography…
2004
Corpus ID: 39557133
Techniques for fast exponentiation (multiplication) in various groups have been extensively studied for use in cryptographic…
Expand
2002
2002
A Protected Division Algorithm
M. Joye
,
Karine Villegas
Smart Card Research and Advanced Application…
2002
Corpus ID: 16457555
Side-channel analysis is a powerful tool for retrieving secrets embedded in cryptographic devices such as smart cards. Although…
Expand
Highly Cited
2002
Highly Cited
2002
Improved Techniques for Fast Exponentiation
Bodo Möller
International Conference on Information Security…
2002
Corpus ID: 951440
We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the…
Expand
1995
1995
A new systolic architecture for fast exponentiation in GF(2m)
J.-H. Guo
,
C.-L. Wang
1995
Corpus ID: 64783551
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)
ACCEPT & CONTINUE