Open AccessRemarks on the Pocklington and Padró–Sáez cube root algorithm in 𝔽 q
Author(s) -
Heo Geon,
Choi Seokhwan,
Lee Kwang Ho,
Koo Namhun,
Kwon Soonhak
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.1037
Subject(s) - cube root , cube (algebra) , mathematics , algorithm , root (linguistics) , combinatorics , geometry , philosophy , linguistics
A cube root algorithm in q proposed by Pocklington and later rediscovered by Padró and Sáez is clarified and generalised. Some errors in the result of Padró and Sáez are corrected and a full generalisation of their result is given. A comparison of the implementation of the proposed algorithm with the two most popular cube root algorithms is also given, namely the Adleman–Manders–Miller algorithm and the Cipolla–Lehmer algorithm. To the authors’ knowledge, this comparison is the first one which compares three fundamental algorithms together.