Person

Martijn Stam

This person is no longer with EPFL

Related publications (13)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Efficient Hashing Using the AES Instruction Set

Joppe Willem Bos, Martijn Stam, Onur Özen

In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions. We instantiate the underlying blockcipher with AES, which allows us to exploit the recent AES instruction set (AESNI). Since AES itself only output ...

Springer Berlin Heidelberg2011

Collision Attacks against the Knudsen-Preneel Compression Functions

Martijn Stam, Onur Özen

Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. Their main design goal ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

An Analysis of the Blockcipher-Based Hash Functions from PGV

Martijn Stam

Preneel, Govaerts, and Vandewalle (1993) considered the 64 most basic ways to construct a hash function H: {0, 1}*->{0, 1}(n) from a blockcipher E: {0, 1}(n) x {0, 1}(n)->{0,1}(n). They regarded 12 of these 64 schemes as secure, though no proofs or formal ...

Springer Verlag2010

Knudsen and Preneel (Asiacrypt’96 and Crypto’97) introduced a hash function design in which a linear error-correcting code is used to build a wide-pipe compression function from underlying blockciphers operating in Davies-Meyer mode. In this paper, we (re) ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Obfuscation for Cryptographic Purposes

Martijn Stam

Loosely speaking, an obfuscation O of a function f should satisfy two requirements: firstly, using O, it should be possible to evaluate f; secondly, O should not reveal anything about f that cannot be learnt from oracle access to f alone. Several definitio ...

Springer Verlag2010

Another Glance at Double-Length Hashing

Martijn Stam, Onur Özen

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use on ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Beyond uniformity: Better security/efficiency tradeoffs for compression functions

Martijn Stam

Suppose we are given a perfect n + c-to-n bit compression function f and we want to construct a larger m + s-to-s bit compression function H instead. What level of security, in particular collision resistance, can we expect from H if it makes r calls to f? ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

On Small Characteristic Algebraic Tori in Pairing-Based Cryptography

Robert Granger, Martijn Stam

The value of the Tate pairing on an elliptic curve over a finite field may be viewed as an element of an algebraic torus. Using this simple observation, we transfer techniques recently developed for torus-based cryptography to pairing-based cryptography, r ...

2006

Discrete logarithm variants of VSH

Arjen Lenstra, Martijn Stam

Recent attacks on standardised hash functions such as SHA1 have reawakened interest in design strategies based on techniques common in provable security. In presenting the VSH hash function, a design based on RSA-like modular exponentiation, the authors in ...

2006

At Crypto 2004, van Dijk and Woodruff introduced a new way of using the algebraic tori

T_n

in cryptography, and obtained an asymptotically optimal

n/\phi(n)

savings in bandwidth and storage for a number of cryptographic applications. However, the compu ...

Springer Berlin Heidelberg2005

At Crypto 2004, van Dijk and Woodruff introduced a new way of using the algebraic tori

T_n

in cryptography, and obtained an asymptotically optimal

n/\phi(n)

savings in bandwidth and storage for a number of cryptographic applications. However, the compu ...

Springer Berlin Heidelberg2005