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.

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.

EUROCRYPT 2001, the 20th annual Eurocrypt conference, was sponsored by the IACR, the International Association for Cryptologic Research, see http://www. iacr. org/, this year in cooperation with the Austrian Computer - ciety (OCG). The General Chair, Reinhard Posch, was responsible for local or- nization, and registration was handled by the IACR Secretariat at the University of California, Santa Barbara. In addition to the papers contained in these proceedings, we were pleased that the conference program also included a presentation by the 2001 IACR d- tinguished lecturer, Andrew Odlyzko, on "Economics and Cryptography" and an invited talk by Silvio Micali, "Zero Knowledge Has Come of Age. " Furthermore, there was the rump session for presentations of recent results and other (p- sibly satirical) topics of interest to the crypto community, which Jean-Jacques Quisquater kindly agreed to run. The Program Committee received 155 submissions and selected 33 papers for presentation; one of them was withdrawn by the authors. The review process was therefore a delicate and challenging task for the committee members, and I wish to thank them for all the e?ort they spent on it. Each committee member was responsible for the review of at least 20 submissions, so each paper was carefully evaluated by at least three reviewers, and submissions with a program committee member as a (co-)author by at least six.

Books on information theory and coding have proliferated over the last few years, but few succeed in covering the fundamentals without losing students in mathematical abstraction. Even fewer build the essential theoretical framework when presenting algorithms and implementation details of modern coding systems.

Without abandoning the theoretical foundations, Fundamentals of Information Theory and Coding Design presents working algorithms and implementations that can be used to design and create real systems. The emphasis is on the underlying concepts governing information theory and the mathematical basis for modern coding systems, but the authors also provide the practical details of important codes like Reed-Solomon, BCH, and Turbo codes. Also setting this text apart are discussions on the cascading of information channels and the additivity of information, the details of arithmetic coding, and the connection between coding of extensions and Markov modelling.

Complete, balanced coverage, an outstanding format, and a wealth of examples and exercises make this an outstanding text for upper-level students in computer science, mathematics, and engineering and a valuable reference for telecommunications engineers and coding theory researchers.

Blockchain is emerging as a powerful technology, which has attracted the wider attention of all businesses across the globe. In addition to financial businesses, IT companies and business organizations are keenly analyzing and adapting this technology for improving business processes. Security is the primary enterprise application. There are other crucial applications that include creating decentralized applications and smart contracts, which are being touted as the key differentiator of this pioneering technology. The power of any technology lies in its ecosystem. Product and tool vendors are building and releasing a variety of versatile and robust toolsets and platforms in order to speed up and simplify blockchain application development, deployment and management. There are other infrastructure-related advancements in order to streamline blockchain adoption. Cloud computing, big data analytics, machine and deep learning algorithm, and connected and embedded devices all are driving blockchain application development and deployment. Blockchain Technology and Applications illustrates how blockchain is being sustained through a host of platforms, programming languages, and enabling tools. It examines: Data confidential, integrity, and authentication Distributed consensus protocols and algorithms Blockchain systems design criteria and systems interoperability and scalability Integration with other technologies including cloud and big data It also details how blockchain is being blended with cloud computing, big data analytics and IoT across all industry verticals. The book gives readers insight into how this path-breaking technology can be a value addition in several business domains ranging from healthcare, financial services, government, supply chain and retail.

"Data Analysis" in the broadest sense is the general term for a field of activities of ever-increasing importance in a time called the information age. It covers new areas with such trendy labels as, e.g., data mining or web mining as well as traditional directions emphazising, e.g., classification or knowledge organization. Leading researchers in data analysis have contributed to this volume and delivered papers on aspects ranging from scientific modeling to practical application. They have devoted their latest contributions to a book edited to honor a colleague and friend, Hans-Hermann Bock, who has been active in this field for nearly thirty years.

