Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008768615/catalog> ?p ?o. }

• catalog abstract ""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 Crytography is suitable as a secondary text for a graduate level course, and as a reference for researchers and practitioners in industry."--Jacket.".
• catalog contributor b12289794.
• catalog created "c2001.".
• catalog date "2001".
• catalog date "c2001.".
• catalog dateCopyrighted "c2001.".
• catalog description ""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 Crytography is suitable as a secondary text for a graduate level course, and as a reference for researchers and practitioners in industry."--Jacket.".
• catalog description "1. Mathematical Background 1 -- 1.1 Divisibility and the residue class ring Z[subscript n] 1 -- 1.2 Polynomials 5 -- 1.3 Euler's totient function and Z*[subscript n] 6 -- 1.4 Polynomial congruences and systems of linear congruences 9 -- 1.5 Quadratic residues 10 -- 2. Computational Complexity 13 -- 2.1 Turing machines 13 -- 2.2 Deterministic and nondeterministic machines 14 -- 2.3 Decision problems and complexity classes 16 -- 2.4 Reductions, completeness and oracle computations 19 -- 2.5 co--NP 21 -- 2.6 Efficient computation and randomized complexity classes 22 -- 3. Public Key Cryptography 25 -- 3.1 Public key cryptography 25 -- 3.2 Permutation polynomials and RSA-type cryptosystems 28 -- 3.3 Efficient implementation of RSA 30 -- 3.4 One-way functions 33 -- 3.5 On the complexity of an attack against RSA 41 -- 4. Factorization Methods 49 -- 4.1".
• catalog description "103 -- 7.4 Optimal Asymmetric Encryption 104 -- 7.5 Faulty encryption 106 -- 7.6 Timing attacks 108 -- 8. RSA Signatures 111 -- 8.1 Attacks on RSA signatures with redundancy 111 -- 8.2 Security of hash-and-sign signatures 115 -- 8.3 Provably secure RSA signatures 118 -- 8.4 Undeniable signatures 122 -- 8.5 Threshold signatures 125.".
• catalog description "Includes bibliographical references (p. [129]-136) and index.".
• catalog description "Trial division and Fermat factorization 49 -- 4.2 Monte-carlo factorization 50 -- 4.3 Factor base methods 52 -- 4.4 Continued fraction method 54 -- 4.5 Quadratic sieve 57 -- 4.6 Other Factorization Methods 59 -- 5. Properties of the RSA Cryptosystem 63 -- 5.1 Computing the decryption exponent 63 -- 5.2 Partial decryption 67 -- 5.3 Cycling attacks and superencryption 68 -- 5.4 Incorrect keys 71 -- 5.5 Partial information on RSA and hard-core predicates 73 -- 6. Low-Exponent RSA 81 -- 6.1 Wiener's attack 81 -- 6.2 Lattice basis reduction 82 -- 6.3 Attack of Boneh and Durfee 86 -- 6.4 Low public exponents 91 -- 6.5 Polynomially related messages 93 -- 6.6 Partial key exposure 96 -- 7. Protocol and Implementation Attacks 99 -- 7.1 Simple protocol attacks against RSA 99 -- 7.2 Hastad's broadcast attack 102 -- 7.3 Effective security of small RSA messages".
• catalog extent "xiii, 140 p. :".
• catalog identifier "079237438X (alk. paper)".
• catalog isPartOf "Advances in information security ; 3".
• catalog issued "2001".
• catalog issued "c2001.".
• catalog language "eng".
• catalog publisher "Boston : Kluwer Academic Publishers,".
• catalog subject "005.8 21".
• catalog subject "Computer security.".
• catalog subject "Cryptography.".
• catalog subject "QA76.9.A25 K38 2001".
• catalog tableOfContents "1. Mathematical Background 1 -- 1.1 Divisibility and the residue class ring Z[subscript n] 1 -- 1.2 Polynomials 5 -- 1.3 Euler's totient function and Z*[subscript n] 6 -- 1.4 Polynomial congruences and systems of linear congruences 9 -- 1.5 Quadratic residues 10 -- 2. Computational Complexity 13 -- 2.1 Turing machines 13 -- 2.2 Deterministic and nondeterministic machines 14 -- 2.3 Decision problems and complexity classes 16 -- 2.4 Reductions, completeness and oracle computations 19 -- 2.5 co--NP 21 -- 2.6 Efficient computation and randomized complexity classes 22 -- 3. Public Key Cryptography 25 -- 3.1 Public key cryptography 25 -- 3.2 Permutation polynomials and RSA-type cryptosystems 28 -- 3.3 Efficient implementation of RSA 30 -- 3.4 One-way functions 33 -- 3.5 On the complexity of an attack against RSA 41 -- 4. Factorization Methods 49 -- 4.1".
• catalog tableOfContents "103 -- 7.4 Optimal Asymmetric Encryption 104 -- 7.5 Faulty encryption 106 -- 7.6 Timing attacks 108 -- 8. RSA Signatures 111 -- 8.1 Attacks on RSA signatures with redundancy 111 -- 8.2 Security of hash-and-sign signatures 115 -- 8.3 Provably secure RSA signatures 118 -- 8.4 Undeniable signatures 122 -- 8.5 Threshold signatures 125.".
• catalog tableOfContents "Trial division and Fermat factorization 49 -- 4.2 Monte-carlo factorization 50 -- 4.3 Factor base methods 52 -- 4.4 Continued fraction method 54 -- 4.5 Quadratic sieve 57 -- 4.6 Other Factorization Methods 59 -- 5. Properties of the RSA Cryptosystem 63 -- 5.1 Computing the decryption exponent 63 -- 5.2 Partial decryption 67 -- 5.3 Cycling attacks and superencryption 68 -- 5.4 Incorrect keys 71 -- 5.5 Partial information on RSA and hard-core predicates 73 -- 6. Low-Exponent RSA 81 -- 6.1 Wiener's attack 81 -- 6.2 Lattice basis reduction 82 -- 6.3 Attack of Boneh and Durfee 86 -- 6.4 Low public exponents 91 -- 6.5 Polynomially related messages 93 -- 6.6 Partial key exposure 96 -- 7. Protocol and Implementation Attacks 99 -- 7.1 Simple protocol attacks against RSA 99 -- 7.2 Hastad's broadcast attack 102 -- 7.3 Effective security of small RSA messages".
• catalog title "Recent advances in RSA cryptography / by Stefan Katzenbeisser.".
• catalog type "text".