Results 201 to 210 of about 34,466 (227)
Some of the next articles are maybe not open access.
Related-Key Rectangle Attack on 42-Round SHACAL-2
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2006Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is
Lu, J. +3 more
+6 more sources
Improved Related-Key Rectangle Attacks On GIFT
The Computer Journal, 2023Abstract GIFT is a lightweight cipher proposed by Banik et al. at CHES’17, motivated by the design strategy of PRESENT. GIFT-64[2021] is a variant of GIFT proposed by Sun et al. at EUROCRYPT’22 to achieve better resistance against differential attack while maintaining a similar security level against linear attack.
Qingyuan Yu +3 more
openaire +1 more source
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
Integral Attack on Reduced-Round Rectangle
2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing, 2015RECTANGLE is a 64-bit block cipher with 80 and 128-bit key length proposed by Zhang et al(Lightweight Cryptography Workshop 2015). Integral attack is one of the typical evaluation tools of block cipher. The designers showed 7-round integral distinguisher.
Haruhisa Kosuge +3 more
openaire +1 more source
Rectangle Algebraic Attack of Serpent Encryption Algorithm
2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010After exploring multi-round difference feature of Serpent encryption algorithm and using the method of constructing S-boxes algebraic equations, we put forward Rectangle algebraic attack of 10-round Serpent-256. This method analyzed that 10-round Serpent-256 needed 2×2144 ×210 = 2155 pairs of selective plaintexts, 2155 times of 10-round encryption and ...
Wenlue Chen, Boli Li, Zhihua Hu
openaire +1 more source
Countering overlapping rectangle privacy attack for moving kNN queries
Information Systems, 2013An important class of LBSs is supported by the moving k nearest neighbor (MkNN) query, which continuously returns the k nearest data objects for a moving user. For example, a tourist may want to observe the five nearest restaurants continuously while exploring a city so that she can drop in to one of them anytime.
Tanzima Hashem, Lars Kulik, Rui Zhang
openaire +1 more source
Improved Rectangle Attack on SMS4 Reduced to 18 Rounds
2013 Ninth International Conference on Computational Intelligence and Security, 2013SMS4 is a 32-round block cipher with 128-bit block size and 128-bit secret key. It is used in WAPI, the Chinese WLAN national standard. In this paper, we analyze the security of SMS4 against the rectangle attack. First we describe two properties of SMS4. Next, we propose the 16-round rectangle distinguisher with probability 2-250.
Xianglong Kong, Wei Wang, Qiuliang Xu
openaire +1 more source
Related-Key Boomerang and Rectangle Attacks: Theory and Experimental Analysis
IEEE Transactions on Information Theory, 2012In 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
openaire +1 more source