Proceedings of the First International Workshop on Coding and Cryptology, Wuyi Mountain, Fujian, China 11-15 June 2007 / editors, Yongqing Li ... [et al.].

Format:

Book

Conference/Event

Author/Creator:

International Workshop on Coding and Cryptology, Corporate Author.

Contributor:

Li, Yongqing.

Conference Name:

International Workshop on Coding and Cryptology (1st : 2007 : Wuyi Mountain, China)

International Workshop on Coding and Cryptology

Series:

Series on coding theory and cryptology ; 4.

Series on coding theory and cryptology ; v. 4

Language:

English

Subjects (All):

Coding theory--Congresses.

Coding theory.

Cryptography--Congresses.

Cryptography.

Number theory--Congresses.

Number theory.

Computer security--Congresses.

Computer security.

Physical Description:

1 online resource (288 p.)

Edition:

1st ed.

Place of Publication:

New Jersey : World Scientific, c2008.

Language Note:

English

Summary:

Over the past years, the rapid growth of the Internet and World Wide Web has provided great opportunities for online commercial activities, business transactions and government services over open computer and communication networks. However, such developments are only possible if communications can be conducted in a secure and reliable manner. The mathematical theory and practice of coding theory and cryptology underpin the provision of effective security and reliability for data communication, processing and storage. Theoretical and practical advances in these fields are therefore a key facto

Contents:

Preface; Organizing Committees; CONTENTS; Fuzzy Identity-based Encryption: New and Efficient Schemes J. Baek, W. Susilo and J. Zhou; 1. Introduction; 2. Preliminaries; 3. Proposed Fuzzy IBE Schemes; 4. Comparisons; 5. Concluding Remarks; References; A Functional View of Upper Bounds on Codes A. Barg and D. Nogin; 1. Introduction; 2. Functional approach; 2.1. Notation.; 2.2. Construction of polynomials.; 2.2.1. The MRRW polynomial.; 2.2.2. Levenshtein polynomials, n = 2k + 1:; 2.2.3. Levenshtein polynomials, n = 2k + 2:; 3. Spectral method; References

A Method of Construction of Balanced Functions with Optimum Algebraic Immunity C. Carlet1. Introduction; 2. Preliminaries; 3. The general method; 4. Constructing functions with optimum algebraic immunity; 5. Study of the Walsh transforms of the constructed functions and their nonlinearity; 6. Constructing functions with optimum algebraic immunity, in odd numbers of variables; References; Enumeration of a Class of Sequences Generated by Inversions A. C e seml_io glu, W. Meidl and A. Topuzo glu; 1. Introduction; 2. Preliminaries; 3. Proofs of Theorems 1.1 and 1.2; 4. Remarks; References

A Critical Look at Cryptographic Hash Function Literature S. Contini, R. Steinfeld, J. Pieprzyk and K. Matusiewicz1. Introduction; 2. A Brief History of Cryptographic Hashing; 2.1. Definitions of Hash Functions; 2.2. Random Oracles; 2.3. Other Requirements for Hash Functions; 2.4. Summary; 3. Ordinary Hash Functions Versus Hash Function Families; 3.1. Ordinary Hash Functions; 3.1.1. Definitions and Implications of Security Properties; 3.2. Hash Functions Families; 4. What to Do about all the Cryptographic Hash Function Definitions?; 5. Moving Forward; 6. Conclusion; References; Appendix A.

7. Security Requirement De nitionsScalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects Y. M. Chee and C. J. Colbourn; 1. Introduction; 2. Testing Under a Generalized MAF Model; 3. Optimal Crosstalk Test Arrays; 4. Implementation; 4.1. Testing Data Buses; 4.2. Testing Address Buses; 5. Significance; 6. Conclusion; Acknowledgments; References; An Improved Distinguisher for Dragon J. Y. Cho and J. Pieprzyk; 1. Introduction; 2. A brief description of Dragon; 3. A linear distinguisher for Dragon; 3.1. Approximations of functions G and H

3.1.1. Approximations of the function H3.1.2. Approximations of the function G; 3.2. Linear approximations of modular addition; 3.3. Linear approximation of the function F; 3.3.1. The approximation of a0; 3.3.2. The approximation of e0; 3.4. Building the distinguisher; 3.5. Our results; 4. Improving the distinguisher; 4.1. Experiments; 5. Conclusion; Acknowledgment; References; Appendix A. Proof of Theorem 3.1; Appendix B. Proof of Corollary 3.1; Appendix C. Proof of Lemma 4.1; Constructing Perfect Hash Families Using a Greedy Algorithm C. J. Colbourn; 1. Introduction

2. Density and a Greedy Algorithm

Notes:

Description based upon print version of record.

Includes bibliographical references and index.

ISBN:

9789812832245

9812832246

OCLC:

835162259