Differential Fault Attack on LEA
LEA is a symmetric block cipher proposed in 2014. It uses ARX design and its main advantage is the possibility of a fast software implementation on common computing platforms. In this paper we propose a Differential Fault Analysis attack on LEA. By injecting random bit faults in the last round and i...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/80626 http://hdl.handle.net/10220/40634 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
sg-ntu-dr.10356-80626 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-806262023-02-28T19:30:04Z Differential Fault Attack on LEA Jap, Dirmanto Breier, Jakub School of Physical and Mathematical Sciences Temasek Laboratories Fault attack DFA LEA LEA is a symmetric block cipher proposed in 2014. It uses ARX design and its main advantage is the possibility of a fast software implementation on common computing platforms. In this paper we propose a Differential Fault Analysis attack on LEA. By injecting random bit faults in the last round and in the penultimate round, we were able to recover the secret key by using 258 faulty encryptions in average. If the position of faults is known, then only 62 faulty encryptions are needed in order to recover the key which surpasses the results achieved so far. Accepted Version 2016-06-08T07:16:12Z 2019-12-06T13:53:27Z 2016-06-08T07:16:12Z 2019-12-06T13:53:27Z 2015 2015 Journal Article Jap, D., & Breier, J. (2015). Differential Fault Attack on LEA. Lecture Notes in Computer Science, 9357, 265-274. https://hdl.handle.net/10356/80626 http://hdl.handle.net/10220/40634 10.1007/978-3-319-24315-3 193460 en Lecture Notes in Computer Science © 2015 International Federation for Information Processing (IFIP). This is the author created version of a work that has been peer reviewed and accepted for publication by Lecture Notes in Computer Science, IFIP. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1007/978-3-319-24315-3]. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
Fault attack DFA LEA |
| spellingShingle |
Fault attack DFA LEA Jap, Dirmanto Breier, Jakub Differential Fault Attack on LEA |
| description |
LEA is a symmetric block cipher proposed in 2014. It uses ARX design and its main advantage is the possibility of a fast software implementation on common computing platforms. In this paper we propose a Differential Fault Analysis attack on LEA. By injecting random bit faults in the last round and in the penultimate round, we were able to recover the secret key by using 258 faulty encryptions in average. If the position of faults is known, then only 62 faulty encryptions are needed in order to recover the key which surpasses the results achieved so far. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Jap, Dirmanto Breier, Jakub |
| format |
Article |
| author |
Jap, Dirmanto Breier, Jakub |
| author_sort |
Jap, Dirmanto |
| title |
Differential Fault Attack on LEA |
| title_short |
Differential Fault Attack on LEA |
| title_full |
Differential Fault Attack on LEA |
| title_fullStr |
Differential Fault Attack on LEA |
| title_full_unstemmed |
Differential Fault Attack on LEA |
| title_sort |
differential fault attack on lea |
| publishDate |
2016 |
| url |
https://hdl.handle.net/10356/80626 http://hdl.handle.net/10220/40634 |
| _version_ |
1759855388991160320 |