Formulas for cube roots in F₃^m using shifted polynomial basis

DOI10.1016/J.IPL.2014.01.001MaRDI QIDQ2446580zbMATH OpenOpenAlexFDO

Authors Young In Cho, Nam Su Chang, Seokhie Hong

Publication date 17 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2014.01.001

zbMATH Keywords

cryptographycube rootsfinite field arithmeticshifted polynomial basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Formulas for cube roots in \(\mathbb F_{3^m}\)
• Finite field basis conversion and normal basis in characteristic three
• Efficient \(p\)th root computations in finite fields of characteristic \(p\)
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Improving the Pocklington and Padró-Sáez cube root algorithm

Cites work

• Advances in Cryptology - ASIACRYPT 2003
• Algorithms and Arithmetic Operators for Computing the ηT Pairing in Characteristic Three
• Efficient algorithms for pairing-based cryptosystems
• Efficient pairing computation on supersingular abelian varieties
• Formulas for cube roots in \(\mathbb F_{3^m}\)

Cited in

(3)

• Efficient \(p\)th root computations in finite fields of characteristic \(p\)
• Remarks on Heron's cubic root iteration formula
• Formulas for cube roots in \(\mathbb F_{3^m}\)

This page was built for publication: Formulas for cube roots in \(\mathbb F_{3^m}\) using shifted polynomial basis

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