A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
2020
IACR Transactions on Symmetric Cryptology
Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle. ...
In his attack, the key-schedules are not taken into account. Hence, the same attack applies to all three versions of AES. ...
Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work. ...
doi:10.46586/tosc.v2019.i4.318-347
fatcat:cjytpk6ikjg7rdj5wdy4tzobbm
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
2020
IACR Transactions on Symmetric Cryptology
Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle. ...
In his attack, the key-schedules are not taken into account. Hence, the same attack applies to all three versions of AES. ...
Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work. ...
doi:10.13154/tosc.v2019.i4.318-347
dblp:journals/tosc/BaoDGWZ19
fatcat:sw6m76lsufgt3ho5cwy4mdkhty
Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting
[chapter]
2013
Lecture Notes in Computer Science
In this paper, we revisit meet-in-the-middle attacks on AES in the single-key model and improve on Dunkelman, Keller and Shamir attacks of Asiacrypt 2010. ...
Moreover, we are able to extend the number of rounds to reach attacks on 8 rounds for both AES-192 and AES-256. ...
Figure 2 : 2 General scheme of the meet-in-the-middle attack on AES, where some messages in the middle rounds may verify a certain property used to perform the meet-in-the-middle. ...
doi:10.1007/978-3-642-38348-9_23
fatcat:sawpayfipbb7vcqefqmbcwz7bq
Improved Meet-in-the-Middle Attacks on Crypton and mCrypton
2017
KSII Transactions on Internet and Information Systems
Combined with the properties of nibble permutation and substitution, an improved meet-in-the-middle attack on 8round mCrypton is proposed and the first complete attack on 9-round mCrypton-96 is proposed ...
The security of Crypton and mCrypton under meet-in-the-middle attack is analyzed in this paper. ...
[24] improved the meetin-the-middle attacks on AES with the rebound-like idea. In FSE 2014, Li et al. ...
doi:10.3837/tiis.2017.05.020
fatcat:5tpu6mzomjfovl2z46cdozjcpa
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
[chapter]
2011
Lecture Notes in Computer Science
In 2008, Demirci and Selçuk gave a meet-in-the-middle attack on 7-round AES under 192 key bits. In 2009, Demirci et al. ...
In this paper, we show that by exploiting a simple observation on the key schedule, a meet-in-the-middle attack on 8-round AES under 192 key bits can be obtained from Demirci and Selçuk's and Demirci et ...
Acknowledgments The authors are very grateful to the anonymous referees for their comments. ...
doi:10.1007/978-3-642-21031-0_17
fatcat:6kgkblukprbqroavxshn6jvlwq
Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES
[chapter]
2014
Lecture Notes in Computer Science
In this paper, we revisit Demirci and Selçuk meet-in-the-middle attacks on AES. ...
As a result, we automatically recover all the recent improved attacks of Derbez, Fouque and Jean on AES and we show new improved attacks against 8-rounds of AES-192 and AES-256. ...
In this paper, we consider another direction to improve on Demirci and Selçuk (DS) attack using only meet-in-the-middle techniques. ...
doi:10.1007/978-3-662-43933-3_28
fatcat:gs2dqfvf6zbmtgkonyhfw4fgse
Meet-in-the-Middle and Impossible Differential Fault Analysis on AES
[chapter]
2011
Lecture Notes in Computer Science
Since the early work of Piret and Quisquater on fault attacks against AES at CHES 2003, many works have been devoted to reduce the number of faults and to improve the time complexity of this attack. ...
The first attack requires 10 faults and its complexity is around 2 40 in time and memory, an improvement allows only 5 faults and its complexity in memory is reduced to 2 24 while the second one requires ...
We would like to thank Nicolas Guillermin and the anonymous reviewers for their helpful and valuable comments and discussions. ...
doi:10.1007/978-3-642-23951-9_19
fatcat:j2aedadn4fbtta7shhvfujqnie
Improved Meet-in-the-Middle Distinguisher on Feistel Schemes
[chapter]
2016
Lecture Notes in Computer Science
In this paper, we describe a versatile and powerful algorithm for searching the best improved meet-in-the-middle distinguisher with efficient tabulation technique on word-oriented BFN and GFN block ciphers ...
Improved meet-in-the-middle cryptanalysis with efficient tabulation technique has been shown to be a very powerful form of cryptanalysis against SPN block ciphers. ...
The research community has still a lot to learn on the way to build better attacks and there are many future works possible: the algorithm combining the precomputation phase and online phase together, ...
doi:10.1007/978-3-319-31301-6_7
fatcat:xd7eqwfwfvanteegxhxnq6cohe
Biclique Cryptanalysis of the Full AES
[chapter]
2011
Lecture Notes in Computer Science
Since Rijndael was chosen as the Advanced Encryption Standard (AES), improving upon 7-round attacks on the 128-bit key variant (out of 10 rounds) or upon 8-round attacks on the 192/256-bit key variants ...
-Preimage search for compression functions based on the full AES versions faster than brute force. In contrast to most shortcut attacks on AES variants, we do not need to assume related-keys. ...
We thank Joan Daemen and Vincent Rijmen for their helpful feedback on the earlier versions of the paper. ...
doi:10.1007/978-3-642-25385-0_19
fatcat:mvuaeztrrbhojn7joqu3o7xlw4
Transposition of AES Key Schedule
[chapter]
2017
Lecture Notes in Computer Science
First, it reduces the number of rounds that some attacks are effective, such as SQUARE attacks and meet-in-the-middle attacks; Second, it is interesting that our new key schedule also protects AES from ...
In this paper, we point out a new weakness of the AES key schedule by revisiting an old observation exploited by many known attacks. ...
On the other hand, the weakness in the key schedule can be exploited in the SQUARE and meet-in-the-middle attacks. ...
doi:10.1007/978-3-319-54705-3_6
fatcat:huutydhecngqnkyddzhrecqjnq
An Innovative Approach to Enhance the Security of Data Encryption Scheme
2010
Journal of clean energy technologies
With cascading of data encryption standard in three times, we become able to counter the famous meet in middle attack in double and triple data encryption standard. ...
The goal of this article to show how the one-time pad encryption technique can be achieved by the suitable combination of these techniques. ...
Using the variation of key in our approach, we improve the efficiency and security of DES against various attacks like Meet -In -Middle attack.
V. ...
doi:10.7763/ijcte.2010.v2.171
fatcat:deu5ic3ovnazvnotxgrau3i2yy
Narrow-Bicliques: Cryptanalysis of Full IDEA
[chapter]
2012
Lecture Notes in Computer Science
The biclique attack framework was recently introduced as a way to add more rounds to a meet-in-the-middle attack while potentially keeping the same time complexity. ...
We also show that the biclique approach to block cipher cryptanalysis not only obtains results on more rounds, but also improves time and data complexities over existing attacks. ...
Acknowledgements We thank Orr Dunkelman and Adi Shamir for bringing to our attention their new attack on 6 middle rounds of IDEA during the MSR Symmetric Cryptanalysis Workshop 2011. ...
doi:10.1007/978-3-642-29011-4_24
fatcat:um5qqm6wvzhzzg3qjg335eo4au
Quantum Security Analysis of AES
2019
IACR Transactions on Symmetric Cryptology
Our best attack is a quantum Demirci-Selçuk meet-in-the-middle attack. ...
In particular, we can reduce the memory in some attacks against AES-256 and AES-128. ...
Acknowledgments We thank the anonymous referees of ToSC for their helpful and detailed comments, and Gilles Van Assche for his insightful remarks and comments that have considerably helped improving the ...
doi:10.13154/tosc.v2019.i2.55-93
dblp:journals/tosc/BonnetainNS19
fatcat:tvdabjxplbfchhsovx5tmc3u7e
Quantum Security Analysis of AES
2019
IACR Transactions on Symmetric Cryptology
We believe this framework will be useful for future analysis.Our best attack is a quantum Demirci-Selçuk meet-in-the-middle attack. ...
In particular, we can reduce the memory in some attacks against AES-256 and AES-128.One of the building blocks of our attacks is solving efficiently the AES S-Box differential equation, with respect to ...
Acknowledgments We thank the anonymous referees of ToSC for their helpful and detailed comments, and Gilles Van Assche for his insightful remarks and comments that have considerably helped improving the ...
doi:10.46586/tosc.v2019.i2.55-93
fatcat:qpocbirhgjatjgxivecdy53azq
What is the effective key length for a block cipher: an attack on every practical block cipher
2014
Science China Information Sciences
In [7] , the authors proposed a complex meet-in-the-middle attack on KASUMI using various subtle weaknesses of the cipher. ...
attacks, meet-in-the-middle attacks, related-key attacks, as well as other existing cryptanalysis techniques [3] [4] [5] . ...
Discussion and conclusion Recently, there are significant improvements on meet-in-the-middle attacks, as well as other brute-forcelike cryptanalysis. ...
doi:10.1007/s11432-014-5096-6
fatcat:t55mptqukbgp5mgcqbt3nzhbiu
« Previous
Showing results 1 — 15 out of 23,439 results