This book contains papers based on the fourteen lectures presented at the NATO Advanced Study Institute "Information Security and Related Combinatorics", held in Opatija, Croatia, May 31 - June 11, 2010. The conference was widely attended by students and junior scientists from throughout Europe and the USA. The theme addressed by these papers is combinatorial mathematics, as used in applications related to information security, cryptography and coding theory. Together they cover several topics subject to current research in the field. The volume will be of interest to mathematicians, computer scientists and engineers working in the area of digital communications, as well as to researchers and graduate students wishing to learn more about the application of combinatorial mathematics. The tutorial style of the papers makes the book particularly suitable for use as an additional text for a course in discrete mathematics or applied combinatorics. It would similarly be of value for graduate courses in applied combinatorics with a focus on coding theory and cryptography.IOS Press is an international science, technical and medical publisher of high-quality books for academics, scientists, and professionals in all fields. Some of the areas we publish in: -Biomedicine -Oncology -Artificial intelligence -Databases and information systems -Maritime engineering -Nanotechnology -Geoengineering -All aspects of physics -E-governance -E-commerce -The knowledge economy -Urban studies -Arms control -Understanding and responding to terrorism -Medical informatics -Computer Sciences
Author(s): D. Crnkovic, V. Tonchev
Series: NATO Science for Peace and Security Series 29
Publisher: IOS Press
Year: 2011
Language: English
Pages: 460
Tags: Информатика и вычислительная техника;Информационная безопасность;Криптология и криптография;Материалы конференций;
Title......Page 1
Preface......Page 5
Contents......Page 7
Crypto applications of combinatorialgroup theory......Page 9
Generating rooted trees of m nodes uniformly at random......Page 25
On Jacobsthal Binary Sequences......Page 35
Applications of finite geometry in coding theory and cryptography......Page 46
The arithmetic of genus two curves......Page 67
Covering arrays and hash families......Page 107
Sequences and arrays with desirable correlation properties......Page 144
Permutation decoding for codes from designs, finite geometries and graphs......Page 180
Finite Groups, Designs and Codes......Page 210
Designs, strongly regular graphs and codes constructed from some primitive groups......Page 239
Matrices for graphs, designs and codes......Page 261
Finding error-correcting codes using computers......Page 286
Quantum jump codes and related combinatorial designs......Page 293
Unbiased Hadamard matrices and bases......Page 320
Multi-structured designs and their applications......Page 334
Recent results on families of symmetric designs and non-embeddable quasi-residual designs......Page 371
Codes and modules associated with designs and t-uniform hypergraphs......Page 412
Finite geometry designs, codes, and Hamada’s conjecture......Page 445
Subject Index......Page 457
Author Index......Page 459
