• Title/Summary/Keyword: 난수생성

Search Result 220, Processing Time 0.024 seconds

Efficient random number generation from extreme tail areas of a t-distribution (t 분포의 극단 꼬리부분으로부터의 효율적인 난수생성)

  • 오만숙;김나영
    • The Korean Journal of Applied Statistics
    • /
    • v.9 no.1
    • /
    • pp.165-177
    • /
    • 1996
  • It is often needed to generate random numbers from truncated t-distributions to carry out Bayesian inferences, especially in Monte Carlo integration for estimation of posterior densities of constrained parameters. However, when the restricted area is an extreme tail area with a small probability most existing random generation methods are not efficient. In this paper, we propose an efficient acceptance-rejection method to generate random numbers from extreme tail areas of a t-distribution. Using some simulation results, we compare the proposed algorithm with other popular methods.

  • PDF

Random Number Generator using Time Stamp Counter Register (타임 스템프 카운터 레지스터를 사용한 난수 발생기)

  • 이정희;표창우
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.322-324
    • /
    • 2004
  • 보안 시스템은 암호화 기능을 필요로 하고 암호화를 위 한 비밀키로 난수를 사용한다 난수 발생기에는 순수 난수 발생기와 의사 난수 발생기가 있다. 본 논문에서는 펜티엄부터 인텔 프로세서들이 가지고 있는 타임스탬프 카운터 레지스터(TSC MSR)에서 시드를 가져와 비트 가공을 통해 난수를 발생하는 난수 발생기를 구현하였다. 구현된 난수 발생기의 난수 품질을 평가하기 위해 순수 난수 발생기, 의사 난수 발생기의 난수 시퀀스와 비교하였다. 구현된 난수 발생기가 생성한 난수 시퀀스는 순수 난수 발생기의 난수 시퀀스와 큰 차이가 없고 특정 디바이스 없이 응용이 간단하다는 점에서 보안 시스템의 암호화키로 사용하기에 적합하다.

  • PDF

True Random Number Generation Method by using the Moire Fringe (무아레 무늬를 이용한 참 난수 생성 방법)

  • kang, Hyeok;Lee, Keun-Ho
    • 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.

Comparison on Recent Metastability and Ring-Oscillator TRNGs (최신 준안정성 및 발진기 기반 진 난수 발생기 비교)

  • Shin, Hwasoo;Yoo, Hoyoung
    • Journal of IKEEE
    • /
    • v.24 no.2
    • /
    • pp.543-549
    • /
    • 2020
  • As the importance of security increases in various fields, research on a random number generator (RNG) used for generating an encryption key, has been actively conducted. A high-quality RNG is essential to generate a high-performance encryption key, but the initial pseudo-random number generator (PRNG) has the possibility of predicting the encryption key from the outside even though a large amount of hardware resources are required to generate a sufficiently high-performance random number. Therefore, the demand of high-quality true random number generator (TRNG) generating random number through various noises is increasing. This paper examines and compares the representative TRNG methods based on metastable-based and ring-oscillator-based TRNGs. We compare the methods how the random sources are generated in each TRNG and evaluate its performances using NIST SP 800-22 tests.

Dual-mode Pseudorandom Number Generator Extension for Embedded System (임베디드 시스템에 적합한 듀얼 모드 의사 난수 생성 확장 모듈의 설계)

  • Lee, Suk-Han;Hur, Won;Lee, Yong-Surk
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.8
    • /
    • pp.95-101
    • /
    • 2009
  • Random numbers are used in many sorts of applications. Some applications, like simple software simulation tests, communication protocol verifications, cryptography verification and so forth, need various levels of randomness with various process speeds. In this paper, we propose a fast pseudorandom generator module for embedded systems. The generator module is implemented in hardware which can run in two modes, one of which can generate random numbers with higher randomness but which requires six cycles, the other providing its result within one cycle but with less randomness. An ASIP (Application Specific Instruction set Processor) was designed to implement the proposed pseudorandom generator instruction sets. We designed a processor based on the MIPS architecture,, by using LISA, and have run statistical tests passing the sequence of the Diehard test suite. The HDL models of the processor were generated using CoWare's Processor Designer and synthesized into the Dong-bu 0.18um CMOS cell library using the Synopsys Design Compiler. With the proposed pseudorandom generator module, random number generation performance was 239% faster than software model, but the area increased only 2.0% of the proposed ASIP.

