A Survey of Fast Exponentiation Methods
β Scribed by Daniel M. Gordon
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 194 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
β¦ Synopsis
Public-key cryptographic systems often involve raising elements of some group (e.g., GF 2 n , Z/NZ, or elliptic curves) to large powers. An important question is how fast this exponentiation can be done, which often determines whether a given system is practical. The best method for exponentiation depends strongly on the group being used, the hardware the system is implemented on, and whether one element is being raised repeatedly to different powers, different elements are raised to a fixed power, or both powers and group elements vary.
This problem has received much attention, but the results are scattered through the literature. In this paper we survey the known methods for fast exponentiation, examining their relative strengths and weaknesses.
π SIMILAR VOLUMES
In this article, we provide an overview of the case adaptation process. We classify various existing case adaptation methods available in the literature. We consider three different aspects, namely, domain knowledge requirement, adaptive capabilities of the case adaptation methods, and the kind of a
## Abstract Authorship attribution supported by statistical or computational methods has a long history starting from the 19th century and is marked by the seminal study of Mosteller and Wallace (1964) on the authorship of the disputed βFederalist Papers.β During the last decade, this scientific fi
The knowledge of the 10 inertia parameters mass, centre of gravity and inertia tensor (moments and products of inertia) of mechanical systems is of great interest whenever the dynamic behaviour is signi"cantly governed by these parameters. In this paper, a survey of currently available inertia param