References of "Nikolic, Ivica"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailRotational Cryptanalysis of ARX Revisited
Khovratovich, Dmitry UL; Nikolic, Ivica; Pieprzyk, Josef et al

in Fast Software Encryption - 22nd International Workshop, FSE 2015 Istanbul, Turkey, March 8-11, 2015, Revised Selected Papers (2015)

Detailed reference viewed: 57 (0 UL)
Full Text
Peer Reviewed
See detailColliding Keys for SC2000-256
Biryukov, Alex UL; Nikolic, Ivica

in Selected Areas in Cryptography, Lecture Notes in Computer Science (2014)

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 ... [more ▼]

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 . [less ▲]

Detailed reference viewed: 49 (1 UL)
Full Text
Peer Reviewed
See detailComplementing Feistel Ciphers
Biryukov, Alex UL; Nikolic, Ivica

in Fast Software Encryption, 20th International Workshop, Lecture Notes in Computer Science (2013)

In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property ... [more ▼]

In this paper, we propose related-key differential distinguishers based on the complementation property of Feistel ciphers. We show that with relaxed requirements on the complementation, i.e. the property does not have to hold for all keys and the complementation does not have to be on all bits, one can obtain a variety of distinguishers. We formulate criteria sufficient for attacks based on the complementation property. To stress the importance of our findings we provide analysis of the full-round primitives: Camelia-128 and GOST. [less ▲]

Detailed reference viewed: 95 (0 UL)
Full Text
See detailSecurity Analysis of the Block Cipher SC2000
Biryukov, Alex UL; Nikolic, Ivica

Report (2013)

Detailed reference viewed: 49 (2 UL)
Full Text
Peer Reviewed
See detailRotational Cryptanalysis of ARX
Khovratovich, Dmitry UL; Nikolic, Ivica

in Fast Software Encryption 17th International Workshop, FSE 2010, Seoul, Korea (2010)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 47 (0 UL)