mirror of
https://github.com/Mbed-TLS/mbedtls.git
synced 2025-10-27 12:15:33 +03:00
In the next refactoring we'll have: - pretty different paths for N odd or even, - possibly different paths for A <= 0, in [0, N) or above, - possibly special cases when A % N is 0 or 1. Pick two small moduli of different parities (3 and 4) and go over the range [-(N+1), 2N-1] with A. This should ensure we naturally run into all special cases. Signed-off-by: Manuel Pégourié-Gonnard <manuel.pegourie-gonnard@arm.com>