Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1838

• The complexity of some lattice problems
  Jin-Yi Cai
  Lecture Notes in Computer Science 1838, 2000, pp. 1-32
• Rational points near curves and small nonzero \mid x^3 - y^2\mid via lattice reduction
  Noam D. Elkies
  Lecture Notes in Computer Science 1838, 2000, pp. 33-63
• Coverings of curves of genus 2
  E. Victor Flynn
  Lecture Notes in Computer Science 1838, 2000, pp. 65-84
• Lattice reduction in cryptology: An update
  Phong Q. Nguyen, Jacques Stern
  Lecture Notes in Computer Science 1838, 2000, pp. 85-112
• Construction of secure C_{ab} curves using modular curves
  Seigo Arita
  Lecture Notes in Computer Science 1838, 2000, pp. 113-126
• Curves over finite fields with many rational points obtained by ray class field extensions
  Roland Auer
  Lecture Notes in Computer Science 1838, 2000, pp. 127-134
• New results on lattice basis reduction in practice
  Werner Backes, Susanne Wetzel
  Lecture Notes in Computer Science 1838, 2000, pp. 135-152
• Baby-step giant-step algorithms for non-uniform distributions
  Simon R. Blackburn, Edlyn Teske
  Lecture Notes in Computer Science 1838, 2000, pp. 153-168
• On powers as sums of two cubes
  Nils Bruin
  Lecture Notes in Computer Science 1838, 2000, pp. 169-184
• Factoring polynomials over p-adic fields
  David G. Cantor, Daniel M. Gordon
  Lecture Notes in Computer Science 1838, 2000, pp. 185-208
• Strategies in filtering in the Number Field Sieve
  Stefania Cavallar
  Lecture Notes in Computer Science 1838, 2000, pp. 209-231
• Factoring polynomials over finite fields and stable colorings of tournaments
  Qi Cheng, Ming-Deh A. Huang
  Lecture Notes in Computer Science 1838, 2000, pp. 233-245
• Computing special values of partial zeta functions
  Gautam Chinta, Paul E. Gunnells, Robert Sczech
  Lecture Notes in Computer Science 1838, 2000, pp. 247-256
• Construction of tables of quartic number fields
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1838, 2000, pp. 257-268
• Counting discriminants of number fields of degree up to four
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1838, 2000, pp. 269-283
• On reconstruction of algebraic numbers
  Claus Fieker, Carsten Friedrichs
  Lecture Notes in Computer Science 1838, 2000, pp. 285-296
• Dissecting a sieve to cut its need for space
  William F. Galway
  Lecture Notes in Computer Science 1838, 2000, pp. 297-312
• Counting points on hyperelliptic curves over finite fields
  Pierrick Gaudry, Robert Harley
  Lecture Notes in Computer Science 1838, 2000, pp. 313-332
• Modular forms for GL(3) and Galois representations
  Bert van Geemen, Jaap Top
  Lecture Notes in Computer Science 1838, 2000, pp. 333-346
• Modular symbols and Hecke operators
  Paul E. Gunnells
  Lecture Notes in Computer Science 1838, 2000, pp. 347-357
• Fast Jacobian group arithmetic on C_{ab} curves
  Ryuichi Harasawa, Joe Suzuki
  Lecture Notes in Computer Science 1838, 2000, pp. 359-376
• Lifting elliptic curves and solving the elliptic curve discrete logarithm problem
  Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan
  Lecture Notes in Computer Science 1838, 2000, pp. 377-384
• A one round protocol for tripartite Diffie-Hellman
  Antoine Joux
  Lecture Notes in Computer Science 1838, 2000, pp. 385-393
• On exponential sums and group generators for elliptic curves over finite fields
  David R. Kohel, Igor E. Shparlinski
  Lecture Notes in Computer Science 1838, 2000, pp. 395-404
• Component groups of quotients of J_0(N)
  David R. Kohel, William A. Stein
  Lecture Notes in Computer Science 1838, 2000, pp. 405-412