• Title/Summary/Keyword: 원시다항식

Search Result 31, Processing Time 0.034 seconds

Rearrangement of Sequences through the Generation Principle (생성원리를 통한 수열의 재배열)

  • Kwon, Min-Jeong;Cho, Sung-Jin;Kim, Jin-Gyoung;Choi, Un-Sook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.1
    • /
    • pp.133-140
    • /
    • 2018
  • In this paper we discover the generation principle of a sequence when the characteristic polynomial of the sequence is a power of a primitive polynomial. With the generation principle, we can rearrange a sequence. Also we get the linear complexity and the required term of the sequence efficiently.

Performance Analysis of CRC Error Detecting Codes (CRC 오류검출부호의 성능 분석)

  • 염흥렬;권주한;양승두;이만영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.6
    • /
    • pp.590-603
    • /
    • 1989
  • In tnis paper, the CRC-CCITT code and primitive polynomial CRC code are selected for analysing error detecting performance. However, general formulas for obtaining the weight distribution of these two CRC codes are not so far dericed. So, a new method for calculating the weight distribution of the shortened cyclic Hamming code is presented and an undetected error probability of these two codes is obtained when used in cell of ATM for broadband ISDN user-network interface. Consequently, we show that CRC code too much does affect its error detection performance. All the computer simulation is performed by IBM PC/AT.

  • PDF

Generation of Maximum Length Cellular Automata (최대길이를 갖는 셀룰라 오토마타의 생성)

  • Choi Un-Sook;Cho Sung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.25-30
    • /
    • 2004
  • Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

Analysis of Shrinking Generator Using Phase Shifts (위상이동차를 이용한 수축 생성기의 분석)

  • Hwang, Yoon-Hee;Cho, Sung-Jin;Choi, Un-Sook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.11
    • /
    • pp.2507-2513
    • /
    • 2010
  • In this paper, we show that the shrinking generator with two LFSR whose characteristic polynomials are primitive is an interleaving generator and analyze phase shifts in shrunken sequence. Also for a given intercepted sequence of shrunken sequence, we propose. the method of reconstructing some deterministic bits of the shrunken sequence using phase shifts.

A Study on Fingerprinting Code for Illegal Distribution Prevention (불법 유통 방지를 위한 핑거프린팅 코드에 관한 연구)

  • Lee, Jin-Heung;Park, Ji-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11c
    • /
    • pp.1839-1842
    • /
    • 2003
  • 핑거프린팅은 컨텐츠 유통 시, 구매자의 정보를 컨텐츠에 삽입함으로써 불법 유통 행위된 컨텐츠에 대하여 불법 배포자를 추적할 수 있는 기법이다. 이 방법에는 서로 다른 구매자에 의한 핑거프린팅코드를 제거하려는 공모 공격(collusion attacks)이 발생할 수 있다. 본 논문에서는 고차의 원시다항식을 이용하여 효율적이면서 공모 공격에 강인한 핑거프린팅 코드 구성 방법을 제안한다. 그리고, 제안된 방법을 오디오 데이터에 적용하여 공모 공격에 대하여 안전한 코드임을 보이고 있다.

  • PDF

Design of Key Sequence Generators Based on Symmetric 1-D 5-Neighborhood CA (대칭 1차원 5-이웃 CA 기반의 키 수열 생성기 설계)

  • Choi, Un-Sook;Kim, Han-Doo;Kang, Sung-Won;Cho, Sung-Jin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.3
    • /
    • pp.533-540
    • /
    • 2021
  • To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.

Pseudo Random Pattern Generator based on phase shifters (페이지 쉬프터 기반의 의사 난수 패턴 생성기)

  • Cho, Sung-Jin;Choi, U-Sook;Hwang, Yoon-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.707-714
    • /
    • 2010
  • Since an LFSR(linear feedback shift register) as a pattern generator has solely linear dependency in itself, it generates sequences by moving the bit positions for pattern generation. So the correlation between the generated patterns is high and thus reduces the possibility of fault detection. To overcome these problems many researchers studied to have goodness of randomness between the output test patterns. In this paper, we propose the new and effective method to construct phase shifter as PRPG(pseudo random pattern generator).

Two Predecessor Nongroup Cellular Automata (두 개의 직전자를 갖는 Nongroup CA)

  • Cho, Sung-Jin;Choi, Un-Sook;Kim, Han-Doo;Hwang, Yoon-Hee;Kim, Jin-Gyoung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.423-426
    • /
    • 2007
  • In this paper, we propose an algorithm for finding 90/150 Two Predecessor Nongroup Cellular Automata(TPNCA). Especially, we synthesize TPNCA for the minimal polynomial whose type is of the form xp(x) or x(x+1)p(x) using the proposed algorithm which is useful to study pseudorandom number generation, where p(x) is some primitive polynomial. Also we synthesize Two Predecessor Single Attractor CA and Two Predecessor Multiple Attractor CA which are useful to study hashing.

  • PDF

A Construction of Cellular Array Multiplier Over GF($2^m$) (GF($2^m$)상의 셀배열 승산기의 구성)

  • Seong, Hyeon-Kyeong;Kim, Heung-Soo
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.4
    • /
    • pp.81-87
    • /
    • 1989
  • A cellular array multiplier for performing the multiplication of two elements in the finite field GF($2^m$) is presented in this paper. This multiplier is consisted of three operation part ; the multiplicative operation part, the modular operation part, and the primitive irreducible polynomial operation part. The multiplicative operation part and the modular operation part are composed by the basic cellular arrays designed AND gate and XOR gate. The primitive iirreducible operation part is constructed by XOR gates, D flip-flop circuits and a inverter. The multiplier presented here, is simple and regular for the wire routing and possesses the properties of concurrency and modularity. Also, it is expansible for the multiplication of two elements in the finite field increasing the degree m and suitable for VLSI implementation.

  • PDF

Design of DSP Instructions and their Hardware Architecture for Reed-Solomon Codecs (Reed-Solomon 부호화/복호화를 위한 DSP 명령어 및 하드웨어 설계)

  • 이재성;선우명훈
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6A
    • /
    • pp.405-413
    • /
    • 2003
  • This paper presents new DSP (Digital Signal Processor) instructions and their hardware architecture to efficiently implement RS (Reed-Solomon) codecs, which is one of the most widely used FEC (Forward Error Control) algorithms. The proposed DSP architecture can implement various primitive polynomials by program, and thus, hardwired codecs can be replaced. The new instructions and their hardware architecture perform GF (Galois Field) operations using the proposed GF multiplier and adder. Therefore, the proposed DSP architecture can significantly reduce the number of clock cycles compared with existing DSP chips. It can perform RS decoding rate of up to 228.1 Mbps on 130MHz DSP chips.