Reference : Colliding Keys for SC2000-256
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/18750
Colliding Keys for SC2000-256
English
Biryukov, Alex mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) > ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Nikolic, Ivica [Nanyang Technological University, Singapore]
2014
Selected Areas in Cryptography, Lecture Notes in Computer Science
Springer International Publishing
Vol. 8781
Yes
International
978-3-319-13050-7
Selected Areas in Cryptography SAC 2014, 21st International Conference
14.08.2014
Montreal
Canada
[en] block cipher ; key collisions ; equivalent keys ; CRYPTREC ; hash function
[en] In this work we present analysis for the block cipher SC2000, which is in the Japanese CRYPTREC portfolio for standardization. In spite of its very complex and non-linear key-schedule we have found a property of the full SC2000-256 (with 256-bit keys) which allows the attacker to find many pairs of keys which generate identical sets of subkeys. Such colliding keys result in identical encryptions. We designed an algorithm that efficiently produces colliding key pairs in 2^39 time, which takes a few hours on a PC. We show that there are around 2^68 colliding pairs, and the whole set can be enumerated in 2^58 time. This result shows that SC2000-256 cannot model an ideal cipher. Furthermore we explain how practical collisions can be produced for both Davies-Meyer and Hiroses hash function constructions instantiated with SC2000-256 .
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/18750

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
biryukov-nikolic-colliding keys-sc2000-sac2014.pdfrevised versionAuthor postprint333.47 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.