Cryptography in C and C++Apress, 19.03.2001 г. - 432 страници This book offers a comprehensive, yet relentlessly practical overview of the fundamentals of modern cryptography. Welschenbach avoids complexities by explaining cryptography and its mathematical basis in terms a programmer can easily understand. Coverage mainly focuses on the practical aspects involved in implementing public key cryptography methods, such as the RSA algorithm. It also gives both a technical overview and an implementation of the Rijndael Advanced Encryption Standard algorithm. The book includes a wide-ranging library of code in C and C++, including the RSA algorithm, completed by an extensive Test Suite that proves that the code works correctly. Readers will learn, step by step, how to implement a platform independent library for the all-important multi-precision arithmetic used in modern cryptography. This is followed by an implementation of the cryptographic algorithms themselves. The CD-ROM includes all the programs presented in the book, x86 assembler programs for basic arithmetical operations, implementations of Rijndael in both C and C++ and more. |
Съдържание
Arithmetic and Number Theory in C | 2 |
1 | 7 |
Input Output Assignment Conversion | 8 |
The Representation of Large Numbers in C | 11 |
The Fundamental Operations | 23 |
3 | 32 |
3 | 44 |
Calculating with Residue Classes | 64 |
Large Random Numbers | 231 |
Strategies for Testing LINT | 242 |
Arithmetic in C++ with the Class LINT | 262 |
Members and Friends | 275 |
Error Handling | 307 |
The RSA Cryptosystem | 317 |
Test LINT | 334 |
Approaches for Further Extensions | 354 |
1 | 69 |
Modular Exponentiation | 79 |
4 | 89 |
5 | 114 |
1 | 122 |
Bitwise and Logical Functions | 131 |
Macros | 142 |
1 | 152 |
Basic NumberTheoretic Functions | 167 |
1 | 189 |
1 | 368 |
Appendices | 379 |
B 1 | 391 |
B 4 | 397 |
Generation of Pseudorandom Numbers | 407 |
Additional Constants | 409 |
3 | 415 |
426 | |