Results 21 to 30 of about 4,229,821 (188)
Differential-Linear Cryptanalysis of GIFT family and GIFT-based Ciphers [PDF]
IACR Communications in CryptologyAt CHES 2017, Banik et al. proposed a lightweight block cipher GIFT consisting of two versions GIFT-64 and GIFT-128. Recently, there are lots of authenticated encryption schemes that adopt GIFT-128 as their underlying primitive, such as GIFT-COFB and HyENA.
Shichang Wang +3 more
core +4 more sources
New Methodologies for Differential-Linear Cryptanalysis and Its Extensions. [PDF]
IACR Cryptol. ePrint Arch., 2010 In 1994 Langford and Hellman introduced differential-linear cryptanalysis, which involves building a differential-linear distinguisher by concatenating a linear approximation with such a (truncated) differential that with probability 1 does not affect ...
Jiqiang Lu
core +3 more sources
Differential-Linear Cryptanalysis [PDF]
, 2007 This paper introduces a new chosen text attack on iterated cryptosystems, such as the Data Encryption Standard (DES). The attack is very efficient for 8-round DES,2 recovering 10 bits of key with 80% probability of success using only 512 chosen plaintexts. The probability of success increases to 95% using 768 chosen plaintexts.
Susan K. Langford, Martin E. Hellman
openaire +1 more source
Enhancing Differential-Linear Cryptanalysis [PDF]
, 2002 Differential cryptanalysis analyzes ciphers by studying the development of differences during encryption. Linear cryptanalysis is similar but is based on studying approximate linear relations. In 1994, Langford and Hellman showed that both kinds of analysis can be combined together by a technique called differential-linear cryptanalysis, in which the ...
Eli Biham, Orr Dunkelman, Nathan Keller
openaire +2 more sources
Differential-Linear Cryptanalysis of Serpent [PDF]
, 2003 Serpent is a 128-bit SP-Network block cipher consisting of 32 rounds with variable key length (up to 256 bits long). It was selected as one of the 5 AES finalists. The best known attack so far is a linear attack on an 11-round reduced variant.
Eli Biham, Orr Dunkelman, Nathan Keller
openaire +2 more sources
Improving Impossible Differential Cryptanalysis with Concrete Investigation of Key Scheduling Algorithm and Its Application to Lblock [PDF]
, 2014 Impossible differential cryptanalysis has been proved to be one of the most powerful techniques to attack block ciphers. Based on the impossible differential paths, we can usually add several rounds before or after to launch a key recovery attack ...
Atsuko Miyaji +7 more
core +1 more source
Differential and Linear Cryptanalysis of Ivlbc Via Milp Modeling
, 2023 16th International Conference on Information Security and Cryptology, ISCTURKEY 2023 -- 18 October 2023 through 19 October 2023 -- 195312Involutive Lightweight Block Cipher (IVLBC) is a recently proposed SPN-type block cipher.
Ilter, M.B., Selçuk, Ali Aydın
core +1 more source
Linear and Differential Cryptanalysis of SHA-256 [PDF]
, 2005 The one-way hash function plays an important role in digital signatures and message authentication from the viewpoint of security. No effective attacking method has been discovered to the algorithm of hash function standard.
Wang, Xiao Dong, Ishikawa, Hirofumi
core +1 more source
Dianzi Jishu Yingyong, 2021 NBC is a family of block ciphers using Generalized Feistel structure, designed by Xu Hong et al. There are three block and key sizes,i.e.,128/128, 128/256 and 256/256. A 16-bit Sbox is involved in the cipher as the non-linear component.
Yang Jiangshuai +3 more
doaj +1 more source
Distribution of the best nonzero differential and linear approximations of s-box functions
Journal of Telecommunications and Information Technology, 2006 In the paper the differential and the linear approximations of two classes of s-box functions are considered. The classes are the permutations and arbitrary functions with n binary inputs and m binary outputs, where 1≤n=m≤10.
Krzysztof Chmiel
doaj +1 more source