gogf127

package

v1.2.0 Latest Latest Go to latest Published: Sep 4, 2019 License: GPL-3.0 Imports: 5 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/nspcc-dev/tzhash

Links

Open Source Insights

Documentation ¶

Overview ¶

Package gf127 implements the GF(2^127) arithmetic modulo reduction polynomial x^127 + x^63 + 1 . Implementation is in pure Go.

Index ¶

func Add(a, b, c *GF127)
func And(a, b, c *GF127)
func Inv(a, b *GF127)
func Mul(a, b, c *GF127)
func Mul1(a, b *GF127)
func Mul10(a, b *GF127)
func Mul11(a, b *GF127)
type GF127
- func New(lo, hi uint64) *GF127
- func Random() *GF127

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func Add ¶

func Add(a, b, c *GF127)

Add sets c to a+b.

func And ¶

func And(a, b, c *GF127)

And sets c to a & b (bitwise-and).

func Inv ¶

func Inv(a, b *GF127)

Inv sets b to a^-1 Algorithm is based on Extended Euclidean Algorithm and is described by Hankerson, Hernandez, Menezes in https://link.springer.com/content/pdf/10.1007/3-540-44499-8_1.pdf

func Mul ¶

func Mul(a, b, c *GF127)

Mul sets c to a*b. TODO optimization: no need to perform shift by i every time, cache results

func Mul1 ¶

func Mul1(a, b *GF127)

Mul1 copies a to b.

func Mul10 ¶

func Mul10(a, b *GF127)

Mul10 sets b to a*x.

func Mul11 ¶

func Mul11(a, b *GF127)

Mul11 sets b to a*(x+1).

Types ¶

type GF127 ¶

type GF127 [2]uint64

GF127 represents element of GF(2^127)

func New ¶

func New(lo, hi uint64) *GF127

New constructs new element of GF(2^127) as hi*x^64 + lo. It is assumed that hi has zero MSB.

func Random ¶

func Random() *GF127

Random returns random element from GF(2^127). Is used mostly for testing.

func (*GF127) Add ¶

func (c *GF127) Add(a, b *GF127) *GF127

Add sets c to the sum a+b and returns c.

func (*GF127) ByteArray ¶

func (c *GF127) ByteArray() (buf []byte)

ByteArray represents element of GF(2^127) as byte array of length 16.

func (*GF127) Equals ¶

func (c *GF127) Equals(b *GF127) bool

Equals checks if two reduced (zero MSB) elements of GF(2^127) are equal

func (*GF127) MarshalBinary ¶

func (c *GF127) MarshalBinary() (data []byte, err error)

MarshalBinary implements encoding.BinaryMarshaler.

func (*GF127) Mul ¶

func (c *GF127) Mul(a, b *GF127) *GF127

Mul sets c to the product a*b and returns c.

func (*GF127) String ¶

func (c *GF127) String() string

String returns hex-encoded representation, starting with MSB.

func (*GF127) UnmarshalBinary ¶

func (c *GF127) UnmarshalBinary(data []byte) error

UnmarshalBinary implements encoding.BinaryUnmarshaler.

Source Files ¶

View all Source files

gogf127.go

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL