swu

README

SWU

Shallue-Woestijne-Ulas algorithm implementation in Go

Documentation

Index

• Variables
• func HashToPoint(data []byte) (x, y *big.Int)
• type GF
  • func (g *GF) Add(a, b *big.Int) *big.Int
  • func (g *GF) Cube(a *big.Int) *big.Int
  • func (g *GF) Div(a, b *big.Int) *big.Int
  • func (g *GF) Inv(a *big.Int) *big.Int
  • func (g *GF) Mul(a, b *big.Int) *big.Int
  • func (g *GF) Neg(a *big.Int) *big.Int
  • func (g *GF) Pow(a, b *big.Int) *big.Int
  • func (g *GF) Square(a *big.Int) *big.Int
  • func (g *GF) Sub(a, b *big.Int) *big.Int

Variables

var (
	One   = big.NewInt(1)
	Two   = big.NewInt(2)
	Three = big.NewInt(3)
	Four  = big.NewInt(4)
)

var (
	F = &GF{p}
)

Functions

func HashToPoint

func HashToPoint(data []byte) (x, y *big.Int)

Types

type GF

type GF struct {
	P *big.Int
}

func (*GF) Add

func (g *GF) Add(a, b *big.Int) *big.Int

func (*GF) Cube

func (g *GF) Cube(a *big.Int) *big.Int

func (*GF) Div

func (g *GF) Div(a, b *big.Int) *big.Int

func (*GF) Inv

func (g *GF) Inv(a *big.Int) *big.Int

func (*GF) Mul

func (g *GF) Mul(a, b *big.Int) *big.Int

func (*GF) Neg

func (g *GF) Neg(a *big.Int) *big.Int

func (*GF) Pow

func (g *GF) Pow(a, b *big.Int) *big.Int

func (*GF) Square

func (g *GF) Square(a *big.Int) *big.Int

func (*GF) Sub

func (g *GF) Sub(a, b *big.Int) *big.Int