scientific article; zbMATH DE number 1303185

MaRDI QIDQ4249708zbMATHFDO

Authors Scott Lindhurst

Publication date 31 August 1999

zbMATH Keywords

average time complexityLebesgue's dominated convergence theoremlinear recurrence relationsShanks's algorithmDirichlet's theorem on arithmetic progressions

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• On Shanks' Algorithm for Modular Square Roots
• scientific article; zbMATH DE number 2086246
• Square Roots mod p
• A note on square roots in finite fields

Cited in

(11)

• scientific article; zbMATH DE number 2086246 (Why is no real title available?)
• On Shanks' Algorithm for Modular Square Roots
• Computation and Formal Verification of SRT Quotient and Square Root Digit Selection Tables
• Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• On the computation of square roots in finite fields
• Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm
• scientific article; zbMATH DE number 7688194 (Why is no real title available?)
• Improved generalized Atkin algorithm for computing square roots in finite fields
• Trace expression of \(r\)-th root over finite field
• Square form factorization

This page was built for publication:

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