Reference : Rotational Cryptanalysis of ARX
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Rotational Cryptanalysis of ARX
Khovratovich, Dmitry mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Nikolic, Ivica [> >]
Fast Software Encryption 17th International Workshop, FSE 2010, Seoul, Korea
Fast Software Encryption
February 7-10, 2010
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.
Fast Software Encryption

File(s) associated to this reference

Fulltext file(s):

Open access
chp%3A10.1007%2F978-3-642-13858-4_19.pdfPublisher postprint216.46 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.