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

On Bisimulations for the Spi Calculus

Johannes Borgström

The spi calculus is an extension of the pi calculus with cryptographic primitives, designed for the verification of cryptographic protocols. Due to the extension, the naive adaptation of labeled bisimulations for the pi calculus is too strong to be useful ...

2003

Ontogenetic Development and Fault Tolerance in the POEtic Tissue

Eduardo Sanchez, Yann Thoma, Daniel Roggen

In this article, we introduce the approach to the realization of ontogenetic development and fault tolerance that will be implemented in the POEtic tissue, a novel reconﬁgurable digital circuit dedicated to the realization of bio-inspired systems. The mode ...

Springer2003

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 ...

2003

The Security of DSA and ECDSA

Serge Vaudenay

DSA and ECDSA are well established standards for digital signature based on the discrete logarithm problem. In this paper we survey known properties, certification issues regarding the public parameters, and security proofs. ECDSA also includes a standard ...

2003

Mobility Helps Security in Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We propose a technique in which security associations between nodes are establi ...

2003

Etude de la microstructuration du verre par étincelage assisté par attaque chimique

Valia Fascio

We are surrounded by glass! This material has been greatly used for thousand years. More than 2000 years ago in ancient Egypt glass was used to manufacture bottles of perfume. So its first uses were primarily related to decoration and jewellery. The resear ...

EPFL2003

Biosphera: A Prototype Design for Learning about Multivariate Systems

Mauro Cherubini

This paper presents a prototype learning environment for children to create their own knowledge about multivariate systems. We developed a virtual world linked to a tabletop-sized physical dome in which children experiment with envirojnmental parameters af ...

2003

On solving distributed CS(O)Ps with privacy

Cryptographic protocols can enforce privacy in distributed computation of functions [Goldwasser'96] and are a competitor of the distributed constructive search techniques. [Goldreich'87,Chaum'87,Chaum'88,Ben-or'88] show how cryptographic protocols can be c ...

2002

Self-Organized Public-Key Management for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun

In contrast with conventional networks, mobile ad hoc networks do not provide on-line access to trusted authorities or to centralized servers. For this reason, key management is particularly difficult to implement in such networks. The solutions published ...

2002

Selecting cryptographic key sizes

Arjen Lenstra

In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm-based cryptosystems both over finite fields and over groups of elliptic curves over prime fields. Our recommendations are based ...

Springer Verlag2001