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

In this paper the problem of finding the absolutely shortest (possibly nonlinear) feedback shift register, which can generate a given sequence with characters from some arbitrary finite alphabet, is considered To this end, a new complexity measure is denned, called the maximum order complexity A new theory of the nonlinear feedback shift register is developed, concerning elementary complexity properties of transposed and reciprocal sequences, and feedback functions of the maximum order feedback shift register equivalent Moreover, Blumer's algorithm is identified as a powerful tool for determining the maximum order complexity profile of sequences, as well as their period, in linear time and memory The typical behaviour of the maximum order complexity profile is shown and the consequences for the analysis of given sequences and the synthesis of feedback shift registers are discussed

/pdf/the-shortest-feedback-shift-register-that-can-generate-a-2itf53nr9y.pdf

The Shortest Feedback Shift Register That Can Generate A Given Sequence

In this paper we extend the theory of maximum order complexity from a single sequence to an ensemble of sequences. In particular, the maximum order complexity of an ensemble of sequences is defined and its properties discussed. Also, an algorithm is given to determine the maximum order complexity of an ensemble of sequences linear in time and memory. It is also shown how to determine the maximum order feedback shift register equivalent of a given ensmble of sequences, i.e. including a feedback function. Hence, the problem of finding the absolutely shortest (possibly nonlinear) feedback shift register, that can generate two or more given sequences with characters from some arbitrary finite alphabet, is solved. Finally, the consequences for sequence prediction based on the minimum number of observations are discussed.

/pdf/the-maximum-order-complexity-of-sequence-ensembles-25wu63anku.pdf

The maximum order complexity of sequence ensembles

The first aim of this paper is to situate the call for integrity and authentication algorithms within research on cryptography and within evolution of telecommunication. Motivations for submitting primitives and details on the submission process are also given.

/pdf/a-european-call-for-cryptographic-algorithms-ripe-race-34yrhfmvho.pdf

A European call for cryptographic algorithms: ripe, race integrity primitives evaluation

Blumer's algorithm can be used to build a Directed Acyclic Word Graph (DAWG) in linear time and memory from a given sequence of characters. In this paper we introduce the DAWG and show that Blumer's algorithm can be used very effectively to determine the maximum order (or nonlinear) complexity profile of a given sequence. We also show that this algorithm can be used to determine the period of a periodic sequence in linear time and memory. It also appears that the DAWG is an even more efficient means of generating the sequence, given a number of characters, than e.g. the nonlinear feedback shift register equivalent of that sequence, as it always needs the least amount of characters to generate the remainder of the sequence.

On the significance of the directed acyclic word graph in cryptology

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.

/pdf/race-integrity-primitives-evaluation-ripe-a-status-report-4fnlelabjy.pdf

Cees J. A. Jansen

Papers

The Shortest Feedback Shift Register That Can Generate A Given Sequence

The maximum order complexity of sequence ensembles

A European call for cryptographic algorithms: ripe, race integrity primitives evaluation

On the significance of the directed acyclic word graph in cryptology

Race integrity primitives evaluation (RIPE): a status report