Normal view MARC view ISBD view

Mathematical foundations of public key cryptography

By: Wang, Xiaoyun, 1966-
Title By: Xu, Guangwu | Wang, Mingqiang | Meng, Xianmeng
Material type: BookPublisher: Boca Raton : CRC Press, Taylor & Francis Group, 2016.Description: xv, 220 p. ; 24 cm.ISBN: 9781498702232; 1498702236Subject(s): Coding theory | Cryptography -- Mathematics | Coding theory | Cryptography -- MathematicsDDC classification: 005.8/2 Online resources: Location Map
Summary:
The authors present 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Home library Call number Status Date due Barcode Item holds
REGULAR University of Wollongong in Dubai
Main Collection
005.82 WA MA (Browse shelf) Available T0055044
Total holds: 0

Includes bibliographical references and index.

Divisibility of Integers The Concept of Divisibility The Greatest Common Divisor and The Least Common Multiple The Euclidean Algorithm Solving Linear Diophantine Equations Prime Factorization of Integers Congruences Residue Classes and Systems of Residues Euler's Theorem Wilson's Theorem Congruence Equations Basic Concepts of Congruences of High Degrees Linear Congruences Systems of Linear Congruence Equations and the Chinese Remainder Theorem General Congruence Equations Quadratic Residues The Legendre Symbol and the Jacobi Symbol Exponents and Primitive Roots Exponents and Their Properties Primitive Roots and Their Properties Indices, Construction of Reduced System of Residues Nth Power Residues Some Elementary Results for Prime Distribution Introduction to the Basic Properties of Primes and The Main Results of Prime Number Distribution Proof of the Euler Product Formula Proof of a Weaker Version of the Prime Number Theorem Equivalent Statements of the Prime Number Theorem Simple Continued Fractions Simple Continued Fractions and Their Basic Properties Simple Continued Fraction Representations of Real Numbers Application of Continued Fraction In Cryptography-Attack to RSA with Small Decryption Exponents Basic Concepts Maps Algebraic Operations Homomorphisms and Isomorphisms between Sets with Operations Equivalence Relations and Partitions Group Theory Definitions Cyclic Groups Subgroups and Cosets Fundamental Homomorphism Theorem Concrete Examples of Finite Groups Rings and Fields Definition of a Ring Integral Domains, Fields, and Division Rings Subrings, Ideals, and Ring Homomorphisms Chinese Remainder Theorem Euclidean Rings Finite Fields Field of Fractions Some Mathematical Problems in Public Key Cryptography Time Estimation and Complexity of Algorithms Integer Factorization Problem Primality Tests The RSA Problem and the Strong RSA Problem Quadratic Residues The Discrete Logarithm Problem Basics of Lattices Basic Concepts Shortest Vector Problem Lattice Basis Reduction Algorithm Applications of LLL Algorithm References Further Reading Index.

The authors present 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.

Powered by Koha