*   Fixes a division by 0 in `Conv2DBackpropInput`
    ([CVE-2021-29525](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29525))
*   Fixes a division by 0 in `Conv2D`
    ([CVE-2021-29526](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29526))
*   Fixes a division by 0 in `QuantizedConv2D`
    ([CVE-2021-29527](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2021-29527))
*   Fixes a division by 0 in `QuantizedMul`

the CRT for private operations and because // we use constant time windowed exponentiation. On the other hand, it // requires computing a GCD of two values that are not coprime, and then // a division, both complex variable-time operations. λ, err := totient(P, Q) if err == errDivisorTooLarge { // The divisor is too large, try again with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This...

the CRT for private operations and because // we use constant time windowed exponentiation. On the other hand, it // requires computing a GCD of two values that are not coprime, and then // a division, both complex variable-time operations. λ, err := totient(P, Q) if err == errDivisorTooLarge { // The divisor is too large, try again with different primes. continue } if err != nil { return nil, err } e := bigmod.NewNat().SetUint(65537) d, ok := bigmod.NewNat().InverseVarTime(e, λ) if !ok { // This...