Feng / Xing / Niederreiter | Coding, Cryptography and Combinatorics | Buch | 978-3-7643-2429-2 | sack.de

Buch, Englisch, Band 23, 405 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 1680 g

Reihe: Progress in Computer Science and Applied Logic

Feng / Xing / Niederreiter

Coding, Cryptography and Combinatorics


2004
ISBN: 978-3-7643-2429-2
Verlag: Springer

Buch, Englisch, Band 23, 405 Seiten, Format (B × H): 160 mm x 241 mm, Gewicht: 1680 g

Reihe: Progress in Computer Science and Applied Logic

ISBN: 978-3-7643-2429-2
Verlag: Springer


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. There are also carefully selected contributed papers on many aspects of coding theory, cryptology and combinatorics. 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.

Feng / Xing / Niederreiter Coding, Cryptography and Combinatorics jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.