Coding, cryptography and combinatorics

Keqin Feng, Harald Niederreiter, Chaoping Xing - Collection Progress in computer science and applied logic

406 pages, parution le 09/07/2004

Ajouter à une liste

Indisponible

Résumé

This book contains a selection of papers submitted to the Workshop on Coding, Cryptography and Combinatorics (CCC 2003). An important feature of the book are invited surveys on key topics such as Boolean functions in cryptology, correlation attacks on LFSR sequences, decoding algorithms for linear codes, LDPC codes, and towers of function fields. There are also carefully selected contributed papers on many aspects of coding theory, cryptology and combinatorics, including new constructions of codes, decoding algorithms, coding bounds, digital nets, crypt-analysis of cryptosystems and other cryptographic schemes, linear complexity of sequences, cross-correlation of sequences, authentication codes, fast arithmetic for cryptosystems, capacity regions, and combinatorial tableaux.

The reader will be informed about current research in these very active areas. The book is of interest for postgraduate students and researchers in mathematics, computer science, information theory and electrical engineering.

Sommaire

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 fc-Error Linear Complexity for p Periodic Sequences .
HFE and BDDs: A Practical Attempt at Cryptanalysis
Digital Nets and Coding Theory
Constructive Asymptotic Codes with an Improvement on the Tsfasman-Vladu^-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 Suitable Moduli
Security Analysis of Three Oblivious Transfer Protocols
An Improved Identification Scheme

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Birkhäuser
Auteur(s)	Keqin Feng, Harald Niederreiter, Chaoping Xing
Collection	Progress in computer science and applied logic
Parution	09/07/2004
Nb. de pages	406
Format	16 x 24
Couverture	Relié
Poids	845g
Intérieur	Noir et Blanc
EAN13	9783764324292