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

• Cryptography and the methodology of provable security
  Jacques Stern
  Lecture Notes in Computer Science 2643, 2003, pp. 1-5
• Dynamical systems generated by rational functions
  Harald Niederreiter, Igor E. Shparlinski
  Lecture Notes in Computer Science 2643, 2003, pp. 6-17
• Homotopy methods for equations over finite fields
  Alan G.B. Lauder
  Lecture Notes in Computer Science 2643, 2003, pp. 18-23
• Three constructions of authentication/secrecy codes
  Cunsheng Ding, Arto Salomaa, Patrick Solé, Xiaojian Tian
  Lecture Notes in Computer Science 2643, 2003, pp. 24-33
• The Jacobi model of an elliptic curve and side-channel analysis
  Olivier Billet, Marc Joye
  Lecture Notes in Computer Science 2643, 2003, pp. 34-42
• Fast point multiplication on elliptic curves through isogenies
  Eric Brier, Marc Joye
  Lecture Notes in Computer Science 2643, 2003, pp. 43-50
• Interpolation of the elliptic curve Diffie-Hellman mapping
  Tanja Lange, Arne Winterhof
  Lecture Notes in Computer Science 2643, 2003, pp. 51-60
• An optimized algebraic method for higher order differential attack
  Yasuo Hatano, Hidema Tanaka, Toshinobu Kaneko
  Lecture Notes in Computer Science 2643, 2003, pp. 61-70
• Fighting two pirates
  Hans Georg Schaathun
  Lecture Notes in Computer Science 2643, 2003, pp. 71-78
• Copyright control and separating systems
  Sylvia Encheva, Gérard Cohen
  Lecture Notes in Computer Science 2643, 2003, pp. 79-86
• Unconditionally secure homomorphic pre-distributed commitments
  Anderson C.A. Nascimento, Akira Otsuka, Hideki Imai, Joern Mueller-Quade
  Lecture Notes in Computer Science 2643, 2003, pp. 87-97
• A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols
  Ivana Djurdjevic, Jun Xu, Khaled Abdel-Ghaffar, Shu Lin
  Lecture Notes in Computer Science 2643, 2003, pp. 98-107
• Relative duality in MacWilliams identity
  L.S. Kazarin, V.M. Sidelnikov, I.B. Gashkov
  Lecture Notes in Computer Science 2643, 2003, pp. 108-118
• Good expander graphs and expander codes: Parameters and decoding
  H. Janwa
  Lecture Notes in Computer Science 2643, 2003, pp. 119-128
• On the covering radius of certain cyclic codes
  Oscar Moreno, Francis N. Castro
  Lecture Notes in Computer Science 2643, 2003, pp. 129-138
• Unitary error bases: Constructions, equivalence, and applications
  Andreas Klappenecker, Martin Rötteler
  Lecture Notes in Computer Science 2643, 2003, pp. 139-149
• Differentially 2-uniform cocycles - The binary case
  K.J. Horadam
  Lecture Notes in Computer Science 2643, 2003, pp. 150-157
• The second and third generalized Hamming weights of algebraic geometry codes
  Domingo Ramirez-Alzola
  Lecture Notes in Computer Science 2643, 2003, pp. 158-168
• Error correcting codes over algebraic surfaces
  Thanasis Bouganis
  Lecture Notes in Computer Science 2643, 2003, pp. 169-179
• A geometric view of decoding AG codes
  Thanasis Bouganis, Drue Coles
  Lecture Notes in Computer Science 2643, 2003, pp. 180-190
• Performance analysis of M-PSK signal constellations in Riemannian varieties
  Rodrigo Gusmão Cavalcante, Reginaldo, Jr. Palazzo
  Lecture Notes in Computer Science 2643, 2003, pp. 191-203
• Improvements to evaluation codes and new characterizations of Arf semigroups
  Maria Bras-Amorós
  Lecture Notes in Computer Science 2643, 2003, pp. 204-215
• Optimal 2-dimensional 3-dispersion lattices
  Moshe Schwartz, Tuvi Etzion
  Lecture Notes in Computer Science 2643, 2003, pp. 216-225
• On g-th MDS codes and matroids
  Keisuke Shiromoto
  Lecture Notes in Computer Science 2643, 2003, pp. 226-234
• On the minimum distance of some families of Z_{2^k}-linear codes
  F. Galand
  Lecture Notes in Computer Science 2643, 2003, pp. 235-243