• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.344-347
• /
• 2004

Critical cryptography applications require the production of an unpredictable and unbiased stream of binary data derived from a fundamental noise mechanism. In this paper, we proposed a RNG with Gaussian noise using filter algorithm. The proposed scheme is designed to reduce the statistical property of the biased bit stream in the output of a RNG. Experimental show that we analysis the loss rate according to window size and propose optimum window size.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.112-121
• /
• 2002

In this paper, we present a design of a hash processor for data security systems. Two standard hash algorithms, Sha-1(American) and HAS-1600(Korean), are implemented on a single hash engine to support real time processing of the algorithms. The hash processor can also be used as a PRNG(Pseudo-random number generator) by utilizing SHA-1 hash iterations, which is being used in the Intel software library. Because both SHA-1 and HAS-160 have the same step operation, we could reduce hardware complexity by sharing the computation unit. Due to precomputation of message variables and two-stage pipelined structure, the critical path of the processor was shortened and overall performance was increased. We estimate performance of the hash processor about 624 Mbps for SHA-1 and HAS-160, and 195 Mbps for pseudo-random number generation, both at 100 MHz clock, based on Samsung 0.5um CMOS standard cell library. To our knowledge, this gives the best performance for processing the hash algorithms.

• Journal of Internet of Things and Convergence
• /
• v.2 no.1
• /
• pp.23-27
• /
• 2016

There is Generated Moire fringe by fresnel diffraction that explains one of light's physical phenomenon and interference. In this paper, we propose to generate true random numbers by Moire fringe should be used by not pseudo-random number in cryptosystem.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.175-177
• /
• 2003

본 논문에서는 신뢰도가 높은 시뮬레이션 최종결과를 얻기 위한 2가지 중요 요건인 (1) 독립적이고 균일하게 분포된(independent and uniformly distributed) 난수를 발생시키는 적절한 난수 발생기(pseudo-random number generator)의 사용과 (2) 적절한 시뮬레이션 데이터의 분석 기법에 대해서 고려하였다. 통신 네트워크 분야의 저명한 논문지들에 발표된 논문들을 조사하였다. 조사한 결과에 의하면 컴퓨터 시뮬레이션 기법이 아주 일반적인 연구 기법으로 사용되어지고 있었으나, 시뮬레이션이 통계적 실험임을 고려하지 않은 결과물도 아주 많았다. 따라서, 본 논문에서는 시뮬레이션 결과의 신뢰도를 높이기 위한 지침을 언급하였다.

• Review of KIISC
• /
• v.3 no.4
• /
• pp.63-70
• /
• 1993

본 논문에서는 n 개의 원소를 임의로 나열하는 대표적인 치환 발생 알고리즘을 소개하고 이들중 발생 치환의 랜덤성이 우수하다고 알려진 Knuth의 알고리즘을 근간으로 설계된 랜덤 치환 발생기의 암호학적 안전성을 분석하고 발생 치환들에 대한 난수 발생 수열 관점의 통계적 임의성과 연속 발생 치환끼리의 통계적 독립성 적용을 위한 통계량 소개 및 각 관점에서 통계적 검정을 통과함을 시뮬레이션 결과를 통하여 보인다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.51-58
• /
• 2014

A LFSR is commonly used for various stream cryptography applications to generate random numbers. A Leap-ahead LFSR was presented to generate a multi-bits random number per cycle. It only requires a single LFSR and it has an advantages in hardware complexity. However, it suffers from the significant reduction of maximum period of the generated random numbers. This paper presents the new segmented Leap-ahead LFSR to solve this problem. It consists of two segmented LFSRs. We prove the efficiency of the proposed segmented architecture using the precise mathematical analysis. We also demonstrate the proposed comparison results with other counterparts using Xinilx Vertex5 FPGA. The proposed architecture can increase 2.5 times of the maximum period of generated random numbers compared to the typical Leap-ahead architecture.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.803-806
• /
• 2007

Since the different characteristics from the PRNG (Pseudo Random Number Generator) or various deterministic devices such as arithmetic processing units, new concepts and test methods should be suggested in order to test TRNG (Ture Random Number Generator). Deterministic devices can be covered by ATPG (Automatic Test Pattern Generation), which uses patterns generated by cyclic shift registers due to its hardware oriented characteristics, pure random numbers are not possibly tested by automatic test pattern generation due to its analog-oriented characteristics. In this paper, we studied and analyzed a hardware/software combined test method named Diehard test, in which we apply continuous pattern variation to check the statistics. We also point out the considerations when making random number tests.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.61-68
• /
• 2011

Recently arithmetic circuit of lightweight AES symmetric key algorithm that can apply to passive tag have been developed, then security protocol of RFID system using AES symmetric encryption techniques have been proposed. This paper proposed security enhancement protocol of RFID system using lightweight AES arithmetic circuit and random number generator of passive tag. The proposed protocol have AES algorithm and random number generator at server, reader, tag, and transmit encrypted message by separate secret key using random number at each session. The mutual authentication of tag and reader used reader random number and tag random number. As a result, proposal protocol reduce authentication steps of the existing mutual authentication protocol, and reduce amount of computation of tag, and demonstrate as secure protocol to every attack type of attacker by decrease communication step of Air Zone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1765-1773
• /
• 1997

The communication systems which include PLL may have cycle clip problem because of channel noise. The cycle slip problem occurs the synchronization loss of communication system and it may be fatal to the synchronous stream cipher system. While continuous resynchronization is used to lessen the risk of synchronization it has some problems. In this paper, we propose the method which solve the problems by using continuous resynchronization with the clock recovery technique. If the counted value of real clock pulse in reference duration is not same as that of normal state, we decide the cycle slip has occurred. The damaged clock by cycle slip is compensated by adding or subtracting the clock pulse according to the type of cycle slip. It reduced the time for resynchronization by twenty times. It means that 17.8% of data for transmit is compressed.