• Title/Summary/Keyword: random number generation

Search Result 154, Processing Time 0.025 seconds

Monte-Carlo Simulation to the Color Distribution within Galactic Globular Clusters

  • Sohn, Young-Jong;Chun, Mun-Suk
    • Bulletin of the Korean Space Science Society
    • /
    • 1993.10a
    • /
    • pp.18-18
    • /
    • 1993
  • According to the CCD photometric studies, the color distributions of globular clusters with collapsed cores, which are characterized by a power law cusp in thier surface brighness pronto, become bluer toward their centers, but this is not the case in the flat core clusters which are fit by the King model. To test the statistical implication of the color distribution within globular clusters, we built the sample dusters which follows the surface brightness pofile of the King model and power law cusp profile with the Sandage's standao luminosity function for M3 and the Salpter's initial mass functions. On the results from simulations based on the uniform random number generation the color gadients within globualr dusters mar be not likely to come from the statistical random distributions of stars but from the dynamical process on the cluster evolution.

  • PDF

Design of Hash Processor for SHA-1, HAS-160, and Pseudo-Random Number Generator (SHA-1과 HAS-160과 의사 난수 발생기를 구현한 해쉬 프로세서 설계)

  • Jeon, Shin-Woo;Kim, Nam-Young;Jeong, Yong-Jin
    • 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.

Development of Security Service for Mobile Internet Banking Using Personal Digital Assistants

  • Choo, Young-Yeol;Kim, Jung-In
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.12
    • /
    • pp.1719-1728
    • /
    • 2004
  • The fusion of Internet technology and applications with wireless communication provides a new business model and promises to extend the possibilities of commerce to what is popularly called mobile commerce, or m-commerce. In mobile Internet banking service through wireless local area network, security is a most important factor to consider. We describe the development of security service for mobile Internet banking on Personal Digital Assistants (PDAs). Banking Server and Authentication Server were developed to simulate banking business and to support certificate management of authorized clients, respectively. To increase security, we took hybrid approach in implementation: symmetric block encryption and public-key encryption. Hash function and random number generation were exploited to generate a secret key. The data regarding banking service were encrypted with symmetric block encryption, RC4, and the random number sequence was done with public-key encryption. PDAs communicate through IEEE 802.IIb wireless LAN (Local Area Network) to access banking service. Several banking services and graphic user interfaces, which emulatedthe services of real bank, were developed to verity the working of each security service in PDA, the Banking Server, and the Authentication Server.

  • PDF

RFID Tag Ownership Transfer Protocol Using Lightweight Computing Operators (간단한 연산을 사용한 RFID 태그 소유권 이전 프로토콜)

  • Lee, Jae-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.12
    • /
    • pp.1413-1426
    • /
    • 2013
  • RFID thecnology has been widely adopted by industries for supply chain management. When a product item is manufactured RFID tag is attached to the product item and supply chain management among factories, distributors, retailers and customers needs to handle ownership transfer for the product item carefully. With RFID technology, the secure and efficient ownership transfer protocol is an important issue for the identification of product items and the overall system efficiency on supply chain. Many ownership transfer protocols have been proposed now. They have security problems and use complex operations such as encryption operation and hash function. Lo et al. proposed a protocol using lightweight operations such as shift, addition, XOR, and random number generation[1]. However, this protocol has a security problem in which the secret key between the tag and the new owner is disclosed to the attackers, and it is also weak against the Fraud attack[2]. In this paper, we propose a new ownership transfer protocol using lightweight operations such as shift, addition, and random number generation. This protocol is the modified version of Lo et al.'s protocol and is secure against the security attacks.

Design of Control Block for Passive UHF RFID Tag IC (수동형 UHF대역 RFID 태그 IC의 제어부 설계)

  • Woo, Cheol-Jong;Cha, Sang-Rok;Kim, Hak-Yun;Choi, Ho-Yong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.9
    • /
    • pp.41-49
    • /
    • 2008
  • This paper presents a design of the control block of a passive UHF RFID tag IC according to EPCglobal Class-1 Generation-2 UHF RFID 1.1.0 Protocol. The control block includes a PIE block, CRC5/CRC16, a Slot Counter, a Random Number Generator, a Main Control Block, a Encoder and a Memory Interface. The control block has been designed using the Verilog HDL and has been simulated. Functional simulation results for the overall control block operation show that 11 instructions with 7 states are operated correctly. Also, the control block has been implemented with 36,230 gates by Synopsys Design Compiler and Apollo using Magnachip 0.25$\mu$m technology.