This volume represents the refereed proceedings of the Fifth International Conference on Finite Fields and Applications (F q5) held at the University of Augsburg (Germany) from August 2-6, 1999, and hosted by the Department of Mathematics. The conference continued a series of biennial international conferences on finite fields, following earlier conferences at the University of Nevada at Las Vegas (USA) in August 1991 and August 1993, the University ofGlasgow (Scotland) in July 1995, and the University ofWaterloo (Canada) in August 1997. The Organizing Committee of F q5 comprised Thomas Beth (University ofKarlsruhe), Stephen D. Cohen (University of Glasgow), Dieter Jungnickel (University of Augsburg, Chairman), Alfred Menezes (University of Waterloo), Gary L. Mullen (Pennsylvania State University), Ronald C. Mullin (University of Waterloo), Harald Niederreiter (Austrian Academy of Sciences), and Alexander Pott (University of Magdeburg). The program ofthe conference consisted offour full days and one halfday ofsessions, with 11 invited plenary talks andover80contributedtalks that re- quired three parallel sessions. This documents the steadily increasing interest in finite fields and their applications. Finite fields have an inherently fasci- nating structure and they are important tools in discrete mathematics. Their applications range from combinatorial design theory, finite geometries, and algebraic geometry to coding theory, cryptology, and scientific computing. A particularly fruitful aspect is the interplay between theory and applications which has led to many new perspectives in research on finite fields.

Want to kill it at your job interview in the tech industry? Want to win that coding competition? Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. Readers can expect to master 128 algorithms in Python and discover the right way to tackle a problem and quickly implement a solution of low complexity. Classic problems like Dijkstra's shortest path algorithm and Knuth-Morris-Pratt's string matching algorithm are featured alongside lesser known data structures like Fenwick trees and Knuth's dancing links. The book provides a framework to tackle algorithmic problem solving, including: Definition, Complexity, Applications, Algorithm, Key Information, Implementation, Variants, In Practice, and Problems. Python code included in the book and on the companion website.

SAC'99 was the sixth in a series of annual workshops on Selected Areas in Cryptography. Previous workshops were held at Carleton University in Ottawa (1995 and 1997) and at Queen's University in Kingston (1994, 1996, and 1998). The intent of the annual workshop is to provide a relaxed atmosphere in which researchers in cryptography can present and discuss new work on selected areas of current interest. The themes for the SAC'99 workshop were: { Design and Analysis of Symmetric Key Cryptosystems { E cient Implementations of Cryptographic Systems { Cryptographic Solutions for Web/Internet Security The timing of the workshop was particularly fortuitous as the announcement by NIST of the v e nalists for AES coincided with the rst morning of the workshop, precipitating lively discussion on the merits of the selection! A total of 29 papers were submitted to SAC'99 and, after a review process that had all papers reviewed by at least 3 referees, 17 were accepted and p- sented. As well, two invited presentations were given: one by Miles Smid from NIST entitled \From DES to AES: Twenty Years of Government Initiatives in Cryptography"and the other by Mike Reiter from Bell Labs entitled \Password Hardening with Applications to VPN Security". The program committee for SAC'99 consisted of the following members: Carlisle Adams, Tom Cusick, Howard Heys, Lars Knudsen, Henk Meijer, Luke O'Connor, Doug Stinson, Stao rd Tavares, and Serge Vaudenay.

Leading researchers in the field of coding theory and cryptography present their newest findings, published here for the first time following a presentation at the International Conference on Coding Theory, Cryptography and Related Areas. The authors include Tom Hoeholdt, Henning Stichtenoth, and Horacio Tapia-Recillas.

