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.
This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of Fq6, for q≡1mod6. Our result arises from considering the Weil restriction of scalars of this group from Fq6 ...
Meeting the requirements of NIST’s new cryptographic standard ‘Suite B Cryptography’ means phasing out usage of 1024-bit RSA and 160-bit Elliptic Curve Cryptography (ECC) by the year 2010. This write-up comments on the vulnerability of these systems to an ...
In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem [9] allowed to speed-up several combinatorial attacks. However, in the case of NTRU we can not ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009
We report direct evidence of enhanced spontaneous emission in a photonic crystal light-emitting diode (LED) at telecom wavelength (lambda similar to 1300 nm). This result is crucial to obtain an electrically driven single photon source with high extraction ...
Recently, the emission of single photons with emission wavelength in the 1.3 µm telecommunication window was demonstrated for InAs quantum dots. This makes them strong candidates for applications such as quantum cryptography, and in a longer term, quantum ...
This thesis is concerned with the analysis and design of symmetric cryptographic algorithms, with a focus on real-world algorithms. The first part describes original cryptanalysis results, including: The first nontrivial preimage attacks on the (reduced) h ...
Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues, especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Messag ...
Cryptography often meets the problem of distinguishing distributions. In this paper we review techniques from hypothesis testing to express the advantage of the best distinguisher limited to a given number of samples. We link it with the Chernoff informati ...
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 ...