Reference : Rotational Cryptanalysis of ARX |
Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
Engineering, computing & technology : Computer science | |||
http://hdl.handle.net/10993/20041 | |||
Rotational Cryptanalysis of ARX | |
English | |
Khovratovich, Dmitry ![]() | |
Nikolic, Ivica [> >] | |
2010 | |
Fast Software Encryption 17th International Workshop, FSE 2010, Seoul, Korea | |
333-346 | |
Yes | |
No | |
International | |
978-3-642-13857-7 | |
Fast Software Encryption | |
February 7-10, 2010 | |
Seoul | |
South Korea | |
[en] In this paper we analyze the security of systems based on
modular additions, rotations, and XORs (ARX systems). We provide both theoretical support for their security and practical cryptanalysis of real ARX primitives. We use a technique called rotational cryptanalysis , that is universal for the ARX systems and is quite efficient. We illustrate the method with the best known attack on reduced versions of the block cipher Threefish (the core of Skein). Additionally, we prove that ARX with constants are functionally complete, i.e. any function can be real- ized with these operations. | |
http://hdl.handle.net/10993/20041 | |
Fast Software Encryption |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.