691 results
-
Towards Security-Oriented Program analysis
Speaker : Sébastien Bardin (CEA LIST)
While digital security concerns increase, we face both a urging demand for more and more code-level security analysis and a shortage of security experts. Hence the need for techniques and tools able to automate part of these code-level security analyses. As source-level program analysis and formal methods for safety-critical applications have made tremendous progress in the past decades, it is[…] -
When Electromagnetic Signals Reveal Obfuscated Malware: Deep and Machine Learning Use cases
Speaker : Duy-Phuc Pham et Damien Marion
The Internet of Things (IoT) is constituted of devices that are expo-nentially growing in number and in complexity. They use plentiful customized firmware and hardware, ignoring potential security issues, which make them a perfect victim for cybercriminals, especially malware authors.We will describe a new usage of side channel information to identify threats that are targeting the device. Using[…] -
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
Speaker : Maxime Bombar - Ecole Polytechnique
Error correcting codes are well known to provide possible candidates for building quantum safe cryptographic primitives. Besides the Hamming metric which has a long-standing history, one may consider other metrics such as the rank metric. Gabidulin codes are the rank metric analogue of Reed-Solomon codes and can be efficiently decoded up to half the minimum distance. However, beyond this radius,[…] -
https://seminaire-c2.inria.fr/
Speaker : Séminaire C2 - Paris
-
Rank metric cryptography and its implementations
Speaker : Nicolas Aragon
In 2017, the NIST (National Institute for Standards and Technology) started astandardization process in order to select post-quantum encryption and digital signature schemes. Among the proposed solutions, two rank-metric based encryption schemes were selected for the second round of the standardization process: ROLLOand RQC.This raised questions about both the performance and the security of the[…] -
On the hardness of the NTRU problem
Speaker : Alice Pellet-Mary - CNRS, Institut Mathématiques de Bordeaux
The NTRU problem is an algorithmic problem over structured lattices that was introduced by Hoffstein, Pipher, and Silverman more than 20 years ago, and which has been used to construct various cryptographic primitives. However, its relation to other lattice problems is still not well understood.<br/> In this talk, we will describe different variants of the NTRU problem, and study how they compare[…]