Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
687 results
-
-
Seminar
-
Cryptography
RSA problems with Lattice Reduction
Speaker : Alexander May - Technische Universität Darmstadt
This survey addresses the problems of factoring and inverting the RSA function. We define practically relevant relaxed instances of these problems that can be solved in polynomial time. These problem instances are modelled by polynomial equations with small roots. In order to recover the roots, we make use of a method due to Coppersmith which is in turn based on the famous LLL lattice reduction.[…] -
-
-
Seminar
-
Cryptography
An infinite class of balanced functions with optimal algebraic
Speaker : Claude Carlet - Université Paris 8
Travail en commun avec Keqin Feng, Tsinghua University, Pékin.<br/> After the improvement by Courtois and Meier of the algebraic attacks on stream ciphers and the introduction of the related notion of algebraic immunity, several constructions of infinite classes of Boolean functions with optimum algebraic immunity have been proposed. All of them gave functions whose algebraic degrees are high[…] -
-
-
Seminar
-
Cryptography
Quelques aspects algorithmiques de la cryptographie
Speaker : David Lubicz - DGA et Université Rennes I
La cryptographie à clef publique, qui fut inventée dans les années soixante-dix par W. Diffie et M. Hellman, apporte par rapport à la cryptographie symétrique un certain nombre de fonctionnalités particulièrement intéressantes pour les applications pratiques. Sa mise en oeuvre repose le plus souvent sur la difficulté calculatoire de certains problèmes issus de la théorie des nombres. De là, on[…] -
-
-
Seminar
-
Cryptography
Breaking the F-FCSR-H stream cipher in real time
Speaker : Thomas Johanson - Lund University
The F-FCSR stream cipher family has been presented a few years ago. Apart from some flaws in the initial propositions, corrected in a later stage, there are no known weaknesses of the core of these algorithms. The hardware oriented version, called FCSR-H, is one of the ciphers selected for the eSTREAM portfolio. In this paper we present a new and severe cryptanalytic attack on the F-FCSR stream[…] -
-
-
Seminar
-
Cryptography
Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds
Speaker : Orr Dunkelman - ENS
AES is the best known and most widely used block cipher. Its three versions (AES-128, AES-192, and AES-256) differ in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). In the case of AES-128, there is no known attack which is faster than the 2^{128} complexity of exhaustive search. However, AES-192 and AES-256 were recently shown to be[…] -
-
-
Seminar
-
Cryptography
Formules efficaces pour les courbes de genre 2 à multiplication réelle.
Speaker : Pierrick Gaudry - LORIA
Les cryptosystèmes s'appuyant sur les courbes de genre 2 présentent des caractéristiques similaires au cas elliptique en terme de taille de clef, de bande passante, etc. En ce qui concerne les temps de calculs, cela dépend grandement des formules utilisées pour la loi de groupe. Dans cet exposé nous présenterons des formules efficaces pour les courbes de genre 2. Ces formules proviennent[…] -