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
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
Differential Collisions in SHA-0
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Formal aspects of mobile code security
Formal aspects of mobile code security
Fast Software Encryption
Collisions for Round-Reduced LAKE
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Slide Attacks on a Class of Hash Functions
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
On the indifferentiability of the sponge construction
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Second preimage attacks on dithered hash functions
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Finding SHA-1 characteristics: general results and applications
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
A failure-friendly design principle for hash functions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
SMASH – a cryptographic hash function
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
A new dedicated 256-bit hash function: FORK-256
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Cryptanalysis of the hash functions MD4 and RIPEMD
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Collisions of SHA-0 and reduced SHA-1
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
Herding hash functions and the nostradamus attack
EUROCRYPT'06 Proceedings of the 24th annual international conference on The 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
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
In this paper we present Twister , a new framework for hash functions. Twister incorporates the ideas of wide pipe and sponge functions. The core of this framework is a --- very easy to analyze --- Mini-Round providing both extremely fast diffusion as well as collision-freeness for one Mini-Round . The total security level is claimed to be not below 2 n /2 for collision attacks and 2 n for 2nd pre-image attacks. Twister instantiations are secure against all known generic attacks. We also propose three instances Twister -n for hash output sizes n = 224,256,384,512. These instantiations are highly optimized for 64-bit architectures and run very fast in hardware and software, e.g Twister -256 is faster than SHA2-256 on 64-bit platforms and Twister -512 is faster than SHA2-512 on 32-bit platforms. Furthermore, Twister scales very well on low-end platforms.