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

Introduction A fundamental objective of cryptography is to enable two persons to communicate over an insecure channel (a public channel such as the internet) in such a way that any other person is unable to recover their message (called the plaintext ) from what is sent in its place over the channel (the ciphertext ). The transformation of the plaintext into the ciphertext is called encryption , or enciphering. Encryption-decryption is the most ancient cryptographic activity (ciphers already existed four centuries b.c.), but its nature has deeply changed with the invention of computers, because the cryptanalysis (the activity of the third person, the eavesdropper, who aims at recovering the message) can use their power. The encryption algorithm takes as input the plaintext and an encryption key K E , and it outputs the ciphertext. If the encryption key is secret, then we speak of conventional cryptography , of private key cryptography , or of symmetric cryptography . In practice, the principle of conventional cryptography relies on the sharing of a private key between the sender of a message (often called Alice in cryptography) and its receiver (often called Bob). If, on the contrary, the encryption key is public, then we speak of public key cryptography . Public key cryptography appeared in the literature in the late 1970s.

/pdf/boolean-models-and-methods-in-mathematics-computer-science-3vbrnbyptk.pdf

Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes

Part I—Cryptographic Protocols Chapter 2—Protocol Building Blocks 2.

Applied cryptography, second edition : protocols, algorithms,and source code in C

Feedback shift registers with carry operation (FCSRs) are described, implemented, and analyzed with respect to memory requirements, initial loading, period, and distributional properties of their output sequences. Many parallels with the theory of linear feedback shift registers (LFSRs) are presented, including a synthesis algorithm (analogous to the Berlekamp-Massey algorithm for LFSRs) which, for any pseudorandom sequence, constructs the smallest FCSR which will generate the sequence. These techniques are used to attack the summation cipher. This analysis gives a unified approach to the study of pseudorandom sequences, arithmetic codes, combiners with memory, and the Marsaglia-Zaman random number generator. Possible variations on the FCSR architecture are indicated at the end.

/pdf/feedback-shift-registers-2-adic-span-and-combiners-with-4uew5bh2wy.pdf

Feedback shift registers, 2-adic span, and combiners with memory

We find certain neglected issues in the study of private-key encryption schemes. For one, private-key encryption is generally held to the same standard of security as public-key encryption (i.e., indistinguishability) even though usage of the two is very different. Secondly, though the importance of secure encryption of single blocks is well known, the security of modes of encryption (used to encrypt multiple blocks) is often ignored. With this in mind, we present definitions of a new notion of security for private-key encryption called encryption unforgeability which captures an adversary's inability to generate valid ciphertexts. We show applications of this definition to authentication protocols and adaptive chosen ciphertext security.

Additionally, we present and analyze a new mode of encryption, RPC (for Related Plaintext Chaining), which is unforgeable in the strongest sense of the above definition. This gives the first mode provably secure against chosen ciphertext attacks. Although RPC is slightly less efficient than, say, CBC mode (requiring about 33% more block cipher applications and having ciphertext expansion of the same amount when using a block cipher with 128-bit blocksize), it has highly parallelizable encryption and decryption operations.

/pdf/unforgeable-encryption-and-chosen-ciphertext-secure-modes-of-49cf4n311d.pdf

Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation

Blockcipher algorithms are used in a variety of modes for message encryption or message authentication The different modes not all offer the same protection against active eavesdropping In this paper an overview of a number of modes and their protection against active eavesdropping is presented

/pdf/modes-of-blockcipher-algorithms-and-their-protection-against-3qu2c7r2hj.pdf

Modes of blockcipher algorithms and their protection against active eavesdropping

On the key storage requirements for secure terminals

This paper describes the construction of classes of binary sequences, which are obtained by permuting the runs of zeroes and ones of some given periodic binary sequence s = (s0, s1,...,sp-1)?, si ? GF(2). A large class of sequences is constructed by permuting the runs of zeroes and ones of a DeBruijn sequence of given order. The properties of the sequences in this class are discussed. As is known, in this way all DeBruijn sequences of given order are obtained, but also many more sequences with higher complexities, all satisfying Golomb's first and second randomness postulates. It is shown how to generate the sequences in this class with the use of enumerative coding techniques. A more efficient sequence generator, employing shift registers is also introduced. The binary sequence generator obtained in this way can be useful for cryptographic purposes, e.g. in streamcipher systems.

/pdf/on-the-construction-of-run-permuted-sequences-atqe7eippo.pdf

On the construction of run permuted sequences

Protection Against Active Eavesdropping.

Early in 1989, a call for integrity primitives was disseminated within the cryptographic community by the RIPE consortium. The goal of this consortium is to put forward an ensemble of techniques to meet the anticipated requirements of the future Integrated Broadband Communication Network in the European Community. The aim of this paper is to describe the status of the RIPE project.

Cees J. A. Jansen

Papers

Modes of blockcipher algorithms and their protection against active eavesdropping

On the key storage requirements for secure terminals

On the construction of run permuted sequences

Protection Against Active Eavesdropping.

Race Integrity Primitives Evaluation (RIPE): A Status Report