2006/08/31 by Robert Koenig, Robert König, Barbara M. Terhal · 2 citations
Computer Science · Engineering · Physics and Astronomy · #Chaos-based Image/Signal Encryption #Cryptography and Data Security #Wireless Communication Security Techniques #quant-ph
paper · pdf · doi:10.1109/tit.2007.913245
published as IEEE Trans. Inf. Th., vol. 54, no. 2 (2008) · 13 pages Latex, v3: discussion of independent randomizers added
arxiv created 2006/12/08 · openalex publication_date 2008/01/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y, the output E(X,Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic applications. We prove that certain extractors are suitable for key expansion in the bounded-storage model where the adversary has a limited amount of quantum memory. For extractors with one-bit output we show that the extracted bit is essentially equally secure as in the case where the adversary has classical resources. We prove the security of certain constructions that output multiple bits in the bounded-storage model.