• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.07a
• /
• pp.57-61
• /
• 2003

Iwata 등은 SPN 구조에 기반한 블록 암호들 중 Serpent에 대한 의사 난수성을 분석하였다 ［2］. 그들은 Serpent의 구조를 최대한 보존한 상태에서 의사 난수성을 분석하기 위하여 Serpent의 Diffusion layer의 특성을 그대로 보존하여 일반화 한 후 이론을 전개하였다. 본 논문에서는 Serpent가 취한 Diffusion layer 뿐만 아니라 SPN 구조에 기반한 블록 암호들이 취할 수 있는 임의의 Diffusion layer에 대하여 적용 가능한 일반적인 이론을 도출해낼 것이다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.3
• /
• pp.365-378
• /
• 2024

The operating system (OS) of mobiles or embedded devices is based on the Linux kernel. These OSs request random numbers from the Linux kernel for system operation, such as encryption keys and security features. To provide random numbers reliably, the Linux kernel has a dedicated random number generator (Linux Pseudo Random Number Generator, LPRNG). Recently, LPRNG has undergone a major structural changes. However, despite the major changes, no security analysis has been published on the structure of the new LPRNG. Therefore, we analyze these structural changes as a preliminary study to utilize the security analysis of the new LPRNG. Furthermore, the differences between before and after the changes are divided into cryptographic and performance perspectives to identify elements that require security analysis. This result will help us understand the new LPRNG and serve as a base for security analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.655-657
• /
• 2008

We suggest the digital voice encryption module using the pseudo random number generator and design the sorority device of a telephone using the module. The proposed method provides encryption method of the telephone against the third party. This encryption method uses pseudo random number generator which computes the encryption key using the shared secret key and the current time value.

• Review of KIISC
• /
• v.3 no.1
• /
• pp.26-30
• /
• 1993

본 논문에서는Akl-Meijer가 설계한 랜덤 치환 발생기를 일반화한 알고리즘을 제안한다. Akl과 Meijer는 사이즈가 m인 치환(Permutation)과 0과 m!-1사이의 정수를 일대일 대응시키는 Knuth의 알고리즘을 이용하여, 선형 합동법 Y=X+C mod m! (C는 상수)에서 발생되는 난수와 일대일 대응되는 치환을 발생하는 치환 발생 알고리즘을 설계하였으며, 이를 응용하여, 이진 난수 발생기를 제시하였다. 본 논문에서는 선형 합동법 Y=AX+C mod m!(A, C는 상수)에서 발생되는 난수와 일대일 대응되는 치환 계산과정을 상삼각 행렬(Upper triangular matrix) 의 곱으로 변환하여 고속으로 계산하는 알고리즘을 제시한후, 이 알고리즘의 출력 치환을 n 개 결합하여 치환을 발생하는 랜덤치환 발생기를 설계한다. 또한 이의 암호적인 응용으로, 치환 발생기를 이용한 이진 난수 발생기를 제시한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1006-1009
• /
• 2008

We suggest the digital voice encryption module using the pseudo random number generator and design the security device of a telephone using the module. The proposed method provides encryption method of the telephone against the third party. This encryption method uses pseudo random number generator which computes the encryption key using the shared secret key and the current time value.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.3
• /
• pp.13-22
• /
• 2001

The notion of pseudorandomness plays an important role in modem cryptography as well as computer science. We show a simple and practical construction of a pseudorandom generator based on the intractability of the problem in braid groups. The generator is proved as secure as a hard instance of a variant of the conjugacy problem.

• Journal of the Korean Data and Information Science Society
• /
• v.9 no.2
• /
• pp.237-246
• /
• 1998

We put the pseudo-random number generator into catagories like MiCG, MuCG, URG, ICG, EICG, and test uniformity and independency by 10,000 times through n empirical trial after selecting this random number generator. Here, from a fraction of data(20, 40, 60, 80, 100) with a significance level of 0.1, 0.05 and 0.01, we drive cumulative frequency with K-S, $X^{2}$, poker, run, autocorrelation test. As a result from the uniformity and independency among five random number generators based on all these data, all random number generator except EICG passed uniformity and independency test, and the URG turn out to be excellent in periodicity.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1478-1481
• /
• 2009

수동형 RFID(Radio Frequency Identification)는 제한된 자원을 가지고 있으며, 무선채널을 사용하는 기술이다. 하지만 도청과 같은 악의적인 공격과 프라이버시 침해와 같은 문제점이 있으며, 이를 해결하기 위한 각종 암호화 기법 및 알고리즘과 인증 프로토콜이 있다. AES(Advanced Encryption Standard)는 RFID에 적용 가능한 대표적인 대칭키 암호화 알고리즘으로써 그 안정성이 검증되었지만, RFID 태그에서 사용하기 위해서는 키 분배와 같은 문제점을 해결하여야 한다. 본 논문에서는 AES와 난수사용을 기반으로 하는 개선된 RFID 인증 프로토콜을 제안한다. 리더에서 발생된 난수는 새로운 키를 생성하고, 태그와 리더를 인증하는 용도로 사용하며, 난수를 통해 생성된 키는 메시지를 암호화 하는데 이용한다. 따라서, 본 논문의 난수사용은 대칭키의 노출을 막아 키 분배 문제를 해결하며, 인증 단계를 줄일 수 있다. 또한, 태그에서 한번의 암호화만 수행되므로 태그에 발생하는 오버헤드를 최소화하며 도청, 재전송, 스푸핑 및 위치 추적과 같은 공격에도 안전하다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.449-457
• /
• 2017

In this paper, we analyze the security and performance of the Quantis Quantum random number generator in terms of cryptography through experiments. The Quantis' post-processing is designed to output full-entropy via bit-matrix-vector multiplication based on mathematical background, and we used the min-entropy estimating test of NIST SP 800-90B so as to verify whether the output is full-entropy. Quantis minimizes the effect on the random bit rate by using an optimization technique for bit-matrix-vector multiplication, and compared the performance to conditioning functions of NIST SP 800-90B by measuring the random bit rate. Also, we have distinguished what is in Quantis' post-processing to the standard model of NIST in USA and BSI in Germany, and in case of applying Quantis to cryptographic systems in accordance with the CMVP standard, it is recommended to use the output of Quantis as the seed of the approved DRBG.

• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.90-97
• /
• 2009

In 2008, Kim-Jun proposed a RFID mutual authentication protocol using one-time random number that can withstand malicious attacks by the leakage of important information and resolve the criminal abuse problems. Through the security analysis, they claimed that the proposed protocol can withstand various security attacks including the replay attack. However, this paper demonstrates that Kim-Jun' s RFID authentication protocol still insecure to the replay attack. In addition, this paper also proposes a simply improved RFID mutual authentication protocol using one-time random number which not only provides same computational efficiency, but also withstands the replay attack.