Results 91 to 100 of about 1,170,474 (123)

Improved Rectangle Attack on SMS4 Reduced to 18 Rounds

2013 Ninth International Conference on Computational Intelligence and Security, 2013
SMS4 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
semanticscholar   +2 more sources

Improved Related-Key Rectangle Attack Against the Full AES-192

International Conference on Information, Communications and Signal Processing, 2023
Xuanyu Liang, Yincen Chen, Ling Song, Qianqian Yang, Zhuohui Feng, Tianrong Huang   +5 more
semanticscholar   +2 more sources

Related-Key Rectangle Attack on 43-Round SHACAL-2

Information Security Practice and Experience, 2007
Based 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
Gaoli Wang
semanticscholar   +4 more sources

Quantum rectangle attack and its application on Deoxys-BC

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yin‐Song Xu, Yi-Bo Luo, Zheng Yuan, Xuan Zhou, Qidi You, Fei Gao, Xiaoyang Dong   +6 more
semanticscholar   +3 more sources

Optimizing Rectangle Attacks: A Unified and Generic Framework for Key Recovery

IACR Cryptology ePrint Archive, 2022
Ling Song, N. Zhang, Qianqian Yang, Danping Shi, Jiahao Zhao, Lei Hu, Jian Weng   +6 more
semanticscholar   +3 more sources

Related-Key Rectangle Attack of the Full HAS-160 Encryption Mode [PDF]

International Journal of Foundations of Computer Science, 2009
In this paper we investigate the security of the encryption mode of the HAS-160 hash function. HAS-160 is a Korean hash standard which is widely used in Korean industry. The structure of HAS-160 is similar to SHA-1 besides some modifications. In this paper, we present the first cryptographic attack that breaks the encryption mode of the full 80-round ...
O. Dunkelman, E. Fleischmann, M. Gorski, S. Lucks   +3 more
semanticscholar   +3 more sources

A Weak Key Class of XTEA for a Related-Key Rectangle Attack

International Conference on Cryptology in Vietnam, 2006
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-
Eunjin Lee, Deukjo Hong, D. Chang, Seokhie Hong, Jongin Lim   +4 more
semanticscholar   +2 more sources

Related-key rectangle attack on 36 rounds of the XTEA block cipher

International Journal of Information Security, 2009
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
semanticscholar   +3 more sources

Countering overlapping rectangle privacy attack for moving kNN queries

Information Systems, 2013
An 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.
T. Hashem, Lars Kulik, Rui Zhang
semanticscholar   +2 more sources

Rectangle Algebraic Attack of Serpent Encryption Algorithm

2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010
After 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
semanticscholar   +2 more sources