O'Reilly - Safari Books Online: Cryptography in C and C++

Table of Contents

Home
Subscribe
Free Trial

Category Map
My Quick Links
Books
Video
Rough Cuts
Short Cuts
Tools

Search:criteria:

Title=Bold Reference Entry=Italic

Advanced Search

This Book

Cryptography in C and C++

Cryptography in C and C++

Search

search in
search for

Contents

Table of Contents

About the Author

About the Translator

Preface to the Second American Edition

Preface to the First American Edition

Preface to the First German Edition

Pt. 1. Arithmetic and Number Theory in C

Ch. 1. Introduction

Ch. 2. Number Formats: The Representation of Large Numbers in C

Ch. 3. Interface Semantics

Ch. 4. The Fundamental Operations

Ch. 5. Modular Arithmetic: Calculating with Residue Classes

Ch. 6. Where All Roads Meet: Modular Exponentiation

First Approaches

M-ary Exponentiation

Addition Chains and Windows

Montgomery Reduction and Exponentiation

Cryptographic Application of Exponentiation

Ch. 7. Bitwise and Logical Function

Ch. 8. Input, Output, Assignment, Conversion

Ch. 9. Dynamic Registers

Ch. 10. Basic Number-Theoretic Functions

Ch. 11. Rijndael: A Successor to the Data Encryption Standard

Ch. 12. Large Random Numbers

Ch. 13. Strategies for Testing LINT

Pt. 2. Arithmetic in C++ with the Class LINT

Pt. 3. Appendices

Create BookmarkCreate Bookmark
Create Note or TagCreate Note or Tag
DownloadDownload
Email This PageEmail This Page
PrintPrint

Thumbnail View (Key: v)
Zoom Out (Key: -)Zoom Out
Zoom In (Key: +)Zoom In
Fit PageFit Page
Fit WidthFit Width
Previous (Key: p)Previous
Next (Key: n)Next

URL

Show search terms

Help

Chapter 6. Where All Roads Meet: Modular Exponentiation > Addition Chains and Windows - Pg. 101

You are viewing the content on this page in Preview Mode.

Sign In, Subscribe or
Register For a Free Trial
to access full content of this book.