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.
741 résultats
-
-
Séminaire
-
Cryptographie
Number Systems and Cryptography, some examples
Orateur : Jean-Claude Bajard - Sorbonne Université
Number systems are behind a lot of implementations. The role of representation is often underrated while its importance in implementation is crucial. We survey here some classes of fundamental systems that could be used in crypotgraphy. We present three main categories:<br/> - systems based on the Chinese Remainder Theorem which enter more generally in the context of polynomial interpolation,<br/[…] -
-
-
Séminaire
-
Cryptographie
Quantum security of the Fiat-Shamir transform of commit and open protocols
Orateur : André Chailloux - INRIA
Applying the Fiat-Shamir transform on identification schemes is one of the main ways of constructing signature schemes. While the classical security of this transformation is well understood, there are still many cases for which we do not know whether the quantum security holds or not. In this paper, we show that if we start from a commit-and-open identification scheme, where the prover first[…] -
-
-
Séminaire
-
Cryptographie
Practical Strategy-Resistant Privacy-Preserving Elections
Orateur : Quentin Santos - Orange
Recent advances in cryptography promise to let us run com- plex algorithms in the encrypted domain. However, these results are still mostly theoretical since the running times are still much larger than their equivalents in the plaintext domain. In this context, Majority Judgment is a recent proposal for a new voting system with several interesting practical advantages, but which implies a more[…] -
-
-
Séminaire
-
Cryptographie
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Orateur : Simon Masson - Loria, Nancy
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situation is to propose alternative curves that are immune to these attacks, without compromising the efficiency of the pairing computation too much. We follow this direction, and focus on embedding[…] -
-
-
Séminaire
-
Cryptographie
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble
Orateur : Michele Orru - ENS
-
-
-
Séminaire
-
Cryptographie
Isogeny-based cryptography from superspecial genus-2 curves
Orateur : Wouter Castryck - KU Leuven
I will report on some first attempts to do isogeny-based cryptography in genus 2. More precisely, we will use isogeny graphs of superspecial principally polarized abelian surfaces over GF(p^2) for constructing variants of Charles, Goren and Lauter's hash function and of Jao and De Feo's SIDH key exchange protocol, both of which use supersingular elliptic curves over GF(p^2). This will be largely[…] -