물리 계층 보안을 위한 암호학적인 FCSRs 특성 및 분석 = Characteristics and the Analyses of Cryptographic FCSR Sequences for Physical Layer Security

국문 초록 (Abstract)

스트림 암호 구성 인자 FCSR(Feedback with Carry Shift Regiater)은 물리계층 보안 기술 및 암호기술에 접목시켜 안전하고 효율적인 무선 통신 보안 시스템을 구축하는 것을 목적으로 한다. 최근에 FCSR은 간단한 선형 변환을 통해 암호화를 수행하는 채널 암호로 연속 제거(successive cancellation) 복호를 사용해서 채널 용량에 근접하는 통신을 수행할 수 있다. 유한체 GF(p)에서 r=2p+1이 2-소수이고, p에 대한 2의 위수 m을 가질 때, q≥re, (e≥2)를 연결정수로 갖는 FCSR 생성된 출력 수열에 대한 선형복잡도를 구한다. 또한, 합산 난수 발생기(Summation Generator)는 LFSR의 출력 수열을 정수 합산하여 키 수열을 발생한다. 또한 두개의 FCSR 출력 수열을 상관관계에 안전한 비트별 논리합(bitwise exclusive-oring)을 이용한 이진 난수열 발생기를 제안하고, 물리계층 보안을 위한 출력된 수열의 암호학적 특성을 살펴본다.

다국어 초록 (Multilingual Abstract)

We will construct a secure and efficient wireless communication system by combining a Feedback with Carry Shift Regiater (FCSR) with the physical layer security and cryptographic techniques. Recently, the FCSR can provide a capacity achieving communication and it is considered as a new paradigm of cryptographic theory that resolves many open problems in the information theory and cryptographic theory. Among various applications, we focused to devise new security schemes which exploit properties of FCSRs. We have derived the linear complexity of a binary sequence generated by FCSR under the following condition: q is a power of a prime such that q=re, (e ≥ 2) and r=2p+1, where both r and p are 2-prime. Also, a summation generator creates sequence from addition with carry of LFSR (Linear Feedback Shift Register) sequences. Likewise, it is possible to generate keystream by bitwise exclusive-oring on two FCSR sequences. In this paper, we described the cryptographic properties of a sequence generated by the FCSRs in view of the physical layer security.

목차 (Table of Contents)

• 요약
• Abstract
• 1. 서론
• 2. FCSR 소개
• 3. FCSR의 선형 복잡도
• 4. 난수 발생기 제안 및 특성
• 5. 결론
• 참고문헌

참고문헌 (Reference)

1 D. E. Kunth, "The art of computer Programming, vol.2 : Seminumberical Algorithms" Addison-Wesley 1981

2 J. M. Massey, "Shift-Register Synthesis and BCH Decoding" IT (IT): 122-127, 1969

3 E. Hof, "Secret and private rates on degraded wire-tap channels via polar coding" 94-96, 2010

4 S. B. Korada, "Polar codes: Characterization of exponent, bounds, and constructions"

5 E. Arıkan, "Performance of short polar codes under ML decoding" 1-6, 2009

6 A.Klapper, "Large Period nearly debruijn FCSR Sequences" 263-273, 1995

7 M Baldi, "LDPC codes in the McEliece cryptosystem: attacks and countermeasures" 160-174, 2009

8 Hua Loo Keng, "Introduction to Number Theory" Springer-Verlag 1982

9 M.Goresky, "Feedback Registers based on Ramified Extensions of the 2-Adic Numbers" 215-222, 1994

10 W.Meier, "Fast Correlation Attacks on Certain Stream Ciphers" 1 (1): 159-176, 1989

11 L. Minder, "Cryptanalysis of the Sidelnikov cryptosystem" 347-360, 2007

12 Meier, "Correlation Properties of combiners with memory in stream ciphers" 5 (5): 67-86, 1992

13 J. Muramatsu, "Construction of wiretap channel codes by using sparse matrices" 105-109, 2009

14 R.A. Rueppel, "Analysis and Design of Stream Ciphers In Communications and Control Engineering Series" Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo 1986

15 H. Mahdavifar, "Achieving the secrecy capacity of wiretap channels using polar codes"

16 Changho Seo, "A lower bound on the linear span of an FCSR" 46 (46): 691-693, 2001