Documentation ¶
Overview ¶
Package math provides some utility functions for big integers.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func OmegaNAF ¶
OmegaNAF obtains the window-w Non-Adjacent Form of a positive number n and 1 < w < 32. The returned slice L holds n = sum( L[i]*2^i ).
Reference:
- Alg.9 "Efficient arithmetic on Koblitz curves" by Solinas. http://doi.org/10.1023/A:1008306223194
func SignedDigit ¶
SignedDigit obtains the signed-digit recoding of n and returns a list L of digits such that n = sum( L[i]*2^(i*(w-1)) ), and each L[i] is an odd number in the set {±1, ±3, ..., ±2^(w-1)-1}. The third parameter ensures that the output has ceil(l/(w-1)) digits.
Restrictions:
- n is odd and n > 0.
- 1 < w < 32.
- l >= bit length of n.
References:
- Alg.6 in "Exponent Recoding and Regular Exponentiation Algorithms" by Joye-Tunstall. http://doi.org/10.1007/978-3-642-02384-2_21
- Alg.6 in "Selecting Elliptic Curves for Cryptography: An Efficiency and Security Analysis" by Bos et al. http://doi.org/10.1007/s13389-015-0097-y
Types ¶
This section is empty.
Directories ¶
Path | Synopsis |
---|---|
Package fp25519 provides prime field arithmetic over GF(2^255-19).
|
Package fp25519 provides prime field arithmetic over GF(2^255-19). |
Package fp448 provides prime field arithmetic over GF(2^448-2^224-1).
|
Package fp448 provides prime field arithmetic over GF(2^448-2^224-1). |
Package mlsbset provides a constant-time exponentiation method with precomputation.
|
Package mlsbset provides a constant-time exponentiation method with precomputation. |
Click to show internal directories.
Click to hide internal directories.