precompute

package

v0.0.0-...-e663500 Latest Latest Go to latest Published: Oct 16, 2023 License: MIT Imports: 5 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

func ComputeFromTable(table *PreTable, x, N *big.Int) *big.Int

ComputeFromTable computes g^x mod N with the pre-computation table.

func ComputeFromTableParallel(table *PreTable, x, N *big.Int) *big.Int

ComputeFromTableParallel computes g^x mod N with the pre-computation table in parallel.

func PrintTable(p *PreTable)

PrintTable prints out the table for storage

type PreTable struct {
	// contains filtered or unexported fields
}

PreTable only allows to pre-compute a power of 2 for the base g. base[0] should be g and n[0] is 0. base[i] = g^{2^{n[i]}} mod N

func GenPreTable(base, N *big.Int, bitLen, tableSize int) *PreTable

GenPreTable generates a precomputation table for RSA accumulators

type Table struct {
	// contains filtered or unexported fields
}

Table is the precomputing table

func NewTable(g, n, elementUpperBound *big.Int, numElements uint64, byteChunkSize int) *Table

NewTable creates a new precomputing table

func (t *Table) Compute(x *big.Int, numRoutine int) *big.Int

Compute computes the result of base^x mod n with specified number of goroutines