ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Conditional Re-encoding Method for Cryptanalysis-Resistant White-Box AES
Cited 13 time in scopus Download 8 time Share share facebook twitter linkedin kakaostory
저자
이승광, 최두호, 최용제
발행일
201510
출처
ETRI Journal, v.37 no.5, pp.1012-1022
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.15.0114.0025
초록
Conventional cryptographic algorithms are not sufficient to protect secret keys and data in white-box environments, where an attacker has full visibility and control over an executing software code. For this reason, cryptographic algorithms have been redesigned to be resistant to white-box attacks. The first white-box AES (WB-AES) implementation was thought to provide reliable security in that all brute force attacks are infeasible even in white-box environments; however, this proved not to be the case. In particular, Billet and others presented a cryptanalysis of WB-AES with 230 time complexity, and Michiels and others generalized it for all substitution-linear transformation ciphers. Recently, a collision-based cryptanalysis was also reported. In this paper, we revisit Chow and others's first WB-AES implementation and present a conditional re-encoding method for cryptanalysis protection. The experimental results show that there is approximately a 57% increase in the memory requirement and a 20% increase in execution speed.
키워드
AES, Countermeasure, Cryptanalysis, White-box cryptography
KSP 제안 키워드
AES implementation, Brute-force attack, Cryptographic Algorithms, Encoding method, Execution speed, Linear transformation, Time Complexity, Whitebox Cryptography(WBC), secret key, software code