RSA is the first workable and practicable public-key cryptographic system, based on the use of large prime numbers. It is also the most popular and widely-used cryptographic system in today's digital world, for which its three inventors Rivest, Shamir and Adleman received the year 2002 Turing Award, the equivalent Nobel Prize in Computer Science.

Cryptanalytic Attacks on RSA covers almost all major 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. This is followed by an account of the RSA cryptographic system and its variants.

Cryptanalytic Attacks on RSA is designed for a professional audience of practitioners and researchers in industry and academia and as a reference or secondary text for advanced level students in computer science, applied mathematics, electrical & communication engineering.

Reviews

From the reviews:

"This book is ... about cryptanalytic attacks on RSA. ... The book is well organized and a joy to read and it is ... suitable either as a research reference for public-key cryptography in general and for RSA cryptology in particular, or as a graduate text in the field." (Marc M. Gysin, Mathematical Reviews, Issue 2009 a)

"The book covers almost all major known cryptoanalytic attacks and defenses of the RSA cryptographic attacks and defenses of the RSA cryptographic system and its variants. It is a self-contained book and ... has been designed for a professional audience of practitioners and researchers. ... the book is suitable as a graduate text in the field." (Bal Kishan Dass, Zentralblatt MATH, Vol. 1166, 2009)

Book Information
ISBN 9781441943101
Author Song Y. Yan
Format Paperback
Page Count 255
Imprint Springer-Verlag New York Inc.
Publisher Springer-Verlag New York Inc.