Information theory is an exceptional field in many ways. Technically, it is one of the rare fields in which mathematical results and insights have led directly to significant engineering payoffs. Professionally, it is a field that has sustained a remarkable degree of community, collegiality and high standards. James L. Massey, whose work in the field is honored here, embodies the highest standards of the profession in his own career. The book covers the latest work on: block coding, convolutional coding, cryptography, and information theory. The 44 contributions represent a cross-section of the world's leading scholars, scientists and researchers in information theory and communication. The book is rounded off with an index and a bibliography of publications by James Massey.

The idea of this book comes from the observation that sensor networks represent a topic of interest from both theoretical and practical perspectives. The title und- lines that sensor networks offer the unique opportunity of clearly linking theory with practice. In fact, owing to their typical low-cost, academic researchers have the opportunity of implementing sensor network testbeds to check the validity of their theories, algorithms, protocols, etc., in reality. Likewise, a practitioner has the opportunity of understanding what are the principles behind the sensor networks under use and, thus, how to properly tune some accessible network parameters to improve the performance. On the basis of the observations above, the book has been structured in three parts: PartIisdenotedas"Theory,"sincethetopicsofits vechaptersareapparently "detached" from real scenarios; Part II is denoted as "Theory and Practice," since the topics of its three chapters, altough theoretical, have a clear connection with speci c practical scenarios; Part III is denoted as "Practice," since the topics of its ve chapters are clearly related to practical applications.

Cryptography is a field that is constantly advancing, due to exponential growth in new technologies within the past few decades. Applying strategic algorithms to cryptic issues can help save time and energy in solving the expanding problems within this field. Algorithmic Strategies for Solving Complex Problems in Cryptography is an essential reference source that discusses the evolution and current trends in cryptology, and it offers new insight into how to use strategic algorithms to aid in solving intricate difficulties within this domain. Featuring relevant topics such as hash functions, homomorphic encryption schemes, two party computation, and integer factoring, this publication is ideal for academicians, graduate students, engineers, professionals, and researchers interested in expanding their knowledge of current trends and techniques within the cryptology field.

The authors give a detailed summary about the fundamentals and the historical background of digital communication. This includes an overview of the encoding principles and algorithms of textual information, audio information, as well as images, graphics, and video in the Internet. Furthermore the fundamentals of computer networking, digital security and cryptography are covered. Thus, the book provides a well-founded access to communication technology of computer networks, the internet and the WWW. Numerous pictures and images, a subject-index and a detailed list of historical personalities including a glossary for each chapter increase the practical benefit of this book that is well suited as well as for undergraduate students as for working practitioners.

Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research topics in complexity theory are often motivated by questions and problems from cryptology. This book takes account of this situation, and therefore its subject is what may be dubbed "cryptocomplexity'', a kind of symbiosis of these two areas.

This book is written for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve as a valuable source for researchers, teachers, and practitioners working in these fields. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.

This clearly written and enlightening textbook provides a concise, introductory guide to the key mathematical concepts and techniques used by computer scientists. Topics and features: ideal for self-study, offering many pedagogical features such as chapter-opening key topics, chapter introductions and summaries, review questions, and a glossary; places our current state of knowledge within the context of the contributions made by early civilizations, such as the ancient Babylonians, Egyptians and Greeks; examines the building blocks of mathematics, including sets, relations and functions; presents an introduction to logic, formal methods and software engineering; explains the fundamentals of number theory, and its application in cryptography; describes the basics of coding theory, language theory, and graph theory; discusses the concept of computability and decideability; includes concise coverage of calculus, probability and statistics, matrices, complex numbers and quaternions.

Genetic programming (GP), one of the most advanced forms of evolutionary computation, has been highly successful as a technique for getting computers to automatically solve problems without having to tell them explicitly how. Since its inceptions more than ten years ago, GP has been used to solve practical problems in a variety of application fields. Along with this ad-hoc engineering approaches interest increased in how and why GP works. This book provides a coherent consolidation of recent work on the theoretical foundations of GP. A concise introduction to GP and genetic algorithms (GA) is followed by a discussion of fitness landscapes and other theoretical approaches to natural and artificial evolution. Having surveyed early approaches to GP theory it presents new exact schema analysis, showing that it applies to GP as well as to the simpler GAs. New results on the potentially infinite number of possible programs are followed by two chapters applying these new techniques.

This book explores alternative ways of accomplishing secure information transfer with incoherent multi-photon pulses in contrast to conventional Quantum Key Distribution techniques. Most of the techniques presented in this book do not need conventional encryption. Furthermore, the book presents a technique whereby any symmetric key can be securely transferred using the polarization channel of an optical fiber for conventional data encryption. The work presented in this book has largely been practically realized, albeit in a laboratory environment, to offer proof of concept rather than building a rugged instrument that can withstand the rigors of a commercial environment.

