Martin Kreuzer – författare

The book consists of contributions related mostly to public-key cryptography, including the design of new cryptographic primitives as well as cryptanalysis of previously suggested schemes. Most papers are original research papers in the area that can be loosely defined as 'non-commutative cryptography', this means that groups (or other algebraic structures) which are used as platforms are non-commutative.

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 Gröbner Basis Methods in Cryptography Lattice-Based Cryptography

This book contains surveys and research articles on the state-of-the-art in finitely presented groups for researchers and graduate students. Overviews of current trends in exponential groups and of the classification of finite triangle groups and finite generalized tetrahedron groups are complemented by new results on a conjecture of Rosenberger and an approximation theorem. A special emphasis is on algorithmic techniques and their complexity, both for finitely generated groups and for finite Z-algebras, including explicit computer calculations highlighting important classical methods. A further chapter surveys connections to mathematical logic, in particular to universal theories of various classes of groups, and contains new results on countable elementary free groups. Applications to cryptography include overviews of techniques based on representations of p-groups and of non-commutative group actions. Further applications of finitely generated groups to topology and artificial intelligence complete the volume. All in all, leading experts provide up-to-date overviews and current trends in combinatorial group theory and its connections to cryptography and other areas.

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is notavailable at all. The authors continue to present it in their lively and humorous style, interspersing core content with funny quotations and tongue-in-cheek explanations.

This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is notavailable at all. The authors continue to present it in their lively and humorous style, interspersing core content with funny quotations and tongue-in-cheek explanations.

"The second volume of the authors' 'Computational commutative algebra'!covers on its 586 pages a wealth of interesting material with several unexpected applications. ! an encyclopedia on computational commutative algebra, a source for lectures on the subject as well as an inspiration for seminars. The text is recommended for all those who want to learn and enjoy an algebraic tool that becomes more and more relevant to different fields of applications." --ZENTRALBLATT MATH

The main TOPIC of this book is that of Groebner bases and their applications. The main PURPOSE of this book is that of bridging the current gap in the literature between theory and real computation. The book can be used by teachers and students alike as a comprehensive guide to both the theory and the practice of Computational Commutative Algebra. It has been made as self-contained as possible, and thus is ideally suited as a textbook for graduate or advanced undergraduate courses. Numerous applications are described, covering fields as disparate as algebraic geometry and financial markets. To aid a deeper understanding of these applications there are 44 tutorials aimed at illustrating how the theory can be used in these cases. The computational aspects of the tutorials can be carried out with the computer algebra system CoCoA, an introduction to which appears in an appendix. Besides the tutorials there are plenty of exercises, some of a theoretical nature and others more practical.

"The second volume of the authors' 'Computational commutative algebra'!covers on its 586 pages a wealth of interesting material with several unexpected applications. ! an encyclopedia on computational commutative algebra, a source for lectures on the subject as well as an inspiration for seminars. The text is recommended for all those who want to learn and enjoy an algebraic tool that becomes more and more relevant to different fields of applications." --ZENTRALBLATT MATH

Hofstadter’s Law: It always takes longer than you think it will take, even if you take into account Hofstadter’s Law. (Douglas R. Hofstadter) Dear Reader, what you are holding in your hands now is for youabook. But for us, for our families and friends, it has been known as the book over the last three years. Three years of intense work just to ?ll three centimeters of your bookshelf! This amounts to about one centimeter per year, or roughly two-?fths of an inch per year if you are non-metric. Clearly we had ample opportunity to experience the full force of Hofstadter’s Law. Writing a book about Computational Commutative Algebra is not - like computing a Gr¨ obner basis: you need unshakeable faith to believe that the project will ever end; likewise, you must trust in the Noetherianity of polynomial rings to believe that Buchberger’s Algorithm will ever terminate. Naturally, we hope that the ?nal result proves our e?orts worthwhile. This is a book for learning, teaching, reading, and, most of all, enjoying the topic at hand.