---

＜電子ブック＞
Coding, Cryptography and Combinatorics / edited by Keqin Feng, Harald Niederreiter, Chaoping Xing
(Progress in Computer Science and Applied Logic. ISSN:22970584 ; 23)

版	1st ed. 2004.
出版者	(Basel : Birkhäuser Basel : Imprint: Birkhäuser)
出版年	2004
本文言語	英語
大きさ	VIII, 405 p : online resource
著者標目	Feng, Keqin editor Niederreiter, Harald editor Xing, Chaoping editor SpringerLink (Online service)
件　名	LCSH:Coding theory LCSH:Information theory LCSH:Data structures (Computer science) LCSH:Discrete mathematics FREE:Coding and Information Theory FREE:Data Structures and Information Theory FREE:Discrete Mathematics
一般注記	On the Secondary Constructions of Resilient and Bent Functions -- Adaptive Recursive MLD Algorithm Based on Parallel Concatenation Decomposition for Binary Linear Codes -- Modularity of Asymptotically Optimal Towers of Function Fields -- A New Correlation Attack on LFSR Sequences with High Error Tolerance -- LDPC Codes: An Introduction -- The New Implementation Schemes of the TTM Cryptosystem Are Not Secure -- The Capacity Region of Broadcast Networks with Two Receivers -- Constructions of Nonbinary Codes Correcting t- Symmetric Errors and Detecting All Unidirectional Errors: Magnitude Error Criterion -- On the Propagation Criterion of Boolean Functions -- On Certain Equations over Finite Fields and Cross-Correlations of m-Sequences -- A Polly Cracker System Based on Satisfiability -- Combinatorially Designed LDPC Codes Using Zech Logarithms and Congruential Sequences -- New Constructions of Constant-Weight Codes -- Good Self-Dual Quasi-Cyclic Codes over Fq, q Odd -- Linear Complexity and k-Error Linear Complexity for pn-Periodic Sequences -- HFE and BDDs: A Practical Attempt at Cryptanalysis -- Digital Nets and Coding Theory -- Constructive Asymptotic Codes with an Improvement on the Tsfasman-Vlá,dut-Zink and Xing Bounds -- Malleability Attacks on Multi-Party Key Agreement Protocols -- Combinatorial Tableaux in Isoperimetry -- On the Error Exponents of Reliability-Order-Based Decoding Algorithms for Linear Block Codes -- A Construction of Authentication Codes with Secrecy -- Selection Method of Test Patterns in Soft-Input and Output Iterative Bounded Distance Decoding Algorithm -- Deletion Correcting Using Generalised Reed-Solomon Codes -- A Note on the Linear Complexity Profile of the Discrete Logarithm in Finite Fields -- Speeding Up RSA and Elliptic Curve Systems by Choosing SuitableModuli -- Security Analysis of Three Oblivious Transfer Protocols -- An Improved Identification Scheme 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 HTTP:URL=https://doi.org/10.1007/978-3-0348-7865-4

 類似資料