3326          ; mapped                 ; 30C9 30EB     # 1.1  SQUARE DORU
3327          ; mapped                 ; 30C8 30F3     # 1.1  SQUARE TON
3328          ; mapped                 ; 30CA 30CE     # 1.1  SQUARE NANO
3329          ; mapped                 ; 30CE 30C3 30C8 #1.1  SQUARE NOTTO
332A          ; mapped                 ; 30CF 30A4 30C4 #1.1  SQUARE HAITU

agramesh1, Akimitsu Seo, Alan Mosca, Alex Egg, Alex Rothberg, Alexander
Heinecke, Alexander Matyasko, Alexandr Baranezky, Alexandre Caulier, Ali
Siddiqui, Anand Venkat, Andrew Hundt, Androbin, Anmol Sharma, Arie, Arno Leist,
Arron Cao, AuréLien Geron, Bairen Yi, Beomsu Kim, Carl Thomé, cfperez, Changming
Sun, Corey Wharton, critiqjo, Dalei Li, Daniel Rasmussen, Daniel Trebbien, DaríO

 d does not match dQ") } // 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...

invalid CRT coefficient") } // 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...