The National Security Agency funded a conference on Coding theory, Cryp- tography, and Number Theory (nick-named Cryptoday) at the United States Naval Academy, on October 25-27, 1998. We were very fortunate to have been able to attract talented mathematicians and cryptographers to the meeting. Unfortunately, some people couldn't make it for either scheduling or funding reasons. Some of these have been invited to contribute a paper anyway. In addition, Prof. William Tutte and Frode Weierud have been kind enough to allow the inclusion of some very interesting unpublished papers of theirs. The papers basically fall into three catagories. Historical papers on cryp- tography done during World War II (Hatch, Hilton, Tutte, Ulfving, and Weierud), mathematical papers on more recent methods in cryptography (Cosgrave, Lomonoco, Wardlaw), and mathematical papers in coding theory (Gao, Joyner, Michael, Shokranian, Shokrollahi). A brief biography of the authors follows. - Peter Hilton is a Distinguished Professor of Mathematics Emeritus at the State University of New York at Binghamton. He worked from 1941 to 1945 in the British cryptanalytic headquarters at Bletchley Park. Profes- sor Hilton has done extensive research in algebraic topology and group theory. - William Tutte is a Distinguished Professor Emeritus and an Adjunct Pro- fessor in the Combinatorics and Optimization Department at the Univer- sity of Waterloo. He worked from 1941 to 1945 in the British cryptana- lytic headquarters at Bletchley Park. Professor Tutte has done extensive research in the field of combinatorics.

Crypto '99, the Nineteenth Annual Crypto Conference, was sponsored by the International Association for Cryptologic Research (IACR), in cooperation with the IEEE Computer Society Technical Committee on Security and Privacy and the Computer Science Department, University of California, Santa Barbara (UCSB). The General Chair, Donald Beaver, was responsible for local organization and registration. The Program Committee considered 167 papers and selected 38 for presentation. This year's conference program also included two invited lectures. I was pleased to include in the program UeliM aurer's presentation "Information Theoretic Cryptography" and Martin Hellman's presentation "The Evolution of Public Key Cryptography." The program also incorporated the traditional Rump Session for informal short presentations of new results, run by Stuart Haber. These proceedings include the revised versions of the 38 papers accepted by the Program Committee. These papers were selected from all the submissions to the conference based on originality, quality, and relevance to the field of cryptology. Revisions were not checked, and the authors bear full responsibility for the contents of their papers.

This book contains selected papers presented at the First NASA International Conference on Quantum Computing and Quantum Communications, QCQC'98, held in Palm Springs, California, USA in February 1998.As the record of the first large-scale meeting entirely devoted to quantum computing and communications, this book is a unique survey of the state-of-the-art in the area. The 43 carefully reviewed papers are organized in topical sections on entanglement and quantum algorithms, quantum cryptography, quantum copying and quantum information theory, quantum error correction and fault-tolerant quantum computing, and embodiments of quantum computers.

"A systematic review of the structure and context of the blockchain-derived economic model... (the book) describes cryptoeconomics in connection with the game theory, behavioral economics and others in simple understandable language."-Wang Feng, founder of Linekong Interactive Group and Mars Finance, partner in Geekbang Venture Capital Blockchain technology has subverted existing perceptions and is the start of an economic revolution, called, cryptoeconomics. Blockchain is a key component of cryptoeconomics. Vlad Zamfir, a developer of Ethereum, defines this term as "a formal discipline that studies protocols that governs the production, distribution, and consumption of goods and services in a decentralized digital economy. Cryptoeconomics is a practical science that focuses on the design and characterization of these protocols". This book explains the structures of blockchain-derived economic models, their history, and their application. It uses real-world cases to illustrate the relationship between cryptoeconomics and blockchain. Blockchain technology solves trust issues. A blockchain application can restrict behavior on the blockchain through a reward and punishment system that enables consensus in an innovative way. The greatest significance of cryptoeconomics lies in guaranteeing safety, stability, activity, and order in a decentralized consensus system. Security and stability are achieved mainly by cryptographical mechanisms. Activity and order are achieved through economic mechanisms. Cryptoeconomics and Blockchain: Ignighting a New Era of Blockchain discusses the most popular consensus algorithms and optimization mechanisms. With examples explained in clear and simple terms that are easy to understand, the book also explores economic mechanisms of blockchain such as game theory and behavioral economics.

