Filters








6 Hits in 3.1 sec

Cryptanalysis of SKINNY in the Framework of the SKINNY 2018–2019 Cryptanalysis Competition [chapter]

Patrick Derbez, Virginie Lallemand, Aleksei Udovenko
2020 Lecture Notes in Computer Science  
In April 2018, Beierle et al. launched the 3rd SKINNY cryptanalysis competition, a contest that aimed at motivating the analysis of their recent tweakable block cipher SKINNY.  ...  The suggested SKINNY instances are 4-to 20-round reduced variants of SKINNY-64-128 and SKINNY-128-128.  ...  The last competition started on the 1 st of April 2018 and ended on February 28, 2019.  ... 
doi:10.1007/978-3-030-38471-5_6 fatcat:v7oevhhgyzbxva7kywcpzaxgju

Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack on SKINNY

Wenying Zhang, Meichun Cao, Jian Guo, Enes Pasalic
2020 IACR Transactions on Symmetric Cryptology  
For instance, in the case of SKINNY block cipher, several 10-round integral distinguishers, all of the 11-round impossible differentials, and a 7-round truncated differential could be determined.  ...  For the last case, using a single pair of plaintexts differing in three words so that (a = b = c) ≠ (a' = b' = c'), we are able to distinguish 7-round SKINNY from random permutations.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their helpful comments and suggestions. The first author is supported by the National Natural Science Foundation of China (  ... 
doi:10.13154/tosc.v2019.i4.171-191 dblp:journals/tosc/ZhangCGP19 fatcat:vndsrjslkzhmharo3jjaiyyopi

Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack on SKINNY

Wenying Zhang, Meichun Cao, Jian Guo, Enes Pasalic
2020 IACR Transactions on Symmetric Cryptology  
For instance, in the case of SKINNY block cipher, several 10-round integral distinguishers, all of the 11-round impossible differentials, and a 7-round truncated differential could be determined.  ...  For the last case, using a single pair of plaintexts differing in three words so that (a = b = c) ≠ (a' = b' = c'), we are able to distinguish 7-round SKINNY from random permutations.  ...  Acknowledgments The authors would like to thank the anonymous reviewers for their helpful comments and suggestions. The first author is supported by the National Natural Science Foundation of China (  ... 
doi:10.46586/tosc.v2019.i4.171-191 fatcat:sfu4v7qzwreshioa73kl7sow74

Improved Rectangle Attacks on SKINNY and CRAFT

Hosein Hadipour, Nasour Bagheri, Ling Song
2021 IACR Transactions on Symmetric Cryptology  
The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for  ...  Recently, Song et al. have proposed a general framework to identify the actual boundaries of Em and systematically evaluate the probability of Em with any number of rounds, and applied their method to  ...  Nasour Bagheri was supported in part by the Iran National Science Foundation (INSF) under contract No. 98010674.  ... 
doi:10.46586/tosc.v2021.i2.140-198 fatcat:xucyzoijpzapvfs7dcvcwegn3e

Related-tweakey impossible differential attack on reduced-round Deoxys-BC-256

Rui Zong, Xiaoyang Dong, Xiaoyun Wang
2019 Science China Information Sciences  
Deoxys-BC is the internal tweakable block cipher of Deoxys, a third-round authenticated encryption candidate at the CAESAR competition.  ...  For the popular setting in which the key size is 192 bits, we can attack one round more than previous studies.  ...  In March 2014, the first-round competition received 57 submissions; in July 2015, 30 candidates were chosen during the second round of the competition; and in August 2016, 15 candidate ciphers were selected  ... 
doi:10.1007/s11432-017-9382-2 fatcat:ahnnhe4na5hsjkqkcz2uq7zao4

Subject Index to Volumes 1–75

2001 Information Processing Letters  
the plane, 1414 finite set of good examples, 3632 line segments, 1345, 2264 matrices, 330 messages, 1009 places, 590 points in the plane, 64, 1431, 3385 polygons, 1236 rewrite rules, 514 rights  ...  , 2658 , 2735 , 2948 , 3622, 3775, 4066 of randomized list update algorithms, 2658 competitivity factor, 2971 compilation, 88, 151, 258, 262, 376, 779, 1097 , 1724 , 3201 in APL, 1056 process, 135, 1169  ...  a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245 ranked, 1610  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e