[Oberseminar] Oberseminar Kryptographie und Computeralgebra TU-Darmstadt

[Oberseminar-Ankuendigungen]

  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
                           Christoph Ludwig=20
                 Darmstadt University of Technology
=20
          Tuesday, 17 December 2002, 16.15 - 17.15, S1/15-29
  =20
       Schnorr's sampling algorithms for solving lattice problems

  Lattice reduction has proven to be a powerful tool in cryptanalysis.=20
  The ability to find very short vectors in high dimensional lattices
  implies that, e.g., RSA and NTRU can be broken. For several years, the
  renowned LLL algorithm and its heuristic improvements have been the
  methods of choice for lattice reduction.

  Recently, Schnorr published new algorithms for lattice reduction based
  on sampling short vectors. The basic variant reduces the approximation
  factor under reasonable assumptions to its fourth root compared with
  previously available LLL-type algorithms. This talk will present
  Schnorr's sampling algorithms and outline a rationale for the
  algorithm's approximation and time bounds. Finally, the talk will put
  some ideas under consideration how to combine Grover's quantum search
  algorithm with Schnorr sampling, yielding the first quantum algorithm
  for lattice reduction that runs asymptotically faster than classical
  algorithms.=20
  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
=20
  Organizer:   Prof. Dr. J. Buchmann and Dr. T. Takagi, Junior Professor
               Department of Computer Science
               Cryptography and Computer Algebra
               Darmstadt University of Technology
=20
  Location:    S1/15-29, Alexanderstra=DFe 10, Darmstadt
=20
  Time:        Tuesdays  16.15 - 17.15

  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
=20
  Further talks in 2002/2003:
 =20
  ----------------------------------------------------------------------
  07.01.03  Ralf-Philip Weinmann:
            Algebraic representations for Rijndael and their=20
            implications for its security =20
  ----------------------------------------------------------------------
  14.01.03  Dr. Scheuermann, Fraunhofer SIT:
=20
  ----------------------------------------------------------------------
  21.01.03  Bodo M=F6ller:
            Provably Secure Public-Key Encryption for Length-Preserving
            Chaumian Mixes
  ----------------------------------------------------------------------
  28.01.03  Sven Wohlgemuth, Uni Freiburg:
            Benutzbarkeitsevaluierung von Sicherheitsanwendungen
=20
  ----------------------------------------------------------------------
  04.02.03  Luis Carlos Coronado Garcia:
=20
  ----------------------------------------------------------------------
  11.02.03  Dr. Kim Nguyen, Philips Semiconductors GmbH:
            Efficient implementation of curve based cryptography on
            smart cards
  ----------------------------------------------------------------------
=20
  For further information please contact:
  osem@cdc.informatik.tu-darmstadt.de

  Or visit our web sites:
  http://www.informatik.tu-darmstadt.de/TI/