Publication

High performance VLSI architectures implementing strong cryptographic primitives

Publications associées (245)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Secure Position-Based Routing for VANETs

Panagiotis Papadimitratos, Charles Harsch

Vehicular communication (VC) systems have the potential to improve road safety and driving comfort. Nevertheless, securing the operation is a prerequisite for deployment. So far, the security of VC applications has mostly drawn the attention of research ef ...

2007

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Wireless sensor networks are already deployed in numerous occasions. As this technology matures towards wider adoption, security will become an increasingly important requirement. However, resource and cost constraints for the low-complexity sensor nodes r ...

2007

Unsupervised Learning for Information Distillation

Kamand Kamangar

Current document archives are enormously large and constantly increasing and that makes it practically impossible to make use of them efficiently. To analyze and interpret large volumes of speech and text of these archives in multiple languages and produce ...

IDIAP2007

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

E-Passport Threats

Serge Vaudenay

The author focuses on the cryptographic protection of e-passports, working from the assumption that even if people can peacefully live with their e- passports, what sort of cryptography technology is involved here? Can e- passport holders protect their pri ...

2007

On Small Degree Extension Fields in Cryptology

Robert Granger

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension field ...

PhD dissertation, University of Bristol, UK, February 20062006

Cryptosystems and LLL

Thomas Baignères

Since the late 70’s, several public key cryptographic algorithms have been proposed. Diﬃe and Hellman ﬁrst came with this concept in 1976. Since that time, several other public key cryptosystems were invented, such as the well known RSA, ElGamal or Rabin c ...

2006

Key Agreement in Peer-to-Peer Wireless Networks

Jean-Pierre Hubaux, Mario Cagalj, Srdan Capkun

We present a set of simple techniques for key establishment over a radio link in peer-to-peer networks. Our approach is based on the Diffie-Hellman key agreement protocol, which is known to be vulnerable to the ``man-in-the-middle" attack if the two users ...

2006

High Security Pairing-Based Cryptography Revisited

Robert Granger

The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We re-examine how one should implement pairings over ordinary elliptic curves f ...

Springer Berlin Heidelberg2006

Mobility Helps Peer-to-Peer Security

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

We propose a straightforward technique to provide peer-to-peer security in mobile networks. We show that far from being a hurdle, mobility can be exploited to set up security associations among users. We leverage on the temporary vicinity of users, during ...

2006