GIFT-128에 대한 SITM 공격: NIST 경량암호 최종 후보 GIFT-COFB 적용 방안 연구
SITM Attacks on GIFT-128: Application to NIST Lightweight Cryptography Finalist GIFT-COFB
3
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
SITM (See-In-The-Middle) 공격은 부채널 정보를 활용한 차분 분석 기법 중 하나로, CHES 2020에서 제안되었다. 이 기법은 부분적으로 부채널 마스킹이 적용된 블록암호에서 부채널 마스킹이 적용되지 않은 중간 라운드의 전력 파형을 이용해 차분 분석을 진행한다. 블록암호 GIFT는 CHES 2017에 제안된 경량암호로, 블록암호 PRESENT에서 발견된 취약점을 보완하고 더욱 효율적인 구현이 가능하도록 설계되었다. 본 논문에서는 부분 마스킹이 적용된 GIFT-128에 대한 SITM 공격을 제안한다. 이 공격은 4-라운드와 6-라운드 부분 마스킹이 적용된 GIFT-128을 공격대상으로 하며, 공격에 필요한 시간/데이터 복잡도는 각각 /, / 이다. 본 논문에서는 SITM 공격에서 사용 가능한 마스터키 복구 논리를 비교하여, 상황에 따라 더욱 효율적인 논리를 선택하는 기준을 성립한다. 마지막으로, NIST 표준 경량암호 공모사업 최종 후보 중 하나인 GIFT-COFB에 해당 공격을 적용하는 방안을 제시한다.
Abstract
The SITM (See-In-The-Middle) proposed in CHES 2020 is a methodology for side-channel assisted differential cryptanalysis. This technique analyzes the power traces of unmasked middle rounds in partial masked SPN block cipher implementation, and performs differential analysis with the side channel information. Blockcipher GIFT is a lightweight block cipher proposed in CHES 2017, designed to correct the well-known weaknesses of block cipher PRESENT and provide the efficient implementation. In this paper, we propose SITM attacks on partial masked implementation of GIFT-128. This attack targets 4-round and 6-round masked implementation of GIFT-128 and time/data complexity is /, /. In this paper, we compare the masterkey recovery logic available in SITM attacks, establishing a criterion for selecting more efficient logic depending on the situation. Finally, We introduce how to apply the this attack to GIFT-COFB, one of the finalist candidates in NIST lightweight cryptography standardization process.
참고문헌 (17)
- S. Banik, "GIFT: a small present, in International Conference on Cryptographic Hardware and Embedded Systems", LNCS, 10529, pp.321~345 (2017)
- W. Unger, "Side-channel Leakage Assessment Metrics : A Case Study of GIFT Block Ciphers", IEEE Computer Society Annual Symposium on VLSI, IEEE, pp.236~241 (2021)
- R, Zong, "Towards Keyrecovery-attack friendly distinguishers : Application to GIFT-128", IACR Transactions on Symmetric Cryptology, 2021(1), pp.156~184 (2021)
- A. Adomnicai, "Fixslicing : a new GIFT representation : fast constant-time implementations of GIFT and GIFT-COFB on ARM Cortex-M", IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(3), pp.402~427 (2020)
- "SUNDAE-GIFT"[URL]
- "HyENA"[URL]
- "GIFT-COFB"[URL]
- E. Biham, "Differential cryptanalysis of DES-like cryptosystems", Journal of CRYPTOLOGY, 4(1), pp.3~72 (1991)
- P. Kocher, "Differential power analysis, In:Annual international cryptology conference", LNCS, 1666, pp.388~397 (1999)
- S. Nikova, "Threshold Implementations Against Side-Channel Attacks and Glitches, International conference on information and communications security", LNCS, 4307(1), pp.529~545 (2006)
- J. Breier, "SCADPA: Side-channel assisted differential-plaintext attack on bit permutation based ciphers", 2018Design, Automation & Test in Europe Conference & Exhibition, pp.1129~1134 (2018), IEEE
- S. Bhasin, "Sitm : See-in-the-middle side-channel assisted middle round differential cryptanalysis on spn block ciphers", IACR Transactions on Cryptographic Hardware and Embedded Systems, 2020(1), pp.95~122 (2019)
- A. Bogdanov, "Present: An ultra-lightweight block cipher," International Workshop on Cryptographic Hardware and Embedded Systems", LNCS, 4727, pp.450~466 (2007)
- C. Blondeau, "Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities, In: EUROCRYPT 2014", LNCS, 8441, pp.165~182 (2014)
- C. Jooyeon, "Linear cryptanalysis of reduced-round PRESENT, In: CT-RSA 2010", LNCS, 5985, pp.302~317 (2010)
- 박종현, "블록암호 PRESENT에 대한 향상된 SITM 공격", 정보보호학회논문지, 32(2), pp.155~162 (2022), 한국정보보호학회[DOI]
- "NIST Lightweight Cryptography Standar dization: Finalists Announced"[URL]