| | |  | Modeling & Simulation | Home » » » Cryptanalytic Attacks on RSA | | | | | | | Product Promotions: | | | | | Description: | | RSA is a public-key cryptographic system, and is the most famous and widely-used cryptographic system in today's digital world. Cryptanalytic Attacks on RSA, a professional book, covers almost all 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, followed by an account of the RSA cryptographic system and its variants. This book is also suitable as a secondary text for advanced-level students in computer science and mathematics. | | | Product Details: | | | Author:
| Song Y. Yan | | Hardcover:
| 275 pages | | Publisher:
| Springer | | Publication Date:
| November 26, 2007 | | Language:
| English | | ISBN:
| 0387487417 | | Product Length:
| 9.3 inches | | Product Width:
| 6.2 inches | | Product Height:
| 0.9 inches | | Product Weight:
| 1.2 pounds | | Package Length:
| 9.3 inches | | Package Width:
| 6.3 inches | | Package Height:
| 0.9 inches | | Package Weight:
| 1.25 pounds | | Average Customer Rating:
|  based on 1 reviews |
| | | | Customer Reviews: | |
Average Customer Review:
 ( 1 customer reviews )
Write an online review and share your thoughts with other customers.
Most Helpful Customer Reviews
0 of 1 found the following review helpful:
The Math of the Attacks of RSAAug 20, 2009
By Trurl
"trurlthe_constructor"
Ok, so I don't admit to understand most of this book. The editorial review says that it is geared at professionals at the graduate level. My education is some undergraduate level. But I was able to follow along and learn a lot. Being able to derive and discover such theories and cryptography schemes is another story. These techniques are relatively simple with respect to seeing how the algorithms run, but the idea behind the number theory is profound. Meaning, seeing the algorithm is one thing and manipulating and attacking it is another.
But like I said, with the proper math experience and not knowing the mathematics behind RSA, you will learn a lot. That is why I give this book 5 stars. The reason I read this book is because in the comics and movies, spies are always using secret messages. I want to know exactly what the attacks on RSA are. And even though the material is difficult, I see the attacks and it gives me a mental picture of what is possible. In other words, those things I don't know, I want to know without getting a P.H.D in mathematics. So even if you don't have all the higher mathematical experience, you can learn from this book if you read through it.
I recommend knowledge of linear algebra and working with series. This book is to the point . It is not in traditional textbook format, so it takes a little more work to go through the theories and examples. The reference to other sources in that back of the book is extensive and is referred to often, because although this book is filled with details some subjects need explored more deeply if you plan on researching the certain topic more deeply.
Here is a listing of the attacks covered:
--Direct
integer factorization attacks--discrete logarithm attacks-- quantum factoring and discrete logarithm attacks
--Indirect
common modulus attack--fixed-point attacks--guessing d attacks--knowing Euler's totient function--forward attack--e-th root attack--short e attacks--short d attacks--partial key exposure attacks
--Implementation (side-channel) attacks on d, p, q
timing attacks--power attacks--electromagnetic radiation attacks--random fault (glitch) attacks
This list was taken from page 230.
I will also list some areas of interest I marked in the book:
--For some odd reason page 5 and 6 are reversed in the book. But there are no other print mistakes.
--Page 58 has Edouard Lucas's 1891 cylindrical cryptography problem that is unsolved.
--Russian mathematician Bouniakowsky discovered clever algorithm 1870 for a^x is an element of b (mod n) with asymptotic complexity. Not much is mentioned here. It is only a paragraph, but it caught my attention while reading.
--On various pages elliptic key cryptography is worked out. The book also list some alternatives to RSA and its variations. --elliptical curve--coding based--lattice based--quantum cryptography
As stated the material is advanced but explained mathematically in a very concise manner. In fact the book is mostly all mathematical steps with paragraphs only used to start or summarize the chapter. What makes this book is that everything that is written is to the point, but is worked out enough to follow along.
I really enjoyed this book. I was however expecting more to be said about Prime numbers. Yes, p and q are Prime, but I was interested in how knowing the Prime numbers would crack RSA. This would fall under the integer factorization problem, but I guess Prime numbers are not supposed to be solvable in polynomial time, so N is supposed to be secure. But I'll admit that much of my interest in this book was the RSA attacks. There is something mysterious and childlike curiosity when cracking a code. Granted it is no easy task and reading this book doesn't make you an expert code cracker overnight. It is step in that direction and introduces the reader to mystery of how messages can be encoded so only the right person sees them, but does it from a math perspective where there is potential to create even more mysteries in the field.
Oh, and another thing. I believe a logarithmic spiral can find a series in Primes if one exists. (vms)
| | |
|
