Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
655 results
-
-
Seminar
-
Cryptography
Locally recoverable codes from curves
Speaker : Everett Howe - Center for Communications Research, San Diego
A locally recoverable code, or LRC, is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. I will explain why LRCs are important for applications such as cloud data storage, and I will present several constructions of locally recoverable codes from Galois covers of curves over finite[…] -
-
-
Seminar
-
Cryptography
Attaques sur des conversions IND-CCA de systèmes basés sur les codes
Speaker : Paul Stankovski - Université de Lund
Algorithms for secure encryption in a post-quantum world are currently receiving a lot of attention in the research community, including several larger projects and a standardization effort from {NIST}. One of the most promising algorithms is the code-based scheme called QC-MDPC, which has excellent performance and a small public key size.<br/> In this work we present a very efficient key recovery[…] -
-
-
Seminar
-
Cryptography
Class Group Computations in Number Fields and Applications to Cryptology
Speaker : Alexandre Gelin - Versailles-Saint-Quentin-en-Yvelines
In this talk, we focus on class group computations in number fields. We start by describing an algorithm for reducing the size of a defining polynomial of a number field. There exist infinitely many polynomials that define a specific number field, with arbitrarily large coefficients, but our algorithm constructs the one that has the absolutely smallest coefficients. The advantage of knowing such a[…] -
-
-
Seminar
-
Cryptography
Design de cryptographie white-box : n'oublions pas la grey-box
Speaker : Philippe Teuwen - QuarksLab
Bien que toutes les tentatives académiques actuelles pour créer des primitives cryptographiques standard en white-box aient été cassées, il y a encore un grand nombre d'entreprises qui vendent des solutions "sécurisées" de cryptographie white-box. Afin d'évaluer le niveau de sécurité de solutions en boîte blanche, nous verrons de nouvelles approches qui ne nécessitent ni connaissance des tables[…] -
-
-
Seminar
-
Cryptography
Falcon un schéma de signature sur les réseaux euclidiens NTRU
Speaker : Thomas Ricosset - Thales Communications & Security, INP-ENSEEIHT
Dans cette présentation je décrirai le schéma de signature Falcon, pour "FAst Fourier Lattice-based COmpact signatures over NTRU", basé sur le schéma de signature hash-and-sign de Gentry, Peikert et Vaikuntanathan. Je présenterai les outils et techniques permettant à Falcon d'offrir aujourd'hui, à faibles coûts, les signatures les plus compactes sur les réseaux euclidiens : une version randomisée[…] -
-
-
Seminar
-
Cryptography
Attaques par invariants : comment choisir les constantes de tour pour s'en protéger
Speaker : Anne Canteaut - Inria
Many lightweight block ciphers apply a very simple key schedule in which the round keys only differ by addition of a round-specific constant. Generally, there is not much theory on how to choose appropriate constants. In fact, several of those schemes were recently broken using invariant attacks, i.e. invariant subspace or nonlinear invariant attacks. This work analyzes the resistance of such[…] -