Enhanced descriptions from Syndetics:

Recent Advances in RSA Cryptography surveys the most important achievements of the last 22 years of research in RSA cryptography. Special emphasis is laid on the description and analysis of proposed attacks against the RSA cryptosystem. The first chapters introduce the necessary background information on number theory, complexity and public key cryptography. Subsequent chapters review factorization algorithms and specific properties that make RSA attractive for cryptographers. Most recent attacks against RSA are discussed in the third part of the book (among them attacks against low-exponent RSA, Hastad's broadcast attack, and Franklin-Reiter attacks). Finally, the last chapter reviews the use of the RSA function in signature schemes. Recent Advances in RSA Cryptography is of interest to graduate level students and researchers who will gain an insight into current research topics in the field and an overview of recent results in a unified way. Recent Advances in RSA Cryptography is suitable as a secondary text for a graduate level course, and as a reference for researchers and practitioners in industry.

Table of contents provided by Syndetics

• Foreword (p. ix)
• Preface (p. xi)
• 1. Mathematical Background (p. 1)
• 1.1 Divisibility and the residue class ring Z[subscript n] (p. 1)
• 1.2 Polynomials (p. 5)
• 1.3 Euler's totient function and Z*[subscript n] (p. 6)
• 1.4 Polynomial congruences and systems of linear congruences (p. 9)
• 1.5 Quadratic residues (p. 10)
• 2. Computational Complexity (p. 13)
• 2.1 Turing machines (p. 13)
• 2.2 Deterministic and nondeterministic machines (p. 14)
• 2.3 Decision problems and complexity classes (p. 16)
• 2.4 Reductions, completeness and oracle computations (p. 19)
• 2.5 co--NP (p. 21)
• 2.6 Efficient computation and randomized complexity classes (p. 22)
• 3. Public Key Cryptography (p. 25)
• 3.1 Public key cryptography (p. 25)
• 3.2 Permutation polynomials and RSA-type cryptosystems (p. 28)
• 3.3 Efficient implementation of RSA (p. 30)
• 3.4 One-way functions (p. 33)
• 3.5 On the complexity of an attack against RSA (p. 41)
• 4. Factorization Methods (p. 49)
• 4.1 Trial division and Fermat factorization (p. 49)
• 4.2 Monte-carlo factorization (p. 50)
• 4.3 Factor base methods (p. 52)
• 4.4 The continued fraction method (p. 54)
• 4.5 Quadratic sieve (p. 57)
• 4.6 Other Factorization Methods (p. 59)
• 5. Properties of the RSA Cryptosystem (p. 63)
• 5.1 Computing the decryption exponent (p. 63)
• 5.2 Partial decryption (p. 67)
• 5.3 Cycling attacks and superencryption (p. 68)
• 5.4 Incorrect keys (p. 71)
• 5.5 Partial information on RSA and hard-core predicates (p. 73)
• 6. Low-Exponent RSA (p. 81)
• 6.1 Wiener's attack (p. 81)
• 6.2 Lattice basis reduction (p. 82)
• 6.3 The attack of Boneh and Durfee (p. 86)
• 6.4 Low public exponents (p. 91)
• 6.5 Polynomially related messages (p. 93)
• 6.6 Partial key exposure (p. 96)
• 7. Protocol and Implementation Attacks (p. 99)
• 7.1 Simple protocol attacks against RSA (p. 99)
• 7.2 Hastad's broadcast attack (p. 102)
• 7.3 Effective security of small RSA messages (p. 103)
• 7.4 Optimal Asymmetric Encryption (p. 104)
• 7.5 Faulty encryption (p. 106)
• 7.6 Timing attacks (p. 108)
• 8. RSA Signatures (p. 111)
• 8.1 Attacks on RSA signatures with redundancy (p. 111)
• 8.2 Security of hash-and-sign signatures (p. 115)
• 8.3 Provably secure RSA signatures (p. 118)
• 8.4 Undeniable signatures (p. 122)
• 8.5 Threshold signatures (p. 125)
• References (p. 129)
• Index (p. 137)

Author notes provided by Syndetics

050