IMPROVING THE POCKLINGTON AND PADRO-SAEZ CUBE ROOT ALGORITHM

Abstract

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padro-Saez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padro-Saez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of F-q multiplications.