Sommaire

  • Cet exposé a été présenté le 27 juin 2025 (13:45 - 14:45).

Description

  • Orateur

    Maciej Skorski - Laboratoire Hubert Curien

The talk examines power noise modelling through Gaussian Processes for secure True Random Number Generators.

 

While revisiting one-sided fractional Brownian motion, we obtain novel contributions by quantifying posterior uncertainty in exact analytical form, establishing quasi-stationary properties, and developing rigorous time-frequency analysis. These results are applied to model oscillator fluctuations of power-noise type, enabling closed-form entropy expressions for TRNGs and a novel GPU-accelerated simulation technique valuable for studying non-standard post-processing.

 

This work bridges machine learning techniques and signal processing to solve hardware security applications.

 

Keywords

Gaussian Process, Power Noise, True Random Number Generator, Fractional Brownian Motion, Entropy Estimation, Hardware Security, GPU Acceleration

Infos pratiques

Prochains exposés

  • Dual attacks in code-based (and lattice-based) cryptography

    • 19 septembre 2025 (13:45 - 14:45)

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

    Orateur : Charles Meyer-Hilfiger - Inria Rennes

    The hardness of the decoding problem and its generalization, the learning with errors problem, are respectively at the heart of the security of the Post-Quantum code-based scheme HQC and the lattice-based scheme Kyber. Both schemes are to be/now NIST standards. These problems have been actively studied for decades, and the complexity of the state-of-the-art algorithms to solve them is crucially[…]
    • Cryptography

  • Lie algebras and the security of cryptosystems based on classical varieties in disguise

    • 07 novembre 2025 (13:45 - 14:45)

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

    Orateur : Mingjie Chen - KU Leuven

    In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups.   In this talk, we[…]
    • Cryptography

Voir les exposés passés