Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
678 results
-
-
Seminar
-
Cryptography
Constant time implementation of rank based cryptography
Speaker : Nicolas Aragon - IRISA
Since the start of the NIST standardization project for post-quantum cryptography in 2017, rank metric based cryptography is becoming more popular as an alternative to code-based cryptography in the Hamming metric.<br/> While rank based cryptography has always been competitive in terms of keys and ciphertexts sizes, the lack of maturity in the implementations of these cryptosystems made them[…] -
-
-
Seminar
-
Cryptography
Divisible E-Cash from Constrained Pseudo-Random Functions
Speaker : Olivier Sanders - Orange
Electronic cash (e-cash) is the digital analogue of regular cash which aims at preserving users' privacy. Following Chaum's seminal work, several new features were proposed for e-cash to address the practical issues of the original primitive. Among them, divisibility has proved very useful to enable efficient storage and spendings. Unfortunately, it is also very difficult to achieve and, to date,[…] -
-
-
Seminar
-
Cryptography
Some new results on cube attacks against Trivium
Speaker : Tian Tian - Université de Zhengzhou
Trivium is a bit oriented synchronous stream cipher designed by Cannière and Preneel. It is one of the eSTREAM hardware-oriented finalists and an International Standard under ISO/IEC 29192-3:2012. Cube attacks are an important type of key recovery attack against Trivium. First, I will give a survey on cube attacks against Trivium. Second, I will present our recent results including an algebraic[…] -
-
-
Seminar
-
Cryptography
Cryptanalyse algébrique de DAGS
Speaker : Magali Bardet - université de Rouen
Elise Barelli et Alain Couvreur ont présenté une attaque dévastatrice sur le cryptosystème DAGS soumis au 1er tour de la compétition du NIST autour d'algorithmes de cryptographie post-quantiques. Je présenterai une explication précise de la résolution par bases de Gröbner de leur modélisation algébrique, expliquant l'efficacité de l'attaque pour les paramètres de DAGS publiés au NIST.<br/> lien:[…] -
-
-
Seminar
-
Cryptography
Grost Distinguishing Attack: A new rebound attack of an AES-like permutation
Speaker : Victor Cauchois - DGA et IRMAR
Grostl est une fonction de hachage finaliste de la compétition SHA-3. Elle est dotée d'une preuve de sécurité qui assure sa résistance aux attaques en collision, pré-image et seconde pré-image sous l'hypothèse que deux permutations internes sont idéales. Ces permutations, 14 tours d'un SPN, calques de l'AES, présentent une structure sensible aux attaques rebond. Ces attaques sont des attaques[…] -
-
-
Seminar
-
Cryptography
Discrete logarithm computation in finite fields GF(p^k) with NFS
Speaker : Aurore Guillevic - INRIA
Pairings on elliptic curves are involved in signatures, NIZK, and recently in blockchains (ZK-SNARKS).<br/> These pairings take as input two points on an elliptic curve E over a finite field, and output a value in an extension of that finite field. Usually for efficiency reasons, this extension degree is a power of 2 and 3 (such as 12,18,24), and moreover the characteristic of the finite field has[…] -