MTU Library Catalogue

Syndetics cover image
Image from Syndetics

The mathematics of ciphers : number theory and RSA cryptography / S.C. Coutinho.

By: Coutinho, S. C.
Material type: materialTypeLabelBookPublisher: Natick, Mass. : A K Peters, c1999Description: xv, 196 p. : ill. ; 24 cm. + hbk.ISBN: 1568810822.Subject(s): Number theory | CryptographyDDC classification: 512.7
Contents:
Introduction -- Fundamental algorithms -- Unique factorization -- Prime numbers -- Modular arithmetic -- Induction and Fermat -- Pseudoprimes -- Systems of congruences -- Groups -- Mersenne and Fermat -- Primality tests and primitive roots -- The RSA cryptosystem.
Holdings
Item type Current library Call number Copy number Status Barcode
General lending MTU Bishopstown Library Lending 512.7 (Browse shelf(Opens below)) 1 Available 00092440
General lending MTU Bishopstown Library Lending 512.7 (Browse shelf(Opens below)) 1 Available 00092390
Total holds: 0

Enhanced descriptions from Syndetics:

This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.

Bibliography: (pages 183-187) and indexes.

Introduction -- Fundamental algorithms -- Unique factorization -- Prime numbers -- Modular arithmetic -- Induction and Fermat -- Pseudoprimes -- Systems of congruences -- Groups -- Mersenne and Fermat -- Primality tests and primitive roots -- The RSA cryptosystem.

Nâumeros inteiros e criptografia RSA

Reviews provided by Syndetics

CHOICE Review

Despite the misleading emphasis of the main title (and the word "cipher," which just seems wrong), this book provides a basic course in elementary number theory for mathematics and (especially) computer science students who have the meagerest preparation, a course emphasizing algorithmic issues that culminates with a sketch of one public-key cryptosystem. Readers seeking a solid, general treatment of mathematical cryptography must turn to a book such as N. Koblitz's A Course in Number Theory and Cryptography (1987) or A. Salomaa's Public-key Cryptography (1991). Coutinho's discursive, historically informed style will indeed well suit beginning students, but the book suffers from some strange omissions. Coutinho offers no introduction to computational complexity, crucial context for his main themes. Despite developing the necessary tools, he also omits the beautiful and basic theorem of Pratt that says primes have short certificates. To prove the unique factorization theorem, Coutinho regurgitates a standard but unnecessarily complex proof where a slicker one (using infinite descent) suffices. Recommended for advanced high school students and beginning undergraduates. D. V. Feldman; University of New Hampshire

Author notes provided by Syndetics

Coutinho, S.C.