Improving the Pocklington and Padró-Sáez cube root algorithm

DOI10.4134/BKMS.B160769MaRDI QIDQ4968635zbMATH OpenOpenAlexFDO

Authors Gook Hwa Cho, Hyang-Sook Lee

Publication date 16 July 2019

Full work available at URL http://koreascience.or.kr:80/article/JAKO201912742274746.pdf

zbMATH Keywords

finite fieldCipolla-Lehmer algorithmAdleman-Manders-Miller algorithmcube root algorithmPocklington algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• New cube root algorithm based on the third order linear recurrence relations in finite fields
• A refinement of Müller's cube root algorithm
• scientific article; zbMATH DE number 2154289
• Fast ideal cubing in imaginary quadratic number and function fields
• Taking cube roots in \(\mathbb Z_{m}\)

Cites work

• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• scientific article; zbMATH DE number 3341170 (Why is no real title available?)
• Adleman-Manders-Miller root extraction method revisited
• Taking cube roots in \(\mathbb Z_{m}\)

Cited in

(6)

• Taking cube roots in \(\mathbb Z_{m}\)
• scientific article; zbMATH DE number 2154289 (Why is no real title available?)
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• A refinement of Müller's cube root algorithm
• Computation of the cubic root of a \(p\)-adic number
• Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Improving the Pocklington and Padró-Sáez cube root algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968635)