Details
Binary Quadratic Forms
An Algorithmic ApproachAlgorithms and Computation in Mathematics, Band 20
|
53,49 € |
|
| Verlag: | Springer |
| Format: | |
| Veröffentl.: | 22.06.2007 |
| ISBN/EAN: | 9783540463689 |
| Sprache: | englisch |
| Anzahl Seiten: | 318 |
Dieses eBook enthält ein Wasserzeichen.
Beschreibungen
This book deals with algorithmic problems concerning binary quadratic forms 2 2 f(X,Y)= aX +bXY +cY with integer coe?cients a, b, c, the mathem- ical theories that permit the solution of these problems, and applications to cryptography. A considerable part of the theory is developed for forms with real coe?cients and it is shown that forms with integer coe?cients appear in a natural way. Much of the progress of number theory has been stimulated by the study of concrete computational problems. Deep theories were developed from the classic time of Euler and Gauss onwards to this day that made the solutions ofmanyof theseproblemspossible.Algorithmicsolutionsandtheirproperties became an object of study in their own right. Thisbookintertwinestheexpositionofoneveryclassicalstrandofnumber theory with the presentation and analysis of algorithms both classical and modern which solve its motivating problems. This algorithmic approach will lead the reader, we hope, not only to an understanding of theory and solution methods, but also to an appreciation of the e?ciency with which solutions can be reached. The computer age has led to a marked advancement of algorithmic - search. On the one hand, computers make it feasible to solve very hard pr- lems such as the solution of Pell equations with large coe?cients. On the other, the application of number theory in public-key cryptography increased the urgency for establishing the complexity of several computational pr- lems: many a computer system stays only secure as long as these problems remain intractable.
Binary Quadratic Forms.- Equivalence of Forms.- Constructing Forms.- Forms, Bases, Points, and Lattices.- Reduction of Positive Definite Forms.- Reduction of Indefinite Forms.- Multiplicative Lattices.- Quadratic Number Fields.- Class Groups.- Infrastructure.- Subexponential Algorithms.- Cryptographic Applications.
<p><br>Buchmann: Professor of Computer Science and Mathematics<br> special areas number theory, computer algebra, cryptography<br> associate editor Journal of Cryptology<br> Leibniz Award of the Deutsche Forschungsgemeinschaft<br> Author of "Introduction to cryptography" UTM, translated into seven languages<br> Member of Berlin-Brandenburg Academy of Sciences<br> Member of Academy of Sciences and Literature, Mainz</p><p>Vollmer: Thesis and several articles on algorithms for Class Group and Regulator computation in quadratic fields.</p>
Buchmann is a leader in number theory in the world Only book focussing on the algorithmic aspects of the theory
<P>The book deals with algorithmic problems related to binary quadratic forms. Written by a world leader in number theory, it is the only book focusing on the algorithmic aspects of the theory. It deals with problems such as finding the representations of an integer by a form with integer coefficients, finding the minimum of a form with real coefficients and deciding equivalence of two forms. In order to solve those problems, the book introduces the reader to important areas of number theory such as diophantine equations, reduction theory of quadratic forms, geometry of numbers and algebraic number theory. The book explains applications to cryptography. It requires only basic mathematical knowledge.</P>
Diese Produkte könnten Sie auch interessieren:
