Earticle

초록

영어

Hagerty and Draper [3] presented a theoretical result that explains the probabilistic back- ground of the NIST's entropy test at the random bit generation workshop in 2012. They introduced the notion of an entropic statistic and desired to bound the entropy rate of an unknown output distribution of a given entropy source. However there has been no detailed derivation process about the upper bound, while the theoretical steps of obtaining the lower bound are well described. In this paper we give an elaborate mathematical analysis to obtain the upper bound for the collision statistic. We also present an extended simulation results to investigate practical usefulness of the entropy bounds.

목차

Abstract
 1 Introduction
 2 Entropy and Entropic Statistics
 3 Entropy Bounds for Collision Statistic
  3.1 Previous Results
  3.2 Our Results for the Upper Bound
 4 Experimental Results
 5 Conclusion
 Acknowledgement
 References

키워드

저자

• Ju-Sung Kang [ Department of Mathematics, Cryptography & Information Security Institute, Kookmin University, Seoul, Korea ]
• Yongjin Yeom [ Department of Mathematics, Cryptography & Information Security Institute, Kookmin University, Seoul, Korea ]
• Okyeon Yi [ Department of Mathematics, Cryptography & Information Security Institute, Kookmin University, Seoul, Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605