A Study on a Binary Random Sequence Generator with Two Characteristic Polynomials (두개의 특성 다항식으로 구성된 이진 난수열 발생기에 관한 연구)

  • 김대엽;주학수;임종인
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.12 no.3
    • /
    • pp.77-85
    • /
    • 2002
  • A Research of binary random sequence generator that uses a linear shift register had been studied since the 1970s. These generators were used in stream cipher. In general, the binary random sequence generator consists of linear shift registers that generate sequences of maximum period and a nonlinear filter function or a nonlinear combination function to generate a sequence of high linear complexity. Therefore, To generate a sequence that have long period as well as high linear complexity becomes an important factor to estimate safety of stream cipher. Usually, the maximum period of the sequence generated by a linear feedback shift register with L resistors is less than or equal to $2^L$-1. In this paper, we propose new binary random sequence generator that consist of L registers and 2 sub-characteristic polynomials. According to an initial state vector, the least period of the sequence generated by the proposed generator is equal to or ions than it of the sequence created by the general linear feedback shift register, and its linear complexity is increased too.

An Exploring of Random Number Generation Using Race Condition (레이스 컨디션을 활용한 난수 생성 모듈 )

  • Jiun Seo;Jaeyeol Park;Kyung-Hyune Rhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.214-215
    • /
    • 2023
  • 오늘날 운영체제나 응용프로그램에서 레이스 컨디션으로 인한 문제가 발생하여 공격에 이용하거나 레이스 컨디션을 기반으로 한 공격을 막기 위한 연구가 진행되고 있다. 그러나 레이스 컨디션이 발생할 때 스레드가 자원에 접근하는 매커니즘을 응용한 보호기법과 관련된 연구는 미흡하다. 이에 본 논문에서는 레이스 컨디션이 발생할 때 스레드가 무작위 순서로 자원에 접근하는 점을 이용해 새로운 난수 생성 방식을 제안한다. 또한 이를 난수 생성 알고리즘을 사용하는 랜덤 모듈과 비교하여 더 안정적인 난수 생성 모듈을 개발할 수 있는 가능성에 대해 알아봤다.

True Random Number Generator based on Cellular Automata with Random Transition Rules (무작위 천이규칙을 갖는 셀룰러 오토마타 기반 참난수 발생기)

  • Choi, Jun-Beak;Shin, Kyung-Wook
    • Journal of IKEEE
    • /
    • v.24 no.1
    • /
    • pp.52-58
    • /
    • 2020
  • This paper describes a hardware implementation of a true random number generator (TRNG) for information security applications. A new approach for TRNG design was proposed by adopting random transition rules in cellular automata and applying different transition rules at every time step. The TRNG circuit was implemented on Spartan-6 FPGA device, and its hardware operation generating random data with 100 MHz clock frequency was verified. For the random data of 2×107 bits extracted from the TRNG circuit implemented in FPGA device, the randomness characteristics of the generated random data was evaluated by the NIST SP 800-22 test suite, and all of the fifteen test items were found to meet the criteria. The TRNG in this paper was implemented with 139 slices of Spartan-6 FPGA device, and it offers 600 Mbps of the true random number generation with 100 MHz clock frequency.

A Provably secure Pseudorandom generator from Braid groups (땋임군에서의 안전성이 증명 가능한 유사난수 생성기)

  • 이언경;한상근
    • 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.

Design of RFID Mutual Authentication Protocol using One Time Random Number (일회성 난수를 이용한 안전한 RFID 상호인증 프로토콜 설계)

  • Kim, Dae-Jung;Jun, Moon-Seog
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.3
    • /
    • pp.243-250
    • /
    • 2008
  • Recently, researched RFID authentication protocols still have vulnerability of attack, such as location tracking attack, replay attack. spoofing attack etc. This paper designed method of making one time random number in DB server side unlike previously researched protocols, and it protects RFID communication from location tracking, replay attack and spoofing attack.