• Journal of the Korean Statistical Society
• /
• v.27 no.2
• /
• pp.189-195
• /
• 1998

In this paper, we are concerned with the problem of testing the randomness of the coefficients in a first order autoregressive model. A consistent test based on prediction error is suggested. It is shown that under the null hypothesis, the test statistic is asymptotically normal.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1998.12a
• /
• pp.421-441
• /
• 1998

본 논문에서는 스트림 암호 알고리즘과 블록 암호 알고리즘과 같은 비밀키 암호 시스템의 통계적 특성을 측정하기 위하여 사용된 여러 가지 randomness 테스트 방법들을 구현하여 그 성능을 randomness test의 power측면에서 서로 비교하였다. 여기서, power란 randomness test가 nonrandom한 비트 스트림을 얼마나 정확하게 검정할 수 있는 가를 나타내는 적도이다. 그리고, 스트림 암호 알고리즘과 블록 암호 알고리즘의 통계적 특성을 측정하기 위해 가장 효율적이라고 생각되는 테스트 방법들을 찾아 이 방법들을 사용할 것을 제안한다. 끝으로 제안된 방법들을 이용하여, DES, AES후보 알고리즘, SEED의 통계적 특성을 분석하였다.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.47-60
• /
• 2010

Randomness is a basic security evaluation item for the most cryptographic algorithms. NIST has proposed a statistical test suit for random number generators for cryptographic applications in the process of AES project. However the test suit of NIST is customized to block ciphers which have the same input and output lengths. It needs to revise NIST's test suit for key derivation functions which have multiple output blocks. In this paper we propose a revised method of NIST's statistical randomness test adequate to the most key derivation functions and some experimental results for key derivation functions of 3GSM and NIST.

• The Korean Journal of Applied Statistics
• /
• v.22 no.6
• /
• pp.1153-1165
• /
• 2009

There are many traditional statistical tests for randomness. We can consider recurrence plots as an exploratory graphical tool for evaluating randomness.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.4
• /
• pp.321-325
• /
• 2004

It is quite difficult to create an unbiased and stable random bit stream, as required for statistical randomness, when using a random generator with only a hardware component. In this paper, we studied to reduce the statistical property of the biased bit stream in the output of a real random number generator. The proposed scheme is enhanced the randomness of output bitstream, these test items are used by FIPS 140-1.

• Industrial Engineering and Management Systems
• /
• v.15 no.4
• /
• pp.432-445
• /
• 2016

A random profile is the result of a process, the output of which is a function instead of a scalar or vector quantity. In the nature of these objects, two main dimensions of "functionality" and "randomness" can be recognized. Valuable researches have been conducted to present control charts for monitoring such processes in which a regression approach has been applied by focusing on "randomness" of profiles. Performing other statistical techniques such as hypothesis testing for different parameters, comparing parameters of two populations, ANOVA, DOE, etc. has been postponed thus far, because the "functional" nature of profiles is ignored. In this paper, first, some needed theorems are proven with an applied approach, so that be understandable for an engineer which is unfamiliar with advanced mathematical analysis. Then, as an application of that, a statistical test is designed for mean of continuous random profiles. Finally, using experimental operating characteristic curves obtained in computer simulation, it is demonstrated that the presented tests are properly able to recognize deviations in the null hypothesis.

• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.499-505
• /
• 2001

Kim and Baek (2000) tested the spatial randomness for he earthquake occurrence in the Korean Peninsula by using the nearest-neighbor test statistics and empirical distribution functions. The K-function, however, has obvious advantages over the methods used in Kim and Baek (2000), such as it does not depend on the shape of the study region and is an effective summary of spatial dependence over a wide range of scales. We applied the K-function method for testing the randomness to both of the historical and the instrumental seismicity data. It was found that he earthquake occurrences for historical and instrumental seismicity data are not random and clustered rather than scattered.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.41-45
• /
• 2002

From the paper which it sees a strong random number generator it uses a fuzzy set from 16 method of the statistical test which is a cryptograph random number test it verifies. 16 statistical test of NIST extends in crptograph and engineering whole it is a scale which is important distinguishes the distinction incapable characterstic of the random numbers which are used. To try introduce a fuzzy set the possibility of having a more strong randomness in order to be, it strengthens the function of the random number generator.

• The Korean Journal of Applied Statistics
• /
• v.27 no.1
• /
• pp.115-122
• /
• 2014

A test for randomness of the binary random sequence is proposed in this paper. The proposed test statistic is based on the mean length of runs distributed with truncated geometric distribution and asymptotically ${\chi}^2_2$-distributed when the size of the sequences is large. A small Monte Carlo simulation compared the size of the test with a significant level as well as evaluated the test power. We applied the proposed method to the sequence of yes or no numbers in Lotto 6/45 and concluded that the randomness of Lotto is retained.

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.879-897
• /
• 2013

Shannon entropy is one of the widely used randomness measures especially for cryptographic applications. However, the conventional entropy tests are less sensitive to the inter-bit dependency in random samples. In this paper, we propose new online randomness test schemes for true random number generators (TRNGs) based on the mutual information between consecutive ${\kappa}$-bit output blocks for testing of inter-bit dependency in random samples. By estimating the block entropies of distinct lengths at the same time, it is possible to measure the mutual information, which is closely related to the amount of the statistical dependency between two consecutive data blocks. In addition, we propose a new estimation method for entropies, which accumulates intermediate values of the number of frequencies. The proposed method can estimate entropy with less samples than Maurer-Coron type entropy test can. By numerical simulations, it is shown that the new proposed scheme can be used as a reliable online entropy estimator for TRNGs used by cryptographic modules.