Abstract :
[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.
Main work title :
Fast Software Encryption 17th International Workshop, FSE 2010, Seoul, Korea
Scopus citations®
without self-citations
80