haskell-secret-sharing 1.0.1.0-1 source package in Ubuntu
Changelog
haskell-secret-sharing (1.0.1.0-1) unstable; urgency=medium
* New upstream release.
* Refresh missing-test-suite-deps.patch.
* Drop enable-datakinds.patch.
Applied upstream.
-- Sean Whitton <email address hidden> Mon, 17 Feb 2020 09:12:13 -0700
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-secret-sharing_1.0.1.0-1.dsc | 2.7 KiB | c5cce7664faa88103ed43ee45ec4f0bcfa116e686b05e68d0b909e9b390a0bbb |
| haskell-secret-sharing_1.0.1.0.orig.tar.gz | 13.3 KiB | fbfeb43fb44eeb7d917af548dea700da8230680c03a19ca8c32cb239c9ef449a |
| haskell-secret-sharing_1.0.1.0-1.debian.tar.xz | 2.7 KiB | 45b89800162f34958c17dc84c6afae593d98076dcf96b51a5304c1259fc91468 |
Available diffs
No changes file available.
Binary packages built by this source
- libghc-secret-sharing-dev: No summary available for libghc-secret-sharing-dev in ubuntu groovy.
No description available for libghc-
secret- sharing- dev in ubuntu groovy.
- 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.
