Coding, Cryptography and Combinatorics
Springer Basel (Verlag)
978-3-0348-9602-3 (ISBN)
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.
Erscheint lt. Verlag | 21.11.2012 |
---|---|
Reihe/Serie | Progress in Computer Science and Applied Logic |
Zusatzinfo | VIII, 405 p. |
Verlagsort | Basel |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 632 g |
Themenwelt | Informatik ► Theorie / Studium ► Kryptologie |
Schlagworte | algorithms • coding theory • combinatorics • Complexity • Cryptology • DES • finite field • Information • Information Theory |
ISBN-10 | 3-0348-9602-6 / 3034896026 |
ISBN-13 | 978-3-0348-9602-3 / 9783034896023 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich