Results 11 to 20 of about 2,969,359 (203)
Linear Cryptanalysis: Key Schedules and Tweakable Block Ciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2017 This paper serves as a systematization of knowledge of linear cryptanalysis and provides novel insights in the areas of key schedule design and tweakable block ciphers.
Thorsten Kranz +2 more
doaj +4 more sources
Differential, Linear, and Meet-in-the-Middle Attacks on the Lightweight Block Cipher RBFK
IET Information Security, 2023 Randomized butterfly architecture of fast Fourier transform for key cipher (RBFK) is the lightweight block cipher for Internet of things devices in an edge computing environment.
Sugio Nobuyuki
doaj +1 more source
Applied Sciences, 2023 Attacks on the Internet of Things (IoT) are not highly considered during the design and implementation. The prioritization is making profits and supplying services to clients. Most cryptographic algorithms that are commonly used on the IoT are vulnerable
Khumbelo Difference Muthavhine +1 more
doaj +1 more source
Multidimensional linear cryptanalysis [PDF]
, 2010 Linear cryptanalysis is an important tool for studying the security of symmetric ciphers. In 1993 Matsui proposed two algorithms, called Algorithm 1 and Algorithm 2, for recovering information about the secret key of a block cipher.
Hermelin, Miia
core +5 more sources
On Multidimensional Linear Cryptanalysis [PDF]
, 2010 Matsui's Algorithms 1 and 2 with multiple approximations have been studied over 16 years. In CRYPTO'04, Biryukov et al. proposed a formal framework based on m statistically independent approximations. Started by Hermelin et al. in ACISP'08, a different approach was taken by studying m-dimensional combined approximations from m base approximations ...
Phuong Ha Nguyen +3 more
openaire +2 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
Addendum to Linear Cryptanalyses of Three AEADs with GIFT-128 as Underlying Primitives
IACR Transactions on Symmetric Cryptology, 2022 In ToSC 2021(2), Sun et al. implemented an automatic search with the Boolean satisfiability problem (SAT) method on GIFT-128 and identified a 19-round linear approximation with the expected linear potential being 2−117.43, which is utilised to launch a ...
Ling Sun, Wei Wang, Meiqin Wang
doaj +1 more source
New results on the genetic cryptanalysis of TEA and reduced-round versions of XTEA [PDF]
, 2004 Congress on Evolutionary Computation. Portland, USA, 19-23 June 2004Recently, a simple way of creating very efficient distinguishers for cryptographic primitives such as block ciphers or hash functions, was presented by the authors.
Hernández, Julio C. +2 more
core +1 more source
Impossible Differential Cryptanalysis of SIMECK32/64 Algorithm [PDF]
Jisuanji gongcheng, 2017 This paper studies the capability of impossible differential cryptanalysis on block cipher SIMECK32/64.The 11-round impossible differential path of SIMECK32/64 is constructed using the meet-in-the-middle technology.The attack on 19-round SIMECK32/64 is ...
CHEN Yanqin,ZHANG Wenying
doaj +1 more source
Nonlinear Approximations in Cryptanalysis Revisited
IACR Transactions on Symmetric Cryptology, 2018 This work studies deterministic and non-deterministic nonlinear approximations for cryptanalysis of block ciphers and cryptographic permutations and embeds it into the well-understood framework of linear cryptanalysis.
Christof Beierle +2 more
doaj +1 more source