Filter by content type

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

Remove all filters

681 results

    • Seminar

    • Cryptography

    Generation of Prime Numbers on Portable Devices

    • November 10, 2006

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

    Speaker : Marc Joye - Thomson R&D France

    The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despite decades of intense mathematical studies on primality testing and an observed progressive intensification of cryptography, prime number generation algorithms remain scarcely investigated and most real-life[…]
    • Seminar

    • Cryptography

    Vérification formelle de compilateurs

    • March 30, 2007

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

    Speaker : Xavier Leroy - INRIA Rocquencourt

    Tous les programmeurs s'attendent à ce que les compilateurs et autres outils de génération de code produisent du code exécutable qui se comporte exactement comme prescrit par le programme source. Ce n'est malheureusement pas toujours le cas : des bugs dans le compilateur peuvent conduire à la production de code machine incorrect à partir d'un source correct. Ce cas de figure est particulièrement[…]
    • Seminar

    • Cryptography

    Relative rigid cohomology and the deformation method for elliptic curves

    • November 18, 2005

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

    Speaker : Ralf Gerkmann - Universitat Mainz

    By a well-known result of Dwork the zeta functions of the fibers in a one-parameter family of hypersurfaces can be described in terms of p-adic holomorphic functions. This result was used by A. Lauder in order to formulate a deter- ministic algorithm that computes the zeta function of a hypersurface in polynomial time. In this talk we describe a similiar method for elliptic curves which is based[…]
    • 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

    Symbolic verification of Diffie-Hellman-based group key exchange

    • January 13, 2006

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

    Speaker : Yassine Lakhnech - VERIMAG

    We discuss the cryptographic soundness of a symbolic model for Diffie-Hellman based key exchange protocols including symmetric encryption. Our main tool is a new dynamic variation of the decisional Diffie-Hellman problem useful for group protocols.
    • Seminar

    • Cryptography

    On Lattices, Learning with Errors, Random Linear Codes, and Cryptography

    • October 07, 2005

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

    Speaker : Oded Regev - Tel Aviv University

    Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learning from parity with error' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however[…]