Note on taking square-roots modulo N

DOI10.1109/18.749034MaRDI QIDQ4701338zbMATH OpenOpenAlexFDO

Authors Eric Bach, Klaus Huber

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.749034

zbMATH Keywords

cryptographyfactoringGauss sumssquare-roots modulo an integer

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 167875
• Continuity properties of projection operators
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• Square Roots mod p

Cited in

(5)

• Modular curves over number fields and ECM
• Continuity properties of projection operators
• On taking square roots without quadratic nonresidues over finite fields. With an Appendix by Lawrence C. Washington
• A note on the sequence \((\frac{p-1}{2})! \mod p\)
• scientific article; zbMATH DE number 167875 (Why is no real title available?)

This page was built for publication: Note on taking square-roots modulo N

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