type crypto/internal/fips140/bigmod.Nat
104 uses
crypto/internal/fips140/bigmod (current package)
nat.go#L57: type Nat struct {
nat.go#L71: func NewNat() *Nat {
nat.go#L73: return &Nat{limbs}
nat.go#L77: func (x *Nat) expand(n int) *Nat {
nat.go#L94: func (x *Nat) reset(n int) *Nat {
nat.go#L109: func (x *Nat) resetToBytes(b []byte) *Nat {
nat.go#L118: func (x *Nat) trim() *Nat {
nat.go#L131: func (x *Nat) set(y *Nat) *Nat {
nat.go#L140: func (x *Nat) Bits() []uint {
nat.go#L148: func (x *Nat) Bytes(m *Modulus) []byte {
nat.go#L173: func (x *Nat) SetBytes(b []byte, m *Modulus) (*Nat, error) {
nat.go#L189: func (x *Nat) SetOverflowingBytes(b []byte, m *Modulus) (*Nat, error) {
nat.go#L213: func (x *Nat) setBytes(b []byte) error {
nat.go#L233: func (x *Nat) SetUint(y uint) *Nat {
nat.go#L244: func (x *Nat) Equal(y *Nat) choice {
nat.go#L260: func (x *Nat) IsZero() choice {
nat.go#L275: func (x *Nat) IsOne() choice {
nat.go#L297: func (x *Nat) IsMinusOne(m *Modulus) choice {
nat.go#L304: func (x *Nat) IsOdd() choice {
nat.go#L312: func (x *Nat) TrailingZeroBitsVarTime() uint {
nat.go#L331: func (x *Nat) cmpGeq(y *Nat) choice {
nat.go#L351: func (x *Nat) assign(on choice, y *Nat) *Nat {
nat.go#L369: func (x *Nat) add(y *Nat) (c uint) {
nat.go#L386: func (x *Nat) sub(y *Nat) (c uint) {
nat.go#L403: func (x *Nat) ShiftRightVarTime(n uint) *Nat {
nat.go#L435: func (x *Nat) BitLenVarTime() int {
nat.go#L471: nat *Nat
nat.go#L476: rr *Nat // R*R for montgomeryRepresentation
nat.go#L480: func rr(m *Modulus) *Nat {
nat.go#L569: func newModulus(n *Nat) (*Modulus, error) {
nat.go#L593: func (m *Modulus) Nat() *Nat {
nat.go#L606: func (x *Nat) shiftIn(y uint, m *Modulus) *Nat {
nat.go#L647: func (out *Nat) Mod(x *Nat, m *Modulus) *Nat {
nat.go#L676: func (x *Nat) ExpandFor(m *Modulus) *Nat {
nat.go#L683: func (out *Nat) resetFor(m *Modulus) *Nat {
nat.go#L698: func (x *Nat) maybeSubtractModulus(always choice, m *Modulus) {
nat.go#L713: func (x *Nat) Sub(y *Nat, m *Modulus) *Nat {
nat.go#L725: func (x *Nat) SubOne(m *Modulus) *Nat {
nat.go#L739: func (x *Nat) Add(y *Nat, m *Modulus) *Nat {
nat.go#L752: func (x *Nat) montgomeryRepresentation(m *Modulus) *Nat {
nat.go#L762: func (x *Nat) montgomeryReduction(m *Modulus) *Nat {
nat.go#L778: func (x *Nat) montgomeryMul(a *Nat, b *Nat, m *Modulus) *Nat {
nat.go#L923: func (x *Nat) Mul(y *Nat, m *Modulus) *Nat {
nat.go#L950: return x.Mod(&Nat{limbs: T}, m)
nat.go#L960: return x.Mod(&Nat{limbs: T}, m)
nat.go#L967: return x.Mod(&Nat{limbs: T}, m)
nat.go#L974: return x.Mod(&Nat{limbs: T}, m)
nat.go#L986: func (out *Nat) Exp(x *Nat, e []byte, m *Modulus) *Nat {
nat.go#L996: table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1)
nat.go#L1041: func (out *Nat) ExpShortVarTime(x *Nat, e uint, m *Modulus) *Nat {
nat.go#L1067: func (x *Nat) InverseVarTime(a *Nat, m *Modulus) (*Nat, bool) {
nat.go#L1082: func (x *Nat) GCDVarTime(a, b *Nat) (*Nat, error) {
nat.go#L1095: func extendedGCD(a, m *Nat) (u, A *Nat, err error) {
nat.go#L1199: func rshift1(a *Nat, carry uint) {
nat.go#L1218: func (x *Nat) DivShortVarTime(y uint) uint {
crypto/internal/fips140/ecdsa
ecdsa.go#L219: func randomPoint[P Point[P]](c *Curve[P], generate func([]byte) error) (k *bigmod.Nat, p P, err error) {
ecdsa.go#L376: func inverse[P Point[P]](c *Curve[P], kInv, k *bigmod.Nat) {
ecdsa.go#L396: func hashToNat[P Point[P]](c *Curve[P], e *bigmod.Nat, hash []byte) {
crypto/internal/fips140/rsa
rsa.go#L28: d *bigmod.Nat
rsa.go#L38: qInv *bigmod.Nat // qInv = q⁻¹ mod p
rsa.go#L72: func newPrivateKey(n *bigmod.Modulus, e int, d *bigmod.Nat, p, q *bigmod.Modulus) (*PrivateKey, error) {
rsa.go#L421: var m *bigmod.Nat