Sciweavers

Share
13 search results - page 1 / 3
» Hash Functions Based on Three Permutations: A Generic Securi...
Sort
View
IACR
2011
106views more  IACR 2011»
8 years 6 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
EUROCRYPT
2008
Springer
9 years 9 months ago
Security/Efficiency Tradeoffs for Permutation-Based Hashing
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
Phillip Rogaway, John P. Steinberger
ASIACRYPT
2015
Springer
4 years 3 months ago
On the Impact of Known-Key Attacks on Hash Functions
Abstract. Hash functions are often constructed based on permutations or blockciphers, and security proofs are typically done in the ideal permutation or cipher model. However, once...
Bart Mennink, Bart Preneel
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
10 years 21 days ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...
IACR
2016
46views Biometrics» more  IACR 2016»
4 years 3 months ago
Cryptanalysis of Simpira
Simpira is a recently proposed family of permutations, based on the AES round function. The design includes recommendations for using the Simpira permutations in block ciphers, has...
Christoph Dobraunig, Maria Eichlseder, Florian Men...
books