Harald Niederreiter's pioneering research in the field of applied algebra and number theory has led to important and substantial breakthroughs in many areas. This collection of survey articles has been authored by close colleagues and leading experts to mark the occasion of his 70th birthday. The book provides a modern overview of different research areas, covering uniform distribution and quasi-Monte Carlo methods as well as finite fields and their applications, in particular, cryptography and pseudorandom number generation. Many results are published here for the first time. The book serves as a useful starting point for graduate students new to these areas or as a refresher for researchers wanting to follow recent trends.
Experiment with cryptography — the science of secret writing. Cipher and decipher codes: transposition and polyalphabetical ciphers, famous codes, typewriter and telephone codes, codes that use
Protocols for authentication and key establishment are the foundation for security of communications. The range and diversity of these protocols is immense, while the properties and vulnerabilities of
In this book the author introduces a novel approach to securing exam systems. He provides an in-depth understanding, useful for studying the security of exams and similar systems, such as public tende
This book provides a survey on different kinds of Feistel ciphers, with their definitions and mathematical/computational properties. Feistel ciphers are widely used in cryptography in order to obtain
Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors develop and compare alternative algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings. Various finite precision number systems are investigated, with the focus on comparative analysis of practically efficient algorithms for closed arithmetic operations over these systems. Each chapter begins with an introduction to its contents and ends with bibliographic notes and an extensive bibliography. The book may also be used for grad
This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.
This well-balanced text touches on theoretical and applied aspects of protecting digital data. The reader is provided with the basic theory and is then shown deeper fascinating detail, including the current state of the art. Readers will soon become familiar with methods of protecting digital data while it is transmitted, as well as while the data is being stored. Both basic and advanced error-correcting codes are introduced together with numerous results on their parameters and properties. The authors explain how to apply these codes to symmetric and public key cryptosystems and secret sharing. Interesting approaches based on polynomial systems solving are applied to cryptography and decoding codes. Computer algebra systems are also used to provide an understanding of how objects introduced in the book are constructed, and how their properties can be examined. This book is designed for Masters-level students studying mathematics, computer science, electrical engineering or physics.
A concise, "no-frills" introduction to quantum computation and quantum cryptography for non-experts. Rather than concentrating on stories about scientists and philosophical concepts, Quantum Bits and
This is the first self-contained text to consider security and non-cooperative behavior in wireless networks. Major networking trends are analyzed and their implications explained in terms of security and cooperation, and potential malicious and selfish misdeeds are described along with the existing and future security techniques. Fundamental questions of security including user and device identification; establishment of security association; secure and cooperative routing in multi-hop networks; fair bandwidth distribution; and privacy protection are approached from a theoretical perspective and supported by real-world examples including ad hoc, mesh, vehicular, sensor, and RFID networks. Important relationships between trust, security, and cooperation are also discussed. Contains homework problems and tutorials on cryptography and game theory. This text is suitable for advanced undergraduates and graduate students of electrical engineering and computer science, and researchers and pr
Cypherpunks are activists who advocate the widespread use of strong cryptography (writing in code) as a route to progressive change. Julian Assange, the editor-in-chief of and visionary behind WikiLea
The science of cryptology is made up of two halves. Cryptography is the study of how to create secure systems for communications. Cryptanalysis is the study of how to break those systems. The conflict
Obtain better system performance, lower energy consumption, and avoid hand-coding arithmetic functions with this concise guide to automated optimization techniques for hardware and software design. High-level compiler optimizations and high-speed architectures for implementing FIR filters are covered, which can improve performance in communications, signal processing, computer graphics, and cryptography. Clearly explained algorithms and illustrative examples throughout make it easy to understand the techniques and write software for their implementation. Background information on the synthesis of arithmetic expressions and computer arithmetic is also included, making the book ideal for newcomers to the subject. This is an invaluable resource for researchers, professionals, and graduate students working in system level design and automation, compilers, and VLSI CAD.
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasizes algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The presentation alternates between theory and applications in order to motivate and illustrate the mathematics. The mathematical coverage includes the basics of number theory, abstract algebra and discrete probability theory. This edition now includes over 150 new exercises, ranging from the routine to the challenging, that flesh out the material presented in the body of the text, and which further develop the theory and present new applications. The material has also been reorganized to improve clarity of exposition and presentation. Ideal as a textbook for introductory courses in number theory and algebra, especially those geared t
Cryptology: Classical and Modern, Second Edition proficiently introduces readers to the fascinating field of cryptology. The book covers classical methods including substitution, transposition, Playfa
Alan Turing (1912–1954) made seminal contributions to mathematical logic, computation, computer science, artificial intelligence, cryptography and theoretical biology. In this volume, outstanding scientific thinkers take a fresh look at the great range of Turing's contributions, on how the subjects have developed since his time, and how they might develop still further. The contributors include Martin Davis, J. M. E. Hyland, Andrew R. Booker, Ueli Maurer, Kanti V. Mardia, S. Barry Cooper, Stephen Wolfram, Christof Teuscher, Douglas Richard Hofstadter, Philip K. Maini, Thomas E. Woolley, Eamonn A. Gaffney, Ruth E. Baker, Richard Gordon, Stuart Kauffman, Scott Aaronson, Solomon Feferman, P. D. Welch and Roger Penrose. These specially commissioned essays will provoke and engross the reader who wishes to understand better the lasting significance of one of the twentieth century's deepest thinkers.
The theme of this book is the study of the distribution of integer powers modulo a prime number. It provides numerous new, sometimes quite unexpected, links between number theory and computer science as well as to other areas of mathematics. Possible applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory. The main method discussed is based on bounds of exponential sums. Accordingly, the book contains many estimates of such sums, including new estimates of classical Gaussian sums. It also contains many open questions and proposals for further research.
