Primality Testing and Integer Factorization in Public-Key Cryptography
Primality Testing and Integer Factorization in Public-Key Cryptography

Author: Song Y. Yan

Publisher: Springer Science & Business Media

Published: 2013-06-29

Total Pages: 249

ISBN-13: 1475738161

DOWNLOAD EBOOK

Primality Testing and Integer Factorization in Public-Key Cryptography introduces various algorithms for primality testing and integer factorization, with their applications in public-key cryptography and information security. More specifically, this book explores basic concepts and results in number theory in Chapter 1. Chapter 2 discusses various algorithms for primality testing and prime number generation, with an emphasis on the Miller-Rabin probabilistic test, the Goldwasser-Kilian and Atkin-Morain elliptic curve tests, and the Agrawal-Kayal-Saxena deterministic test for primality. Chapter 3 introduces various algorithms, particularly the Elliptic Curve Method (ECM), the Quadratic Sieve (QS) and the Number Field Sieve (NFS) for integer factorization. This chapter also discusses some other computational problems that are related to factoring, such as the square root problem, the discrete logarithm problem and the quadratic residuosity problem.

Mathematics of Public Key Cryptography
Mathematics of Public Key Cryptography

Author: Steven D. Galbraith

Publisher: Cambridge University Press

Published: 2012-03-15

Total Pages: 631

ISBN-13: 1107013925

DOWNLOAD EBOOK

This advanced graduate textbook gives an authoritative and insightful description of the major ideas and techniques of public key cryptography.

Computational Number Theory and Modern Cryptography
Computational Number Theory and Modern Cryptography

Author: Song Y. Yan

Publisher: John Wiley & Sons

Published: 2013-01-29

Total Pages: 432

ISBN-13: 1118188586

DOWNLOAD EBOOK

The only book to provide a unified view of the interplay between computational number theory and cryptography Computational number theory and modern cryptography are two of the most important and fundamental research fields in information security. In this book, Song Y. Yang combines knowledge of these two critical fields, providing a unified view of the relationships between computational number theory and cryptography. The author takes an innovative approach, presenting mathematical ideas first, thereupon treating cryptography as an immediate application of the mathematical concepts. The book also presents topics from number theory, which are relevant for applications in public-key cryptography, as well as modern topics, such as coding and lattice based cryptography for post-quantum cryptography. The author further covers the current research and applications for common cryptographic algorithms, describing the mathematical problems behind these applications in a manner accessible to computer scientists and engineers. Makes mathematical problems accessible to computer scientists and engineers by showing their immediate application Presents topics from number theory relevant for public-key cryptography applications Covers modern topics such as coding and lattice based cryptography for post-quantum cryptography Starts with the basics, then goes into applications and areas of active research Geared at a global audience; classroom tested in North America, Europe, and Asia Incudes exercises in every chapter Instructor resources available on the book’s Companion Website Computational Number Theory and Modern Cryptography is ideal for graduate and advanced undergraduate students in computer science, communications engineering, cryptography and mathematics. Computer scientists, practicing cryptographers, and other professionals involved in various security schemes will also find this book to be a helpful reference.

Number Theory for Computing
Number Theory for Computing

Author: Song Y. Yan

Publisher: Springer Science & Business Media

Published: 2013-11-11

Total Pages: 454

ISBN-13: 366204773X

DOWNLOAD EBOOK

This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.

Cryptanalytic Attacks on RSA
Cryptanalytic Attacks on RSA

Author: Song Y. Yan

Publisher: Springer Science & Business Media

Published: 2007-11-15

Total Pages: 270

ISBN-13: 0387487425

DOWNLOAD EBOOK

RSA is a public-key cryptographic system, and is the most famous and widely-used cryptographic system in today's digital world. Cryptanalytic Attacks on RSA, a professional book, covers almost all known cryptanalytic attacks and defenses of the RSA cryptographic system and its variants. Since RSA depends heavily on computational complexity theory and number theory, background information on complexity theory and number theory is presented first, followed by an account of the RSA cryptographic system and its variants. This book is also suitable as a secondary text for advanced-level students in computer science and mathematics.

Handbook of Applied Cryptography
Handbook of Applied Cryptography

Author: Alfred J. Menezes

Publisher: CRC Press

Published: 2018-12-07

Total Pages: 810

ISBN-13: 0429881320

DOWNLOAD EBOOK

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications. Standards are emerging to meet the demands for cryptographic protection in most areas of data communications. Public-key cryptographic techniques are now in widespread use, especially in the financial services industry, in the public sector, and by individuals for their personal privacy, such as in electronic mail. This Handbook will serve as a valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography. It is a necessary and timely guide for professionals who practice the art of cryptography. The Handbook of Applied Cryptography provides a treatment that is multifunctional: It serves as an introduction to the more practical aspects of both conventional and public-key cryptography It is a valuable source of the latest techniques and algorithms for the serious practitioner It provides an integrated treatment of the field, while still presenting each major topic as a self-contained unit It provides a mathematical treatment to accompany practical discussions It contains enough abstraction to be a valuable reference for theoreticians while containing enough detail to actually allow implementation of the algorithms discussed Now in its third printing, this is the definitive cryptography reference that the novice as well as experienced developers, designers, researchers, engineers, computer scientists, and mathematicians alike will use.

The Development of the Number Field Sieve
The Development of the Number Field Sieve

Author: Arjen K. Lenstra

Publisher: Springer

Published: 2006-11-15

Total Pages: 138

ISBN-13: 3540478922

DOWNLOAD EBOOK

The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

An Introduction to Mathematical Cryptography
An Introduction to Mathematical Cryptography

Author: Jeffrey Hoffstein

Publisher: Springer

Published: 2014-09-11

Total Pages: 549

ISBN-13: 1493917110

DOWNLOAD EBOOK

This self-contained introduction to modern cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. The book focuses on these key topics while developing the mathematical tools needed for the construction and security analysis of diverse cryptosystems. Only basic linear algebra is required of the reader; techniques from algebra, number theory, and probability are introduced and developed as required. This text provides an ideal introduction for mathematics and computer science students to the mathematical foundations of modern cryptography. The book includes an extensive bibliography and index; supplementary materials are available online. The book covers a variety of topics that are considered central to mathematical cryptography. Key topics include: classical cryptographic constructions, such as Diffie–Hellmann key exchange, discrete logarithm-based cryptosystems, the RSA cryptosystem, and digital signatures; fundamental mathematical tools for cryptography, including primality testing, factorization algorithms, probability theory, information theory, and collision algorithms; an in-depth treatment of important cryptographic innovations, such as elliptic curves, elliptic curve and pairing-based cryptography, lattices, lattice-based cryptography, and the NTRU cryptosystem. The second edition of An Introduction to Mathematical Cryptography includes a significant revision of the material on digital signatures, including an earlier introduction to RSA, Elgamal, and DSA signatures, and new material on lattice-based signatures and rejection sampling. Many sections have been rewritten or expanded for clarity, especially in the chapters on information theory, elliptic curves, and lattices, and the chapter of additional topics has been expanded to include sections on digital cash and homomorphic encryption. Numerous new exercises have been included.