Since their invention in the late seventies, public key cryptosystems have become an
indispensable asset in establishing private and secure electronic communication, and this …

We describe a cell processor implementation of Pollard's rho method to solve discrete
logarithms in groups of elliptic curves over prime fields. The implementation was used on a …

The 128-bit blockcipher CLEFIA is known to be highly efficient in hardware implementations.
This paper proposes very compact hardware implementations of CLEFIA-128. Our …

We examine a natural, but non-tight, reductionist security proof for deterministic message
authentication code (MAC) schemes in the multi-user setting. If security parameters for the …

P g.
N s. M …

We present a novel, automated way to find differential paths for MD5. Its main application is
in the construction of chosen-prefix collisions. We have shown how, at an approximate …

Computations of small discrete logarithms are feasible even in “secure” groups, and are
used as subroutines in several cryptographic protocols in the literature. For example, the …

In this thesis we use isogenies between ordinary elliptic curves for the construction of new
cryptographic schemes. The thesis is organized into an introductory chapter followed by …

In a world that relies heavily on technology, privacy is sought by many. Privacy, among other
things, is especially desired when making an online payment. This motivates the use of …

Cryptology and computers have a long common history; in fact, some of the early computers
were created as cryptanalytic tools. The development of faster and widely deployed …