A High-Speed Square Root Algorithm in Extension Fields

DOI10.1007/11927587_10MaRDI QIDQ5385549zbMATH OpenOpenAlexFDO

Authors Hidehiro Katou, Feng Wang, Yasuyuki Nogami, Yoshitaka Morikawa

Publication date 6 May 2008

Published in Information Security and Cryptology – ICISC 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11927587_10

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7688194
• On the computation of square roots in finite fields
• Fast algorithm of square rooting in some finite fields of odd characteristic
• scientific article; zbMATH DE number 2086246
• Taking roots over high extensions of finite fields

Cited in

(7)

• Fast algorithm of square rooting in some finite fields of odd characteristic
• On the computation of square roots in finite fields
• Secure distributed computation of the square root and applications
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
• scientific article; zbMATH DE number 7688194 (Why is no real title available?)
• Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
• Improved generalized Atkin algorithm for computing square roots in finite fields

This page was built for publication: A High-Speed Square Root Algorithm in Extension Fields

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