We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Generalized Elias schemes for efficient harvesting of truly random bits.
- Authors
Bernardini, Riccardo; Rinaldo, Roberto
- Abstract
The problem of generating a sequence of true random bits (suitable for cryptographic applications) from random discrete or analog sources is considered. A generalized version, including vector quantization, of the classical approach by Elias for the generation of truly random bits is introduced, and its performance is analyzed, both in the finite case and asymptotically. The theory allows us to provide an alternative proof of the optimality of the original Elias' scheme. We also consider the problem of deriving random bits from measurements of a Poisson process and from vectors of iid Gaussian variables. The comparison with the scheme of Elias, applied to geometric-like non-binary vectors, originally based on the iso-probability property of permutations of iid variables, confirms the potential of the generalized scheme proposed in our work.
- Subjects
ELIAS (Information retrieval system); CRYPTOGRAPHY; RANDOM numbers; HARVESTING software; VECTOR quantization; PERMUTATIONS
- Publication
International Journal of Information Security, 2018, Vol 17, Issue 1, p67
- ISSN
1615-5262
- Publication type
Article
- DOI
10.1007/s10207-016-0358-5