Results 21 to 30 of about 4,860,803 (237)
Bounds for the Security of Ascon against Differential and Linear Cryptanalysis
IACR Transactions on Symmetric Cryptology, 2022 The NIST Lightweight Cryptography project aims to standardize symmetric cryptographic designs, including authenticated encryption and hashing, suitable for constrained devices.
John Erlacher +2 more
semanticscholar +1 more source
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
Zero-Correlation Linear Cryptanalysis on SPARX-64
J. Sensors, 2021 SPARX is a family of ARX-based block ciphers designed according to the long-trail strategy, which has 32-bit ARX-based SBoxes and has provable bounds against single-differential and single-linear cryptanalysis.
Dawei Zhou +3 more
semanticscholar +1 more source
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
Related-Key Linear Cryptanalysis [PDF]
2006 IEEE International Symposium on Information Theory, 2006 A coding theory framework for related-key linear cryptanalytic attacks on block ciphers is presented. It treats linear cryptanalysis as communication over a low capacity channel, and a related key attack (RKA) as a concatenated code. It is used to show that an RKA, using n related keys generated from k independent ones, can improve the amortized cost ?
Poorvi L. Vora, Darakhshan J. Mir
openaire +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
openaire +5 more sources
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
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
Security Analysis of Lightweight IoT Cipher: Chaskey
Cryptography, 2020 This paper presents the differential cryptanalysis of ARX based cipher Chaskey using tree search based heuristic approach. ARX algorithms are suitable for resource-constrained devices such as IoT and very resistant to standard cryptanalysis such as ...
Ashutosh Dhar Dwivedi
doaj +1 more source