- ON A SECURE BINARY SEQUENCE GENERATED BY A QUADRATIC POLYNOMIAL ON $mathbb{Z}_{2^n}$
- ㆍ 저자명
- Rhee. Min-Surp
- ㆍ 간행물명
- Journal of applied mathematics & informatics
- ㆍ 권/호정보
- 2011년|29권 1호|pp.247-255 (9 pages)
- ㆍ 발행정보
- 한국전산응용수학회
- ㆍ 파일정보
- 정기간행물| PDF텍스트
- ㆍ 주제분야
- 기타
Invertible functions with a single cycle property have many cryptographic applications. The main context in which we study them in this paper is pseudo random generation and stream ciphers. In some cryptographic applications we need a generator which generates binary sequences of period long enough. A common way to increase the size of the state and extend the period of a generator is to run in parallel and combine the outputs of several generators with different period. In this paper we will characterize a secure quadratic polynomial on $mathbb{Z}_{2^n}$, which generates a binary sequence of period long enough and without consecutive elements.