Taking cube roots in \(\mathbb Z_{m}\)

DOI10.1016/S0893-9659(02)00031-9zbMath1027.11094OpenAlexW1969847147MaRDI QIDQ1614110

Germán Sáez, Carles Padró

Publication date: 3 September 2002

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(02)00031-9

zbMATH Keywords

cube rootPeralta algorithmTonelli-Shanks algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (5)

On the Cipolla-Lehmer type algorithms in finite fields ⋮ Unnamed Item ⋮ IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM ⋮ A new algorithm to search for small nonzero |𝑥³-𝑦²| values ⋮ Taking roots over high extensions of finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• The Lattice Point Covering Theorem for Rectangles

This page was built for publication: Taking cube roots in \(\mathbb Z_{m}\)