Generation and Extension of Models for Repeated Measurement Design by Generalizability Design (일반화가능도 디자인에 의한 반복측정 실험설계의 모형 생성 및 확장)

  • Choi, Sung-Woon
    • Journal of the Korea Safety Management & Science
    • /
    • v.13 no.2
    • /
    • pp.195-202
    • /
    • 2011
  • The study focuses on the Repeated Measurements Design (RMD) which observations are periodically made for identical subjects within definite time periods. One of the purposes of this design is to monitor and keep track of replicated records within regular period over years. This paper also presents the classification models of RMD that is developed according to the number of factors in Between-Subject (BS) variates and Within-Subject (WS) variates. The types of models belong to each number of factors: One factor is 0BS 1WS. Two factors are 1BS 1WS and 0BS 2WS. Three factors are 1BS 2WS and 2BS 1WS. Lastly, the four factors include model of 2BS 2WS In addition, the study explains the generation mechanism of models for RMD using Generalizability Design (GD). GD is a useful method for practitioners to identify linear model of experimental design, since it generates a Venn diagram. Lastly, the research develops three types of 1BS 2WS RMDs with crossed factors and nested factors. Those are random models, mixed models and fixed models and they are presented by using Generalizability Design, $(S:A{\times}B){\times}C$. Moreover, the example of applications and its implementation steps of models developed in the study are presented for better comprehension.

A New Dynamic Prediction Algorithm for Highway Traffic Rate (고속도로 통행량 예측을 위한 새로운 동적 알고리즘)

  • Lee, Gwangyeon;Park, Kisoeb
    • Journal of the Korea Society for Simulation
    • /
    • v.29 no.3
    • /
    • pp.41-48
    • /
    • 2020
  • In this paper, a dynamic prediction algorithm using the cumulative distribution function for traffic volume is presented as a new method for predicting highway traffic rate more accurately, where an approximation function of the cumulative distribution function is obtained through numerical methods such as natural cubic spline interpolation and Levenberg-Marquardt method. This algorithm is a new structure of random number generation algorithm using the cumulative distribution function used in financial mathematics to be suitable for predicting traffic flow. It can be confirmed that if the highway traffic rate is simulated with this algorithm, the result is very similar to the actual traffic volume. Therefore, this algorithm is a new one that can be used in a variety of areas that require traffic forecasting as well as highways.

Potential of the Quantitative Trait Loci Mapping Using Crossbred Population

  • Yang, Shulin;Zhu, Zhengmao;Li, Kui
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.18 no.12
    • /
    • pp.1675-1683
    • /
    • 2005
  • In the process of crossbreeding, the linkage disequilibria between the quantitative trait loci (QTL) and their linked markers were reduced gradually with increasing generations. To study the potential of QTL mapping using the crossbred population, we presented a mixed effect model that treated the mean allelic value of the different founder populations as the fixed effect and the allelic deviation from the population mean as random effect. It was assumed that there were fifty QTLs having effect on the trait variation, the population mean and variance were divided to each QTL in founder generation in our model. Only the additive effect was considered in this model for simulation. Six schemes (S1-S6) of crossbreeding were studied. The selection index was used to evaluate the synthetic breeding value of two traits of the individual in the scheme of S2, S4 and S6, and the individuals with high selection index were chosen as the parents of the next generation. Random selection was used in the scheme of S1, S3 and S5. In this study, we premised a QTL explained 40% of the genetic variance was located in a region of 20 cM by the linkage analysis previously. The log likelihood ratio (log LR) was calculated to determine the presence of a QTL at the particular chromosomal position in each of the generations from the fourth to twentieth. The profiles of log LR and the number of the highest log LR located in the region of 5, 10 and 20 cM were compared between different generations and schemes. The profiles and the correct number reduced gradually with the generations increasing in the schemes of S2, S4 and S6, but both of them increased in the schemes of S1, S3 and S5. From the results, we concluded that the crossbreeding population undergoing random selection was suitable for improving the resolution of QTL mapping. Even experiencing index selection, there was still enough variation existing within the crossbred population before the fourteenth generation that could be used to refine the location of QTL in the chromosome region.

A Study on the OTP Generation Algorithm for User Authentication (사용자 인증에 적합한 OTP 생성 알고리즘에 관한 연구)

  • Kim, Dong-Ryool
    • Journal of Digital Convergence
    • /
    • v.13 no.1
    • /
    • pp.283-288
    • /
    • 2015
  • A disposable password is necessary to avoid any danger by the use of a static password and reinforce the user's authentication. In order to prevent personal information from being exposed, OTP generation algorithm is regarded as important. The OTP generation algorithm we suggest in this thesis generates 256-bit-size OTP Data by using Seed value and Time value. This value that the generated OTP Data are arranged with a matrix and a 32-bit-value is extracted on an irregular basis becomes the final value. We can find out that the more OTP generation frequency we have, the lower probability of clash tolerance we get in our suggested algorithm, compared to the previous algorithm.

Efficient Weighted Random Pattern Generation Using Weight Set Optimization (가중치 집합 최적화를 통한 효율적인 가중 무작위 패턴 생성)

  • 이항규;김홍식;강성호
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.9
    • /
    • pp.29-37
    • /
    • 1998
  • In weighted random pattern testing it is an important issue to find the optimal weight sets for achieving a high fault coverage using a small number of weighted random patterns. In this paper, a new weight set optimization algorithm is developed, which can generate the optimal weight sets in an efficient way using the sampling probabilities of deterministic tests patterns. In addition, the simulation based method of finding the proper maximum Hamming distance is presented. Experimental results for ISCAS 85 benchmark circuits prove the effectiveness of the new weight set optimization algorithm and the method of finding the proper maximum Hamming distance.

  • PDF