Böcker av Richard A. Mollin

Offers a detailed treatment of public-key cryptography (PKC), from RSA, the first public key system devised in 1978, to the applications of PKC, including electronic cash, secret broadcasting, secret balloting systems, various banking and payment protocols, high security logins, smart cards, and biometrics.

Features fundamental material, including partition theory, generating functions, and combinatorial number theory. This work offers coverage of random number generation, Diophantine analysis, and additive number theory. It also includes more applications to cryptography, primality testing, and factoring.

The first thing readers will notice about this book is that it is fun to read. It is meant for browsers, for students, and for specialists wanting to know more about the subject. The footnotes give an historical background to the text, in addition to providing deeper applications of the concept that is being cited. This allows browsers to look more deeply into the history or to pursue a given sideline. Those who are only marginally interested in the area will be able to read the text, pick up information easily, and be entertained at the same time by the historical and philosophical digressions. It is rich in structure and motivation in its concentration upon quadratic orders.

This book explores the depth and breadth of the field of cryptology. It begins by tracing the development of cryptology from inception to modern-day practice. The remainder of the book explores the modern aspects and applications of cryptography, covering symmetric- and public-key cryptography, cryptographic protocols, key management, message authentication, e-mail and Internet security, and advanced applications. Nearly 200 diagrams, examples, figures, and tables along with abundant references and exercises complement the discussion. It is designed such that the non-professional reader may learn all aspects of secrecy yet it is still suitable as a textbook for a course on a variety of secrecy-related topics.

Covers a range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. This text also offers coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density and primes.

Features appendices that contain tabular material including class numbers of real and complex quadratic fields up to 104; class group structures; and, fundamental units of real quadratic fields.

Includes two chapters on various applications that cover topics such as electronic mail, Internet security, protocol layers and SSL, firewalls, client-server model and cookies, network security, wireless security, smart cards, and biometrics. This book provides information on cryptanalysis, primality testing, DES, and primitive roots.

Explores the depth and breadth of the field of cryptology. This title begins by tracing the development of cryptology from inception to modern-day practice. It also explores the modern aspects and applications of cryptography, covering symmetric- and public-key cryptography, cryptographic protocols, key management, and advanced applications.