Functions — github.com/cloudflare/bn256

CodeHub MCPcopy Create free account

hub / github.com/cloudflare/bn256 / functions

Functions161 in github.com/cloudflare/bn256

⨍ Functions 161◇ Types & classes 9

↓ 64 callersFunctiongfpMul

↓ 44 callersMethodMarshal

↓ 42 callersMethodSub

↓ 34 callersMethodSquare

↓ 33 callersFunctiongfpAdd

↓ 30 callersMethodAdd

Add sets e to a+b and then returns e.

↓ 30 callersMethodMul

See "Multiplication and Squaring in Pairing-Friendly Fields", http://eprint.iacr.org/2006/471.pdf

↓ 25 callersFunctionmontDecode

↓ 22 callersFunctionnewGFp

↓ 21 callersFunctiongfpSub

↓ 21 callersFunctionmontEncode

↓ 20 callersMethodScalarBaseMult

ScalarBaseMult sets e to g*k where g is the generator of the group and then returns e.

↓ 17 callersMethodAdd

↓ 17 callersMethodMul

(a *twistPoint, scalar *big.Int)

↓ 16 callersMethodUnmarshal

Unmarshal sets e to the result of converting the output of Marshal back into a group element and then returns e.

↓ 15 callersMethodMul

↓ 15 callersMethodSub

↓ 14 callersMethodSetOne

↓ 13 callersMethodSet

↓ 12 callersMethodSet

↓ 11 callersMethodAdd

(a, b *twistPoint)

↓ 11 callersMethodConjugate

↓ 11 callersMethodUnmarshal

↓ 10 callersMethodMul

↓ 10 callersFunctiongfpNeg

↓ 9 callersMethodMulXi

MulXi sets e=ξa where ξ=i+3 and then returns e.

↓ 9 callersFunctionPair

Pair calculates an Optimal Ate pairing.

↓ 9 callersMethodScalarMult

ScalarMult sets e to a*k and then returns e.

↓ 9 callersMethodSet

(a *twistPoint)

↓ 9 callersFunctionrandomGF

randomGF returns a random integer between 0 and p-1.

↓ 9 callersFunctiontogfP

togfP converts an integer into a field element (in Montgomery representation). This function assumes the input is between 0 and p-1; otherwise it pani

↓ 8 callersMethodSetZero

↓ 7 callersMethodIsInfinity

↓ 7 callersMethodMulScalar

(a *gfP6, b *gfP2)

↓ 7 callersMethodSet

(a *curvePoint)

↓ 7 callersMethodSet

↓ 6 callersMethodIsZero

↓ 6 callersMethodMulScalar

(a *gfP2, b *gfP)

↓ 6 callersMethodSet

↓ 6 callersFunctiontoBigInt

toBigInt converts a field element into its reduced (mod p) integer representation.

↓ 5 callersMethodAdd

↓ 5 callersMethodExp

(a *gfP12, power *big.Int)

↓ 5 callersMethodFrobenius

↓ 5 callersMethodInvert

↓ 5 callersMethodMakeAffine

↓ 5 callersMethodMulTau

MulTau computes τ·(aτ²+bτ+c) = bτ²+cτ+aξ

↓ 5 callersMethodNeg

Neg sets e to -a and then returns e.

↓ 5 callersFunctionRandomG2

RandomG2 returns x and g₂ˣ where x is a random, non-zero number read from r.

↓ 5 callersMethodSquare

↓ 4 callersMethodDouble

(a *curvePoint)

↓ 4 callersFunctionRandomG1

RandomG1 returns x and g₁ˣ where x is a random, non-zero number read from r.

↓ 4 callersMethodSqrt

↓ 4 callersFunctiongfpCarry

(a *gfP, head uint64)

gfp_generic.go:5

↓ 4 callersFunctionlineFunctionAdd

(r, p *twistPoint, q *curvePoint, r2 *gfP2)

↓ 4 callersFunctionmul

(a, b [4]uint64)

gfp_generic.go:69

↓ 4 callersFunctionmulLine

(ret *gfP12, a, b, c *gfP2)

↓ 4 callersFunctionsign0

↓ 3 callersMethodFrobeniusP2

FrobeniusP2 computes (xτ²+yτ+z)^(p²) = xτ^(2p²) + yτ^(p²) + z

↓ 3 callersMethodIsInfinity

↓ 3 callersMethodMakeAffine

↓ 3 callersMethodSet

Set sets e to a and then returns e.

↓ 3 callersMethodSub

↓ 3 callersFunctionbenchmarkSize

(b *testing.B, size int)

hash_test.go:20

↓ 3 callersFunctionbigFromBase10

↓ 3 callersMethodexp

(f *gfP, bits [4]uint64)

↓ 3 callersFunctionrandomK

↓ 2 callersMethodDouble

(a *twistPoint)

↓ 2 callersFunctionHashG1

HashG1 implements a hashing function into the G1 group. dst represents domain separation tag, similar to salt, for the hash.

↓ 2 callersMethodIsOnCurve

IsOnCurve returns true iff c is on the curve.

↓ 2 callersMethodIsZero

↓ 2 callersMethodMulGFP

(a *gfP6, b *gfP)

↓ 2 callersMethodMulScalar

(a *gfP12, b *gfP6)

↓ 2 callersMethodNeg

↓ 2 callersFunctionRandomGT

RandomGT returns x and e(g₁, g₂)ˣ where x is a random, non-zero number read from r.

↓ 2 callersMethodSetInfinity

↓ 2 callersMethodSetZero

↓ 2 callersMethodSquare

↓ 2 callersMethodString

↓ 2 callersMethodString

↓ 2 callersFunctionfinalExponentiation

finalExponentiation computes the (p¹²-1)/Order-th power of an element of GF(p¹²) to obtain an element of GT (steps 13-15 of algorithm 1 from http://cr

↓ 2 callersFunctiongfP2Decode

↓ 2 callersFunctionlegendre

↓ 2 callersFunctionmiller

miller implements the Miller loop for calculating the Optimal Ate pairing. See algorithm 1 from http://cryptojedi.org/papers/dclxvi-20100714.pdf

↓ 1 callersMethodAdd

(a, b *curvePoint)

↓ 1 callersMethodInvert

↓ 1 callersMethodInvert

↓ 1 callersMethodIsOne

↓ 1 callersMethodIsZero

↓ 1 callersMethodMarshal

Marshal converts e to a byte slice.

↓ 1 callersMethodMarshal

Marshal converts e into a byte slice.

↓ 1 callersMethodNeg

(a *twistPoint)

↓ 1 callersMethodSetOne

↓ 1 callersMethodSetZero

↓ 1 callersFunctionhalfMul

(a, b [4]uint64)

gfp_generic.go:112

↓ 1 callersFunctionhashToBase

hashToBase implements hashing a message to an element of the field. L = ceil((256+128)/8)=48, ctr = 0, i = 1

↓ 1 callersFunctionlineFunctionDouble

(r *twistPoint, q *curvePoint)

↓ 1 callersFunctionmapToCurve

↓ 1 callersFunctionoptimalAte

(a *twistPoint, b *curvePoint)

Add sets e to a+b and then returns e.

Add sets e to a+b and then returns e.

next →1–100 of 161, ranked by callers