랜덤 순열의 직렬 합성과 병렬 합성 사이의 트래이드오프에 관한 연구 = On the Trade-off Between Composition and XOR of Random Permutations

다국어 초록 (Multilingual Abstract)

Both composition and XOR are operations widely used to enhance security of cryptographic schemes. The more number of random permutations we compose (resp. XOR), the more secure random permutation (resp. random function) we get. Combining the two methods, we consider a generalized form of random function:SUM<SUP>s</SUP>-CMP<SUP>c</SUP>=(π<SUB>sc</SUB>°?°π<SUB>(s-1)c+1</SUB>)???(π<SUB>c</SUB>°?°π₁) where π₁,?,π<SUB>sc</SUB>are random permutations. Given a fixed number of random permutations, there seems to be a trade-off between composition and XOR for security of SUM<SUP>s</SUP>-CMP<SUP>c</SUP>. We analyze his trade-off based on some upper bound of insecurity of SUM<SUP>s</SUP>-CMP<SUP>c</SUP>, and investigate what the optimal number of each operation is, in order to lower the upper bound.

목차 (Table of Contents)

• 요약
• ABSTRACT
• Ⅰ. Introduction
• Ⅱ. Preliminaries
• Ⅲ. A Random Function and Its Security
• Ⅳ. Trade-off between Composition and XOR
• Ⅴ. Concluding Remarks
• REFERENCES
• 저자소개