마스킹 기법이 적용된 SEED 알고리즘에 대한 취약점 분석
Analysis on Vulnerability of Masked SEED Algorithm
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
전력분석의 대응기법으로 가장 널리 알려진 마스킹 기법은 암호 알고리즘 수행 도중 비밀 중간 값을 노출시키지않게 함으로써 공격자가 필요한 정보를 얻지 못하도록 한다. 마스킹 기법은 대칭키 암호 알고리즘에 적용되어 많은연구가 진행되었다. 국제표준 알고리즘인 SEED 알고리즘에 대해 마스킹 대응기법 연구가 진행되었다. Cho 등이제안한 Masked SEED 알고리즘은 1차 전력분석에 안전할 뿐만 아니라 Arithmetic to Boolean 변형 함수의호출을 줄임으로써 효율성까지 만족시켰다. 본 논문에서는 Cho 등이 제안한 Masked SEED에 대한 취약점을 분석하였다. 효율적인 연산을 위해 추가로 수행되는 사전연산에 의해 마스크 값이 노출되고 이를 이용하여 1차 전력분석 공격으로 비밀키를 복원하였다. 우리는 이론적인 측면과 실험적인 측면을 모두 고려하여 취약점을 분석하였으며제안한 공격기법은 Cho 등이 제안한 알고리즘이 탑재된 모든 디바이스에서 공통적으로 적용될 수 있음을 예상한다.
Abstract
Masking technique that is most widely known as countermeasure against power analysis attack prevents leakage for sensitive information during the implementations of cryptography algorithm. it have been studied extensively until now applied on block cipher algorithms. Masking countermeasure have been applied to international standard SEED algorithm. Masked SEED algorithm proposed by Cho et al , not only protects against first order power analysis attacks but also efficient by reducing the execution of Arithmetic to Boolean converting function. In this paper, we analyze the vulnerability of Cho’s algorithm against first order power analysis attacks. We targeted additional pre-computation to improve the efficiency in order to recover the random mask value being exploited in first order power analysis attacks. We describe weakness by considering both theoretical and practical aspects and are expecting to apply on every device equipped with cho’s algorithm using the proposed attack method.
참고문헌 (22)
- P. Kocher, "“Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS,and Others Systems,” CRYPTO ‘96", LNCS, 1109, pp.104~113 (1996)
- E. Biham, "“Differential Fault Analysis of Secret Key Cryptosystems,”CRYPTO ‘97", LNCS, 1294, pp.513~525 (1997)
- D. Boneh, "“On the Importance of Checking Cryptographic Protocols for Faults,”EUROCRYPT ‘97", LNCS, 1233, pp.37~51 (1997)
- P. Kocher, "Introduction to differential power analysis and related attacks" (1998), Cryptography Research
- P. Kocher, "“Differential power analysis,” CRYPTO ‘99", LNCS, 1666, pp.388~397 (1999)
- S. Chari, "“Template Attacks,” CHES 2002", LNCS, 2523, pp.13~28 (2002)
- E. Brier, "“Correlation power analysis with a leakage model,” CHES", LNCS, 3156, pp.16~29 (2004)
- "Block Cipher Algorithm SEED"[URL]
- "Information Technology – Security Techniques – Encryption Algorithms –Part 3: Block Ciphers", ISO, 2005
- 한동국, "전력 분석 공격에 안전한 효율적인 SEED 마스킹 기법", 정보처리학회논문지C, 17(3), pp.233~242 (2010), 한국정보처리학회
- 최용제, "KLA-SCARF 부채널 검증 보드 구현", 정보보호학회논문지, 24(1), pp.229~240 (2014), 한국정보보호학회[DOI]
- Y. Lu, "SEED Masking Implementations against Power Analysis Attacks", IEEE Asia Pacific Conference on Circuit and Systems, pp.1199~1202 (2010)
- S. Mangard, "Power Analysis Attacks: Revealing the Secrets of Smart Cards., (Advances in Information Security)" (2007), Springer
- S. Chari, "“Towards Sound Approaches to Counteract Power-Analysis Attacks,”CPYPTO ‘99", LNCS, 1666, pp.398~412 (1999)
- L. Goubin, "“DES and Differential Power Analysis - The “Duplication” Method,” CHES 1999", LNCS, 1717, pp.158~172 (1999)
- T. Messerges, "Power Analysis Attacks and Countermeasures for Cryptographic Algorithms", Ph.D., pp.2000
- J-S. Coron, "“On boolean and arithmetic masking against differential power analysis,” CHES 2000", LNCS, 965, pp.231~237 (2000)
- M. Nassar, "RSM: a small and fast countermeasure for AES, secure against 1st and 2nd-order Zero-Offset SCAs", Design, Automation & Test in Europe Conference & Exhibition (DATE) 2012, pp.1173~1178 (2012)
- L. Goubin, "“A sound method for switching between boolean and arithmetic masking,”CHES 2001", LNCS, 2162, pp.3~15 (2001)
- J-S. Coron, "“A new algorithm for switching from arithmetic to boolean masking,” CHES 2003", LNCS, 2779, pp.89~97 (2003)
- O. Neibe, "“Switching blindings with a view towards idea,” CHES 2004", LNCS, 3156, pp.230~239 (2004)
- J-S. Coron, "“Secure conversion between boolean and arithmetic masking of any order,” CHES 2014", LNCS, 3156, pp.188~205 (2014)