| Title | Semi-Finite Length Analysis for Secure Random Number Generation |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Hayashi, Masahito |
| Conference Name | 2019 IEEE International Symposium on Information Theory (ISIT) |
| Date Published | jul |
| Keywords | asymptotic expansion, cryptography, Distribution functions, Entropy, Human Behavior, imperfect random numbers, Lattices, lower bounds, Metrics, pubcrawl, random key generation, random number generation, Resiliency, Scalability, secure key generation length, secure random number generation, semifinite length analysis, set theory, Solids, STEM, Upper bound, upper bounds |
| Abstract | To discuss secure key generation from imperfect random numbers, we address the secure key generation length. There are several studies for its asymptotic expansion up to the order n or log n. However, these expansions have errors of the order o(n) or o(log n), which does not go to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ranges of these optimal values, whose errors go to zero asymptotically. |
| DOI | 10.1109/ISIT.2019.8849241 |
| Citation Key | hayashi_semi-finite_2019 |
Semi-Finite Length Analysis for Secure Random Number Generation