Grøstl-a SHA-3 candidate
Grøstl is a SHA-3 candidate proposal. Grøstl is an iterated hash function with a compression
function built from two fixed, large, distinct permutations. The design of Grøstl is transparent …
function built from two fixed, large, distinct permutations. The design of Grøstl is transparent …
Security Analysis of salt|| password Hashes
P Gauravaram - 2012 International Conference on Advanced …, 2012 - ieeexplore.ieee.org
Protection of passwords used to authenticate computer systems and networks is one of the
most important application of cryptographic hash functions. Due to the application of …
most important application of cryptographic hash functions. Due to the application of …
The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
B Preneel - Cryptographers' track at the RSA conference, 2010 - Springer
The first designs of cryptographic hash functions date back to the late 1970s; more
proposals emerged in the 1980s. During the 1990s, the number of hash function designs …
proposals emerged in the 1980s. During the 1990s, the number of hash function designs …
Unsupervised video hashing with multi-granularity contextualization and multi-structure preservation
Unsupervised video hashing typically aims to learn a compact binary vector to represent
complex video content without using manual annotations. Existing unsupervised hashing …
complex video content without using manual annotations. Existing unsupervised hashing …
On the Security of Tan et al. Serverless RFID Authentication and Search Protocols
In this paper, we analyze the security of the mutual authentication and search protocols
recently proposed by Tan et al.[20]. Our security analysis clearly highlights important security …
recently proposed by Tan et al.[20]. Our security analysis clearly highlights important security …
Generation of randomized messages for cryptographic hash functions
P Gauravaram - US Patent 9,444,619, 2016 - Google Patents
US9444619B2 - Generation of randomized messages for cryptographic hash functions - Google
Patents US9444619B2 - Generation of randomized messages for cryptographic hash functions …
Patents US9444619B2 - Generation of randomized messages for cryptographic hash functions …
Improved indifferentiability security bound for the JH mode
Indifferentiability security of a hash mode of operation guarantees the mode's resistance
against all generic attacks. It is also useful to establish the security of protocols that use hash …
against all generic attacks. It is also useful to establish the security of protocols that use hash …
[PDF][PDF] Security properties of domain extenders for cryptographic hash functions
Cryptographic hash functions reduce inputs of arbitrary or very large length to a short string
of fixed length. All hash function designs start from a compression function with fixed length …
of fixed length. All hash function designs start from a compression function with fixed length …
[BOOK][B] Handbook of EID Security: Concepts, Practical Experiences, Technologies
W Fumy, M Paeschke - 2010 - books.google.com
In the forthcoming years, citizens of many countries will be provided with electronic identity
cards. eID solutions may not only be used for passports, but also for communication with …
cards. eID solutions may not only be used for passports, but also for communication with …
Building indifferentiable compression functions from the PGV compression functions
Abstract Preneel, Govaerts and Vandewalle (PGV) analysed the security of single-block-
length block cipher based compression functions assuming that the underlying block cipher …
length block cipher based compression functions assuming that the underlying block cipher …