This book addresses the issue of Machine Learning (ML) attacks on Integrated Circuits through Physical Unclonable Functions (PUFs). It provides the mathematical proofs of the vulnerability of various PUF families, including Arbiter, XOR Arbiter, ring-oscillator, and bistable ring PUFs, to ML attacks. To achieve this goal, it develops a generic framework for the assessment of these PUFs based on two main approaches. First, with regard to the inherent physical characteristics, it establishes fit-for-purpose mathematical representations of the PUFs mentioned above, which adequately reflect the physical behavior of these primitives. To this end, notions and formalizations that are already familiar to the ML theory world are reintroduced in order to give a better understanding of why, how, and to what extent ML attacks against PUFs can be feasible in practice. Second, the book explores polynomial time ML algorithms, which can learn the PUFs under the appropriate representation. More importantly, in contrast to previous ML approaches, the framework presented here ensures not only the accuracy of the model mimicking the behavior of the PUF, but also the delivery of such a model. Besides off-the-shelf ML algorithms, the book applies a set of algorithms hailing from the field of property testing, which can help to evaluate the security of PUFs. They serve as a "toolbox", from which PUF designers and manufacturers can choose the indicators most relevant for their requirements. Last but not least, on the basis of learning theory concepts, the book explicitly states that the PUF families cannot be considered as an ultimate solution to the problem of insecure ICs. As such, it provides essential insights into both academic research on and the design and manufacturing of PUFs.

Invariant, or coordinate-free methods provide a natural framework for many geometric questions. Invariant Methods in Discrete and Computational Geometry provides a basic introduction to several aspects of invariant theory, including the supersymmetric algebra, the Grassmann-Cayler algebra, and Chow forms. It also presents a number of current research papers on invariant theory and its applications to problems in geometry, such as automated theorem proving and computer vision. Audience: Researchers studying mathematics, computers and robotics.

Foreword by Dieter Jungnickel
Finite Commutative Rings and their Applications answers a need for an introductory reference in finite commutative ring theory as applied to information and communication theory. This book will be of interest to both professional and academic researchers in the fields of communication and coding theory.

The book is a concrete and self-contained introduction to finite commutative local rings, focusing in particular on Galois and Quasi-Galois rings. The reader is provided with an active and concrete approach to the study of the purely algebraic structure and properties of finite commutative rings (in particular, Galois rings) as well as to their applications to coding theory.

Finite Commutative Rings and their Applications is the first to address both theoretical and practical aspects of finite ring theory. The authors provide a practical approach to finite rings through explanatory examples, thereby avoiding an abstract presentation of the subject. The section on Quasi-Galois rings presents new and unpublished results as well. The authors then introduce some applications of finite rings, in particular Galois rings, to coding theory, using a solid algebraic and geometric theoretical background.

This text is suitable for courses in commutative algebra, finite commutative algebra, and coding theory. It is also suitable as a supplementary text for courses in discrete mathematics, finite fields, finite rings, etc.

