Bøker av Gerhard Rosenberger

Fundamentals of mathematics are presented in the two-volume set in an exciting and pedagogically sound way. The present volume examines the most important basic results in geometry and discrete mathematics, along with their proofs, and also their history. New: A chapter on discrete Morse theory and still more graph theory for solving further classical problems as the Travelling Salesman and Postman problem.

The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts with a general chapter on algebraic structures; this part provides all the necessary knowledge for the rest of the book. The next chapter gives a concise overview of cryptography. Chapter 3 on number theoretic algorithms is important for developping cryptosystems, Chapter 4 presents the deterministic primality test of Agrawal, Kayal, and Saxena. The account to elliptic curves again focuses on cryptographic applications and algorithms. With combinatorics on words and automata theory, the reader is introduced to two areas of theoretical computer science where semigroups play a fundamental role.The last chapter is devoted to combinatorial group theory and its connections to automata. Contents:Algebraic structuresCryptographyNumber theoretic algorithmsPolynomial time primality testElliptic curvesCombinatorics on wordsAutomataDiscrete infinite groups

Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptography. It grew out of many courses presented by the authors over the past twenty years at various universities and covers a wide range of topics in mathematical cryptography. It is primarily geared towards graduate students and advanced undergraduates in mathematics and computer science, but may also be of interest to researchers in the area. Besides the classical methods of symmetric and private key encryption, the book treats the mathematics of cryptographic protocols and several unique topics such as Group-Based Cryptography Grobner Basis Methods in Cryptography Lattice-Based Cryptography

A new approach to conveying abstract algebra, the area that studies algebraic structures, such as groups, rings, fields, modules, vector spaces, and algebras, that is essential to various scientific disciplines such as particle physics and cryptology. It provides a well written account of the theoretical foundations and it also includes a chapter on cryptography. End of chapter problems help readers with accessing the subjects.

After being an open question for sixty years the Tarski conjecture was answered in the affirmative by Olga Kharlampovich and Alexei Myasnikov and independently by Zlil Sela. Both proofs involve long and complicated applications of algebraic geometry over free groups as well as an extension of methods to solve equations in free groups originally developed by Razborov. This book is an examination of the material on the general elementary theory of groups that is necessary to begin to understand the proofs. This material includes a complete exposition of the theory of fully residually free groups or limit groups as well a complete description of the algebraic geometry of free groups. Also included are introductory material on combinatorial and geometric group theory and first-order logic. There is then a short outline of the proof of the Tarski conjectures in the manner of Kharlampovich and Myasnikov.