Adleman-Manders-Miller Root Extraction Method Revisited

DOI10.1007/978-3-642-34704-7_6zbMath1292.94044arXiv1111.4877OpenAlexW1769231392MaRDI QIDQ4899196

Qian Sha, Zhengjun Cao, Xiao Fan

Publication date: 7 January 2013

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.4877

zbMATH Keywords

square root extractionhigher root extraction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (6)

On the Cipolla-Lehmer type algorithms in finite fields ⋮ A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm ⋮ IMPROVING THE POCKLINGTON AND PADRÓ-SÁEZ CUBE ROOT ALGORITHM ⋮ Unnamed Item

This page was built for publication: Adleman-Manders-Miller Root Extraction Method Revisited