Short polynomial representations for square roots modulo \(p\)

DOI10.1023/A:1021819602497zbMath1023.12002OpenAlexW2143225046MaRDI QIDQ1866025

Simon Joseph Agou, Marc Deléglise, Jean Louis Nicolas

Publication date: 3 April 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021819602497

zbMATH Keywords

finite fieldsShanks algorithmsquare root modulo \(p\)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Related Items (2)

Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions ⋮ Length of polynomials over finite groups

This page was built for publication: Short polynomial representations for square roots modulo \(p\)