## Cryptography in C and C++ (Google eBook)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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

3 | |

13 | |

19 | |

23 | |

Calculating with Residue Classes | 67 |

Modular Exponentiation | 81 |

Bitwise and Logical Functions | 125 |

The | 337 |

Error Handling | 367 |

The RSA Cryptosystem | 377 |

Test LINT | 413 |

Approaches for Further Extensions | 417 |

Appendices | 419 |

Directory of C Functions | 421 |

Directory of C++ Functions | 433 |

Input Output Assignment Conversion | 145 |

Dynamic Registers | 157 |

Basic NumberTheoretic Functions | 167 |

A Successor to the Data Encryption Standard | 237 |

Large Random Numbers | 261 |

Strategies for Testing LINT | 305 |

Arithmetic in C++ with the Class LINT | 317 |

Let C++ Simplify Your Life | 319 |

Macros | 451 |

Calculation Times | 459 |

Notation | 461 |

Arithmetic and NumberTheoretic Packages | 463 |

465 | |

473 | |

### Common terms and phrases

__LINE__ a_l and b_l aa_l addition aptr_l arithmetic base bb_l binary digits BITPERDGT block bytes calculation Chapter char CLINT a_l CLINT object computed congruence const LINT& constructor Cpy_l cryptographic deﬁned deﬁnition digital signatures DIGITS_L division encryption EQZ_L error example exponent factors ﬁeld ﬁle ﬁrst FLINT FLINT/C greatest common divisor implementation implicit argument Input integer large numbers Legendre symbol length LINT LSDPTR_L malloc member functions modular arithmetic modular exponentiation modulo Montgomery Montgomery reduction most-signiﬁcant msdptra_l mul_l multiplication multiplicative inverse natural numbers number of digits number theory operator ostream& output overﬂow pointer polynomial prime numbers procedure pseudorandom number public key quadratic residue random number registers remainder representation residue class result return E_CLINT_OK Rijndael rstate S-box Section sequence SETZERO_L speciﬁed square root step Syntax tmp_l UCHAR ULONG unsigned int USHORT variable void

### Popular passages

Page 18 - A further setting is related to the behavior of arithmetic functions in the case of overflow, which occurs when the result of an arithmetic operation is too large to be represented in the result type.