An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)

DOI10.1016/0020-0190(89)90127-0zbMath0679.68059OpenAlexW1983731997MaRDI QIDQ1822956

Toshiya Itoh, Shigeo Tsujii

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90127-0

zbMATH Keywords

Legendre symbolEuler's criterionquadratic residuacity in finite fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (1)

The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self- similarity.
• Gaussian elimination is not optimal

This page was built for publication: An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)