Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008067988/catalog> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- catalog contributor b11205537.
- catalog created "c1999.".
- catalog date "1999".
- catalog date "c1999.".
- catalog dateCopyrighted "c1999.".
- catalog description "I. Preliminaries -- 1. Introduction -- 2. Basic Notation and Definitions -- 3. Auxiliary Results -- II. Approximation and Complexity of the Discrete Logarithm -- 4. Approximation of the Discrete Logarithm Modulo p -- 5. Approximation of the Discrete Logarithm Modulo p -- 1 -- 6. Approximation of the Discrete Logarithm by Boolean Functions -- 7. Approximation of the Discrete Logarithm by Real and Complex Polynomials -- III. Complexity of Breaking the Diffie-Hellman Cryptosystem -- 8. Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Key -- 9. Boolean Complexity of the Diffie-Hellman Key -- IV. Other Applications -- 10. Trade-off between the Boolean and Arithmetic Depths of Modulo p Functions -- 11. Special Polynomials and Boolean Functions -- 12. RSA and Blum-Blum-Shub Generators of Pseudo-Random Numbers -- V. Concluding Remarks -- 13. Generalizations and Open Questions -- 14. Further Directions.".
- catalog description "Includes bibliographic references (p. [165]-177) and index.".
- catalog extent "viii, 180 p. ;".
- catalog hasFormat "Number theoretic methods in cryptography.".
- catalog identifier "0817658882 (Boston)".
- catalog identifier "3764358882 (Basel)".
- catalog isFormatOf "Number theoretic methods in cryptography.".
- catalog isPartOf "Progress in computer science and applied logic ; v. 17".
- catalog issued "1999".
- catalog issued "c1999.".
- catalog language "eng".
- catalog publisher "Basel ; Boston : Birkhäuser,".
- catalog relation "Number theoretic methods in cryptography.".
- catalog subject "003/.54 21".
- catalog subject "Computational complexity.".
- catalog subject "Cryptography.".
- catalog subject "Number theory.".
- catalog subject "QA267.7 .S57 1999".
- catalog tableOfContents "I. Preliminaries -- 1. Introduction -- 2. Basic Notation and Definitions -- 3. Auxiliary Results -- II. Approximation and Complexity of the Discrete Logarithm -- 4. Approximation of the Discrete Logarithm Modulo p -- 5. Approximation of the Discrete Logarithm Modulo p -- 1 -- 6. Approximation of the Discrete Logarithm by Boolean Functions -- 7. Approximation of the Discrete Logarithm by Real and Complex Polynomials -- III. Complexity of Breaking the Diffie-Hellman Cryptosystem -- 8. Polynomial Approximation and Arithmetic Complexity of the Diffie-Hellman Key -- 9. Boolean Complexity of the Diffie-Hellman Key -- IV. Other Applications -- 10. Trade-off between the Boolean and Arithmetic Depths of Modulo p Functions -- 11. Special Polynomials and Boolean Functions -- 12. RSA and Blum-Blum-Shub Generators of Pseudo-Random Numbers -- V. Concluding Remarks -- 13. Generalizations and Open Questions -- 14. Further Directions.".
- catalog title "Number theoretic methods in cryptography : complexity lower bounds / Igor Shparlinski.".
- catalog type "text".