Filter by content type

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

Remove all filters

627 results

    • 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

    Packings on the Grassmann manifold: an interesting approach for non coherent space-time coding

    • November 21, 2003

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

    Speaker : Jean-Claude Belfiore - ENST

    The need of high data rates on the radio channel (WiFi and its future for example) explains the increasing number of researchers working on space-time codes. Preparing Wireless IP systems, some companies and some researchers are promoting the use of non coherent space-time codes.<br/> We show that designing a non coherent space-time code is equivalent to finding some good packings on the Grassmann[…]
    • Seminar

    • Cryptography

    Efficient arithmetic on (hyper-)elliptic curves over finite fields

    • April 04, 2003

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

    Speaker : Tanja Lange - Ruhr-Universität Bochum

    The talk will be concerned with arithmetic on elliptic and hyperelliptic curves. We show how fast the arithmetic can get by clever choices of the coordinates and present special kinds of curves which allow even faster arithmetic using the Frobenius endomorphism. For elliptic curves this has been used to achieve fast arithmetic for the past years. However, so far arithmetic in the ideal class group[…]
    • Seminar

    • Cryptography

    Sur le calcul du corps de définition d'un point de torsion d'une jacobienne d'une courbe de genre quelconque

    • January 23, 2004

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

    Speaker : Bas Edixhoven - Leiden University

    En commençant par un calcul explicite sur une courbe elliptique, j'expliquerai ma stratégie pour calculer le corps de définition d'un point de torsion d'une jacobienne d'une courbe de genre quelconque. En gros, cette stratégie consiste à calculer le polynôme minimal d'une coordonnée d'un tel point par une approximation (complexe ou p-adique) avec une précision suffisante. J'expliquerai comment la[…]
    • Seminar

    • Cryptography

    Un état de l'art de la cryptographie à base de réseaux

    • February 07, 2003

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

    Speaker : Phong N'Guyen - Ecole Normale Supérieure

    Un réseau est un sous-groupe discret de R^n. Les réseaux ont de nombreuses applications en cryptologie. Pendant longtemps, ces applications sont restées cantonnées à l'attaque des cryptosystèmes à clef publique à base de theorie des nombres. Mais paradoxalement, une cryptographie à base de reseaux est depuis apparue en 1996. Dans cet exposé, nous dresserons un état-de-l'art de la cryptographie à[…]
    • Seminar

    • Cryptography

    Constructive Galois Theory

    • September 12, 2003

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

    Speaker : Juergen Klueners - Universität Kassel

    In constructive Galois theory, there are two main questions: the direct problem and the inverse problem. For the inverse problem the question is whether it is possible to find a polynomial such that the Galois group of that polynomial is a given finite group. In this talk, we will focus on the direct problem. Given a polynomial f we explain how to compute the Galois group of this polynomial. The[…]