Note on taking square-roots modulo N

DOI10.1109/18.749034zbMath0945.94017OpenAlexW2114019849MaRDI QIDQ4701338

Klaus Huber, Eric Bach

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

Gauss sumscryptographyfactoringsquare-roots modulo an integer

Mathematics Subject Classification ID

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

Related Items (2)

On taking square roots without quadratic nonresidues over finite fields ⋮ Modular curves over number fields and ECM

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