rsa

Documentation

Index

• Variables
• func HashToPrime(data []byte) *big.Int
• func NewAccumulator() *accumulator

Variables

var Modulus = func() *big.Int {

	modString := "2519590847565789349402718324004839857142928212620403202777713783604366202070759555626401852588078" +
		"4406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971" +
		"8246911650776133798590957000973304597488084284017974291006424586918171951187461215151726546322822168699875" +
		"4918242243363725908514186546204357679842338718477444792073993423658482382428119816381501067481045166037730" +
		"6056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467" +
		"962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357"

	m, ok := new(big.Int).SetString(modString, 10)
	if !ok {
		log.Debug("error converting modulus to big int")
	}
	return m
}()

Modulus taken from https://en.wikipedia.org/wiki/RSA_numbers#RSA-2048

Functions

func HashToPrime

func HashToPrime(data []byte) *big.Int

HashToPrime takes some data and maps that data to a prime number

func NewAccumulator

func NewAccumulator() *accumulator

NewAccumulator returns an initialised rsa accumulator