WCC 2005: Bergen, Norway

• Keisuke Shiromoto:
  Second Support Weights for Binary Self-dual Codes. 1-13
  
• Nina I. Pilipchuk, Ernst M. Gabidulin:
  On Codes Correcting Symmetric Rank Errors. 14-21
  
• Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
  Error and Erasure Correction of Interleaved Reed-Solomon Codes. 22-35
  
• Pierre Loidreau:
  A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes. 36-45
  
• Yves Aubry, Philippe Langevin:
  On the Weights of Binary Irreducible Cyclic Codes. 46-54
  
• Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti:
  3-Designs from Z₄-Goethals-Like Codes and Variants of Cyclotomic Polynomials. 55-68
  
• A. Roger Hammons Jr.:
  Space-Time Code Designs Based on the Generalized Binary Rank Criterion with Applications to Cooperative Diversity. 69-84
  
• Tatsuya Maruta, Kei Okamoto:
  Geometric Conditions for the Extendability of Ternary Linear Codes. 85-99
  
• Olgica Milenkovic, Navin Kashyap:
  On the Design of Codes for DNA Computing. 100-119
  
• Anne Canteaut:
  Open Problems Related to Algebraic Attacks on Stream Ciphers. 120-134
  
• Nina Brandstätter, Tanja Lange, Arne Winterhof:
  On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two. 135-143
  
• Clemens Adelmann, Arne Winterhof:
  Interpolation of Functions Related to the Integer Factoring Problem. 144-154
  
• Takakazu Satoh:
  On Degrees of Polynomial Interpolations Related to Elliptic Curve Cryptography. 155-163
  
• Krystian Matusiewicz, Josef Pieprzyk:
  Finding Good Differential Patterns for Attacks on SHA-1. 164-177
  
• Raphael Overbeck:
  Extending Gibson's Attacks on the GPT Cryptosystem. 178-188
  
• Maffre Samuel:
  Reduction of Conjugacy Problem in Braid Groups, Using Two Garside Structures. 189-201
  
• Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
  A New Key Assignment Scheme for Access Control in a Complete Tree Hierarchy. 202-217
  
• Quan Son Nguyen:
  Multi-Dimensional Hash Chains and Application to Micropayment Schemes. 218-228
  
• Patrick Felke:
  On the Affine Transformations of HFE-Cryptosystems and Systems with Branches. 229-241
  
• Adama Diene, Jintai Ding, Jason E. Gower, Timothy J. Hodges, Zhijun Yin:
  Dimension of the Linearization Equations of the Matsumoto-Imai Cryptosystems. 242-251
  
• Damien Vergnaud:
  RSA-Based Secret Handshakes. 252-274
  
• Ventzislav Nikov, Svetla Nikova:
  On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes. 275-290
  
• Lihua Wang, Eiji Okamoto, Ying Miao, Takeshi Okamoto, Hiroshi Doi:
  ID-Based Series-Parallel Multisignature Schemes for Multi-Messages from Bilinear Maps. 291-303
  
• Cédric Faure, Pierre Loidreau:
  A New Public-Key Cryptosystem Based on the Problem of Reconstructing p-Polynomials. 304-315
  
• Françoise Levy-dit-Vehel, Ludovic Perret:
  On the Wagner-Magyarik Cryptosystem. 316-329
  
• Kai-Uwe Schmidt, Adolf Finger:
  Constructions of Complementary Sequences for Power-Controlled OFDM Transmission. 330-345
  
• Xiangyong Zeng, Lei Hu, Qingchong Liu:
  A Novel Method for Constructing Almost Perfect Polyphase Sequences. 346-353
  
• Berndt M. Gammel, Rainer Göttfert:
  Linear Filtering of Nonlinear Shift-Register Sequences. 354-370
  
• Nam Yul Yu, Guang Gong:
  Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation. 371-385
  
• Yun-Pyo Hong, Hong-Yeop Song:
  Frequency/Time Hopping Sequences with Large Linear Complexities. 386-396
  
• Constanza Riera, Matthew G. Parker:
  One and Two-Variable Interlace Polynomials: A Spectral Interpretation. 397-411
  
• San Ling, Ferruh Özbudak:
  Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights. 412-426
  
• Ruben G. Lobo, Donald L. Bitzer, Mladen A. Vouk:
  Locally Invertible Multivariate Polynomial Matrices. 427-441