• Title/Summary/Keyword: 난수 생성기

Search Result 76, Processing Time 0.02 seconds

Design of Single Power CMOS Beta Ray Sensor Reducing Capacitive Coupling Noise (커패시터 커플링 노이즈를 줄인 단일 전원 CMOS 베타선 센서 회로 설계)

  • Jin, HongZhou;Cha, JinSol;Hwang, ChangYoon;Lee, DongHyeon;Salman, R.M.;Park, Kyunghwan;Kim, Jongbum;Ha, PanBong;Kim, YoungHee
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.4
    • /
    • pp.338-347
    • /
    • 2021
  • In this paper, the beta-ray sensor circuit used in the true random number generator was designed using DB HiTek's 0.18㎛ CMOS process. The CSA circuit proposed a circuit having a function of selecting a PMOS feedback resistor and an NMOS feedback resistor, and a function of selecting a feedback capacitor of 50fF and 100fF. And for the pulse shaper circuit, a CR-RC2 pulse shaper circuit using a non-inverting amplifier was used. Since the OPAMP circuit used in this paper uses single power instead of dual power, we proposed a circuit in which the resistor of the CR circuit and one node of the capacitor of the RC circuit are connected to VCOM instead of GND. And since the output signal of the pulse shaper does not increase monotonically, even if the output signal of the comparator circuit generates multiple consecutive pulses, the monostable multivibrator circuit is used to prevent signal distortion. In addition, the CSA input terminal, VIN, and the beta-ray sensor output terminal are placed on the top and bottom of the silicon chip to reduce capacitive coupling noise between PCB traces.

A Novel Copyright Protection for Digital Images Using Magnitude and Orientation of Edge (영상의 에지 크기와 각도를 이용한 정지영상 보호 기법)

  • Shin, Jin-Wook;Min, Byung-Jun;Yoon, Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3C
    • /
    • pp.262-270
    • /
    • 2008
  • We propose a technique to protect digital images using the magnitude and orientation of their edges. The proposed technique uses the content-associated copyright message generated by combining the original copyright message with the magnitude and orientation of some edges of a digital image. It enables the distribution of the original copyright message without any distortion of original digital images by avoiding embedment of the original copyright message into images. In addition to the advantage in the image quality, it also has a relatively low computational complexity by using simple operations to generate the content-associated copyright message. To verify the proposed technique, we performed experiments on its robustness to the external attacks such as histogram equalization, median filtering, rotation, and cropping. Experimental results on restoring the copyright message from images distorted by attacks show that more than 90%, on the average, can be recovered.

On the Construction of the 90/150 State Transition Matrix Corresponding to the Trinomial x2n-1 + x + 1 (3항 다항식 x2n-1 + x + 1에 대응하는 90/150 상태전이행렬의 구성)

  • Kim, Han-Doo;Cho, Sung-Jin;Choi, Un-Sook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.2
    • /
    • pp.383-390
    • /
    • 2018
  • Since cellular automata(CA) is superior to LFSR in randomness, it is applied as an alternative of LFSR in various fields. However, constructing CA corresponding to a given polynomial is more difficult than LFSR. Cattell et al. and Cho et al. showed that irreducible polynomials are CA-polynomials. And Cho et al. and Sabater et al. gave a synthesis method of 90/150 CA corresponding to the power of an irreducible polynomial, which is applicable as a shrinking generator. Swan characterizes the parity of the number of irreducible factors of a trinomial over the finite field GF(2). These polynomials are of practical importance when implementing finite field extensions. In this paper, we show that the trinomial $x^{2^n-1}+X+1$ ($n{\geq}2$) are CA-polynomials. Also the trinomial $x^{2^a(2^n-1)}+x^{2^a}+1$ ($n{\geq}2$, $a{\geq}0$) are CA-polynomials.

Two layered Secure Password Generation with Random Number Generator (난수 발생기를 이용한 이중화 구조의 안전한 비밀번호 생성 기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.4
    • /
    • pp.867-875
    • /
    • 2014
  • Rapid development of internet service is enabling internet banking services in anywhere and anytime. However, service access through internet can be exposed to adversary easily. To prevent, current service providers execute authentication process with user's identification and password. However, majority of users use short and simple password and do not periodically change their password. As a result of this, user's password could be exposed to attacker's brute force attack. In this paper, we presented enhanced password system which guarantee higher security even though users do not change their current password. The method uses additional secret information to replace real password periodically without replacement of real password.

Characteristic Polynomials of 90/150 CA <10 ⋯ 0> (90/150 CA <10 ⋯ 0>의 특성다항식)

  • Kim, Jin-Gyoung;Cho, Sung-Jin;Choi, Un-Sook;Kim, Han-Doo;Kang, Sung-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.6
    • /
    • pp.1301-1308
    • /
    • 2018
  • 90/150 CA which are used as key generators of the cipher system have more randomness than LFSRs, but synthesis methods of 90/150 CA are difficult. Therefore, 90/150 CA synthesis methods have been studied by many researchers. In order to synthesize a suitable CA, the analysis of the characteristic polynomial of 90/150 CA should be preceded. In general, the characteristic of polynomial ${\Delta}_n$ of n cell 90/150 CA is obtained by using ${\Delta}_{n-1}$ and ${\Delta}_{n-2}$. Choi et al. analyzed $H_{2^n}(x)$ and $H_{2^n-1}(x)$, where $H_k(x)$ is the characteristic polynomial of k cell 90/150 CA with state transition rule <$10{\cdots}0$>. In this paper, we propose an efficient method to obtain $H_n(x)$ from $H_{n-1}(x)$ and an efficient algorithm to obtain $H_{2^n+i}(x)$ and $H_{2^n-i}(x)$ ($1{\leq}i{\leq}2^{n-1}$) from $H_{2^n}(x)$ by using this method.

A Security Nonce Generation Algorithm Scheme Research for Improving Data Reliability and Anomaly Pattern Detection of Smart City Platform Data Management (스마트시티 플랫폼 데이터 운영의 이상패턴 탐지 및 데이터 신뢰성 향상을 위한 보안 난수 생성 알고리즘 방안 연구)

  • Lee, Jaekwan;Shin, Jinho;Joo, Yongjae;Noh, Jaekoo;Kim, Jae Do;Kim, Yongjoon;Jung, Namjoon
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.4 no.2
    • /
    • pp.75-80
    • /
    • 2018
  • The smart city is developing an energy system efficiently through a common management of the city resource for the growth and a low carbon social. However, the smart city doesn't counter a verification effectively about a anomaly pattern detection when existing security technology (authentication, integrity, confidentiality) is used by fixed security key and key deodorization according to generated big data. This paper is proposed the "security nonce generation based on security nonce generation" for anomaly pattern detection of the adversary and a safety of the key is high through the key generation of the KDC (Key Distribution Center; KDC) for improvement. The proposed scheme distributes the generated security nonce and authentication keys to each facilities system by the KDC. This proposed scheme can be enhanced to the security by doing the external pattern detection and changed new security key through distributed security nonce with keys. Therefore, this paper can do improving the security and a responsibility of the smart city platform management data through the anomaly pattern detection and the safety of the keys.