Details

Arithmetic and Number Theory in C.- Number Formats: The Representation of Large Numbers in C.- Interface Semantics.- The Fundamental Operations.- Modular Arithmetic: Calculating with Residue Classes.- Where All Roads Meet: Modular Exponentiation.- Bitwise and Logical Functions.- Input, Output, Assignment, Conversion.- Dynamic Registers.- Basic Number-Theoretic Functions.- Rijndael: A Successor.- Large Random Numbers.- Strategies for Testing LINT.- Arithmetic in C++ with the Class LINT.- Let C++ Simplify Your Life.- The LINT Public Interface: Members and Friends.- Error Handling.- An Application Example: The RSA Cryptosystem.- Do It Yourself: Test LINT.- Approaches for Further Extensions.

Michael Welschenbach works for SRC Security Research & Consulting GmbH in Bonn, Germany. He graduated with a master's degree in mathematics from the University of Cologne, and has extensive experience in both pure and applied cryptological research. Currently, his favorite programming languages are C and C++. When not working, he enjoys spending time with his wife and two sons, programming, reading, and playing music.

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

<P>This book covers all that is needed to write professional level cryptographic code. An expanded and improved version of the very well received first edition it includes approximately 100 pages of new material as well as numerous improvements in the original text.</P>