ebooks and download videos Search All  Title  Author 
Home / Nonfiction / Computers / Cryptography

Mathematical Foundations of Public Key Cryptography

| £66.62 | €74.92 | Ca$108.08 | Au$106.66
by Xiaoyun Wang & Guangwu Xu & Mingqiang Wang
What is this?DRM-PDF | by download   add to wish list
Mathematical Foundations of Public Key Cryptography by Xiaoyun Wang & Guangwu Xu & Mingqiang Wang

In Mathematical Foundations of Public Key Cryptography, the authors integrate the results of more than 20 years of research and teaching experience to help students bridge the gap between math theory and crypto practice. The book provides a theoretical structure of fundamental number theory and algebra knowledge supporting public-key cryptography.

Rather than simply combining number theory and modern algebra, this textbook features the interdisciplinary characteristics of cryptography-revealing the integrations of mathematical theories and public-key cryptographic applications. Incorporating the complexity theory of algorithms throughout, it introduces the basic number theoretic and algebraic algorithms and their complexities to provide a preliminary understanding of the applications of mathematical theories in cryptographic algorithms.

Supplying a seamless integration of cryptography and mathematics, the book includes coverage of elementary number theory; algebraic structure and attributes of group, ring, and field; cryptography-related computing complexity and basic algorithms, as well as lattice and fundamental methods of lattice cryptanalysis.

The text consists of 11 chapters. Basic theory and tools of elementary number theory, such as congruences, primitive roots, residue classes, and continued fractions, are covered in Chapters 1-6. The basic concepts of abstract algebra are introduced in Chapters 7-9, where three basic algebraic structures of groups, rings, and fields and their properties are explained.

Chapter 10 is about computational complexities of several related mathematical algorithms, and hard problems such as integer factorization and discrete logarithm. Chapter 11 presents the basics of lattice theory and the lattice basis reduction algorithm-the LLL algorithm and its application in the cryptanalysis of the RSA algorithm.

Containing a number of exercises on key algorithms, the book is suitable for use as a textbook for undergraduate students and first-year graduate students in information security programs. It is also an ideal reference book for cryptography professionals looking to master public-key cryptography.

To view this DRM protected ebook on your desktop or laptop you will need to have Adobe Digital Editions installed. It is a free software. We also strongly recommend that you sign up for an AdobeID at the Adobe website. For more details please see FAQ 1&2. To view this ebook on an iPhone, iPad or Android mobile device you will need the Adobe Digital Editions app, or BlueFire Reader or Txtr app. These are free, too. For more details see this article.

SHARE  Share by Email  Share on Facebook  Share on Twitter  Share on Linked In  Share on Delicious
or call in the US toll free 1-888-866-9150 product ID: 784035

Ebook Details
Pages: 220
Size: 2.1 MB
Publisher: CRC Press
Date published:   2015
ISBN: 9781498702249 (DRM-PDF)

DRM Settings
Copying:not allowed
Printing:not allowed
Read Aloud:  not allowed

This product is listed in the following categories:

Nonfiction > Mathematics > Number Theory
Nonfiction > Mathematics > Combinatorics
Nonfiction > Computers > Cryptography

If you find anything wrong with this product listing, perhaps the description is wrong, the author is incorrect, or it is listed in the wrong category, then please contact us. We will promptly address your feedback.

Submit 5 page SummaryWhat is this?

© 2016