Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design of Rijndael
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Distinguishers for Ciphers and Known Key Attack against Rijndael with Large Blocks
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Known-key distinguishers for some block ciphers
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Another look at complementation properties
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Distinguishers for the compression function and output transformation of hamsi-256
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Known and chosen key differential distinguishers for block ciphers
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
A lightweight 256-bit hash function for hardware and low-end devices: lesamnta-LW
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
In this paper, we show a known-key (middletext) distinguisher on the internal block cipher of tweaked Lesamnta reduced to 31 (out of 32) rounds, which is one of the hash functions submitted to the SHA-3 competition. Moreover, we present a distinguisher for full internal block cipher of Lesamnta with stronger assumption. Although Lesamnta was not chosen for the second round, for its tweaked version, all previous cryptanalysis can work no more than 24 rounds. We search for a new integral characteristic for the internal block cipher, and discover a 19-round integral characteristic for forward direction. We then search for an integral characteristic for backward direction, and the characteristics can be combined to full rounds with some assumption. The distinguisher for the internal block cipher of Lesamnta-256 requires 2192 query complexity and negligible memory. This is the best attack on Lesamnta compression function and its internal block cipher after the tweak.