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.
These data files containg code sources for dataset creation & model learning (Joint-Space-SCA.zip) and collected synthetic dataset of free & collided postures for humanoid robot iCub (raw_binary_data.zip). Follow the Readme.MD files to launch the code if n ...
Recently, some collisions have been exposed for a variety of cryptographic hash functions including some of the most widely used today. Many other hash functions using similar constructions can however still be considered secure. Nevertheless, this has dra ...
These data files containg code sources for dataset creation & model learning (neural-jsdf.zip) and collected synthetic dataset of free & collided postures for robotic arm Franka (sdf_3m_full_mesh.mat). Follow the Readme.MD files to launch the code if neede ...
With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each ch ...
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 ...
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 ...
Cryptographic primitives are usually based on a network with boxes. Schnorr and Vaudenay (1994) claimed that all boxes should be multipermutations. In this paper we investigate a few combinatorial properties of multipermutations. We argue that boxes which ...
This paper describes and analyzes the security of a general-purpose cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we suggest minimum parameter values for the main components of this cryptographic ...
