• Journal of the Korean Mathematical Society
• /
• v.41 no.5
• /
• pp.921-931
• /
• 2004

We derive a formula for the expected value $\mu$(n) of the independent domination number of a random directed rooted tree with n labeled vertices and determine the asymptotic behavior of $\mu$(n) as n goes to infinity.

• 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×10⁷ 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.

• Atmosphere
• /
• v.29 no.5
• /
• pp.551-566
• /
• 2019

Quantitative understanding of a random error that is associated with Lagrangian particle dispersion modeling is a prerequisite for backward-in-time mode simulations. This study aims to quantify the random error of the WRF-FLEXPART model and suggest an optimum number of the Lagrangian particles for backward-in-time simulations over the Seoul metropolitan area. A series of backward-in-time simulations of the WRF-FLEXPART model has conducted at two receptor points by changing the number of Lagrangian particles and the relative error, as a quantitative indicator of random error, is analyzed to determine the optimum number of the release particles. The results show that in the Seoul metropolitan area a 1-day Lagrangian transport contributes 80~90% in residence time and ~100% in atmospheric enhancement of carbon monoxide. The relative errors in both the residence time and the atmospheric concentration enhancement are larger when the particles release in the daytime than in the nighttime, and in the inland area than in the coastal area. The sensitivity simulations reveal that the relative errors decrease with increasing the number of Lagrangian particles. The use of small number of Lagrangian particles caused significant random errors, which is attributed to the random number sampling process. For the particle number of 6000, the relative error in the atmospheric concentration enhancement is estimated as -6% ± 10% with reduction of computational time to 21% ± 7% on average. This study emphasizes the importance of quantitative analyses of the random errors in interpreting backward-in-time simulations of the WRF-FLEXPART model and in determining the number of Lagrangian particles as well.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.2
• /
• pp.755-759
• /
• 2012

In this paper, it is about random number generator, which is based on hardware is utilized in medical science and game area. The Intel presents guideline of security level about hardware based true random number generator. At hardware based random number generator, the various test items, that are included in test suits as NIST statistical test, FIPS140-1, is applied. In this paper, it experiments about degree extent of randomness variation from filter scheme effects, which is applied in output stream of hardware noise source.

• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.363-375
• /
• 2004

In this paper, We show that the bandpass random signals of the form ∑$_{\alpha}$$\alpha$$_{\alpha}$ a Sin(2$\pi$f$_{\alpha}$t + b$_{\alpha}$) where a$_{\alpha}$ being a random number in [0,1], f$_{\alpha}$ a random integer in a given frequency band, and b$_{\alpha}$ a random number in [0, 2$\pi$], generate Gaussian white noise signals and hence they are adequate for simulating Continuous Markov processes. We apply the result to the fluctuation-dissipation formula for the Johnson noise and show that the probability distribution for the long term average of the power of the Johnson noise is a X$^2$ distribution and that the relative error of the long term average is (equation omitted) where N is the number of blocks used in the average.error of the long term average is (equation omitted) where N is the number of blocks used in the average.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.76-80
• /
• 2010

It is floating to security of information and the early assignment that it is important it processes and to transmit in inundations of information that I changed suddenly. I used the encryption/decryption process that applied simple substitution and mathematical calculation algorithm at theory and encryption transmission steps protective early information. Hardware and financial loss are using spurious random number to be satisfied with the random number anger that isn't real random number to size so much perfect information protection using One-time pad for applying this. I was transformed into serial test under a test to prove spurious random number anger, and it is into random number anger stronger, and the transformation serial test that proposes is proving it in algorithm speed and efficiency planes.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1467-1473
• /
• 2015

In this paper, we implemented a parallel random number generation program on GPU's, which are known for high performance computing, using LCG (Linear Congruential Generator). Random numbers are important in all fields requiring the use of randomness, and LCG is one of the most widely used methods for the generation of pseudo-random numbers. We explained the parallel program using the NVIDIA CUDA model and MPI(Message Passing Interface) and showed uniform distribution and performance results. We also used a Monte Carlo algorithm to calculate pi(${\pi}$) comparing the parallel random number generator with cuRAND, which is a CUDA library function, and showed that our program is much more efficient. Finally we compared performance results using multi-GPU's with those of ideal speedups.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.603-606
• /
• 2019

In this paper, we propose a slotted-ALOHA-based random access protocol and derive the optimal number of random slots that maximize channel throughput when multiple energy harvesting sensor devices perform random access in wireless-powered sensor networks (WPSN). Throughput numerical analysis, we prove that the throughput has a concavity with respect to the number of random slots and obtain the optimal number of slots. Simulation results show that the throughput of the proposed slotted ALOHA-based random access protocol is maximize when the derived optimal number of slots is employed in the considered WPSN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.3
• /
• pp.130-134
• /
• 1982

In computer communication network, it is assumed that blocks are served at a rate of u messages per sec. The message blocks will be stayed in the buffer during the service time. In this case, the probability density distribution of the number of message blocks in the buffer space has been studied. When the average buffer space needed is minimum, the average block size will be specified by the relation between the input data and link infromation length. This relation proves to be perfect. The random number generator for this probability distribution is designed. The test result by making use of the random number generator has shown that is has little difference from the theoretical one.