haskell-secret-sharing 1.0.0.3-3build8 source package in Ubuntu

Changelog

haskell-secret-sharing (1.0.0.3-3build8) bionic; urgency=medium

  * Rebuild against new GHC ABI.

 -- Gianfranco Costamagna <email address hidden>  Sat, 25 Nov 2017 20:11:52 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release universe misc

Downloads

File Size SHA-256 Checksum
haskell-secret-sharing_1.0.0.3.orig.tar.gz 13.0 KiB 62af2ba181d30e6d6c6cfd01f83a5082b6bc378a745c90497cff42ebea2b6160
haskell-secret-sharing_1.0.0.3-3build8.debian.tar.xz 2.6 KiB 17ecaf27b6ed64f870ac5640838b8c91b515987651b98f0e27f0d995d6d733b6
haskell-secret-sharing_1.0.0.3-3build8.dsc 2.8 KiB 812b5d0de6be718cf549be637d0ac55a444971dc91510e9103609439b633019b

Available diffs

View changes file

Binary packages built by this source

libghc-secret-sharing-dev: (m, n)-threshold secret sharing scheme

 This library implements the secret sharing method described by Adi
 Shamir, "How to Share a Secret", Communications of the ACM 22 (11):
 612–613, 1979.
 .
 Given a bytestring and integers n and m, produces n strings, any m of
 which are sufficient to reconstruct the original bytestring.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-secret-sharing-doc: (m, n)-threshold secret sharing scheme; documentation

 This library implements the secret sharing method described by Adi
 Shamir, "How to Share a Secret", Communications of the ACM 22 (11):
 612–613, 1979.
 .
 Given a bytestring and integers n and m, produces n strings, any m of
 which are sufficient to reconstruct the original bytestring.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-secret-sharing-prof: (m, n)-threshold secret sharing scheme; profiling libraries

 This library implements the secret sharing method described by Adi
 Shamir, "How to Share a Secret", Communications of the ACM 22 (11):
 612–613, 1979.
 .
 Given a bytestring and integers n and m, produces n strings, any m of
 which are sufficient to reconstruct the original bytestring.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.