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=1423

• Shimura curve computations
  Noam D. Elkies
  Lecture Notes in Computer Science 1423, 1998, pp. 1-47
• The decision Diffie-Hellman problem
  Dan Boneh
  Lecture Notes in Computer Science 1423, 1998, pp. 48-63
• Parallel implementation of Schönhage's integer GCD algorithm
  Giovanni Cesari
  Lecture Notes in Computer Science 1423, 1998, pp. 64-76
• The complete analysis of the binary Euclidean algorithm
  Brigitte Vallée
  Lecture Notes in Computer Science 1423, 1998, pp. 77-94
• Cyclotomy primality proving - Recent developments
  Preda Mihȃilescu
  Lecture Notes in Computer Science 1423, 1998, pp. 95-110
• Primality proving using elliptic curves: An update
  F. Morain
  Lecture Notes in Computer Science 1423, 1998, pp. 111-127
• Bounding smooth integers
  Daniel J. Bernstein
  Lecture Notes in Computer Science 1423, 1998, pp. 128-130
• Factorization of the numbers of the form m^3+c_2m^2+c_1m+c_0
  Mingzhi Zhang
  Lecture Notes in Computer Science 1423, 1998, pp. 131-136
• Modelling the yield of number field sieve polynomials
  Brian Murphy
  Lecture Notes in Computer Science 1423, 1998, pp. 137-150
• A Montgomery-like square root for the number field sieve
  Phong Nguyen
  Lecture Notes in Computer Science 1423, 1998, pp. 151-168
• Robert Bennion's ``Hopping Sieve''
  William F. Galway
  Lecture Notes in Computer Science 1423, 1998, pp. 169-178
• Trading time for space in prime number sieves
  Jonathan P. Sorenson
  Lecture Notes in Computer Science 1423, 1998, pp. 179-195
• Do sums of 4 biquadrates have a positive density?
  Jean-Marc Deshouillers, François Hennecart, Bernard Landreau
  Lecture Notes in Computer Science 1423, 1998, pp. 196-203
• New experimental results concerning the Goldbach conjecture
  J.-M. Deshouillers, H.J.J. te Riele, Y. Saouter
  Lecture Notes in Computer Science 1423, 1998, pp. 204-215
• Dense admissible sets
  Daniel M. Gordon, Gene Rodemich
  Lecture Notes in Computer Science 1423, 1998, pp. 216-225
• An analytic approach to smooth polynomials over finite fields
  Daniel Panario, Xavier Gourdon, Philippe Flajolet
  Lecture Notes in Computer Science 1423, 1998, pp. 226-236
• Generating a product of three primes with an unknown factorization
  Dan Boneh, Jeremy Horwitz
  Lecture Notes in Computer Science 1423, 1998, pp. 237-251
• On the performance of signature schemes based on elliptic curves
  Erik de Win, Serge Mister, Bart Preneel, Michael Wiener
  Lecture Notes in Computer Science 1423, 1998, pp. 252-266
• NTRU: A ring-based public key cryptosystem
  Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
  Lecture Notes in Computer Science 1423, 1998, pp. 267-288
• Finding length-3 positive Cunningham chains and their cryptographic significance
  Adam Young, Moti Yung
  Lecture Notes in Computer Science 1423, 1998, pp. 289-298
• Reducing ideal arithmetic to linear algebra problems
  Stefan Neis
  Lecture Notes in Computer Science 1423, 1998, pp. 299-310
• Evaluation of linear relations between vectors of a lattice in Euclidean space
  I.A. Semaev
  Lecture Notes in Computer Science 1423, 1998, pp. 311-322
• An efficient parallel block-reduction algorithm
  Susanne Wetzel
  Lecture Notes in Computer Science 1423, 1998, pp. 323-337
• Fast multiprecision evaluation of series of rational numbers
  Bruno Haible, Thomas Papanikolaou
  Lecture Notes in Computer Science 1423, 1998, pp. 338-350
• A problem concerning a character sum
  E. Teske, H.C. Williams
  Lecture Notes in Computer Science 1423, 1998, pp. 351-357