Fault analysis on elliptic curve cryptosystems with sliding window method
Based on the principle of sign change fault attacks,an improved fault analysis method was presented against elliptic curve cryptosystems with sliding window method for point multiplication.When faults on double instruction it could effectively solve the “zero block failure” problem.Experiment result...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)01-0071-08/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Based on the principle of sign change fault attacks,an improved fault analysis method was presented against elliptic curve cryptosystems with sliding window method for point multiplication.When faults on double instruction it could effectively solve the “zero block failure” problem.Experiment results demonstrate that 15 times fault injections are enough to recover full 192bit key.When faults on add instruction,a new fault analysis method was proposed.Experiment results demonstrate one fault injection can reduce searching space 2<sup>7</sup>~2<sup>15</sup>.The method presented here can provide some ideas for fault attack on other cryptosystems using sliding window method. |
|---|---|
| ISSN: | 1000-436X |