Filter by content type

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

Remove all filters

702 results

    • Seminar

    • Cryptography

    Research on Cryptographic Algorithms: beyond triple-DES, AES and RSA

    • November 22, 2002

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

    Speaker : Bart Preneel - University of Leuven

    In this talk we discuss the state of the art and progress in cryptographic algorithms such as encryption algorithms and digital signature techniques. We present at a high level the challenges to the designers (and users) of cryptographic algorithms and we discuss the major components of the solution, that is, research, standardization, and open evaluation. We also discuss the status of the NESSIE[…]

    • Seminar

    • Cryptography

    Quelques moments de l'histoire de la cryptographie

    • December 14, 2001

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

    Speaker : Jean-Pierre Escofier - IRMAR

    Retracer en détail toute l'histoire de la cryptographie de Jules César à aujourd'hui est impossible en une séance. On abordera quelques moments de cette histoire et de ses protagonistes : Jules César, Alberti, Viète, Poe, Bazeries, Painvin, etc., en terminant par la naissance de la cryptographie à clef publique : Diffie, Hellman, etc.<br/> Bibliographie principale :<br/> David Kahn : La guerre des[…]

    • Seminar

    • Cryptography

    Monsky-Washnitzer Cohomology and Computing Zeta Functions

    • May 31, 2002

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

    Speaker : Kiran Kedlaya - Berkeley

    Monsky-Washnitzer cohomology is a p-adic cohomology theory for algebraic varieties over finite fields, based on algebraic de Rham cohomology. Unlike the l-adic (etale) cohomology, it is well-suited for explicit computations, particularly over fields of small characteristic. We describe how to use Monsky-Washnitzer to construct efficient algorithms for computing zeta functions of varieties over[…]

    • Seminar

    • Cryptography

    Computing the order of the group of rational points on the Jacobian of a hyperelliptic curve in characteristic 2

    • June 07, 2002

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

    Speaker : Alan Lauder - Oxford University

    I will describe an algorithm for computing the zeta function of an arbitrary hyperelliptic curve in characteristic 2. This is a generalisation of an earlier method of myself and Wan, which tackled a restricted class of curves. The algorithm reduces the problem to that of computing the L-function of an additive character sum over an open subset of the projective line. This latter task can be[…]

    • Seminar

    • Cryptography

    Quelques applications des réseaux en cryptographie

    • September 20, 2002

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

    Speaker : Olivier Orcière - Thales

    Après avoir décrit le problème du "sac-à-dos" qui appartient à la classe de complexité NP, nous montrons comment il peut servir d' infrastructure à des cryptosystèmes à clef publique. Nous montrons dans un deuxième temps qu'il est possible de cryptanalyser la plupart de ces systèmes en utilisant de manière astucieuse l'algorithme LLL.

    • Seminar

    • Cryptography

    BCH codes and algebraic curves

    • November 15, 2002

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

    Speaker : Gerard van der Geer - University of Amsterdam

    In this talk we consider various relations between BCH codes and algebraic geometry, especially algebraic curves and show how it can be used to gain information about such codes.
Page top