Check that |p - q| > 2^(nlen/2 - 100). // // If p and q are very close to each other, then N=pq can be trivially // factored using Fermat's factorization method. Broken RSA implementations // do generate such keys. See Hanno Böck, Fermat Factorization in the Wild, // https://eprint.iacr.org/2023/026.pdf. diff := bigmod.NewNat() if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q), p); err != nil { // q > p pQ, err := bigmod.NewNat().SetBytes(p.Nat().Bytes(p), q) if err != nil { return errors.New("crypto/rsa:...

SOFTWARE.

================================================================

github.com/lib/pq
https://github.com/lib/pq
----------------------------------------------------------------
Copyright (c) 2011-2013, 'pq' Contributors
Portions Copyright (C) 2011 Blake Mizerany