In today's workplace, computer and cybersecurity professionals must understand both hardware and software to deploy effective security solutions. This book introduces readers to the fundamentals of computer architecture and organization for security, and provides them with both theoretical and practical solutions to design and implement secure computer systems. Offering an in-depth and innovative introduction to modern computer systems and patent-pending technologies in computer security, the text integrates design considerations with hands-on lessons learned to help practitioners design computer systems that are immune from attacks. Studying computer architecture and organization from a security perspective is a new area. There are many books on computer architectures and many others on computer security. However, books introducing computer architecture and organization with security as the main focus are still rare. This book addresses not only how to secure computer components (CPU, Memory, I/O, and network) but also how to secure data and the computer system as a whole. It also incorporates experiences from the author's recent award-winning teaching and research. The book also introduces the latest technologies, such as trusted computing, RISC-V, QEMU, cache security, virtualization, cloud computing, IoT, and quantum computing, as well as other advanced computing topics into the classroom in order to close the gap in workforce development. The book is chiefly intended for undergraduate and graduate students in computer architecture and computer organization, as well as engineers, researchers, cybersecurity professionals, and middleware designers.

In July 1998, a summer school in cryptology and data security was organized atthecomputersciencedepartmentofAarhusUniversity, Denmark.Thistook place as a part of a series of summer schools organized by the European Edu- tional Forum, an organizationconsisting of the researchcenters TUCS (Finland), IPA(Holland)andBRICS(Denmark, Aarhus).Thelocalorganizingcommittee consisted of Jan Camenisch, Janne Christensen, Ivan Damga? ard (chair), Karen Moller, andLouisSalvail.ThesummerschoolwassupportedbytheEuropean Union. Modern cryptology is an extremely fast growing ?eld and is of fundamental importance in very diverse areas, from theoretical complexity theory to practical electroniccommerceontheInternet.Wethereforesetouttoorganizeaschool that would enable young researchers and students to obtain an overview of some mainareas, coveringboththeoreticalandpracticaltopics.Itisfairtosaythat the school was a success, both in terms of attendance (136 participants from over20countries)andintermsofcontents.Itisapleasuretothankallofthe speakers for their cooperation and the high quality of their presentations. A total of 13 speakers gave talks: Mihir Bellare, University of California, San Diego; Gilles Brassard, University of Montreal; David Chaum, DigiCash; Ronald Cramer, ETH Zur ] ich; Ivan Damg? ard, BRICS; Burt Kaliski, RSA Inc.; Lars Knudsen, Bergen University; Peter Landrock, Cryptomathic; Kevin Mc- Curley, IBM Research, Almaden; Torben Pedersen, Cryptomathic; Bart Preneel, Leuven University; Louis Salvail, BRICS; Stefan Wolf, ETH Zur ] ich.

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equations over finite fields and residue rings. It also contains a number of open problems and proposals for further research. We obtain several lower bounds, exponential in terms of logp, on the de grees and orders of * polynomials; * algebraic functions; * Boolean functions; * linear recurring sequences; coinciding with values of the discrete logarithm modulo a prime p at suf ficiently many points (the number of points can be as small as pI/He). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the right most bit of the discrete logarithm and defines whether the argument is a quadratic residue. We also obtain non-trivial upper bounds on the de gree, sensitivity and Fourier coefficients of Boolean functions on bits of x deciding whether x is a quadratic residue. These results are used to obtain lower bounds on the parallel arithmetic and Boolean complexity of computing the discrete logarithm. For example, we prove that any unbounded fan-in Boolean circuit. of sublogarithmic depth computing the discrete logarithm modulo p must be of superpolynomial size.

Over seven chapters the book shows how international communication has been shaped by the structure of international political power and how these means of global communication have in turn been strategic tools for the exercise of international political power. There are separate chapters on global news flows, the international trade in cultural products (films, books, advertising, recorded music, periodicals and books), and government propaganda activities. The politics of the International Telecommunication Union (ITU), the Universal Postal Union (UPU) and the World Intellectual Property Organisation (WIPO) are analysed.

