|
|
Sold Out
Book Categories |
| Preface | ||
| Acknowledgments | ||
| 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 | |
| Bibliography | ||
| Index |
| Price | Condition | Delivery | Seller | Action |
| $130.28 | Digital |
| WonderClub |
Nicolas Huguelet
reviewed Number Theoretic Methods in Cryptography: Complexity Lower Bounds on September 10, 2018
Number Theoretic Methods in Cryptography
If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go.
The book has five parts:
Part I: Algorithms
Part II: Logic
Part III: P and NP
Part IV: Inside P
Part V: Beyond NP
The most important parts are in Part I, III.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Number Theoretic Methods in Cryptography: Complexity Lower Bounds
X
This Item is in Your Inventory
Number Theoretic Methods in Cryptography: Complexity Lower Bounds
X
You must be logged in to review the productsX
X
X
Add Number Theoretic Methods in Cryptography: Complexity Lower Bounds, The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equa, Number Theoretic Methods in Cryptography: Complexity Lower Bounds to the inventory that you are selling on WonderClubX
X
Add Number Theoretic Methods in Cryptography: Complexity Lower Bounds, The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These methods and techniques are based on bounds of character sums and numbers of solutions of some polynomial equa, Number Theoretic Methods in Cryptography: Complexity Lower Bounds to your collection on WonderClub |