Browse > Article
http://dx.doi.org/10.13089/JKIISC.2005.15.4.3

Algorithm for The Relative Phase Shifts between PN Sequences Generated by 90/150 Cellular Automata  

Cho, Sung-Jin (Pukyong National University)
Choi, Un-Sook (Youngsan University)
Kim, Han-Doo (Inje University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.15, no.4, 2005 , pp. 3-10 More about this Journal
Abstract
Every cell position of a maximum-length 90/150 cellular automata(CA) generates the same pseudo-noise(PN) sequence corresponding to the characteristic polynomial of the CA with a phase shift. Unlike LFSRs, the phase shift is generally different between stages of a CA. In this paper, we propose an algorithm to compute relative phase shifts between stage of a CA. Our algorithm does not need Shank's algorithm to compute relative phase shifts and does not need any previous phase shifts to compute a phase shift. Moreover it is done in time $O(2^n)$.
Keywords
90/150 CA; Phase ships; PN sequences; Primitive polynomials;
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. Sarkar, 'The filter-combiner model for memoryless synchronous stream ciphers', in Proceedings of Crypto 2002, Lecture Notes in Computer Science, Springer, Berlin 2442, pp. 533-548, 2002
2 박영희, 정병천, 이윤호, 김희열, 이재원, 윤현수, 'Diffie-Hallman 키 교환을 이용한 확장성을 가진 계층적 그룹키 설정 프로토콜', 정보보호학회논문지, 13(5), pp.3-15, 2003
3 R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, 1997
4 S.W. Golomb, Shift Register Sequences, Holden Day, 1967
5 홍진, 이동훈, 지성택, 'LFSM 기반의 비선형 필터 모델의 특성', 정보보호학회논문지, 14(2), pp.75-83, 2004
6 박영호, 이경현, '이동네트워크 환경에서 그룹키 관리구조', 정보보호학회논문지, 12(2), pp.89-100, 2002
7 이상원, 천정희, 김용대, 'Pairing을 이용한 트리 기반 그룸키 합의 프로토콜', 정보보호학회논문지, 13(3), pp.101-110, 2003
8 P. Sarkar, 'Computing Shifts in 90/150 cellular automata sequences', Finite Fields Their Appl. 42, pp. 340-352, 2003
9 M. Serra, T. Slater, J.C. Muzio and D.M. Miller, The analysis of one dimensional linear cellular automata and their aliasing properties, IEEE Trans Computer-Aided Design, 9, pp. 767-778, 1990   DOI   ScienceOn
10 S. Wolfram, 'Statistical Mechanics of Cellular Automata', Rev. Mod. Phys. 55, pp. 601-644, 1983   DOI
11 권정옥, 황정연, 김현정, 이동훈, 임종인, '일방향 함수와 XOR을 이용한 효율적인 그룹키 관리 프로토콜: ELKH', 정보보호학회논문지, 12(6), pp.93-1121, 2002
12 조태남, 이상호, '(2,4)-트리를 이요한 그룹키 관리', 정보보호학회논문지, 11(4), pp.77-89, 2001
13 최언숙, 조성진, '최대길이를 갖는 셀룰라 오토마타의 생성', 정보보호확회논문지, 14(6), pp.25-30, 2004
14 A.K. Das and P.P. Chaudhuri, 'Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation', IEEE Trans. Comput. 42, pp. 340-352, 1993   DOI   ScienceOn
15 S.J. Cho, U.S. Choi and H.D. Kim, 'Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA', Mathematical and Computer Modelling 36, pp. 979-986, 2002   DOI   ScienceOn
16 P.H. Bardell, 'Analysis of Cellular Automata Used as Pseudorandom Pattern Generators', Proc. IEEE int. Test. Conf. pp.762-767, 1990
17 S.J. Cho, U.S. Choi and H.D. Kim, 'Analysis of complemented CA derived from a linear TPMACA', Computers and Mathematics with Applications 45, pp.689-698, 2003   DOI   ScienceOn
18 S. Nandi and P.P. Chaudhuri, 'Additive Cellular Automata as an on-chip test pattern generator', Test Symposium 1993, Proceedings of the Second Asian, IEEE, pp.166-171, 1993
19 전준철, 김현성, 이형목, 유기영, '$GF(2^m)$ 상의 셀룰라 오토마타를 이용한 VLSI 구조', 정보보호학회논문지, 12(6), pp. 87-94, 2002
20 S. Tezuka and M. Fushimi, 'A method of designing cellular automata as pseudorandom number generators for built-in self-test for VLSI', Contemporary Mathematica 168, pp.363-367, 1994
21 조성진, 최언숙, 황윤희, 김한두, 표용수, 'GF(2p) 위에서의 SACA의 상태전이 분석', 정보보호학회논문지, 15(2), pp.105-111, 2005