This book is about the cryptographic hash function BLAKE, one of the five final contenders in
the SHA3 competition, out of 64 initial submissions. The SHA3 competition was a public …

It was recently shown that estimating the Shannon entropy H (p) of a discrete k-symbol
distribution p requires Θ (k/log k) samples, a number that grows nearlinearly in the support …

The first practical public key cryptosystem ever published, the Diffie–Hellman key exchange
algorithm, relies for its security on the assumption that discrete logarithms are hard to …

Signal processing in the encrypted domain has become a hot research topic, which enable
signal processing tasks in a secure and privacy-preserving manner. Taken the fact that …

In this paper, we investigate the multi-user setting both in public and in secret-key
cryptanalytic applications. In this setting, the adversary tries to recover keys of many users in …

Abstract The iterated Even-Mansour (EM) scheme is a generalization of the original 1-round
construction proposed in 1991, and can use one key, two keys, or completely independent …

The security of HMAC (and more general hash-based MACs) against state-recovery and
universal forgery attacks was very recently shown to be suboptimal, following a series of …

In recent years, portable devices and wireless communication have been popularly used by
people in their everyday lives. In fact, with these facilities, due to their usage convenience …

This paper shows, assuming standard heuristics regarding the number-field sieve, that a
“batch NFS” circuit of area L^ 1.181 ...+ o (1) factors L^ 0.5+ o (1) separate B-bit RSA keys in …

Using FPGAs to compute the discrete logarithms of elliptic curves is a well-known method.
However, until to date only CPU clusters succeeded in computing new elliptic curve discrete …