INTRODUCTION

Cryptography

Data Security

Cryptographic Systems

• Public-Key Systems
• Digital Signatures

Information Theory

• Entropy and Equivocation
• Perfect Secrecy
• Unicity Distance

Complexity Theory

• Algorithm Complexity
• Problem Complexity and NP-Completeness
• Ciphers Based on Computationally Hard Problems

Number Theory

• Congruences and Modular Arithmetic
• Computing Inverses
• Computing in Galois Fields

ENCRYPTION ALGORITHMS

Transposition Ciphers

Simple Substitution Ciphers

• Single-Letter Frequency Analysis

Homophonic Substitution Ciphers

• Beale Ciphers
• Higher-Order Homophonics

Polyalphabetic Substitution Ciphers

• Vigen6re and Beaufort Ciphers
• Index of Coincidence
• Kasiski Method
• Running-Key Ciphers
• Rotor and Hagelin Machines
• Vernam Cipher and One-Time Pads

Polygram Substitution Ciphers

• Playfair Cipher
• Hill Cipher

Product Ciphers

• Substitution-Permutation Ciphers
• The Data Encryption Standard (DES)
• Time-Memory Tradeoff

Exponentiation Ciphers

• Pohlig-Hellman Scheme
• Rivest-Shamir-Adleman (RSA) Scheme
• Mental Poker
• Oblivious Transfer

Knapsack Ciphers

• Merkle-Hellman Knapsacks
• Graham-Shamir Knapsacks
• Shamir Signature-Only Knapsacks
• A Breakable NP-Complete Knapsack

CRYPTOGRAPHIC TECHNIQUES

Block and Stream Ciphers

Synchronous Stream Ciphers

• Linear Feedback Shift Registers
• Output-Block Feedback Mode
• Counter Method

Self-Synchronous Stream Ciphers

• Autokey Ciphers
• Cipher Feedback

Block Ciphers

• Block Chaining and Cipher Block Chaining
• Block Ciphers with Subkeys

Endpoints of Encryption

• End-to-End versus Link Encryption
• Privacy Homomorphisms

One-Way Ciphers

• Passwords and User Authentication

Key Management

• Secret Keys
• Public Keys
• Generating Block Encryption Keys
• Distribution of Session Keys

Threshold Schemes

• Lagrange Interpolating Polynomial Scheme
• Congruence Class Scheme

ACCESS CONTROLS

Access-Matrix Model

• The Protection State
• State Transitions
• Protection Policies

Access Control Mechanisms

• Security and Precision
• Reliability and Sharing
• Design Principles

Access Hierarchies

• Privileged Modes
• Nested Program Units

Authorization Lists

• Owned Objects
• Revocation

Capabilities

• Domain Switching with Protected Entry Points
• Abstract Data Types
• Capability-Based Addressing
• Revocation
• Locks and Keys
• Query Modification

Verifiably Secure Systems

• Security Kernels
• Levels of Abstraction
• Verification

Theory of Safe Systems

• Mono-Operational Systems
• General Systems
• Theories for General Systems
• Take-Grant Systems

INFORMATION FLOW CONTROLS

Lattice Model of Information Flow

• Information Flow Policy
• Information State
• State Transitions and Information Flow
• Lattice Structure
• Flow Properties of Lattices

Flow Control Mechanisms

• Security and Precision
• Channels of Flow

Execution-Based Mechanisms

• Dynamically Enforcing Security for Implicit Flow
• Flow-Secure Access Controls
• Data Mark Machine
• Single Accumulator Machine

Compiler-Based Mechanism

• Flow Specifications
• Security Requirements
• Certification Semantics
• General Data and Control Structures
• Concurrency and Synchronization
• Abnormal Terminations

Program Verification

• Assignment
• Compound
• Alternation
• Iteration
• Procedure Call
• Security

Flow Controls in Practice

• System Verification
• Extensions
• A Guard Application

INFERENCE CONTROLS

Statistical Database Model

• Information State
• Types of Statistics
• Disclosure of Sensitive Statistics
• Perfect Secrecy and Protection
• Complexity of Disclosure

Inference Control Mechanisms

• Security and Precision
• Methods of Release

Methods of Attack

• Small and Large Query Set Attacks
• Tracker Attacks
• Linear System Attacks
• Median Attacks
• Insertion and Deletion Attacks

Mechanisms that Restrict Statistics

• Cell Suppression
• Implied Queries
• Partitioning

Mechanisms that Add Noise

• Response Perturbation (Rounding)
• Random-Sample Queries
• Data Perturbation
• Data Swapping
• Randomized Response (Inquiry)