期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 62, 期 4, 页码 2213-2232出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2016.2526018
关键词
Privacy amplification; universal hash function; minimum entropy; quantum cryptography
资金
- Grants-in-Aid for Scientific Research [23246071] Funding Source: KAKEN
We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity O(n log n) for input length n. The key idea is the concept of dual universal(2) hash function introduced recently. We also use a new method for constructing extractors by concatenating delta-almost dual universal(2) hash functions with other extractors. Besides minimizing seed lengths, we also introduce methods that allow one to use non-uniform random seeds for extractors. These methods can be applied to a wide class of extractors, including dual universal(2) hash function, as well as to the conventional universal(2) hash functions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据