1# ModExp tests. 2# 3# These test vectors satisfy A ^ E = ModExp (mod M) and 0 <= ModExp < M. 4# Additionally, These test vectors satisfy the following constraints: 5# 6# * 0 <= A < M. 7# * E is odd, and the number of bits in E is in [2, 33]. 8# * M requires at least 4 (64-bit) words to represent. 9# 10# XXX: Unfortunately, the above criteria exclude all BoringSSL test vectors; 11# i.e. none of the BoringSSL test vectors were suitable for testing the 12# variable-time exponentiation used in RSA verification in *ring*. TODO: Make 13# new test vectors. 14