Rotational Cryptanalysis of ARX

Reference : Rotational Cryptanalysis of ARX


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/20041

Title :	Rotational Cryptanalysis of ARX
Language :	English
Author, co-author :	Khovratovich, Dmitry [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Nikolic, Ivica [> >]
Publication date :	2010
Main document title :	Fast Software Encryption 17th International Workshop, FSE 2010, Seoul, Korea
Pages :	333-346
Peer reviewed :	Yes
On invitation :	No
Audience :	International
ISBN :	978-3-642-13857-7
Event name :	Fast Software Encryption
Event date :	February 7-10, 2010
Event place (city) :	Seoul
Event country :	South Korea
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.
Permalink :	http://hdl.handle.net/10993/20041
Commentary :	Fast Software Encryption

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	chp%3A10.1007%2F978-3-642-13858-4_19.pdf		Publisher postprint	216.46 kB	View/Open

All documents in ORBi^lu are protected by a user license.