Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Modular square root"”.

  1. A Transparent Square Root Algorithm to Beat Brute Force for Sufficiently Large Primes of the Form p = 4n + 1

    Finding square roots in the modular integers is a well known problem that is the basis for many modern cryptosystems. For primes of the form p=4n+3, given C\in\mathbb Z_p^\times , finding solutions to x^2\equiv C \pmod{p} is deterministic. For primes of the form p=4n+1, no known deterministic …

    rit Repository record for A Transparent Square Root Algorithm to Beat Brute Force for Sufficiently Large Primes of the Form p = 4n + 1 (opens in a new tab)