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.
656 résultats
-
-
Séminaire
-
Cryptographie
L1 a new quasi-linear LLL algorithm
Orateur : Andy Novocin - ENS Lyon
The LLL lattice reduction algorithm of 1982 has proven to be useful in a wide variety of fields. It can be used to approximately solve computationally difficult lattice-based problems, such as the shortest vector problem, in polynomial time. We present a new algorithm for lattice reduction which is the first algorithm to have a complexity bound which is both polynomial and quasi-linear bound in[…] -
-
-
Séminaire
-
Cryptographie
Sélection polynomiale pour NFS
Orateur : Paul Zimmermann - LORIA
Le problème de la sélection polynomiale pour le crible algébrique consiste à trouver deux polynômes irréductibles f(x) et g(x) à coefficients entiers ayant une racine commune modulo le nombre N à factoriser. On décrira en détail l'algorithme proposé par Kleinjung en 2008, son implantation dans CADO-NFS, et on donnera des exemples de polynômes obtenus avec cet algorithme (RSA704, B200, RSA896). -
-
-
Séminaire
-
Cryptographie
Cracking Passwords with Time-memory Trade-offs
Orateur : Gildas Avoine - IRISA
Cryptanalytic time-memory trade-offs were introduced by Hellman in 1980 in order to perform key-recovery attacks on cryptosystems. A major advance was presented at Crypto 2003 by Oechslin, with the rainbow tables that outperform Hellman's seminal work. After introducing the cryptanalytic time-memory trade-offs, we will present in this talk a new variant of tables, known as fingerprint tables,[…] -
-
-
Séminaire
-
Cryptographie
Towards Automatic Verification of Security Proofs for
Orateur : Marion Daubrignard - Verimag
Providing security proofs instead of arguing lack of existing relevant attacks is a quite new approach when it comes to cryptography. In the last thirty years, a lot of work has been done to formalize security of systems and prove of the achievement of security criteria. It has resulted in the design of a great number of proofs under various hypotheses. Though a step in the right direction, these[…] -
-
-
Séminaire
-
Cryptographie
New LFSRs and FCSRs representations for stream ciphers hardware
Orateur : Marine Minier - Université de Lyon
In this talk, we will sum up our recent research results concerning the introduction of a new representation for FCSRs and for LFSRs. This matrix based representation allows to construct LFSRs and FCSRs with a more compact hardware representation and a quicker diffusion while preserving the usual and proven good properties (good periods, $\ell$-sequences, good statistical behaviors, etc.).[…] -
-
-
Séminaire
-
Cryptographie
Couplages et applications industrielles
Orateur : Renaud Dubois - Thales
Les couplages permettent de réaliser de nouveaux protocoles cryptographiques ou d'en améliorer les complexités : chiffrement broadcast, IBE... On trouve peu d'exemples de développements concrets de tels sytèmes. Nous exposons les contraintes industrielles qui se posent lors du développement de ces outils. Nous présentons les choix de développement et les performances atteintes par la librairie[…] -