Results 211 to 220 of about 34,576 (259)
Related-key rectangle attack on 36 rounds of the XTEA block cipher
XTEA is a 64-round block cipher with a 64-bit block size and a 128-bit user key, which was designed as a short C program that would run safely on most computers. In this paper, we present a related-key rectangle attack on a series of inner 36 rounds of XTEA without making a weak key assumption, and a related-key rectangle attack on the first 36 rounds ...
Jiqiang Lu
openalex +3 more sources
Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qianqian Yang +7 more
openalex +3 more sources
Extending commutative diagram cryptanalysis to slide, boomerang, rectangle and square attacks
Encryption algorithms that use the same secret key for encryption and decryption (also known as block ciphers) allow confidential information to be protected and accessible only by legitimate parties who have knowledge of that secret key. Before the public can be comfortable with using a block cipher, it needs to gain public trust on its level of ...
Raphaël C.‐W. Phan
openalex +3 more sources
Attack of the Black Rectangles by Amy Sarig King
Adam McConville
openalex +2 more sources
Related-Key Boomerang and Rectangle Attacks: Theory and Experimental Analysis
In 2004, we introduced the related-key boomerang/ rectangle attacks, which allow us to enjoy the benefits of the boomerang attack and the related-key technique, simultaneously. The new attacks were used since then to attack numerous block ciphers. While the claimed applications are significant, most of them have a major drawback.
Jongsung Kim +5 more
openalex +2 more sources
Improved Related-Key rectangle Attack on GIFT
Yaxin Cui, Hong Xu, Lin Tan
openalex +2 more sources
Improved Related-Key Rectangle Attack Against the Full AES-192
Xuanyu Liang +5 more
openalex +2 more sources
A Weak Key Class of XTEA for a Related-Key Rectangle Attack
XTEA is a block cipher with a very simple structure but there has not been found attack even for half of full round version i.e 32-round version. In this paper we introduce a class of weak keys which makes a 34-round reduced version of XTEA vulnerable to the related-key rectangle attack. The number of such weak keys is about 2108.21. Our attack on a 34-
Eun‐Jin Lee +4 more
openalex +2 more sources
Rectangle Attacks on Reduced Versions of the FBC Block Cipher
Wenchang Zhou, Jiqiang Lu
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Dividing rectangles attack multi-objective optimization
2016 IEEE Congress on Evolutionary Computation (CEC), 2016Decomposition-based evolutionary algorithms have been applied with success to multi-objective optimization problems where they are broken into several subproblems, and solutions for the original problem are recognized in a coordinated manner. Motivated by the working principle of decomposition-based methods, viz. the “divide-and-conquer” paradigm; this
Abdullah Al-Dujaili, S. Suresh
openaire +1 more source

