Cryptography: Theory and Practice
Cryptography: Theory and Practice
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Collision-Resistant Hashing: Towards Making UOWHFs Practical
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Some Observations on the Theory of Cryptographic Hash Functions
Designs, Codes and Cryptography
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
A nonce-based mutual authentication system with smart card
WSEAS Transactions on Computers
Domain extension for enhanced target collision-resistant hash functions
FSE'10 Proceedings of the 17th international conference on Fast software encryption
| Hi-index | 0.04 |
We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG-based hashing, this technique yields a new hashing algorithm. The amount of padding and the number of invocations of the compression function required by the new algorithm is smaller than the general Merkle-Damgard algorithm.