Cunsheng Ding – författare

This is the unique book on cross-fertilisations between stream ciphers and number theory. It systematically and comprehensively covers known connections between the two areas that are available only in research papers. Some parts of this book consist of new research results that are not available elsewhere. In addition to exercises, over thirty research problems are presented in this book. In this revised edition almost every chapter was updated, and some chapters were completely rewritten. It is useful as a textbook for a graduate course on the subject, as well as a reference book for researchers in related fields.·Unique book on interactions of stream ciphers and number theory. ·Research monograph with many results not available elsewhere. ·A revised edition with the most recent advances in this subject. ·Over thirty research problems for stimulating interactions between the two areas. ·Written by leading researchers in stream ciphers and number theory.

This is the unique book on cross-fertilisations between stream ciphers and number theory. It systematically and comprehensively covers known connections between the two areas that are available only in research papers. Some parts of this book consist of new research results that are not available elsewhere. In addition to exercises, over thirty research problems are presented in this book. In this revised edition almost every chapter was updated, and some chapters were completely rewritten. It is useful as a textbook for a graduate course on the subject, as well as a reference book for researchers in related fields.�Unique book on interactions of stream ciphers and number theory. �Research monograph with many results not available elsewhere. �A revised edition with the most recent advances in this subject. �Over thirty research problems for stimulating interactions between the two areas. �Written by leading researchers in stream ciphers and number theory.

INDOCRYPT 2001, the Second Annual Crypto Conference, is proof of the s- ni?cant amount of enthusiasm generated among Indian as well as International crypto communities. INDOCRYPT 2001 was organized by the Indian Institute of Technology, Madras and the Institute of Mathematical Sciences, also located in Madras (now Chennai). This event was enthusiastically co-sponsored by eAl- traz ConsultingPrivate Ltd, Chennai, Odyssey Technologies Ltd, Chennai, and Shanmuga Arts Science Technology and Research Academy (SASTRA), Th- javur. The Program Committee Co-chair, Prof.C.Pandu Rangan was responsible for local organization and registration. The Program Committee considered 77 papers and selected 31 papers for presentation. These papers were selected on the basis of perceived originality, quality, and relevance to the ?eld of cryptography. The proceedings include the revised version of the accepted papers. Revisions were not checked as to their contents and authors bear full responsibility for the contents of their submissions. The selection of papers is a very challengingand demandingtask. We wish to thank the Program Committee members who did an excellent job in reviewing the submissions in spite of severe time constraints imposed by the tight p- cessingschedule. Each submission was reviewed by at least three referees (only a few by two). The Program Committee was ably assisted by a large number of reviewers in their area of expertise. The list of reviewers has been provided separately. Our thanks go to all of them.

INDOCRYPT 2001, the Second Annual Crypto Conference, is proof of the s- ni?cant amount of enthusiasm generated among Indian as well as International crypto communities. INDOCRYPT 2001 was organized by the Indian Institute of Technology, Madras and the Institute of Mathematical Sciences, also located in Madras (now Chennai). This event was enthusiastically co-sponsored by eAl- traz ConsultingPrivate Ltd, Chennai, Odyssey Technologies Ltd, Chennai, and Shanmuga Arts Science Technology and Research Academy (SASTRA), Th- javur. The Program Committee Co-chair, Prof.C.Pandu Rangan was responsible for local organization and registration. The Program Committee considered 77 papers and selected 31 papers for presentation. These papers were selected on the basis of perceived originality, quality, and relevance to the ?eld of cryptography. The proceedings include the revised version of the accepted papers. Revisions were not checked as to their contents and authors bear full responsibility for the contents of their submissions. The selection of papers is a very challengingand demandingtask. We wish to thank the Program Committee members who did an excellent job in reviewing the submissions in spite of severe time constraints imposed by the tight p- cessingschedule. Each submission was reviewed by at least three referees (only a few by two). The Program Committee was ably assisted by a large number of reviewers in their area of expertise. The list of reviewers has been provided separately. Our thanks go to all of them.

Secure message transmission is of extreme importance intoday's information-based society. Stream encryption is apractically important means to this end. This monograph isdevoted to a new aspect of stream ciphers, namely thestability theory of stream ciphers, with the purpose ofdeveloping bounds on complexity which can form part of thebasis for a general theory of data security and ofstabilizing stream-cipher systems.The approach adopted in this monograph is new. The topic istreated by introducing measure indexes on the security ofstream ciphers, developing lower bounds on these indexes,and establishing connections among them. The treatmentinvolves the stability of boolean functions, the stabilityof linear complexity of key streams, the period stability ofkey streams, and the stability of source codes. Misleadingideas about stream ciphers are exposed and new viewpointspresented.The numerous measure indexes and bounds on them that areintroduced here, the approach based on spectrum techniques,andthe ten open problems presented will all be useful tothe reader concerned with analyzing and designing streamciphers for securing data.

Since the publication of the first edition of this monograph, a generalisation of the Assmus-Mattson theorem for linear codes over finite fields has been developed, two 70-year breakthroughs and a considerable amount of other progress on t-designs from linear codes have been made. This second edition is a substantial revision and expansion of the first edition. Two new chapters and two new appendices have been added, and most chapters of the first edition have been revised.It provides a well-rounded and detailed account of t-designs from linear codes. Most chapters of this book cover the support designs of linear codes. A few chapters deal with designs obtained from linear codes in other ways. Connections among ovals, hyperovals, maximal arcs, ovoids, special functions, linear codes and designs are also investigated. This book consists of both classical and recent results on designs from linear codes.It is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications, or finite geometry. It can also be used as a textbook for postgraduates in these subject areas.Related Link(s)

This monograph aims to provide a well-rounded and detailed account of designs using linear codes. Most chapters of this monograph cover on the designs of linear codes. A few chapters deal with designs obtained from linear codes in other ways. Connections among ovals, hyperovals, maximal arcs, ovoids, linear codes and designs are also investigated. This book consists of both classical results on designs from linear codes and recent results yet published by others.This monograph is intended to be a reference for postgraduates and researchers who work on combinatorics, or coding theory, or digital communications, or finite geometry.