Cryptanalysis of Number Theoretic Ciphers

— —

Samuel S. Wagstaff, Jr. (Purdue University, West Lafayette, Indiana, USA) Mikhail J. Atallah (Purdue University, West Lafayette, Indiana, USA Purdue University Purdue University Purdue University Purdue University Purdue University Purdue University)

Cryptanalysis of Number Theoretic Ciphers

Samuel S. Wagstaff, Jr. (Purdue University, West Lafayette, Indiana, USA), Mikhail J. Atallah (Purdue University, West Lafayette, Indiana, USA Purdue University Purdue University Purdue University Purdue University Purdue University Purdue University)

$284

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Chapman & Hall/CRC
10 December 2002

Mathematical foundations; Calculus & mathematical analysis; Data encryption

Series: Computational Mathematics

At the heart of modern cryptographic algorithms

lies computational number theory. Whether you're encrypting

or decrypting ciphers, a solid background in number theory is essential for success. Written by a number theorist and practicing cryptographer, Cryptanalysis of Number Theoretic Ciphers takes you from basic number theory to the inner workings of ciphers and protocols.

First, the book provides the mathematical background needed in cryptography as well as definitions and simple examples from cryptography. It includes summaries of elementary number theory and group theory, as well as common methods of finding or constructing large random

primes, factoring large integers, and computing discrete logarithms. Next, it describes a selection of cryptographic algorithms, most of which use number theory. Finally the book presents methods of attack on the cryptographic algorithms and assesses their effectiveness. For each attack method the author lists the systems it applies to and tells how they may be broken with it.

C omputational number theorists are some of the most successful cryptanalysts against public key systems. Cryptanalysis of Number Theoretic Ciphers builds a solid foundation in number theory and shows you how to apply it not only

when breaking ciphers, but also when designing ones that are difficult to break.

By: Samuel S. Wagstaff Jr. (Purdue University West Lafayette Indiana USA)
Series edited by: Mikhail J. Atallah (Purdue University West Lafayette Indiana USA Purdue University Purdue University Purdue University Purdue University Purdue University Purdue University)
Imprint: Chapman & Hall/CRC
Country of Publication: United States
Volume: 5
Dimensions: Height: 234mm, Width: 156mm, Spine: 25mm
Weight: 780g
ISBN: 9781584881537
ISBN 10: 1584881534
Series: Computational Mathematics
Pages: 334
Publication Date: 10 December 2002
Audience: Professional and scholarly , College/higher education , General/trade , Undergraduate , Primary
Format: Hardback
Publisher's Status: Active

Samuel S. Wagstaff, Jr. is a professor at the Purdue University Center for Education and Research in Information Assurance and Security (CERIAS) in West Lafayette, Indiana.

Reviews for Cryptanalysis of Number Theoretic Ciphers

This book contains a nice introduction to modern cryptography, with emphasis laid on the ciphers based on computational number theory. ... The reader learns to deal with large numbers in a computer and to analyze the complexity of the most basic algorithms. ... [T]he reader is not just confronted with a list of algorithms, but he/she is given the clues to assimilate the ideas behind the results ... . The book contains more than 200 interesting exercises that test the reader's understanding of the text. - Zentralblatt MATH, 1045 The book provides an excellent text concerning cryptanalysis. ... masterly and carefully written. As the proofs are given with full details ... I can recommend it also to students. - Monatshefte fur Mathematik