Uniform Random Number Generation from Markov Chains: Non-Asymptotic and
Asymptotic Analyses

v1v2 (latest)

Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses

15 March 2015

Masahito Hayashi

ArXiv (abs)PDF HTML

Papers citing "Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses"

9 / 9 papers shown

Title
Recommendations on Statistical Randomness Test Batteries for Cryptographic Purposes E. A. Luengo Luis Javier García Villalba 31 19 0 03 Feb 2024
Geometric Aspects of Data-Processing of Markov Chains Geoffrey Wolfer S. Watanabe 19 3 0 09 Mar 2022
Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification Yunyi Shen Li Gao Hao-Chung Cheng 42 19 0 23 Feb 2022
Secure list decoding and its application to bit-string commitment Masahito Hayashi 23 4 0 22 Mar 2021
Semi-Finite Length Analysis for Information Theoretic Tasks Masahito Hayashi 17 5 0 01 Nov 2018
Analysis of Remaining Uncertainties and Exponents under Various Conditional Rényi Entropies Vincent Y. F. Tan Masahito Hayashi 42 16 0 31 May 2016
Finite-Block-Length Analysis in Classical and Quantum Information Theory Masahito Hayashi 28 9 0 10 May 2016
More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function Masahito Hayashi T. Tsurumaru 89 91 0 21 Nov 2013
Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2 Masahito Hayashi 126 33 0 06 Sep 2013