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

DOI10.4134/BKMS.B160769zbMATH Open1446.11217OpenAlexW2936164445MaRDI QIDQ4968635FDOQ4968635

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

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}\)

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Taking cube roots in \(\mathbb Z_{m}\)
• Adleman-Manders-Miller root extraction method revisited

Cited In (6)

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

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)