crypto/internal/fips140/bigmod.Modulus.Nat (method)
26 uses
crypto/internal/fips140/bigmod (current package)
nat.go#L298: minusOne := m.Nat()
nat.go#L593: func (m *Modulus) Nat() *Nat {
crypto/internal/fips140/rsa
keygen.go#L45: if Q.Nat().ExpandFor(P).Equal(P.Nat()) == 1 {
keygen.go#L117: a, b := p.Nat().SubOne(p), q.Nat().SubOne(q)
keygen.go#L321: if wm.Nat().IsOdd() == 0 {
keygen.go#L327: wMinus1 := mr.w.Nat().SubOne(mr.w)
rsa.go#L73: pMinusOne := p.Nat().SubOne(p)
rsa.go#L80: qMinusOne := q.Nat().SubOne(q)
rsa.go#L89: if p.Nat().IsOdd() == 0 {
rsa.go#L93: pMinusTwo := p.Nat().SubOne(p).SubOne(p).Bytes(p)
rsa.go#L94: qInv := bigmod.NewNat().Mod(q.Nat(), p)
rsa.go#L176: N = priv.pub.N.Nat().Bytes(priv.pub.N)
rsa.go#L182: P = priv.p.Nat().Bytes(priv.p)
rsa.go#L183: Q = priv.q.Nat().Bytes(priv.q)
rsa.go#L218: if _, err := pN.SetBytes(p.Nat().Bytes(p), N); err != nil {
rsa.go#L222: if _, err := qN.SetBytes(q.Nat().Bytes(q), N); err != nil {
rsa.go#L238: pMinus1, err := bigmod.NewModulus(p.Nat().SubOne(p).Bytes(p))
rsa.go#L253: qMinus1, err := bigmod.NewModulus(q.Nat().SubOne(q).Bytes(q))
rsa.go#L268: qP, err := bigmod.NewNat().SetOverflowingBytes(q.Nat().Bytes(q), p)
rsa.go#L271: qP = bigmod.NewNat().Mod(q.Nat(), p)
rsa.go#L284: if qP, err := bigmod.NewNat().SetBytes(q.Nat().Bytes(q), p); err != nil {
rsa.go#L286: pQ, err := bigmod.NewNat().SetBytes(p.Nat().Bytes(p), q)
rsa.go#L341: if pub.N.Nat().IsOdd() == 0 {
rsa.go#L446: m.ExpandFor(N).Mul(t0.Mod(Q.Nat(), N), N)