From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Handbook of Applied Cryptography

1. The Advanced Encryption Standard Process.- 2. Preliminaries.- 3. Specification of Rijndael.- 4. Implementation Aspects.- 5. Design Philosophy.- 6. The Data Encryption Standard.- 7. Correlation Matrices.- 8. Difference Propagation.- 9. The Wide Trail Strategy.- 10. Cryptanalysis.- 11. Related Block Ciphers.- Appendices.- A. Propagation Analysis in Galois Fields.- A.1.1 Difference Propagation.- A.l.2 Correlation.- A. 1.4 Functions that are Linear over GF(2).- A.2.1 Difference Propagation.- A.2.2 Correlation.- A.2.4 Functions that are Linear over GF(2).- A.3.3 Dual Bases.- A.4.2 Relationship Between Trace Patterns and Selection Patterns.- A.4.4 Illustration.- A.5 Rijndael-GF.- B. Trail Clustering.- B.1 Transformations with Maximum Branch Number.- B.2 Bounds for Two Rounds.- B.2.1 Difference Propagation.- B.2.2 Correlation.- B.3 Bounds for Four Rounds.- B.4 Two Case Studies.- B.4.1 Differential Trails.- B.4.2 Linear Trails.- C. Substitution Tables.- C.1 SRD.- C.2 Other Tables.- C.2.1 xtime.- C.2.2 Round Constants.- D. Test Vectors.- D.1 KeyExpansion.- D.2 Rijndael(128,128).- D.3 Other Block Lengths and Key Lengths.- E. Reference Code.

The Design of Rijndael: AES - The Advanced Encryption Standard

The first part of this book presents an introduction to the theory of finite fields, with emphasis on those aspects that are relevant for applications. The second part is devoted to a discussion of the most important applications of finite fields especially information theory, algebraic coding theory and cryptology (including some very recent material that has never before appeared in book form). There is also a chapter on applications within mathematics, such as finite geometries. combinatorics. and pseudorandom sequences. Worked-out examples and list of exercises found throughout the book make it useful as a textbook.

Introduction to finite fields and their applications

Spread-spectrum communications, with its inherent interference attenuation capability, has over the years become an increasingly popular technique for use in many different systems. Applications range from antijam systems, to code division multiple access systems, to systems designed to combat multipath. It is the intention of this paper to provide a tutorial treatment of the theory of spread-spectrum communications, including a discussion on the applications referred to above, on the properties of common spreading sequences, and on techniques that can be used for acquisition and tracking.

/pdf/theory-of-spread-spectrum-communications-a-tutorial-3dd1zeac6y.pdf

Theory of Spread-Spectrum Communications--A Tutorial

Two closely-related pseudo-random sequence generators are presented: The ${1 / P}$generator, with input P a prime, outputs the quotient digits obtained on dividing 1 by P. The $x^2 \bmod N$generato...

/pdf/a-simple-unpredictable-pseudo-random-number-generator-26nmj1txd2.pdf

A simple unpredictable pseudo random number generator

From the Publisher:
Shift register sequences are used in a broad range of applications, particularly in random number generation, multiple access and polling techniques, secure and privacy communication systems, error detecting and correcting codes, and synchronization pattern generation, as well as in modern cryptographic systems. The first edition of Shift Register Sequences, published in 1967, has been for many years the definitive work on this subject. In the revised edition, Dr. Golomb has added valuable supplemental material. The Revised Edition contains a comprehensive bibliography of some 400 entries which cover the literature concerning the theory and applications of shift register sequences. Written in a clear and lucid style, Dr. Golomb's approach is completely mathematical with rigorous proofs of all assertions. The proofs, however, may be omitted without loss of continuity by the reader who is interested only in results. Dr. Golomb is considered one of the foremost experts in the world with respect to combinatorial and geometrical aspects of coded communications.

Shift register sequences

Preface to the Revised EditionPreface to the First EditionCh. 1Polyominoes and Checkerboards3Ch. 2Patterns and Polyominoes12Ch. 3Where Pentominoes Will Not Fit20Ch. 4Backtracking and Impossible Constructions30Ch. 5Some Theorems about Counting43Ch. 6Bigger Polyominoes and Higher Dimensions70Ch. 7Generalizations of Polyominoes85Ch. 8Tiling Rectangles with Polyominoes97Ch. 9Some Truly Remarkable Results111Appendix A. Answers to Exercises in Chapter 5127Appendix B. Problem Compendium133Appendix C. Golomb's Twelve Pentomino Problems146Appendix D. Klamer's Konstant and the Enumeration of N-Ominoes152Glossary155Bibliography for the First Edition160Comprehensive Bibliography162Name Index183

Solomon W. Golomb

Papers

Shift register sequences

Polyominoes : puzzles, patterns, problems, and packings