./security/libgfshare, Library to implement Shamirs secret sharing scheme

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 1.0.5, Package name: libgfshare-1.0.5, Maintainer: agc

In simple terms, this package provides a library for implementing the
sharing of secrets and two tools for simple use-cases of the
algorithm. The library implements what is known as Shamir's method
for secret sharing in the Galois Field 2^8. In slightly simpler words,
this is N-of-M secret-sharing byte-by-byte. Essentially this allows
us to split a secret S into any M shares S1..SM such that any N of
those shares can be used to reconstruct S but any less than N shares
yields no information whatsoever.


Required to build:
[pkgtools/cwrappers]

Master sites:

SHA1: 379dd54d198df300ecbd3d848d7e3f092fd60b9f
RMD160: b95284bd5c531de89f7fa07bf5faaa22afc38c52
Filesize: 232.439 KB

Version history: (Expand)


CVS history: (Expand)


   2015-11-04 02:18:12 by Alistair G. Crooks | Files touched by this commit (434)
Log message:
Add SHA512 digests for distfiles for security category

Problems found locating distfiles:
	Package f-prot-antivirus6-fs-bin: missing distfile fp-NetBSD.x86.32-fs-6.2.3.tar.gz
	Package f-prot-antivirus6-ws-bin: missing distfile fp-NetBSD.x86.32-ws-6.2.3.tar.gz
	Package libidea: missing distfile libidea-0.8.2b.tar.gz
	Package openssh: missing distfile openssh-7.1p1-hpn-20150822.diff.bz2
	Package uvscan: missing distfile vlp4510e.tar.Z

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.
   2014-11-02 21:38:16 by Alistair G. Crooks | Files touched by this commit (4) | Imported package
Log message:
Initial import of libgfshare-1.0.5, a library which implements Shamir's
Secret Sharing Scheme, into the packages collection.

	In simple terms, this package provides a library for implementing the
	sharing of secrets and two tools for simple use-cases of the
	algorithm.  The library implements what is known as Shamir's method
	for secret sharing in the Galois Field 2^8.  In slightly simpler words,
	this is N-of-M secret-sharing byte-by-byte.  Essentially this allows
	us to split a secret S into any M shares S1..SM such that any N of
	those shares can be used to reconstruct S but any less than N shares
	yields no information whatsoever.