상세정보
학술대회
A New Fault Cryptanalysis on Montgomery Ladder Exponentiation Algorithm
- 발행일
- 200911
- 출처
- International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS) 2009, pp.896-899
- 출판사
- ACM
- 협약과제
- 09MS5600, 부채널 공격 방지 원천 기술 및 안전성 검증 기술개발, 최두호
- 초록
- The Montgomery ladder exponentiation algorithm is recognized as a very efficient countermeasure against Simple Power Analysis and C Safe-Error Attacks on RSA or elliptic curve cryptosystem. In this paper, we demonstrate the vulnerability of the Montgomery ladder algorithm to fault analysis attack when an error is injected during its operation in an embedded cryptographic chip. After injecting an error, we measure the power traced and compare it with an original correct trace. As a result, we can derive the secret key of the public-key cryptosystems such as RSA by computing the correlation coefficients of two power traces for correct and faulty cryptographic operations with same input. Copyright © 2009 ACM.
- KSP 제안 키워드
- Correlation Coefficient, Elliptic curve cryptosystems, Public-key Cryptosystems, cryptographic chip, fault analysis, power traces, secret key, simple power analysis