Abstract
In several cryptographic systems, a fixed element g of a group (generally Z/qZ) is repeatedly raised to many different powers. In this paper we present a practical method of speeding up such systems, using precomputed values to reduce the number of multiplications needed. In practice this provides a substantial improvement over the level of performance that can be obtained using addition chains, and allows the computation of gn for n
Cite
CITATION STYLE
Brickell, E. F., Gordon, D. M., McCurley, K. S., & Wilson, D. B. (1993). Fast exponentiation with precomputation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 200–207). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
