AAgC,OAAA,gBAChC,SpEy9QN,SoEv9QQ,WAAA,gBAEF,SpEy9QN,SoEv9QQ,aAAA,gBAEF,SpEy9QN,SoEv9QQ,cAAA,gBAEF,SpEy9QN,SoEv9QQ,YAAA,gBAfF,QAAgC,OAAA,eAChC,SpE4+QN,SoE1+QQ,WAAA,eAEF,SpE4+QN,SoE1+QQ,aAAA,eAEF,SpE4+QN,SoE1+QQ,cAAA,eAEF,SpE4+QN,SoE1+QQ,YAAA,eAfF,QAAgC,OAAA,iBAChC,SpE+/QN,SoE7/QQ,WAAA,iBAEF,SpE+/QN,SoE7/QQ,aAAA,iBAEF,SpE+/QN,SoE7/QQ,cAAA,iBAEF,SpE+/QN,SoE7/QQ,YAAA,iBAfF,QAAgC,OAAA,eAChC,SpEkhRN,SoEhhRQ,WAAA,eAEF,SpEkhRN,SoEhhRQ,aAAA,eAEF,SpEkhRN,SoEhhRQ,cAAA,eAEF,SpEkhRN,SoEhhRQ,YAAA,eAfF,QAAgC,Q...

(and that p < N and q < N). pN := bigmod.NewNat().ExpandFor(N) if _, err := pN.SetBytes(p.Nat().Bytes(p), N); err != nil { return errors.New("crypto/rsa: invalid prime") } qN := bigmod.NewNat().ExpandFor(N) if _, err := qN.SetBytes(q.Nat().Bytes(q), N); err != nil { return errors.New("crypto/rsa: invalid prime") } if pN.Mul(qN, N).IsZero() != 1 { return errors.New("crypto/rsa: p * q != n") } // Check that de ≡ 1 mod p-1, and de ≡ 1 mod q-1. // // This implies that e is coprime to each p-1 as e has...