Listing 1 - 10 of 14 | << page >> |
Sort by
|
Choose an application
cryptografie --- cryptologie --- Information systems --- 621.391.7 --- 681.3*E3 --- Secret systems of electrical communication --- Data encryption: data encryption standard; DES; public key cryptosystems --- 681.3*E3 Data encryption: data encryption standard; DES; public key cryptosystems --- 621.391.7 Secret systems of electrical communication --- Data transmission systems --- Cryptography --- Computers --- Données --- Cryptographie --- Ordinateurs --- Security measures --- Congresses --- Access control --- Transmissions --- Sécurité --- Mesures --- Congrès --- Accès --- Contrôle --- Information theory. --- Data transmission systems. --- Telecommunication. --- Theory of Computation. --- Input/Output and Data Communications. --- Communications Engineering, Networks. --- Electric communication --- Mass communication --- Telecom --- Telecommunication industry --- Telecommunications --- Communication --- Information theory --- Telecommuting --- Data communication systems --- Transmission of data --- Digital communications --- Electronic data processing --- Electronic systems --- Telecommunication systems --- Communication theory --- Cybernetics
Choose an application
Numbers, Prime --- Lucas, Édouard, --- Lucas, Édouard, - 1842-1891
Choose an application
The objective of this book is to provide tools for solving problems which involve cubic number fields. Many such problems can be considered geometrically; both in terms of the geometry of numbers and geometry of the associated cubic Diophantine equations that are similar in many ways to the Pell equation. With over 50 geometric diagrams, this book includes illustrations of many of these topics. The book may be thought of as a companion reference for those students of algebraic number theory who wish to find more examples, a collection of recent research results on cubic fields, an easy-to-understand source for learning about Voronoi’s unit algorithm and several classical results which are still relevant to the field, and a book which helps bridge a gap in understanding connections between algebraic geometry and number theory. The exposition includes numerous discussions on calculating with cubic fields including simple continued fractions of cubic irrational numbers, arithmetic using integer matrices, ideal class group computations, lattices over cubic fields, construction of cubic fields with a given discriminant, the search for elements of norm 1 of a cubic field with rational parametrization, and Voronoi's algorithm for finding a system of fundamental units. Throughout, the discussions are framed in terms of a binary cubic form that may be used to describe a given cubic field. This unifies the chapters of this book despite the diversity of their number theoretic topics. .
Geometry, Algebraic. --- Equations, Cubic. --- Cubic equations --- Algebraic geometry --- Geometry --- Geometry, algebraic. --- Number theory. --- Algorithms. --- Algebraic Geometry. --- Number Theory. --- Algorism --- Algebra --- Arithmetic --- Number study --- Numbers, Theory of --- Foundations --- Algebraic geometry.
Choose an application
Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him. Since Lucas’ early work, much more has been discovered concerning these remarkable mathematical objects, and the objective of this book is to provide a much more thorough discussion of them than is available in existing monographs. In order to do this a large variety of results, currently scattered throughout the literature, are brought together. Various sections are devoted to the intrinsic arithmetic properties of these sequences, primality testing, the Lucasnomials, some associated density problems and Lucas’ problem of finding a suitable generalization of them. Furthermore, their application, not only to primality testing, but also to integer factoring, efficient solution of quadratic and cubic congruences, cryptography and Diophantine equations are briefly discussed. Also, many historical remarks are sprinkled throughout the book, and a biography of Lucas is included as an appendix. Much of the book is not intended to be overly detailed. Rather, the objective is to provide a good, elementary and clear explanation of the subject matter without too much ancillary material. Most chapters, with the exception of the second and the fourth, will address a particular theme, provide enough information for the reader to get a feel for the subject and supply references to more comprehensive results. Most of this work should be accessible to anyone with a basic knowledge of elementary number theory and abstract algebra. The book’s intended audience is number theorists, both professional and amateur, students and enthusiasts.
Choose an application
The objective of this book is to provide tools for solving problems which involve cubic number fields. Many such problems can be considered geometrically; both in terms of the geometry of numbers and geometry of the associated cubic Diophantine equations that are similar in many ways to the Pell equation. With over 50 geometric diagrams, this book includes illustrations of many of these topics. The book may be thought of as a companion reference for those students of algebraic number theory who wish to find more examples, a collection of recent research results on cubic fields, an easy-to-understand source for learning about Voronoi’s unit algorithm and several classical results which are still relevant to the field, and a book which helps bridge a gap in understanding connections between algebraic geometry and number theory. The exposition includes numerous discussions on calculating with cubic fields including simple continued fractions of cubic irrational numbers, arithmetic using integer matrices, ideal class group computations, lattices over cubic fields, construction of cubic fields with a given discriminant, the search for elements of norm 1 of a cubic field with rational parametrization, and Voronoi's algorithm for finding a system of fundamental units. Throughout, the discussions are framed in terms of a binary cubic form that may be used to describe a given cubic field. This unifies the chapters of this book despite the diversity of their number theoretic topics. .
Number theory --- Algebraic geometry --- Geometry --- Computer science --- landmeetkunde --- algoritmen --- getallenleer --- geometrie
Choose an application
Choose an application
Pell's equation is a very simple, yet fundamental Diophantine equation which is believed to have been known to mathematicians for over 2000 years. Because of its popularity, the Pell equation is often discussed in textbooks and recreational books concerning elementary number theory, but usually not in much depth. This book provides a modern and deeper approach to the problem of solving the Pell equation. The main component of this will be computational techniques, but in the process of deriving these it will be necessary to develop the corresponding theory. One objective of this book is to provide a less intimidating introduction for senior undergraduates and others with the same level of preparedness to the delights of algebraic number theory through the medium of a mathematical object that has fascinated people since the time of Archimedes. To achieve this, this work is made accessible to anyone with some knowledge of elementary number theory and abstract algebra. Many references and notes are provided for those who wish to follow up on various topics, and the authors also describe some rather surprising applications to cryptography. The intended audience is number theorists, both professional and amateur, and students, but we wish to emphasize that this is not intended to be a textbook; its focus is much too narrow for that. It could, however be used as supplementary reading for students enrolled in a second course in number theory.
Choose an application
Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him. Since Lucas’ early work, much more has been discovered concerning these remarkable mathematical objects, and the objective of this book is to provide a much more thorough discussion of them than is available in existing monographs. In order to do this a large variety of results, currently scattered throughout the literature, are brought together. Various sections are devoted to the intrinsic arithmetic properties of these sequences, primality testing, the Lucasnomials, some associated density problems and Lucas’ problem of finding a suitable generalization of them. Furthermore, their application, not only to primality testing, but also to integer factoring, efficient solution of quadratic and cubic congruences, cryptography and Diophantine equations are briefly discussed. Also, many historical remarks are sprinkled throughout the book, and a biography of Lucas is included as an appendix. Much of the book is not intended to be overly detailed. Rather, the objective is to provide a good, elementary and clear explanation of the subject matter without too much ancillary material. Most chapters, with the exception of the second and the fourth, will address a particular theme, provide enough information for the reader to get a feel for the subject and supply references to more comprehensive results. Most of this work should be accessible to anyone with a basic knowledge of elementary number theory and abstract algebra. The book’s intended audience is number theorists, both professional and amateur, students and enthusiasts.
Choose an application
Choose an application
Listing 1 - 10 of 14 | << page >> |
Sort by
|