Extraction of random bits for cryptographic purposes

Rok, strany: 2002, 91 - 107

Extraction of randomness from random binary sources is considered for cryptographic purposes. A quality measure is suggested for comparison of the performance of extractors. Practical problems are pointed out with the accuracy of entropy estimation, which estimate is a basic input parameter of extractors. Deterministic hashing as an extractor is shown to be effective on average, where the average is taken over all input distributions. Example designs are also presented.

ISO 690:

Vajda, I. 2002. Extraction of random bits for cryptographic purposes. In Tatra Mountains Mathematical Publications, vol. 25, no.3, pp. 91-107. 1210-3195.

APA:

Vajda, I. (2002). Extraction of random bits for cryptographic purposes. Tatra Mountains Mathematical Publications, 25(3), 91-107. 1210-3195.