Publications related to SHA-1 | EPFL Graph Search

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009

On Degraded Two Message Set Broadcast

Christina Fragouli, Suhas Diggavi, Vinod Malathidevi Prabhakaran, Shirin Saeedi Bidokhti

We consider the two message set problem, where a source broadcasts a common message

W_1

to an arbitrary set of receivers

\mathcal{U}

and a private message

W_2

to a subset of the receivers

\mathcal{P}\subseteq \mathcal{U}

. Transmissions occur over l ...

EPFL Technical Report2009

Multi-Stream Hashing on the PlayStation 3

Joppe Willem Bos, Dag Arne Osvik, Nathalie Casati

With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each ch ...

Springer2008

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Arjen Lenstra

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 2 50 calls to the MD5 compression function, for any two chosen message prefixes P and P′, suffixe ...

2007

Hash-and-Sign with Weak Hashing Made Secure

Serge Vaudenay, Sylvain Pasini

Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break s ...

Springer2007

FOX Specifications Version 1.2

Serge Vaudenay, Pascal Junod

In this document, we describe the design of a new family of block ciphers, named FOX. The main goals of this design, besides a very high security level, are a large implementation flexibility on various platforms as well as high performances. The high-leve ...

2005

Computational alternatives to random number generators

Serge Vaudenay

We present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accidental). In opposition to all past state-machine models, we assume that the signer is a memoryl ...

1999

The FIP1 gene encodes a component of a yeast pre-mRNA polyadenylation factor that directly interacts with poly(A) polymerase

Joachim Lingner

We have identified an essential gene, called FIP1, encoding a 327 amino acid protein interacting with yeast poly(A) polymerase (PAP1) in the two-hybrid assay. Recombinant FIP1 protein forms a 1:1 complex with PAP1 in vitro. At 37 degrees C, a thermosensiti ...

1995

SHA-1

Graph Chatbot

Chat with Graph Search

On degraded two-message set broadcast

On Degraded Two Message Set Broadcast

Multi-Stream Hashing on the PlayStation 3

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

Hash-and-Sign with Weak Hashing Made Secure

FOX Specifications Version 1.2

Computational alternatives to random number generators

The FIP1 gene encodes a component of a yeast pre-mRNA polyadenylation factor that directly interacts with poly(A) polymerase

Hash-and-Sign with Weak Hashing Made Secure

The FIP1 gene encodes a component of a yeast pre-mRNA polyadenylation factor that directly interacts with poly(A) polymerase

On degraded two-message set broadcast

On Degraded Two Message Set Broadcast

Multi-Stream Hashing on the PlayStation 3

Chosen-prefix collisions for MD5 and colliding X.509 certificates for different identities

FOX Specifications Version 1.2

Computational alternatives to random number generators