Publication

Cryptanalysis of the Sidelnikov cryptosystem

Related publications (64)

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.

OREN: Optimal Revocations in Ephemeral Networks

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Public-key certificates allow a multitude of entities to securely exchange and verify the authenticity of data. However, the ability to effectively revoke compromised or untrustworthy certificates is of great importance when coping with misbehavior. In thi ...

2011

Front-Crawl Propulsive Phase Detection Using Inertial Sensors

Kamiar Aminian, Grégoire Millet, Farzin Dadashi, Florent Crettenand

Front crawl is an alternating swimming stroke technique in which different phases of arm movement induce changes in acceleration of limbs and body. This study proposes a new approach to use inertial body worn sensors to estimate main temporal phases of fro ...

2011

Transforming terpene feedstock into polyketide architecture

Christoph Heinz

The Cu-catalyzed synthesis of skipped 1,4-dienes from allylic acetates and vinyl-Grignard reagents is key to bidirectional modifications of acyclic terpene acetates. As a result, trisubstituted double bond containing subunits can be readily transferred int ...

Royal Society of Chemistry2011

Neutrality-Based Symmetric Cryptanalysis

Shahram Khazaei

Cryptographic primitives are the basic components of any cryptographic tool. Block ciphers, stream ciphers and hash functions are the fundamental primitives of symmetric cryptography. In symmetric cryptography, the communicating parties perform essentially ...

EPFL2010

A mean field model of work stealing in large-scale systems

Nicolas Gabriel Gast

In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing ecient job allocation policies is to balance the workload over the dierent resources. We pres ...

ACM Press2010

Optimal Revocations in Ephemeral Networks: A Game-Theoretic Framework

Jean-Pierre Hubaux, Maxime Raya, Igor Bilogrevic

Revocation of public-key certificates is an important security primitive. In this paper, we design a fully distributed local certificate revocation scheme for ephemeral networks - a class of extremely volatile wireless networks with short-duration and shor ...

IEEE2010

Model-based implementation of real-time applications

Joseph Sifakis

Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on features of the execution platform, in particular its speed. Existing rigorous im ...

2010

Secure communication using authenticated channels

Sylvain Pasini

Our main motivation is to design more user-friendly security protocols. Indeed, if the use of the protocol is tedious, most users will not behave correctly and, consequently, security issues occur. An example is the actual behavior of a user in front of an ...

EPFL2009

Revocation Games in Ephemeral Networks

Igor Bilogrevic

An ephemeral network is usually defined by the very short-lived and heterogeneous nature of interactions among self-organizing wireless devices. The wide penetration in everyday gadgets of radio technologies operating in unlicensed frequency spectrum, such ...

2009

Weariness and Loyalty Loss in Recurrent Service Models

Max-Olivier Hongler, Olivier Gallay

For recurrent service providers (fast-food, entertainment, medical care,...), retaining loyal customers is obviously a key issue. The customers' loyalty essentially depends on their service satisfaction defined via an ad-hoc utility function. Among several ...

2008