haskell-secret-sharing 1.0.1.2-3build1 source package in Ubuntu

Changelog

haskell-secret-sharing (1.0.1.2-3build1) oracular; urgency=medium

  * Rebuild against new GHC ABIs.

 -- Gianfranco Costamagna <email address hidden>  Wed, 15 May 2024 13:49:11 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Oracular
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe misc

Downloads

File Size SHA-256 Checksum
haskell-secret-sharing_1.0.1.2.orig.tar.gz 13.6 KiB 095966c90276cebcd55dbe535bfee9513bf47ca489841cfa9240c5a8feb2c524
haskell-secret-sharing_1.0.1.2-3build1.debian.tar.xz 2.7 KiB 8575717800a682d8153e84e89116691f092a992b368199526bdbb1972170a13c
haskell-secret-sharing_1.0.1.2-3build1.dsc 2.8 KiB 4257509b1419bcbba78d35118c07d6c20e8496faad2426c570bb6cf66a8e9d63

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.