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

• On bent and highly nonlinear balanced/resilient functions and their algebraic immunities
  Claude Carlet
  Lecture Notes in Computer Science 3857, 2006, pp. 1-28
• On generalized parity checks
  Robert J. McEliece, Edwin Soedarmadji
  Lecture Notes in Computer Science 3857, 2006, pp. 29-34
• Cryptography based on bilinear maps
  Tatsuaki Okamoto
  Lecture Notes in Computer Science 3857, 2006, pp. 35-50
• The merit factor problem for binary sequences
  Tom Hholdt
  Lecture Notes in Computer Science 3857, 2006, pp. 51-59
• Quantum period reconstruction of binary sequences
  Florina Piroi, Arne Winterhof
  Lecture Notes in Computer Science 3857, 2006, pp. 60-67
• The vector key equation and multisequence shift register synthesis
  Li-Ping Wang
  Lecture Notes in Computer Science 3857, 2006, pp. 68-75
• A general framework for applying FGLM techniques to linear codes
  M. Borges-Quintana, M.A. Borges-Trenard, E. Martínez-Moro
  Lecture Notes in Computer Science 3857, 2006, pp. 76-86
• A theory of highly nonlinear functions
  K.J. Horadam
  Lecture Notes in Computer Science 3857, 2006, pp. 87-100
• The solutions of the third power sum equation for Niho type decimations
  Kalle Ranto, Petri Rosendahl
  Lecture Notes in Computer Science 3857, 2006, pp. 101-107
• On constructing AG codes without basis functions for Riemann-Roch spaces
  Drue Coles
  Lecture Notes in Computer Science 3857, 2006, pp. 108-117
• Computing Gröbner bases for vanishing ideals of finite sets of points
  Jeffrey B. Farr, Shuhong Gao
  Lecture Notes in Computer Science 3857, 2006, pp. 118-127
• A class of fermat curves for which Weil-Serre's bound can be improved
  Francis N. Castro, Ernesto Gomez, Oscar Moreno
  Lecture Notes in Computer Science 3857, 2006, pp. 128-135
• Nonbinary quantum codes from Hermitian curves
  Pradeep Kiran Sarvepalli, Andreas Klappenecker
  Lecture Notes in Computer Science 3857, 2006, pp. 136-143
• A genetic algorithm for cocyclic Hadamard matrices
  V. Álvarez, J.A. Armario, M.D. Frau, P. Real
  Lecture Notes in Computer Science 3857, 2006, pp. 144-153
• Unconditionally secure chaffing-and-winnowing: A relationship between encryption and authentication
  Goichiro Hanaoka, Yumiko Hanaoka, Manabu Hagiwara, Hajime Watanabe, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 154-162
• A fast calculus for the linearizing attack and its application to an attack on KASUMI
  Nobuyuki Sugio, Shunichi Nambu, Toshinobu Kaneko
  Lecture Notes in Computer Science 3857, 2006, pp. 163-172
• On achieving chosen ciphertext security with decryption errors
  Yang Cui, Kazukuni Kobara, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 173-182
• Applying Fujisaki-Okamoto to identity-based encryption
  Peng Yang, Takashi Kitagawa, Goichiro Hanaoka, Rui Zhang, Kanta Matsuura, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 183-192
• A short random fingerprinting code against a small number of pirates
  Manabu Hagiwara, Goichiro Hanaoka, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 193-202
• A general formulation of algebraic and fast correlation attacks based on dedicated sample decimation
  Miodrag J. Mihaljević, Marc P.C. Fossorier, Hideki Imai
  Lecture Notes in Computer Science 3857, 2006, pp. 203-214
• Traitor tracing against powerful attacks using combinatorial designs
  Simon McNicol, Serdar Boztaş, Asha Rao
  Lecture Notes in Computer Science 3857, 2006, pp. 215-224
• New bounds on the capacity of multi-dimensional RLL-constrained systems
  Moshe Schwartz, Alexander Vardy
  Lecture Notes in Computer Science 3857, 2006, pp. 225-234
• LDPC codes for fading channels: Two strategies
  Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Collins
  Lecture Notes in Computer Science 3857, 2006, pp. 235-244
• Low-floor Tanner codes via Hamming-Node or RSCC-node doping
  Shadi Abu-Surra, Gianluigi Liva, William E. Ryan
  Lecture Notes in Computer Science 3857, 2006, pp. 245-254
• Algebraic constructions of quasi-cyclic LDPC codes - Part I: For AWGN and binary random erasure channels
  Lan Lan, Lingqi Zeng, Ying Y. Tai, Lei Chen, Shu Lin, Khaled Abdel-Ghaffar
  Lecture Notes in Computer Science 3857, 2006, pp. 255-264