An efficient algorithm for deciding quadratic residuosity in finite fields \(GF(p^ m)\)
From MaRDI portal
Publication:1822956
DOI10.1016/0020-0190(89)90127-0zbMath0679.68059MaRDI QIDQ1822956
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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
11R09: Polynomials (irreducibility, etc.)
11T55: Arithmetic theory of polynomial rings over finite fields
Related Items
Cites Work