658 search results - page 80 / 132 » The Grindahl Hash Functions |
SACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
We present a new message authentication code. It is based on a two trail construction, which underlies the unkeyed hash function RIPEMD-160. It is in comparison with the MDx-MAC ba...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
AINA
2004
IEEE
15 years 1 months ago
2004
IEEE
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
ECRA
2007
14 years 9 months ago
2007
Micro-payment systems have become popular in recent times as the desire to support low-value, high-volume transactions of text, music, clip-art, video and other media has increase...
IACR
2011
13 years 9 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...