• Title/Summary/Keyword: Random number generator

Search Result 150, Processing Time 0.045 seconds

Improved RFID Authentication Protocol Based on SSG (SSG기반 개선된 RFID 인증 프로토콜)

  • Park, Taek-Jin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.4 no.4
    • /
    • pp.311-317
    • /
    • 2011
  • Recently, RFID is substituted for bar codes according to advance in the ubiquitous computing environments, but the RFID system has several problems such as security and privacy because it uses radio frequencies. Firstly, unauthorized reader can easily read the ID information of any Tag. Secondly, Attacker can easily fake the legitimate reader using the collected Tag ID information,such as the any legitimate tag. This paper proposed improved RFID authentication protocol based on SSG. SSG is organized only one LFSR and selection logic. Thus SSG is suitable for implementation of hardware logic in system with extremely limited resources such as RFID tag and it has resistance to known various attacks because of output bit stream for the use as pseudorandom generator. The proposed protocol is secure and effective because it is based on SSG.

A Study on Logic Built-In Self-Test Using Modified Pseudo-random Patterns (수정된 의사 무작위 패턴을 이용한 효율적인 로직 내장 자체 테스트에 관한 연구)

  • Lee Jeong-Min;Chang Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.8 s.350
    • /
    • pp.27-34
    • /
    • 2006
  • During Built-In Self-Test(BIST), The set of patterns generated by a pseudo-random pattern generator may not provide sufficiently high fault coverage and many patterns were undetected fault. In order to reduce the test time, we can remove useless patterns or change from them to useful patterns. In this paper, we reseed modify the pseudo-random and use an additional bit flag to improve test length and achieve high fault coverage. the fat that a random tset set contains useless patterns, so we present a technique, including both reseeding and bit modifying to remove useless patterns or change from them to useful patterns, and when the patterns change, we choose number of different less bit, leading to very short test length. the technique we present is applicable for single-stuck-at faults. the seeds we use are deterministic so 100% faults coverage can be achieve.

A Technique of Watermark Generation and Similarity Embedding for Still Images Based on Cross Reference Points (교차참조점에 기반한 정지영상의 워터마크 생성 및 유사성 삽입 기법)

  • Lee, Hang-Chan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.8
    • /
    • pp.1484-1490
    • /
    • 2007
  • The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

Cooling Schedules in Simulated Annealing Algorithms for Optimal Seismic Design of Plane Frame Structures (평면골조의 최적내진설계를 위한 SA 알고리즘의 냉각스케줄)

  • 이상관;박효선;박성무
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.04b
    • /
    • pp.458-465
    • /
    • 2000
  • In the field of structural optimization simulated annealing (SA) algorithm has widely been adopted as an optimizer with the positive features of SA such as simplicity of the algorithm and possibility of finding global solution However, annealing process of SA algorithm based on random generator with the zeroth order structural information requires a large of number of iterations highly depending on cooling schedules and stopping criteria. In this paper, MSA algorithm is presented in the form of two phase annealing process with the effective cooling schedule and stopping criteria. With the application to optimal seismic design of steel structures, the performance of the proposed MSA algorithm has been demonstrated with respect to stability and global convergence of the algorithm

  • PDF

A Study of the hydrological generation - The generation and comparison with annual and monthly dicharge at Wacgwan in the Nakdong River (수문학적 모의기법에 대한 연구 - 낙동강 왜관지점의 연유량과 월유량의 모의발생 및 비교 -)

  • 천덕진;최영박
    • Water for future
    • /
    • v.13 no.1
    • /
    • pp.49-56
    • /
    • 1980
  • The thesis of this analytical study includes 1) the generation of annual and monthly discharge regarding single hydrological variable at single site, 2)comparsion with the historical records and the generation, and 3) changing the monthly generatied discharge into annual. The conclusion of this will be used for the future plan for water resources development. Annual discharges at waegwan are characterized by log-normal distirbution and persistence-absent. Also, the random number generator causes the errors in the generation of annual discharge. The serial correlation coefficients of the generated annual discharge have less value than that of historical records, while the correlation coefficient and slope in January have(+) value and opposite to historical record. To change the monthly generated discharge into annual is not proper.

  • PDF

An application of the Computer Simulation Model for Stochastic Inventory System (최적재고정책(最適在庫政策)을 위한 컴퓨터 시물레이숀 모델)

  • Sin, Hyeon-Pyo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.2 no.1
    • /
    • pp.79-83
    • /
    • 1976
  • This paper deals with a computer simulation for the stochastic inventory system in which the decision rules are associated with the problem of forecasting uncertain demand, lead time, and amount of shortages. The model consists of mainly three parts; part I$\cdots$the model calculates the expected demand during lead time through the built-in subrou tine program for random number generator and the probability distribution of the demand, part II$\cdots$the model calculates all the possible expected shortages per lead time period, part III$\cdots$finally the model calculates all the possible total inventory cost over the simulation period. These total inventory costs are compared for searching the optimal inventory cost with the best ordering quantity and reorder point. An application example of the simulation program is given.

  • PDF

Performance Analysis according to Filter Window Size in Random Number Generator Using Filter Algorithm (실난수생성기에서 필터 윈도우크기에 관한 연구)

  • Hong, Jin-Keun
    • 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.

  • PDF

FPGA implementation of overhead reduction algorithm for interspersed redundancy bits using EEDC

  • Kim, Hi-Seok
    • Journal of IKEEE
    • /
    • v.21 no.2
    • /
    • pp.130-135
    • /
    • 2017
  • Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits 'r' in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the r in Hamming code. The experimental results were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection of random errors. Moreover, this proposal can be a better option for detecting and correcting errors.

저전력을 소모하는 난수발생기의 성능 평가

  • Yun, Jeong-Min;Kim, Ji-Hong;Kim, Jin-Hyo
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2003.05a
    • /
    • pp.225-229
    • /
    • 2003
  • 휴대전화, PDA와 같은 이동 단말기와 무선 통신의 발전으로 인하여, 이동 단말기를 이용한 전자 메일, 게임, 주식거래 등이 가능하게 되었다. 무선 단말기를 통한 주식거래나 게임 등을 위하여서는 난수발생기(Random Number Generator)의 사용이 필수적이다. 그런데 최근까지의 난수발생기는 우수한 난수성에 중점을 두어 개발되었으며, 이동 단말기에서의 에너지 소비량에 대한 연구는 없었다. 이동 단말기는 무게 및 크기의 한계 때문에 배터리의 용량에 제한이 있게되므로, 되도록 에너지 소비량을 줄여서 주어진 배터리를 오랫동안 사용하기를 원하게 된다. 본 논문에서는 이동 단말기에서 많이 사용되는 여러 난수발생기들을 살펴보고, 저전력 에너지 측정도구인 SES(SNU Energy Scanner)를 이용하여 각 난수발생기의 에너지 소비량을 측정하여 이들을 비교한다. 이를 바탕으로 이동 단말기 환경에서 저전력을 소모하는 난수발생기를 제안하였다.

  • PDF

ALGORITHMS FOR GENERATING NONLINEAR COMBINERS WITH GIVEN CONDITIONS

  • Rhee, Min-Surp;Shin, Hyun-Yong;Jun, Youn-Bae
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.269-278
    • /
    • 2000
  • A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper, we present the algorithms for generating random nonlinear combining functions satisfying given correlation immune order and nonlinearity. These constructions can be applied for designing the key stream generators. We use Microsoft Visual C++6.0 for our program.