A refinement of Müller's cube root algorithm

DOI10.1016/j.ffa.2020.101708zbMath1473.11217OpenAlexW3040926342MaRDI QIDQ1994923

Hyang-Sook Lee, Gook Hwa Cho, Soonhak Kwon

Publication date: 18 February 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101708

zbMATH Keywords

finite fieldlinear recurrence relationcube rootCipolla-Lehmer algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
• A Refinement of H. C. Williams' qth Root Algorithm
• Public-key cryptosystems based on cubic finite field extensions
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: A refinement of Müller's cube root algorithm