624 résultats
-
FeFET based Logic-in-Memory design, methodologies, tools and open challenges
Orateur : Cédric Marchand - University of Lyon - Lyon Institute of Nanotechnology (UMR CNRS 5270)
Data-centric applications such as artificial intelligence and the Internet of Things (IoT) impose increasingly stringent demands on the performance, the security and the energy efficiency of modern computing architectures. Traditional approaches are often unable to keep pace with these requirements making necessary to explore innovative paradigms such as in-memory computing. This paradigm is[…]-
SemSecuElec
-
-
Computational assumptions in the quantum world
Orateur : Alex Bredariol Grilo - LIP6 (CNRS / Sorbonne Université)
QKD is a landmark of how quantum resources allow us to implement cryptographicfunctionalities with a level of security that is not achievable only with classical resources.However, key agreement is not sufficient to implement all functionalities of interest, and it iswell-known that they cannot be implemented with perfect security, even if we have accessto quantum resources. Thus, computational[…]-
Cryptography
-
-
The Battle Against Bots: Current Threats and New Directions to Counter Automated Attacks
Orateur : Elisa Chiapponi - Amadeus IT Group
In today's digital landscape, the battle between industry and automated bots is an ever-evolving challenge. Attackers are leveraging advanced techniques such as residential proxies, CAPTCHA farms, and AI-enhanced fingerprint rotations to evade detection and execute functional abuse attacks, including web scraping, denial of inventory, and SMS pumping. This talk will explore ongoing efforts to[…]-
SoSysec
-
Intrusion detection
-
-
Solving the Tensor Isomorphism Problem for Special Orbits
Orateur : Valerie Gilchrist - ULB
Public key cryptography relies on using mathematical functions that are easy to compute but hard to invert. A recent work by D'Alconzo, Flamini, and Gangemi attempted to build such a function from tensors and use it to create a commitment scheme. In this talk, we will review their construction and present an attack on it, rendering it completely insecure. We will also offer an approach to[…]-
Cryptography
-
Asymmetric primitive
-
Protocols
-
-
Improved Provable Reduction of NTRU and Hypercubic Lattices
Orateur : Henry Bambury - ENS Paris
Lattice-based cryptography typically uses lattices with special properties to improve efficiency. We show how blockwise reduction can exploit lattices with special geometric properties, effectively reducing the required blocksize to solve the shortest vector problem to half of the lattice's rank, and in the case of the hypercubic lattice , further relaxing the approximation factor of blocks to . […]-
Cryptography
-
Asymmetric primitive
-
-
(On) The Impact of the Micro-architecture on the Masking Countermeasure against Side-Channel Attacks
Orateur : Lorenzo Casalino - CentraleSupélec, IRISA, Inria (SUSHI team)
The masking countermeasure constitutes a provably secure approach against side-channel attacks. Nonetheless, in the software context, the micro-architecture underlying a given CPU potentially induces information leakages undermining the masking's proven security.In this seminar, I will present the research work developed during my Ph.D. at CEA-List in Grenoble. This work addresses, along two axes,[…]-
SemSecuElec
-
Side-channel
-
Micro-architectural vulnerabilities
-