Mathematics

This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice. Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved. Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his or her background in computer science or engineering. Algebra for Cryptologists is a textbook for an introductory course in cryptography or an upper undergraduate course in algebra, or for self-study in preparation for postgraduate study in cryptology.

This book develops a naturalistic aesthetic theory that accounts for aesthetic phenomena in mathematics in the same terms as it accounts for more traditional aesthetic phenomena. Building upon a view advanced by James McAllister, the assertion is that beauty in science does not confine itself to anecdotes or personal idiosyncrasies, but rather that it had played a role in shaping the development of science. Mathematicians often evaluate certain pieces of mathematics using words like beautiful, elegant, or even ugly. Such evaluations are prevalent, however, rigorous investigation of them, of mathematical beauty, is much less common. The volume integrates the basic elements of aesthetics, as it has been developed over the last 200 years, with recent findings in neuropsychology as well as a good knowledge of mathematics. The volume begins with a discussion of the reasons to interpret mathematical beauty in a literal or non-literal fashion, which also serves to survey historical and contemporary approaches to mathematical beauty. The author concludes that literal approaches are much more coherent and fruitful, however, much is yet to be done. In this respect two chapters are devoted to the revision and improvement of McAllister's theory of the role of beauty in science. These antecedents are used as a foundation to formulate a naturalistic aesthetic theory. The central idea of the theory is that aesthetic phenomena should be seen as constituting a complex dynamical system which the author calls the aesthetic as process theory. The theory comprises explications of three central topics: aesthetic experience (in mathematics), aesthetic value and aesthetic judgment. The theory is applied in the final part of the volume and is used to account for the three most salient and often used aesthetic terms often used in mathematics: beautiful, elegant and ugly. This application of the theory serves to illustrate the theory in action, but also to further discuss and develop some details and to showcase the theory's explanatory capabilities.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory--the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field's insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography