Abstract
In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and Padró-Sáez algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and Padró-Sáez algorithm by using a smaller base for exponentiation. Our method can reduce the average number of Fq multiplications.
Original language | English |
---|---|
Pages (from-to) | 277-283 |
Number of pages | 7 |
Journal | Bulletin of the Korean Mathematical Society |
Volume | 56 |
Issue number | 2 |
DOIs | |
State | Published - 2019 |
Bibliographical note
Publisher Copyright:© 2019 Korean Mathematical Society.
Keywords
- Adleman-Manders-Miller algorithm
- Cipolla-Lehmer algorithm
- Cube root algorithm
- Finite field
- Pocklington algorithm