Documentation
¶
Index ¶
- type Modulus
- type Nat
- func (x *Nat) Add(y *Nat, m *Modulus) *Nat
- func (x *Nat) Bytes(m *Modulus) []byte
- func (x *Nat) Equal(y *Nat) choice
- func (out *Nat) Exp(x *Nat, e []byte, m *Modulus) *Nat
- func (out *Nat) ExpShort(x *Nat, e uint, m *Modulus) *Nat
- func (x *Nat) ExpandFor(m *Modulus) *Nat
- func (x *Nat) IsZero() choice
- func (out *Nat) Mod(x *Nat, m *Modulus) *Nat
- func (x *Nat) Mul(y *Nat, m *Modulus) *Nat
- func (x *Nat) SetBytes(b []byte, m *Modulus) (*Nat, error)
- func (x *Nat) SetOverflowingBytes(b []byte, m *Modulus) (*Nat, error)
- func (x *Nat) Sub(y *Nat, m *Modulus) *Nat
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Modulus ¶
type Modulus struct {
// contains filtered or unexported fields
}
Modulus is used for modular arithmetic, precomputing relevant constants.
Moduli are assumed to be odd numbers. Moduli can also leak the exact number of bits needed to store their value, and are stored without padding.
Their actual value is still kept secret.
func NewModulusFromBig ¶
NewModulusFromBig creates a new Modulus from a big.Int.
The Int must be odd. The number of significant bits (and nothing else) is leaked through timing side-channels.
type Nat ¶
type Nat struct {
// contains filtered or unexported fields
}
Nat represents an arbitrary natural number
Each Nat has an announced length, which is the number of limbs it has stored. Operations on this number are allowed to leak this length, but will not leak any information about the values contained in those limbs.
func NewNat ¶
func NewNat() *Nat
NewNat returns a new nat with a size of zero, just like new(Nat), but with the preallocated capacity to hold a number of up to preallocTarget bits. NewNat inlines, so the allocation can live on the stack.
func (*Nat) Add ¶
Add computes x = x + y mod m.
The length of both operands must be the same as the modulus. Both operands must already be reduced modulo m.
func (*Nat) Bytes ¶
Bytes returns x as a zero-extended big-endian byte slice. The size of the slice will match the size of m.
x must have the same size as m and it must be reduced modulo m.
func (*Nat) Equal ¶
Equal returns 1 if x == y, and 0 otherwise.
Both operands must have the same announced length.
func (*Nat) Exp ¶
Exp calculates out = x^e mod m.
The exponent e is represented in big-endian order. The output will be resized to the size of m and overwritten. x must already be reduced modulo m.
func (*Nat) ExpShort ¶
ExpShort calculates out = x^e mod m.
The output will be resized to the size of m and overwritten. x must already be reduced modulo m. This leaks the exact bit size of the exponent.
func (*Nat) ExpandFor ¶
ExpandFor ensures x has the right size to work with operations modulo m.
The announced size of x must be smaller than or equal to that of m.
func (*Nat) Mod ¶
Mod calculates out = x mod m.
This works regardless how large the value of x is.
The output will be resized to the size of m and overwritten.
func (*Nat) Mul ¶
Mul calculates x = x * y mod m.
The length of both operands must be the same as the modulus. Both operands must already be reduced modulo m.
func (*Nat) SetBytes ¶
SetBytes assigns x = b, where b is a slice of big-endian bytes. SetBytes returns an error if b >= m.
The output will be resized to the size of m and overwritten.
func (*Nat) SetOverflowingBytes ¶
SetOverflowingBytes assigns x = b, where b is a slice of big-endian bytes. SetOverflowingBytes returns an error if b has a longer bit length than m, but reduces overflowing values up to 2^⌈log2(m)⌉ - 1.
The output will be resized to the size of m and overwritten.
Source Files