CFF

README

Cover-Free Family

An implementation of the Cover-Free Family from [PWX03]

Reference

[PWX03] Josef Pieprzyk, Huaxiong Wang, and Chaoping Xing. Multiple-time signature schemes against adaptive chosen message attacks. In International Workshop on Selected Areas in Cryptography, pages 88–100. Springer, 2003.

Documentation

Index

• type CFF
  • func NewCFF(a uint8, k, d, irre uint64) (*CFF, error)
  • func (c *CFF) FindBSet(b string) ([]*CFFBSetElement, error)
• type CFFBSetElement
  • func (e *CFFBSetElement) String() string

Types

type CFF

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

d-CFF((dk+1)q, q^(k+1)) w-CFF(m, 2^n) assume that q=2^a, a<64 w = d m = (dk+1)q n = a(k+1) k: highest degree of polynomial f over F_q X: F_{dk+1} x F_q B_f: {(x, f(x))} \cal{B}: {B_f} where f's degree is equal or less than k

func NewCFF

func NewCFF(a uint8, k, d, irre uint64) (*CFF, error)

generate a CFF instance

func (*CFF) FindBSet

func (c *CFF) FindBSet(b string) ([]*CFFBSetElement, error)

b: binary string with a specific length

type CFFBSetElement

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

(x, f(x)) x\in F_q

func (*CFFBSetElement) String

func (e *CFFBSetElement) String() string

convert a CFFBSetElement to a 128-bit string