Focuses mainly on communications and communication standards with emphasis also on risk analysis, ITSEC, EFT and EDI with numerous named viruses described. The dictionary contains extended essays on risk analysis, personal computing, key management, pin management and authentication.

Although the concept of personal data protection began in Europe in the early 1970s, data protection legislation has been adopted in many countries. In Europe there is a wide divergence of policies between members of the EC, non-EC members and the new democracies of Eastern Europe. This volume explains these differences and also, uniquely, focuses on the abuses of personal data in the developing nations of Latin America, Asia and Africa. It also includes the latest national and international laws, initiatives and guidelines on personal data protection. It is the first reference work to combine these various documents in a single volume source.

This volume contains selected and invited papers presented at the International Conference on Computing and Information, ICCI '90, Niagara Falls, Ontario, Canada, May 23-26, 1990. ICCI conferences provide an international forum for presenting new results in research, development and applications in computing and information. Their primary goal is to promote an interchange of ideas and cooperation between practitioners and theorists in the interdisciplinary fields of computing, communication and information theory. The four main topic areas of ICCI '90 are: - Information and coding theory, statistics and probability, - Foundations of computer science, theory of algorithms and programming, - Concurrency, parallelism, communications, networking, computer architecture and VLSI, - Data and software engineering, databases, expert systems, information systems, decision making, and AI methodologies.

Introduction - Risk and Vulnerability in the Financial Sector - The Security Policy - Personnel Security - Physical Security - Security of Computer Operations - Communications Security - Controlling the System - Secure System Development and Maintenance - Logical Access Security - Securing the Customer's Cash - If the Worst Happens: Disaster Recovery and Insurance - Microcomputer Security - Risk Analysis - Managing Security - The Auditor - Security Aspects of Compliance Reviews - Appendices - Glossary: The Language of Security

CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.

The papers in this voluriic were presented at the CHYP'I'O 'SS conf- ence on theory and applications of cryptography, Iicld August 21-2, j. 19SS in Sarita Uarbara, ('alifornia. The conference was sponsored hy the Int- national AssociatioIi for C'ryptologic Research (IAC'R) and hosted by the computer science depart incnt at the llniversity of California at Sarita D- ha ra . 'rile 4-1 papers presented hcrc coniprise: 35 papers selected from 61 - tcwded abstracts subniittctl in response to the call for papcrs, 1 invitcd prv sentations, and 6 papers sclccted from a large niiiii1, cr of informal UIIIJ) sewion present at ionc. The papers wcrc chosen by the program committee on the lja\is of tlic perceived originality, quality and relevance to the field of cryptography of the cxtcndcd allst ract5 suhriiitted. 'I'hc su1, missioris wv riot otlierwise rc.fcrcc(l. a id ofteri rcprescnt prcliininary reports on continuing rcscarc.11. It is a pleasure to tharik many colleagues. Ilarold Iredrickscri sing- made CRJ'PTO '88 a successful realit, y. Eric Dacli, Pad Ijnrret. haridedly Tom Bersori, Gilles Brassard, Ocled Goldreich, Andrew Odlyzko. C'liarles Rackoff arid Ron Rivest did excellerit work on the program comrriittcc in piittirig the technical program together, assisted by kind outsick reviekvers.

This book contains a selection of papers presented at a Symposium on coding theory: "3 Journees sur le Codage," held November 24-26, 1986, in Cachan near Paris, France. It gives an account of the state of the art of research in France on Coding, ranging from rather theoretical topics like algebraic geometry and combinatorial coding to applications like modulation, real-space decoding and implementation of coding algorithms on microcomputers. The symposium was the second one of this type. With its broad spectrum, it was a unique opportunity for contacts between university and industry on the topics of information and coding theory.