Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
715 results
-
-
Seminar
-
Cryptography
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble
Speaker : Michele Orru - ENS
-
-
-
Seminar
-
Cryptography
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Low-Complexity Cryptographic Hash Functions
Speaker : Vinod Vaikuntanathan - Massachusetts Institute of Technology
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.<br/> Despite[…] -
-
-
Seminar
-
Cryptography
identity-based encryption with rank metric
Speaker : Adrien Hauteville - Université de Limoges
Code-based cryptography has a long history, almost as long as the history of public-key encryption (PKE). While we can construct almost all primitives from codes such as PKE, signature, group signature etc, it is a long standing open problem to construct an identity-based encryption from codes. We solve this problem by relying on codes with rank metric. The concept of identity-based encryption […] -
-
-
Seminar
-
Cryptography
Permutations complètes en caractéristique 2.
Speaker : Valentin Suder - Université de Versailles Saint-Quentin
Dans ce travail, nous nous intéressons aux permutations complètes, c’est-à-dire aux fonctions bijectives $x\mapsto f(x)$ telles que $x\mapsto f(x)+x$ soient aussi bijectives. Plus particulièrement, nous nous intéressons aux permutations complètes sur les corps finis $\mathbb{F}_{2^n}$. En caractéristique 2, la définition des permutations complètes coincide avec celle des orthomorphismes. Nous[…] -
-
-
Seminar
-
Cryptography
CRYSTALS: Dilithium and Kyber
Speaker : Damien Stehlé - ENS de Lyon
Kyber -- a Key Exchange Mechanism -- and Dilithium -- a digital signature -- are the two components of the Cryptographic Suite for Algebraic Lattices (CRYSTALS). I will present the intractable problems underlying their security, overview their design and comment their practical performance. The talk is based on the following articles:<br/> https://eprint.iacr.org/2017/633.pdf<br/> https:/[…] -