diff options
| author | Jack Lloyd <[email protected]> | 2020-11-09 08:22:25 -0500 |
|---|---|---|
| committer | Jack Lloyd <[email protected]> | 2020-11-09 08:34:15 -0500 |
| commit | ea28fa55ec56960f1764c6a5d93cbb7d7b922dfc (patch) | |
| tree | c4e1a5d686b32adb3a55817e869ddd44f3ed3c22 /src/lib/pubkey/pubkey.h | |
| parent | f217efa8fc2ae240856a11bc8b95062cb2e8333e (diff) | |
Avoid a long loop in modular square root with certain composite moduli
There are certain composite integers where it is very hard to find a quadratic
non-residue. In that case our loop to find such a non-residue might take a long
time. Bail out after 256 attempts since in principle for a prime modulus we
expect at most 2 tries to find a non-residue.
Diffstat (limited to 'src/lib/pubkey/pubkey.h')
0 files changed, 0 insertions, 0 deletions