627 résultats

  • PHOENIX : the first crypto-agile hardware solution for ML-KEM and HQC

    • 25 avril 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Espace de conférences

    Orateur : Antonio RAS

    The security of the public-key cryptography protecting today and tomorrow's communication is threatened by the advent of quantum computers. To address this challenge, post-quantum cryptography is employed to devise new quantum-resistant cryptosystems. The National Institute of Standards and Technology (NIST), which led the quantum-safe transition, has already standardized the first lattice KEM[…]

    • Cryptography

    • SemSecuElec

    • Hardware accelerator

  • Advanced techniques for fault injection attacks on integrated circuits

    • 25 avril 2025 (10:00 - 11:00)

    • Inria Center of the University of Rennes - Espace de conférences

    Orateur : Paul Grandamme - Laboratoire Hubert Curien, Université Jean Monnet

    The security of integrated circuits is evaluated through the implementation of attacks that exploit their inherent hardware vulnerabilities. Fault injection attacks represent a technique that is commonly employed for this purpose. These techniques permit an attacker to alter the nominal operation of the component in order to obtain confidential information. Firstly, we propose the utilisation of[…]

    • SemSecuElec

    • Fault injection

  • Journées C2

    • 04 avril 2025 (00:00 - 18:00)

    • Pornichet

  • Cycles of pairing-friendly abelian varieties

    • 28 mars 2025 (13:45 - 14:45)

    • Salle Guernesey, ISTIC

    Orateur : Maria Corte-Real Santos - ENS Lyon

    A promising avenue for realising scalable proof systems relies on the existence of 2-cycles of pairing-friendly elliptic curves. More specifically, such a cycle consists of two elliptic curves E/Fp and E’/Fq that both have a low embedding degree and also satisfy q = #E(Fp) and p = #E’(Fq). These constraints turn out to be rather restrictive; in the decade that has passed since 2-cycles were first[…]

    • Cryptography

  • Circuit optimisation problems in the context of homomorphic encryption

    • 21 mars 2025 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Orateur : Sergiu Carpov - Arcium

    Fully homomorphic encryption (FHE) is an encryption scheme that enables the direct execution of arbitrary computations on encrypted data. The first generation of FHE schemes began with Gentry's groundbreaking work in 2019. It relies on a technique called bootstrapping, which reduces noise in FHE ciphertexts. This construction theoretically enables the execution of any arithmetic circuit, but[…]

  • Tackling obfuscated code through variant analysis and Graph Neural Networks

    • 21 mars 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - - Petri/Turing room

    Orateur : Roxane Cohen and Robin David - Quarkslab

    Existing deobfuscation techniques usually target specific obfuscation passes and assume a prior knowledge of obfuscated location within a program. Also, some approaches tend to be computationally costly. Conversely, few research consider bypassing obfuscation through correlation of various variants of the same obfuscated program or a clear program and a later obfuscated variant. Both scenarios are[…]

    • Malware analysis

    • Binary analysis

    • Obfuscation

Haut de page