Hirose, Kuwakado and Yoshida proposed a nonce-based authenticated encryption scheme Lae0 based on Lesamnta-LW in 2019. is block-cipher-based iterated hash function included the ISO/IEC 29192-5 lightweight hash-function standard. They also showed that satisfies both privacy authenticity if underlying block cipher pseudorandom permutation. Unfortunately, their result implies only about 64-bit sec...

This paper looks at the possibility of combining a block cipher and a stream cipher to get a strong hybrid cipher. It includes two specific proposals for combining AES-128 and RC4-128 to get a cipher that takes a 256-bit key and is significantly faster than AES-256, and arguably more secure. One is immune to algebraic attacks.

The block cipher XTEA, designed by Needham andWheeler, was published as a technical report in 1997. The cipher was a result of fixing some weaknesses in the cipher TEA (also designed by Wheeler and Needham), which was used in Microsoft’s Xbox gaming console. XTEA is a 64-round Feistel cipher with a block size of 64 bits and a key size of 128 bits. In this paper, we present meet-in-the-middle at...

In CRYPTO’89, Merkle presented three double-block-length hash functions based on DES. They are optimally collision resistant in a black-box model, that is, the time complexity of any collision-finding algorithm for them is Ω(2 ) if DES is a random block cipher, where is the output length. Their drawback is that their rates are low. In this article, new double-block-length hash functions with hi...

In this paper, we will present an estimation for the upper-bound of the amount of 16-bytes plaintexts for English texts, that is not sufficient large make clear that the block ciphers with block length no more than 16-bytes will be subject to recover plaintext attacks in the occasions of plaintext -known or plaintext-chosen attacks.