Primality testing and integer factorization in public-key cryptography

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 num…

Number theory for computing

Edition

second edition

ISBN/ISSN

-

Collation

-

Series Title

-

Call Number

512.7 YAN n

Quantum attacks on public-key cryptosystems

CONTENTS: 1.Classic and Quantum Computation 1.1.Classical Computability Theory 1.2.Classical Complexity Theory 1.3.Quantum Information and Computation 1.4.Quantum Computability and Complexity 1.5.Conclusions, Notes, and Further Reading References 2.Quantum Attacks on IFP-Based Cryptosystems 2.1.IFP and Classical Solutions to IFP 2.2.IFP-Based Cryptography 2.3.Quantum Attack…

Primality testing and integer factorization in public-key cryptography

Table of Contents: 1.Number-Theoretic Preliminaries.- Problems in Number Theory. Divisibility Properties. Euclid's Algorithm and Continued Fractions. Arithmetic Functions. Linear Congruences. Quadratic Congruences. Primitive Roots and Power Residues. Arithmetic of Elliptic Curves. Chapter Notes and Further Reading.- 2.Primality Testing and Prime Generation.- Computin…