A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (Q3806810)

From MaRDI portal
Revision as of 10:27, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
scientific article

    Statements

    A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.) (English)
    0 references
    0 references
    1986
    0 references
    finite fields
    0 references
    square roots
    0 references
    random polynomial time algorithm
    0 references
    computational number theory
    0 references
    RP algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references