"Published in cooperation with NATO Emerging Security Challenges Division"--T.p.

This volume contains the proceedings of the International Conference on Group Theory, Combinatorics and Computing held from October 3-8, 2012, in Boca Raton, Florida. The papers cover a number of areas in group theory and combinatorics. Topics include finite simple groups, groups acting on structured sets, varieties of algebras, classification of groups generated by 3-state automata over a 2-letter alphabet, new methods for construction of codes and designs, groups with constraints on the derived subgroups of its subgroups, graphs related to conjugacy classes in groups, and lexicographical configurations. Application of computer algebra programs is incorporated in several of the papers. This volume includes expository articles on finite coverings of loops, semigroups and groups, and on the application of algebraic structures in the theory of communications. This volume is a valuable resource for researchers and graduate students working in group theory and combinatorics. The articles provide excellent examples of the interplay between the two areas.

The inaugural research program of the Institute for Mathematical Sciences at the National University of Singapore took place from July to December 2001 and was devoted to coding theory and cryptology. As part of the program, tutorials for graduate students and junior researchers were given by world-renowned scholars. These tutorials covered fundamental aspects of coding theory and cryptology and were designed to prepare for original research in these areas. The present volume collects the expanded lecture notes of these tutorials. The topics range from mathematical areas such as computational number theory, exponential sums and algebraic function fields through coding-theory subjects such as extremal problems, quantum error-correcting codes and algebraic-geometry codes to cryptologic subjects such as stream ciphers, public-key infrastructures, key management, authentication schemes and distributed system security.

Combinatorial Designs for Authentication and Secrecy Codes is a succinct in-depth review and tutorial of a subject that promises to lead to major advances in computer and communication security. This monograph provides a tutorial on combinatorial designs, which gives an overview of the theory. Furthermore, the application of combinatorial designs to authentication and secrecy codes is described in depth. This close relationship of designs with cryptography and information security was first revealed in Shannon's seminal paper on secrecy systems. We bring together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes.

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research

This book constitutes the proceedings of the 14th IMA International Conference on Cryptography and Coding, IMACC 2013, held at Oxford, UK, in December 2013. The 20 papers presented were carefully reviewed and selected for inclusion in this book. They are organized in topical sections named: bits and booleans; homomorphic encryption; codes and applications; cryptanalysis; protecting against leakage; hash functions; key issues and public key primitives.

Advances in discrete mathematics are presented in this book with applications in theoretical mathematics and interdisciplinary research. Each chapter presents new methods and techniques by leading experts. Unifying interdisciplinary applications, problems, and approaches of discrete mathematics, this book connects topics in graph theory, combinatorics, number theory, cryptography, dynamical systems, finance, optimization, and game theory. Graduate students and researchers in optimization, mathematics, computer science, economics, and physics will find the wide range of interdisciplinary topics, methods, and applications covered in this book engaging and useful.