Foreman, Cameron;
Yeung, Richie;
Edgington, Alec;
Curchod, Florian J;
(2025)
Cryptomite: A versatile and user-friendly library of randomness extractors.
Quantum
, 9
, Article 1584. 10.22331/q-2025-01-08-1584.
Preview |
Text
q-2025-01-08-1584.pdf - Published Version Download (1MB) | Preview |
Abstract
We present Cryptomite , a Python library of randomness extractor implementations. The library offers a range of two-source, seeded and deterministic randomness extractors, together with parameter calculation modules, making it easy to use and suitable for a variety of applications. We also present theoretical results, including new extractor constructions and improvements to existing extractor parameters. The extractor implementations are efficient in practice and tolerate input sizes of up to 2 40 > 10 12 bits. Contrary to alternatives using the fast Fourier transform, we implement convolutions efficiently using the number-theoretic transform to avoid rounding errors, making them well suited to cryptography. The algorithms and parameter calculation are described in detail, including illustrative code examples and performance benchmarking.
| Type: | Article |
|---|---|
| Title: | Cryptomite: A versatile and user-friendly library of randomness extractors |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.22331/q-2025-01-08-1584 |
| Publisher version: | https://doi.org/10.22331/q-2025-01-08-1584 |
| Language: | English |
| Additional information: | This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license (https://creativecommons.org/licenses/by/4.0/). Copyright remains with the original copyright holders such as the authors or their institutions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10207581 |
Archive Staff Only
 |
View Item |
