ECE 5520: Secure Hardware Design
Spring 2010

Instructor: Patrick Schaumont
Prerequisites: ECE 4514 (or equivalent).
Students need an understanding of contemporary digital design using a hardware description language.

Syllabus (spring 2010)

Summary: Design and implementation of secure hardware at multiple levels of abstraction, covering cryptographic hardware primitives, cryptographic modules, and trusted platforms. Reverse engineering of cryptographic modules using passive attacks, active attacks, and cryptanalytic techniques. Countermeasures against reverse engineering. The course uses case studies and literature surveys to reflect on the state-of-the-art in secure hardware implementation. Cryptography theory is covered on an as-needed basis.

Text Book:
This course is based in part on the following references.

• Understanding Cryptography [Online Version]
  by C. Paar and J. Pelzl (Springer 2009)
• Cryptographic Algorithms on Reconfigurable Hardware [Online Version]
  by F. Rodriguez-Henriquez, N. A. Saqib, A. Diaz-Perez, and C. K. Koc (Springer 2007)
• Cryptographic Engineering [Online Version]
  by Cetin Kaya Koc, Ed. (Springer 2009)
• Power Analysis Attacks: Revealing the secrets of smartcards, [Online Version]
  by Stefan Mangard, Elisabeth Oswald, Thomas Popp (Springer 2007).
• Secure Telecommunication Systems,
  Course notes and slides by Kris Gaj, George Mason University
• Cryptography and Computer Network Security,
  Course notes and slides by Kris Gaj, George Mason University

Additional References:

• Synthesis of Arithmetic Circuits: FPGAs, ASICs, and Embedded Systems
  by Jean-Pierre Deschamps, Gery Bioul, Gustavo Sutter (Wiley 2006).
• Synthesis of Arithmetic Circuits: FPGAs, ASICs, and Embedded Systems
  by Jean-Pierre Deschamps, Gery Bioul, Gustavo Sutter (Wiley 2006).
• Cryptography Engineering,
  by Niels Ferguson, Bruce Schneier, and Tadayoshi Kohno (Wiley 2010).
• Handbook of Applied Cryptography,
  by A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, CRC Press, 1996.
• Guide to Elliptic Curve Cryptogrpahy
  by Darrel Hankerson, Scott Vanstone and Alfred Menezes (Springer 2004)
• A Classical Introduction to Cryptography
  by S. Vaudenay (Springer 2006)
• Elementary Number Theory, Cryptography and Codes
  by M. W. Baldoni, C. Ciliberto and G. M. P. Cattaneo (Springer 2009)
• Encyclopedia of Cryptography and Security
  by H. van Tilborg, Ed. (Springer 2005)
• Cryptography in C and C++
  by M. Welschenbach (Springer 2005)

Questions? Contact the instructor at schaum@vt.edu

• What is Secure Hardware Design?
• The Clipper Chip
• Basic Crypto Ideas

• Standard requirements for RNG
• Classification of RNG: Deterministic and Non-deterministic
• Design of Deterministic RNG
• Design of Non-deterministic RNG: Entropy, Compression Function, Sources of Entropy

• Tests on Random Number Generator
  • Probability density function
  • Hypothesis test = statistic + significance
  • Example statistic: Freq test, Runs test
  • Test Suites: DIEHARD, NIST
• Random Number generator Design
  • DRNG: LCG, RSA
  • TRNG: Epstein, Ring Oscillator, Vasyltsov

• Modular Arithmetic
• Finite Fields
• Prime Fields
• Multiprecision Arithmetic: Multiplication and Squaring
• Reduction Techniques

• Exponentiation
• Montgomery Multiplication
• Montgomery Exponentiation
• NIST Primes

• Polynomial Basis
• Primitve Polynomial
• Addition
• Reduction
• Multiplication

• Bit-parallel Multiplication
• Karatstuba Offman Decomposition
• Montgomery Multiplication
• Other representations - Normal Basis
• Summary of Finite Field Arithmetic

• Elliptic Curves
• EC Group Structure
• Adding and Doubling of Points
• Point Coordinate Systems
• The Point Multiplication

• Making signatures with a point multiplication
• High-speed Point Multiplication on FPGA
• Hardware-supported ECC Cryptanalysis

• Hash function concepts
• Merkle-Damgard construction
• Block-cipher based hash
• Applications
• Implementation Example: MD5

• Hasing History, SHA-3
• Design Example: Whirlpool
• Hash Module Interfaces

• Pipelining/Retiming: Recap
• Block Cipher Structure: SP Network, Feistel Network, Key Schedule
• High-throughput Implementation

• AES History
• AES Round definition
• Standard Hardware Mapping
• SBox Optimization
• Compact Implementation

• Logical vs Physical Attacks
• Timing
• Power Dissipation: Sources and Models
• Taking and Using Measurements

• Simple Power Analysis
• Differential Power Analysis
• Example: DPA on AES Hardware
• Example: DPA on AES Software
• Multi-bit DPA (CPA)
• Power Models

• Types of Faults
• Fault Models
• Fault Attacks on Symmetric-Key Algorithms
• Implementation Atatcks - Summary

• SPA, DPA
• Hiding: WDDL
• Implementation Issues: ASIC, FPGA

• SCA Countermeasures: Hiding and Masking
• Masking Operation
• Masked Functions
• Secret Sharing
• Perfect masking
• Masked Logic Styles: RSL, MDPL

• Plain Point Multiplication
• Double-Add-Always Point Multiplication
• Doubling Attack
• Randomized Double-Add-Always Point Multiplication
• C-Safe Error Attack
• Montgomery Powering Ladder Point Multiplication
• Trade-offs between Attacks and Countermeasures

• IBM 4758
• AEGIS
• ARM Trustzone