Hash functions based on block ciphers: a synthetic approach
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
How to build a hash function from any collision-resistant function
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
Security/efficiency tradeoffs for permutation-based hashing
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Some plausible constructions of double-block-length hash functions
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
On the impossibility of highly-efficient blockcipher-based hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Provably secure double-block-length hash functions in a black-box model
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Efficient hashing using the AES instruction set
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Compact implementation and performance evaluation of hash functions in ATtiny devices
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
| Hi-index | 0.89 |
In this paper, we give a concrete analysis of preimage resistance for a wide class of linearly-dependent permutation-based compression functions. Specifically, we prove the preimage resistance of LPmkr with r=m-1 up to 2^(^k^-^1^)^n^k^-^l^o^g^n queries. As a special case, the preimage resistance of LP362 is proved up to 2^5^n^6^-^l^o^g^n query complexity, closing the gap between the lower bound (=2^4^n^/^5) and the upper bound (=2^5^n^/^6) presented in Rogaway and Steinberger (2008) [9].