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.
We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on cons ...
A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...
We formulate a conjecture about the distribution of the canonical height of the lowest non-torsion rational point on a quadratic twist of a given elliptic curve, as the twist varies. This conjecture seems to be very deep and we can prove only partial resul ...
Discontinuous Galerkin (DG) method is presented for numerical modeling of melt migration in a chemically reactive and viscously deforming upwelling mantle column. DG methods for both advection and elliptic equations provide a robust and efficient solution ...
Elliptic Curve Cryptography (ECC) is a popular tool to construct public-key crypto-systems. The security of ECC is based on the hardness of the elliptic curve discrete logarithm problem (ECDLP). Implementing and analyzing the performance of the best known ...
For q a prime power, the discrete logarithm problem (DLP) in Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer x such that gx=h. We present an algorithm for computing discrete log ...
For~q a prime power, the discrete logarithm problem (DLP) in~\Fq consists in finding, for any g∈Fq× and h∈⟨g⟩, an integer~x such that gx=h. We present an algorithm for computing discrete logarithm ...
Distance-Bounding is used to defeat relay attacks. For wireless payment systems, the payment terminal is not always online. So, the protocol must rely on a public key for the prover (payer). We propose a generic transformation of a (weakly secure) symmetri ...
The elliptic curve Curve25519 has been presented as pro- tected against state-of-the-art timing attacks [2]. This paper shows that a timing attack is still achievable against a particular X25519 implemen- tation which follows the RFC 7748 requirements [11] ...
The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...
