연산 순서 변경에 따른 범용 프로세서에서 효율적인 CHAM-like 구조
Efficient CHAM-Like Structures on General-Purpose Processorswith Changing Order of Operations
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
CHAM은 ISO/IEC 표준 블록암호 운영 모드에서 암호화 함수가 복호화 함수보다 자주 사용되는 점을 고려하여 암호화 속도를 강조하여 설계되었다. 현대 범용 프로세서 구조의 슈퍼스칼라 아키텍처에서는 연산 구성이 동일하더라도 연산의 순서가 달라지면 처리 속도가 달라질 수 있다. 본 논문에서는 ARX 기반 블록암호인 CHAM의 연산 순서를 재배치한 구조 CHAM-like 구조들에 대해 범용 프로세서 환경에서 단일 블록 구현과 병렬 구현에 대한 구현 효율성과 안전성을 분석한다. 본 논문에서 제시한 구조는 암호화 속도 관점에서 최소 약 9.3%에서 최대 약 56.4% 효율적이다. 안전성 분석은 CHAM-like 구조들에 차분 공격과 선형 공격에 대한 저항성을 평가한다. 보안 마진 관점에서 차분 공격은 3.4%, 선형 공격은 6.8% 차이를 보여 효율성 차이에 비해 보안 강도는 비슷함을 보인다. 이러한 결과는 ARX 기반 블록암호 설계 관점에서 활용가능하다.
Abstract
CHAM is designed with an emphasis on encryption speed, considering that in the ISO/IEC standard block cipher operation mode, encryption functions are used more often than decryption functions. In the superscalar architecture of modern general-purpose processors, different ordering of operations can lead to different processing speeds, even if the computation configuration is the same. In this paper, we analyze the implementation efficiency and security of CHAM-like structures, which rearrange the order of operations in the ARX-based block cipher CHAM, for single-block and parallel implementations in a general-purpose processor environment. The proposed structures are at least 9.3% and at most 56.4% efficient in terms of encryption speed. The security analysis evaluates the resistance of the CHAM-like structures to differential and linear attacks. In terms of security margin, the difference is 3.4% for differential attacks and 6.8% for linear attacks, indicating that the security strength is similar compared to the efficiency difference. These results can be utilized in the design of ARX-based block ciphers.
참고문헌 (15)
- Deukjo Hong, "HIGHT: A New Block Cipher Suitable for Low-Resource Device", LNCS, 4249, pp.46~59 (2006), Springer
- Ray Beaulieu, "The SIMON and SPECK lightweight block ciphers", Design Automation Conference (DAC), 2015 52nd ACM, IEEE, pp.2015[DOI]
- Deukjo Hong, "LEA:A 128-bit Block Cipher for Fast Encryption on Common Processors", International Workshop on Information Security Applications (WISA’13), pp.3~27 (2014), Springer
- Bonwook Koo, "CHAM: A family of lightweight block ciphers for resource-constrained devices", International Conference on Information Security and Cryptology (ICISC'17), pp.3~25 (2018), Springer
- Dongyoung Roh, "Revised version of block cipher CHAM", International Conference on Information Security and Cryptology (ICISC'19), pp.1~19 (2020), Springer
- C. W. Barrett, "Handbook of satisability", pp.825~885 (2009), IOS Press
- Towards Finding Optimal Differential Characteristics for ARX: Application to Salsa20, "Nicky Mouha", IACR, ~, pp.IACR ePrint 2013-328 (2013)
- Vijay Ganesh, "A Decision Procedure for Bit-Vectors and Arrays", Computer Aided Verification 2007, pp.519~531 (2007), Springer
- Helger Lipmaa, "Efficient algorithms for computing differential properties of addition", FSE 2001, pp.336~350 (2002), Springer
- Daniel J. Bernstein, "New Stream Cipher Designs", pp.84~97 (2008), Springer
- Xuejia Lai, "Markov Ciphers and Differential Cryptanalysis", EUROCRYPT 1991, pp.17~38 (1991), Springer
- Yunwen Liu, "Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey", Applied Cryptography and Network Security -14th international conference(ACNS 2016), pp.485~499 (2016), Springer
- Nicky Mouha, "Chaskey: an efficient MAC algorithm for 32-bit microcontrollers", Selected Areas in Cryptography(SAC 2014), pp.306~323 (2014), Springer
- Ernst Schulte-Geers, "On CCZ-equivalence of addition mod 2n", Designs, Codes and Cryptography, 66, pp.111~127 (2012)
- Huang, Mingjiang, "Automatic Search for the Linear (Hull) Characteristics of ARX Ciphers:Applied to SPECK, SPARX, Chaskey, and CHAM‐64", IACR ePrint 2019-1319, ~ (2020)