Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

691 results

    • Seminar

    • Cryptography

    Constructing group based provably secure encryption schemes: a

    • April 28, 2006

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Maria Isabel Gonzalez Vasco - Universidad Rey Juan Carlos Madrid

    Cryptographic primitives arising from group theory have in the last few years attracted a lot of attention. Unfortunately, up to date most of the existing proposals are still far away from practical applications, not only due to unlucky computational assumptions which later turned out to be invalid. In this talk we address the impact of modern security analysis in the sense of provable security to[…]
    • Seminar

    • Cryptography

    Propriétés cryptographiques des fonctions booléennes symétriques

    • May 27, 2005

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Marion Videau - INRIA Rocquencourt

    Les fonctions booléennes symétriques sont les fonctions dont la valeur ne dépend que du poids du vecteur d'entrée. Ces fonctions peuvent être représentées plus simplement, que ce soit par leur forme algébrique normale ou leur vecteur des valeurs, que des fonctions booléennes générales --- vecteurs de taille (n+1) contre des vecteurs de taille 2^{n} en général. En outre, ces fonctions ont une[…]
    • Seminar

    • Cryptography

    Algebraic attacks and design of block ciphers, stream ciphers, and multivariate public key schemes

    • March 19, 2004

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Nicolas Courtois - Schlumberger

    Following the famous 1949 paper of Shannon, breaking a "good" cipher should require: "as much work as solving a system of simultaneous equations in a large number of unknowns of a complex type". For most practical cryptosystems, the problem of recovering the key can indeed can be seen as solving a huge system of binary nonlinear equations. In general, solving such a problem is known to be NP-hard,[…]
    • Seminar

    • Cryptography

    Quantum complexity of the knapsack problem

    • November 19, 2004

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Alexandre Kazakov

    An analogue quantum computer for the solution of the knapsack problem is discussed. Dynamics of some quantum-optical system exhibits explicit parallels with knapsack problem. This fact gives the possibility to propose an quantum algorithm for the knapsack problem and to estimate the quantum complexity of this problem.
    • Seminar

    • Cryptography

    Attaques récentes sur les fonctions de hachage itérées

    • January 14, 2005

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Antoine Joux - DGA/Université de Versailles

    Dans cet exposé, nous examinerons quelques attaques récentes sur diverses fonctions de hachage itérées comme SHA-0 et MD5. Ces attaques basées sur la cryptanalyse différentielle ont permis la mise en évidence de collisions sur plusieurs de ces fonctions. Nous verrons comment, en détaillant le cas de SHA-0, et nous chercherons à identifier les conclusions à tirer suite à ces attaques. Nous verrons[…]
    • Seminar

    • Cryptography

    Some solved and open problems on Boolean functions

    • May 28, 2004

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Hans Dobbertin - Ruhr-Universität Bochum

    We consider properties of Boolean functions which are important when they are used as components in cryptographic primitives. We focus mainly on non-linearity. Closely related issues are the weight distribution of BCH codes with two zeros and the crosscorrelation of two m-sequences. We shall present some recently solved old problems and the methods which where required to achieve this breakthrough[…]