• 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의 통계적 특성을 분석하였다.

• 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.

• 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.

• 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.

• 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.

• 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 Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.71-84
• /
• 1999

The randomness test for a sequence from an encription algorithm has an important role to make differences between plain and cipher text. Thus it is necessary to investigate and analyze the currently used randomness tests. Also in real time point of views it would be helpful to know a minimum sample size which gives discernment of plain and cipher text. In this paper we analyze the rate of successes for widely used nonparametric randomness tests to discern plain and cipher text through experiments. Moreover for given sample sizes an optimal sample size for each randomness test is proposed using the design of experiments.

• 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.

• The Korean Journal of Applied Statistics
• /
• v.30 no.4
• /
• pp.503-512
• /
• 2017

In test with multiple choices, it is necessary to have the position of correct answers of each question spreaded evenly over all the questions in order to minimize the influence of answering tendency of test takers with preference to specific position of multiple choices. The scores of tests with correct answers in specific positions would not reflect exactly the academic aptitude of examinees who do not know correct answers but have the biased answering tendency. In this paper, we have randomness test for the positioning of correct answers at the 2017 College Scholastic Ability Test (CSAT) using Bartels rank test, the Wald-Wolfowitz runs test, the turning point test, the Cox Stuart trend test, the difference sign test and the Mann-Kendall tank test, etc. We also do independence test between the location of correct answer and the allocation of score in each question, for it may result in overestimating the test-taker with specific position preference in marking correct answers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.742-746
• /
• 2010

In this paper, we propose new randomness testing methods based on approximate periods in order to improve the previous randomness testing method using exact pattern matching. Finding approximate periods of random sequences enables us to search similarly repeated parts, but it has disadvantages since it takes long time. In this paper we propose randomness testing methods whose time complexity is O($n^2$) by reducing the time complexity of computing approximate periods from O($n^3$) to O($n^2$). Moreover, we perform some experiments to compare pseudo random number generated by AES cryptographic algorithms and true random number.