Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
679 résultats
-
-
Séminaire
-
SemSecuElec
The influence of flicker noise on ring oscillator-based TRNGs
Orateur : Licinius-Pompiliu BENEA - Univ. Grenoble Alpes, CEA, LETI
Ring oscillators (ROs) are often used in true random number generators (TRNGs). The jitter of their clock signal, used as a source of randomness, stems from thermal and flicker noises. While thermal noise jitter is often identified as the main source of randomness, flicker noise jitter is not taken into account due to its autocorrelated nature which greatly complexifies modelling. However, it is a[…]-
SemSecuElec
-
TRNG
-
-
-
Séminaire
-
Cryptographie
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
-
-
-
Séminaire
-
Cryptographie
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
-
-
-
Séminaire
-
Cryptographie
MinRank Gabidulin encryption scheme on matrix codes
Orateur : Adrien Vinçotte - XLIM, Université de Limoges
The McEliece scheme is a generic framework allowing to use any error correcting code which disposes of an efficient decoding algorithm to design an encryption scheme by hiding a generator matrix of this code.In the context of rank metric, we propose a generalization of the McEliece frame to matrix codes. From a vector code, we compute a matrix version of this code, that is hidden in such a way[…]-
Cryptography
-
Asymmetric primitive
-
-
-
Séminaire
-
Cryptographie
Polytopes in the Fiat-Shamir with Aborts Paradigm
Orateur : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
-
Séminaire
-
Cryptographie
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
-