The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

On a Multiple-cycle Binary Sequence Genrator Based on S-box

S-box 형태의 다 수열 발생기에 관한 연구

  • 이훈재 (경운대학교 컴퓨터전자정보공학부)
  • Published : 2000.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

Keywords

References

  1. Henry J. Beker and Fred C. Piper, 'Cipher systems : The Protection of Communications,' Northwood Books, London, 1982
  2. Henk C. A. van Tilborg, 'An Introduction to Cryptology,' KLUWER ACADEMIC PUBLISHERS, Boston, etc., 1988
  3. T. Siegenthaler, 'Correlation-Immunity of Nonlinear Combining Functions for Cryptographic Applications,' IEEE Trans. on Infor. Theo., Vol.IT-30, No.5, pp.776-780, Sep. 1984
  4. J. Dj. Galic, 'The Number of Output Sequences of a Binary Sequence Generator,' LNCS 547, Advances in Cryptology-EUROCRYPT'91, pp.160-167, 1991
  5. 이훈재, 문상재, '다수열 출력 이진 수열 발생기', 한국통신정보보호학회 논문지, 제7권 제3호, pp.11-22, 1997
  6. E. Dawson, L. Nielsen, 'Automated Cryptanalysis of XOR Plaintext Strings,' Cryptologia, Vol.XX, No.2, pp.165-181, Apr. 1996 https://doi.org/10.1080/0161-119691884870
  7. Philip R. Geffe, 'How to Protect Data with Ciphers that are really hard to Break,' Electronics, pp.99-101, Jan. 1973
  8. 최회동, 노종선, 'PN 시퀸스를 이용한 S-box 설계에 관한 연구', 한국통신학회 논문지, 제20권 제2호, pp.319-326, 1995
  9. R. A. Rueppel and O. J. Stafflebach, 'Products of Linear Recurring Sequences with Maximum Com plexity,' IEEE Trans. on Infor. Thea., Vol.IT-33, No.1, pp.124-131, Jan. 1987 https://doi.org/10.1109/TIT.1987.1057268
  10. J. Dj. Golic, 'On the Linear Complexity of Functions of Periodic GF(q) Sequences,' IEEE Trans. on Infor. Thea., Vol.IT-35, No.1, pp.69-75, Jan. 1989 https://doi.org/10.1109/18.42178
  11. B. Park, H. Choi, T. Chang and K. Kang, 'Period of Sequences of Primitive Polynomials,' Electronics Letters, Vol.29, No.4, pp.390-391, Feb, 1993