It has long been recognized that there are fascinating connections between cod ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi natorics (CCC 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume. Altogether, 39 submissions were received and subjected to another round of refereeing. After care ful scrutiny, 28 papers were accepted for publication.
Author(s): Keqin Feng, Harald Niederreiter, Chaoping Xing (eds.)
Series: Progress in Computer Science and Applied Logic 23
Publisher: Birkhäuser Basel
Year: 2004
Language: English
Pages: 405
Tags: Coding and Information Theory; Data Structures, Cryptology and Information Theory; Combinatorics
Front Matter....Pages i-viii
Front Matter....Pages 1-1
On the Secondary Constructions of Resilient and Bent Functions....Pages 3-28
Adaptive Recursive MLD Algorithm Based on Parallel Concatenation Decomposition for Binary Linear Codes....Pages 29-50
Modularity of Asymptotically Optimal Towers of Function Fields....Pages 51-65
A New Correlation Attack on LFSR Sequences with High Error Tolerance....Pages 67-83
LDPC Codes: An Introduction....Pages 85-110
Front Matter....Pages 111-111
The New Implementation Schemes of the TTM Cryptosystem Are Not Secure....Pages 113-127
The Capacity Region of Broadcast Networks with Two Receivers....Pages 129-137
Constructions of Nonbinary Codes Correcting t -Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion....Pages 139-152
On the Propagation Criterion of Boolean Functions....Pages 153-168
On Certain Equations over Finite Fields and Cross-Correlations of m-Sequences....Pages 169-176
A Polly Cracker System Based on Satisfiability....Pages 177-192
Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequences....Pages 193-208
New Constructions of Constant-Weight Codes....Pages 209-222
Good Self-Dual Quasi-Cyclic Codes over F q , q Odd....Pages 223-226
Linear Complexity and k -Error Linear Complexity for p n -Periodic Sequences....Pages 227-235
HFE and BDDs: A Practical Attempt at Cryptanalysis....Pages 237-246
Digital Nets and Coding Theory....Pages 247-257
Constructive Asymptotic Codes with an Improvement on the Tsfasman-Vlăduţ-Zink and Xing Bounds....Pages 259-275
Malleability Attacks on Multi-Party Key Agreement Protocols....Pages 277-288
Combinatorial Tableaux in Isoperimetry....Pages 289-301
Front Matter....Pages 111-111
On the Error Exponents of Reliability-Order-Based Decoding Algorithms for Linear Block Codes....Pages 303-317
A Construction of Authentication Codes with Secrecy....Pages 319-330
Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm....Pages 331-343
Deletion Correcting Using Generalized Reed-Solomon Codes....Pages 345-358
A Note on the Linear Complexity Profile of the Discrete Logarithm in Finite Fields....Pages 359-367
Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli....Pages 369-383
Security Analysis of Three Oblivious Transfer Protocols....Pages 385-396
An Improved Identification Scheme....Pages 397-405
