Results 211 to 220 of about 10,795 (238)
Some of the next articles are maybe not open access.
Impossible Differential Attacks on Reduced-Round LBlock
2012LBlock is a lightweight block cipher with 32 rounds, which can be implemented efficiently not only in hardware environment but also in software platforms. In this paper, by exploiting the structure of LBlock and the redundancy in its key schedule, we propose an impossible differential attack on 21-round LBlock based on a 14-round impossible ...
Ya Liu, Dawu Gu, Zhiqiang Liu, Wei Li
openaire +1 more source
Note on Impossible Differential Attacks
2016While impossible differential cryptanalysis is a well-known and popular cryptanalytic method, errors in the analysis are often discovered and many papers in the literature present flaws. Wishing to solve that, Boura et al.i¾?[1] presented at ASIACRYPT'14 a generic vision of impossible differential attacks with the aim of simplifying and helping the ...
openaire +1 more source
Differential and Impossible Differential Related-Key Attacks on Hierocrypt-L1
2014Hierocrypt-L1 is one of the Japanese e-Government Recommended Ciphers listed by CRYPTREC in 2003, and its security was reconfirmed as secure by CRYPTREC in 2013. In this paper we first find differential characteristics with probability 1 in the key scheduling of Hierocrypt-L1.
Bungo Taga, Shiho Moriai, Kazumaro Aoki
openaire +1 more source
A new impossible differential attack on SAFER ciphers
Computers & Electrical Engineering, 2010This paper presents an improved impossible differential cryptanalysis of SAFER ciphers, which uses the miss-in-the-middle technique developed by Biham et al. We analyze 3.75-round SAFER SK-64, using 2^4^5 chosen plaintexts, 2^3^8 bytes memory and 2^4^2 half round computations. Furthermore, the new impossible differential attack on 3.75-round SAFER+/128
Shihui Zheng, Licheng Wang, Yixian Yang
openaire +1 more source
Impossible Differential Attack on 30-Round SHACAL-2
2003SHACAL-2 is a 256-bit block cipher with various key sizes based on the hash function SHA-2. Recently, it was recommended as one of the NESSIE selections. Up to now, no security flaws have been found in SHACAL-2. In this paper, we discuss the security of SHACAL-2 against an impossible differential attack.
Seokhie Hong +5 more
openaire +1 more source
New Related-Key Impossible Differential Attack on MIBS-80
2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS), 2016MIBS is a lightweight block cipher designed by M. Izadi et al in 2009 for tiny computing devices, such as RFID tags and sensor network nodes. The cipher algorithm iterates a Feistel structure with SP type round function by 32 rounds. It with 64-bit block size and supports 64/80-bit key size.
Lu Cheng, Peng Xu, Yuechuan Wei
openaire +1 more source
Impossible differential attack on 13-round Camellia-192
Information Processing Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Improved Impossible Differential Attack on Reduced-Round LBlock
2016LBlock is a 32-round lightweight block cipher with a 64-bit block size and an 80-bit key. This paper presents a new impossible differential attack on LBlock by improving the previous best result for 1 more round. Based on the nibble conditions, detailed differential properties of LBlock S-Boxes and thorough exploration of subkey relations, we set up ...
Ning Wang, Xiaoyun Wang, Keting Jia
openaire +1 more source
Improved Impossible Differential Attacks on Reduced-Round MISTY1
2012MISTY1 is a Feistel block cipher with a 64-bit block and a 128-bit key. It is one of the final NESSIE portfolio of block ciphers, and has been recommended for Japanese e-Government ciphers by the CRYPTREC project. In this paper, we improve the impossible differential attack on 6-round MISTY1 with 4 FL layers introduced by Dunkelman et al. with a factor
Keting Jia, Leibo Li
openaire +1 more source
Related-Key Impossible Differential Attack on Reduced-Round LBlock
Journal of Computer Science and Technology, 2014LBlock is a 32-round lightweight block cipher with 64-bit block size and 80-bit key. This paper identifies 16-round related-key impossible differentials of LBlock, which are better than the 15-round related-key impossible differentials used in the previous attack.
Long Wen, Mei-Qin Wang, Jing-Yuan Zhao
openaire +1 more source