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

• Design choices and security implications in implementing Diffie-Hellman key agreement
  Paul C. van Oorschot
  Lecture Notes in Computer Science 1025, 1995, pp. 1-1
• A broadcast key distribution scheme based on block designs
  Valeri Korjik, Michael Ivkov, Yuri Merinovich, Alexander Barg, Henk C.A. van Tilborg
  Lecture Notes in Computer Science 1025, 1995, pp. 2-12
• Minimal supports in linear codes
  Alexei Ashikhmin, Alexander Barg
  Lecture Notes in Computer Science 1025, 1995, pp. 13-13
• Sequential decoding for a subcode of Reed Solomon codes
  Sooyoung Kim Shin, Peter Sweeney
  Lecture Notes in Computer Science 1025, 1995, pp. 14-21
• Linear span analysis of a set of periodic sequence generators
  P. Caballero-Gil, A. Fúster-Sabater
  Lecture Notes in Computer Science 1025, 1995, pp. 22-33
• Minimal weight k-SR representations
  Yongfei Han, Dieter Gollmann, Chris Mitchell
  Lecture Notes in Computer Science 1025, 1995, pp. 34-43
• The main conjecture for MDS codes
  J.W.P. Hirschfeld
  Lecture Notes in Computer Science 1025, 1995, pp. 44-52
• Some decoding applications of minimal realization
  Graham Norton
  Lecture Notes in Computer Science 1025, 1995, pp. 53-62
• The synthesis of perfect sequences
  P.Z. Fan, M. Darnell
  Lecture Notes in Computer Science 1025, 1995, pp. 63-73
• Computation of low-weight parity checks for correlation attacks on stream ciphers
  W.T. Penzhorn, G.J. Kühn
  Lecture Notes in Computer Science 1025, 1995, pp. 74-83
• A storage complexity based analogue of Maurer key establishment using public channels
  C.J. Mitchell
  Lecture Notes in Computer Science 1025, 1995, pp. 84-93
• Soft decision decoding of Reed Solomon codes using the Dorsch algorithm
  H.P. Ho, P. Sweeney
  Lecture Notes in Computer Science 1025, 1995, pp. 94-99
• Good codes based on very sparse matrices
  David J.C. MacKay, Radford M. Neal
  Lecture Notes in Computer Science 1025, 1995, pp. 100-111
• Quantum cryptography: Protecting our future networks with quantum mechanics
  Simon J.D. Phoenix, Paul D. Townsend
  Lecture Notes in Computer Science 1025, 1995, pp. 112-131
• Prepaid electronic cheques using public-key certificates
  Cristian Radu, René Govaerts, Joos Vandewalle
  Lecture Notes in Computer Science 1025, 1995, pp. 132-141
• How Traveling Salespersons prove their identity
  Stefan Lucks
  Lecture Notes in Computer Science 1025, 1995, pp. 142-149
• An elliptic curve analogue of McCurley's key agreement scheme
  Andrew Smith, Colin Boyd
  Lecture Notes in Computer Science 1025, 1995, pp. 150-157
• Multi-dimensional ring TCM codes for fading channels
  M. Ahmadian-Attari, P.G. Farrell
  Lecture Notes in Computer Science 1025, 1995, pp. 158-168
• Authentication codes: An area where coding and cryptology meet
  Henk C.A. van Tilborg
  Lecture Notes in Computer Science 1025, 1995, pp. 169-183
• Efficient generation of binary words of given weight
  Nicolas Sendrier
  Lecture Notes in Computer Science 1025, 1995, pp. 184-187
• Distribution of recurrent sequences modulo prime powers
  Richard G.E. Pinch
  Lecture Notes in Computer Science 1025, 1995, pp. 188-189
• On-line secret sharing
  Christian Cachin
  Lecture Notes in Computer Science 1025, 1995, pp. 190-198
• Church-Rosser codes
  Vladimir A. Oleshchuk
  Lecture Notes in Computer Science 1025, 1995, pp. 199-204
• A new algorithm for finding minimum-weight words in large linear codes
  Anne Canteaut
  Lecture Notes in Computer Science 1025, 1995, pp. 205-212
• Coding and cryptography for speech and vision
  E.V. Stansfield, M. Walker
  Lecture Notes in Computer Science 1025, 1995, pp. 213-236