Recent Advances in RSA Cryptography surveys the most important achievements of the last 22 years of research in RSA cryptography. Special emphasis is laid on the description and analysis of proposed attacks against the RSA cryptosystem. The first chapters introduce the necessary background information on number theory, complexity and public key cryptography. Subsequent chapters review factorization algorithms and specific properties that make RSA attractive for cryptographers. Most recent attacks against RSA are discussed in the third part of the book (among them attacks against low-exponent RSA, Hastad's broadcast attack, and Franklin-Reiter attacks). Finally, the last chapter reviews the use of the RSA function in signature schemes. Recent Advances in RSA Cryptography is of interest to graduate level students and researchers who will gain an insight into current research topics in the field and an overview of recent results in a unified way. Recent Advances in RSA Cryptography is suitable as a secondary text for a graduate level course, and as a reference for researchers and practitioners in industry.

The book is concerned with contemporary methodologies used for automatic text summarization. It proposes interesting approaches to solve well-known problems on text-summarization using computational intelligence (CI) techniques including cognitive approaches. A better understanding of the cognitive basis of the summarization task is still an open research issue, an extent of its use in text summarization is highlighted for further exploration. With the ever-growing text and people on research has little time to spare for extensive reading, where, summarized information helps for a better understanding of the context at a shorter time. This book helps students and researchers to automatically summarize the text documents in an efficient and effective way. The computational approaches and the research techniques presented guides to achieve text summarization at ease. The summarized text generated supports readers to learn the context or the domain at a quicker pace. The book is presented with reasonable amount of illustrations and examples convenient for the readers to understand and implement for their use. The book is not to make readers understand what text summarization is, but for people to perform text summarization using various approaches. This also describes measures that can help to evaluate, determine and explore the best possibilities for text summarization to analyse and use for any specific purpose. The illustration is based on social media and healthcare domain, which shows the possibilities to work with any domain for summarization. The new approach for text summarization based on cognitive intelligence is presented for further exploration in the field.

David Middleton was a towering figure of 20th Century engineering and science and one of the founders of statistical communication theory. During the second World War, the young David Middleton, working with Van Fleck, devised the notion of the matched filter, which is the most basic method used for detecting signals in noise. Over the intervening six decades, the contributions of Middleton have become classics. This collection of essays by leading scientists, engineers and colleagues of David are in his honor and reflect the wide influence that he has had on many fields. Also included is the introduction by Middleton to his forthcoming book, which gives a wonderful view of the field of communication, its history and his own views on the field that he developed over the past 60 years. Focusing on classical noise modeling and applications, Classical, Semi-Classical and Quantum Noise includes coverage of statistical communication theory, non-stationary noise, molecular footprints, noise suppression, Quantum error correction, and other related topics.

The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists.

"Quantum Attacks on Public-Key Cryptosystems" presemts almost allknown quantum computing based attacks on public-key cryptosystems, with an emphasis on quantum algorithms for IFP, DLP, and ECDLP. It also discusses some quantum resistant cryptosystems to replace the IFP, DLP and ECDLP based cryptosystems.

This book is intended to be used either as a graduate text in computing, communications and mathematics, or as a basic reference in the field.

IT changes everyday's life, especially in education and medicine. The goal of ITME 2014 is to further explore the theoretical and practical issues of Ubiquitous Computing Application and Wireless Sensor Network. It also aims to foster new ideas and collaboration between researchers and practitioners. The organizing committee is soliciting unpublished papers for the main conference and its special tracks.

Since humans began writing, they have been communicating in code. This obsession with secrecy has had dramatic effects on the outcome of wars, monarchies and individual lives.

With clear mathematical, linguistic and technological demonstrations of many of the codes, as well as illustrations of some of the remarkable personalities behind them – many courageous, some villainous – The Code Book traces the fascinating development of codes and code-breaking from military espionage in Ancient Greece to modern computer ciphers, to reveal how the remarkable science of cryptography has often changed the course of history.

Amongst many extraordinary examples, Simon Singh relates in detail the story of Mary, Queen of Scots, trapped by her own code and put to death by Elizabeth I; the strange history of the Beale Ciphers, describing the hidden location of a fortune in gold, buried somewhere in Virginia in the nineteenth century and still not found; and the monumental efforts in code-making and code-breaking that influenced the outcomes of the First and Second World Wars.

Now, with the Information Age bringing the possibility of a truly unbreakable code ever nearer, and cryptography one of the major debates of our times, Singh investigates the challenge that technology has brought to personal privacy today.

Dramatic, compelling and remarkably far-reaching, The Code Book will forever alter your view of history, what drives it and how private your last e-mail really was.

The book presents theory and algorithms for secure networked inference in the presence of Byzantines. It derives fundamental limits of networked inference in the presence of Byzantine data and designs robust strategies to ensure reliable performance for several practical network architectures. In particular, it addresses inference (or learning) processes such as detection, estimation or classification, and parallel, hierarchical, and fully decentralized (peer-to-peer) system architectures. Furthermore, it discusses a number of new directions and heuristics to tackle the problem of design complexity in these practical network architectures for inference.

It has long been recognized that there are fascinating connections between cod ing theory, cryptology, and combinatorics. Therefore it seemed desirable to us to organize a conference that brings together experts from these three areas for a fruitful exchange of ideas. We decided on a venue in the Huang Shan (Yellow Mountain) region, one of the most scenic areas of China, so as to provide the additional inducement of an attractive location. The conference was planned for June 2003 with the official title Workshop on Coding, Cryptography and Combi natorics (CCC 2003). Those who are familiar with events in East Asia in the first half of 2003 can guess what happened in the end, namely the conference had to be cancelled in the interest of the health of the participants. The SARS epidemic posed too serious a threat. At the time of the cancellation, the organization of the conference was at an advanced stage: all invited speakers had been selected and all abstracts of contributed talks had been screened by the program committee. Thus, it was de cided to call on all invited speakers and presenters of accepted contributed talks to submit their manuscripts for publication in the present volume. Altogether, 39 submissions were received and subjected to another round of refereeing. After care ful scrutiny, 28 papers were accepted for publication."

This book contains extended and revised versions of the best papers presented at the 17th IFIP WG 10.5/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2009, held in Florian polis, Brazil, in October 2009. The 8 papers included in the book together with two keynote talks were carefully reviewed and selected from 27 papers presented at the conference. The papers cover a wide variety of excellence in VLSI technology and advanced research addressing the current trend toward increasing chip integration and technology process advancements bringing about stimulating new challenges both at the physical and system-design levels, as well as in the test of theses systems.