RSA and Public-Key Cryptography

Discrete Mathematics and Its Applications

Richard A. Mollin

304 pages, parution le 19/12/2002

Ajouter à une liste

Indisponible

Résumé

Although a vast literature exists on the subject of RSA and public-key cryptography, until now there has been no single source that reveals recent developments in the area at an accessible level. Acclaimed author Richard A. Mollin brings together all of the relevant information available on public-key cryptography (PKC), from RSA to the latest applications of PKC, including electronic cash, secret broadcasting, secret balloting systems, various banking and payment protocols, high security logins, smart cards, and biometrics. Moreover, he covers public-key infrastructure (PKI) and its various security applications.

Throughout the book, Mollin gives a human face to cryptography by including nearly 40 biographies of the individuals who helped develop cryptographic concepts. He includes a number of illustrative and motivating examples, as well as optional topics that go beyond the basics, such as Lenstra's elliptic curve method and the number field sieve. From history and basic concepts to future trends and emerging applications, this book provides a rigorous and detailed treatment of public-key cryptography. Accessible to anyone from the senior undergraduate to the research scientist, RSA and Public-Key Cryptography offers challenging and inspirational material for all readers.

Contents

HISTORY AND BASIC CRYPTOGRAPHIC CONCEPTS

Terminology
Classical Ciphers
Classification of Attacks

PROTOCOLS, DISCRETE LOG, AND DIFFIE-HELLMAN

Cryptographic Protocols
The Discrete Log Problem
Exponentiation Ciphers and Diffie-Hellman

PUBLIC-KEY CRYPTOGRAPHY

One-Way Functions
Public-Key Cryptosystems and RSA
ElGamal Cryptosystems
Symmetric vs. Asymmetric Cryptosystems
Secret History of Public-Key Cryptography

PROBABILISTIC PRIMALITY TESTS

Introduction
Pseudoprimes and Carmichael Numbers
Solovay-Strassen Test
Miller-Selfridge-Rabin Test

FACTORING

Universal Exponent Method
Pollard's p - 1 Method
Lenstra's Elliptic Curve Method
Multipolynomial Quadratic Sieve
The Number Field Sieve

SECURITY OF RSA

Implementation Attacks
Exponent Attacks
Strong Moduli
Generation of Random Primes

AUTHENTICATION

Identification, Impersonation, & Signatures
Digital Signature Schemes
Digital Cash and Electronic Commerce

KEY MANAGEMENT

Secret Sharing
Key Establishment
Public-Key Infrastructure (PKI)

APPLICATIONS AND THE FUTURE

Secrecy and Authentication
Other Threats to System Security
Wireless Security
Smart Cards and Biometrics

APPENDICES

Letter Frequency Analysis
Elementary Complexity Theory
Fundamental Facts

L'auteur - Richard A. Mollin

University of Calgary, Alberta, Canada

Caractéristiques techniques

	PAPIER
Éditeur(s)	Chapman and Hall / CRC
Auteur(s)	Richard A. Mollin
Parution	19/12/2002
Nb. de pages	304
Format	16 x 24
Couverture	Relié
Poids	589g
Intérieur	Noir et Blanc
EAN13	9781584883388
ISBN13	978-1-58488-338-8