Handbook of Applied Cryptography
Handbook of Applied Cryptography
A New Class of Invertible Mappings
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Combining compression functions and block cipher-based hash functions
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Linear cryptanalysis of the TSC family of stream ciphers
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Distinguishing attacks on t-functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
New applications of t-functions in block ciphers and hash functions
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
A new class of single cycle t-functions
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
SMASH – a cryptographic hash function
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Merkle-Damgård revisited: how to construct a hash function
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
Second preimages on n-bit hash functions for much less than 2n work
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Breaking a new hash function design strategy called SMASH
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
An optimal probabilistic solution for information confinement, privacy, and security in RFID systems
Journal of Network and Computer Applications
On the (in)security of IDEA in various hashing modes
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
| Hi-index | 0.00 |
T-functions are a useful new tool to design symmetric-key algorithms, introduced by Klimov and Shamir in 2002. They have already been used to build stream ciphers and new applications for block ciphers and hash functions have been recently suggested. In this paper, we analyze the security of several possible constructions of hash functions, based on T-functions. We show that most natural ideas are insecure. As an application, we describe a practical preimage attack against the dedicated hash function used in the MySQL password-based authentication mechanisms.