Cryptography in C and C++, Second Edition

Logic (both Classical and Non-Classical) is being increasingly related with other fields in almost every scientific discipline and human activity. In this volume we have emphasized its role in the following fields of science: Artificial Intelligence, Robotics, Informatics in general, Technology, and correlated themes. The papers are written by some of the most prominent scientists of today I. Arithmetic and number theory in C -- 1. Introduction -- 2. Number formats : the representation of large numbers in C -- 3. Interface semantics -- 4. The fundamental operations -- 5. Modular arithmetic : calculating with residue classes -- 6. Where all roads meet : modular exponentiation -- 7. Bitwise and logical functions -- 8. Input, output, assignment, conversion -- 9. Dynamic registers -- 10. Basic number-theoretic functions -- 11. Rijndael : a successor to the data encryption standard -- 12. Large random numbers -- 13. Strategies for testing LINT -- II. Arithmetic in C++ with the class LINT -- 14. Let C++ simplify your life -- 15. The LINTPublic interface : members and friends -- 16. Error handling -- 17. An application example : the RSA cryptosystem -- 18. Do it yourself : test LINT -- 19. Approaches for further extensions -- III. Appendices Contents......Page p0006.djvu List of Tables......Page p0012.djvu Foreword......Page p0014.djvu About the Author......Page p0016.djvu Preface to the Second American Edition......Page p0018.djvu Preface to the First American Edition......Page p0020.djvu Preface to the First German Edition......Page p0024.djvu Part I - Arithmetic and Number Theory in C......Page p0027.djvu 1. Introduction......Page p0029.djvu 2. Number Formats: Representation of Large Numbers in C......Page p0039.djvu 3. Interface Semantics......Page p0045.djvu 4. The Fundamental Operations......Page p0049.djvu 5. Modular Arithmetic: Calculating with Residue Classes......Page p0093.djvu 6. Where All Roads Meet: Modular Exponentiation......Page p0107.djvu 7. Bitwise and Logical Functions......Page p0151.djvu 8. Input, Output, Assignment, Conversion......Page p0171.djvu 9. Dynamic Registers......Page p0183.djvu 10. Basic Number-Theoretic Functions......Page p0193.djvu 11. Rijndael: A Successor to the Data Encryption Standard......Page p0263.djvu 12. Large Random Numbers......Page p0287.djvu 13. Strategies for Testing LINT......Page p0331.djvu Part II - Arithmetic in C++ with the Class LINT......Page p0343.djvu 14. Let C++ Simplify Your Life......Page p0345.djvu 15. The LINT Public Interface: Members and Friends......Page p0363.djvu 16. Error Handling......Page p0393.djvu 17. An Application Example: The RSA Cryptosystem......Page p0403.djvu 18. Do It Yourself: Test LINT......Page p0439.djvu 19. Approaches for Further Extensions......Page p0443.djvu Part III - \rAppendices......Page p0445.djvu APPENDIX A - \rDirectory of C Functions......Page p0447.djvu APPENDIX B - Directory of C++ Functions......Page p0459.djvu APPENDIX C - Macros......Page p0477.djvu APPENDIX C - Calculation Times......Page p0485.djvu APPENDIX E - Notation......Page p0487.djvu APPENDIX F - Arithmetic and Number-Theoretic Packages......Page p0489.djvu References......Page p0491.djvu Index......Page p0499.djvu CRYPTOGRAPHY IS AN ANCIENT ART, well over two thousand years old. The need to keep certain information secret has always existed, and attempts to preserve secrets have therefore existed as well. But it is only in the last thirty years that cryptography has developed into a science that has offered us needed security in our daily lives. Whether we are talking about automated teller machines, cellular telephones, Internet commerce, or computerized ignition locks on automobiles, there is cryptography hidden within. And what is more, none of these applications would work without cryptography! The historyofcryptographyoverthepastthirtyyearsisauniquesuccessstory. The most important event was surely the discovery of public key cryptography in the mid 1970s. It was truly a revolution: We know today that things are possible that previously we hadn’t even dared to think about. Dif?e and Hellman were the ?rst to formulate publicly the vision that secure communication must be able to take place spontaneously. Earlier, it was the case that sender and receiver had ?rst to engage in secret communication to establish a common key. Dif?e and Hellman asked, with the naivety of youth, whether one could communicate secretly without sharing a common secret. Their idea was that one could encrypt information without a secret key, that is, one that no one else could know. This idea signaled the birth of public key cryptography. That this vision was more than just wild surmise was shown a few years later with the advent of the RSA algorithm. This book covers everything you need to know to write professional-level cryptographic code. This expanded, improved second edition includes about 100 pages of new material as well as numerous improvements to the original text. The chapter about random number generation has been completely rewritten, and the latest cryptographic techniques are covered in detail. Furthermore, this book covers the recent improvements in primality testing. * The chapter on primality tests is thoroughly revised. This is the first book to include practical implementations of the recent major improvements in primality testing * The chapter about random number generation completely rewritten * Completely revised to incorporate latest cryptographic techniques CD-ROM contins: Programs presented in the book including x86 assembler programs and implementations of Rijndael algorithm in both C and C++. Michael Welschenbach ; Translated By David Kramer. Includes Bibliographical References (p. 465-471) And Index.