module gorm.io/gorm/tests

go 1.24.0

require (
	github.com/google/uuid v1.6.0
	github.com/jinzhu/now v1.1.5
	github.com/lib/pq v1.10.9
	github.com/stretchr/testify v1.11.1
	gorm.io/driver/gaussdb v0.1.0
	gorm.io/driver/mysql v1.6.0
	gorm.io/driver/postgres v1.6.0
	gorm.io/driver/sqlite v1.6.0
	gorm.io/driver/sqlserver v1.6.1
	gorm.io/gorm v1.31.0
)

require (
	filippo.io/edwards25519 v1.1.0 // indirect

 * is not guaranteed to traverse the elements of the MonitorBasedPriorityBlockingQueue in
 * any particular order. If you need ordered traversal, consider using {@code
 * Arrays.sort(pq.toArray())}. Also, method {@code drainTo} can be used to remove some or
 * all elements in priority order and place them in another collection.
 *

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:...