New related-key rectangle attack on 42-round SHACAL-2
A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the distinguisher and a technique of key-byte gues...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2009-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74651994/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537606252232704 |
|---|---|
| author | WEI Yong-zhuang1 2 |
| author_facet | WEI Yong-zhuang1 2 |
| author_sort | WEI Yong-zhuang1 |
| collection | DOAJ |
| description | A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the distinguisher and a technique of key-byte guessing. It is shown that related-key rectan- gle attacks with only 2 related keys on 40-round and 42-round reduced SHACAL-2 all require data complexity of about 2235 chosen plaintexts and time complexity of about 2432.6 encryptions on 40-round reduced SHACAL-2, and 2472.6 en- cryptions on 42-round reduced SHACAL-2, respectively. The presented results are better than previous published crypt- analytic results on reduced SHACAL-2 in terms of both the data complexity and the time complexity. |
| format | Article |
| id | doaj-art-474ee271b6c04835b7fc193a49bc96e3 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2009-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-474ee271b6c04835b7fc193a49bc96e32025-01-14T08:30:12ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2009-01-013071174651994New related-key rectangle attack on 42-round SHACAL-2WEI Yong-zhuang12A new 34-round related-key rectangle distinguisher was constructed by exploiting the properties of the round transform of SHACAL-2. Moreover, two new relate-key rectangle attacks on 40-round and 42-round reduced SHACAL-2 were presented by using both the distinguisher and a technique of key-byte guessing. It is shown that related-key rectan- gle attacks with only 2 related keys on 40-round and 42-round reduced SHACAL-2 all require data complexity of about 2235 chosen plaintexts and time complexity of about 2432.6 encryptions on 40-round reduced SHACAL-2, and 2472.6 en- cryptions on 42-round reduced SHACAL-2, respectively. The presented results are better than previous published crypt- analytic results on reduced SHACAL-2 in terms of both the data complexity and the time complexity.http://www.joconline.com.cn/zh/article/74651994/block cipherrelate-key rectangle attackSHACAL-2 algorithmtime complexity |
| spellingShingle | WEI Yong-zhuang1 2 New related-key rectangle attack on 42-round SHACAL-2 Tongxin xuebao block cipher relate-key rectangle attack SHACAL-2 algorithm time complexity |
| title | New related-key rectangle attack on 42-round SHACAL-2 |
| title_full | New related-key rectangle attack on 42-round SHACAL-2 |
| title_fullStr | New related-key rectangle attack on 42-round SHACAL-2 |
| title_full_unstemmed | New related-key rectangle attack on 42-round SHACAL-2 |
| title_short | New related-key rectangle attack on 42-round SHACAL-2 |
| title_sort | new related key rectangle attack on 42 round shacal 2 |
| topic | block cipher relate-key rectangle attack SHACAL-2 algorithm time complexity |
| url | http://www.joconline.com.cn/zh/article/74651994/ |
| work_keys_str_mv | AT weiyongzhuang1 newrelatedkeyrectangleattackon42roundshacal2 AT 2 newrelatedkeyrectangleattackon42roundshacal2 |