Skip Navigation Links Türkçe  
Skip Navigation Links.

EEM530 - Hardware Security and Trusted Circuit Design

Instructor: Dr. Öğr. Üyesiİsmail SAN
Teaching Assistants:
Course Book: Debdeep Mukhopadhyay and Rajat Subhra Chakraborty. 2014. Hardware Security: Design, Threats, and Safeguards (1st ed.). Chapman & Hall/CRC
Other Resources:
Course Outline:
1. Week

Syllabus is attached.

2. Week

Introduction to the course.

3. Week
Number Theory:
  • Number sets,
  • Groups, Rings, and Fields,
  • Greatest Common Divisor,
  • Euclidean algorithm, Extended Euclidean algorithm,
  • Multiplicative Inverse,
  • Fermat's Little Theorem,
  • Euler's Phi function, Euler's Theorem

4. Week
Finite Field Arithmetic:
  • Field Operations
  • Prime Fields and its Arithmetic
  • Binary fields and its Arithmetic
  • Extension Fields and its Arithmetic
  • Chinese Remainder Theorem
  • Single Radix Conversion Algorithm

5. Week
  • Modular Addition and Modular Exponentiation
  • RSA Operations and Parameters
  • Montgomery Multiplication 
  • Montgomery Exponentiation
  • Modular Exponentiaition by RL Binary Method
  • Hardware Design Principles 
  • Notation we use for the Block based Design
  • Designing Hardware Architecture for ModExp and its controller via timing diagram or a finite state machine

6. Week
  • Sequential Design Cicurit Principles, State Machines and Diagrams,
  • Carry propagate Adder, Carry Save Adder, Carry Look ahead Adder
  • Circuit Design for a Finite Field Multiplier (Combinational or Sequential Design)
  • An hardware design for a stack

7. Week
  • Introduction to Block Ciphers
  • Hardware Implementation for Block ciphers
  • Hardware implementation for AES-128
  • Designing the block diagram of the Datapath of AES-128
  • Drawing its timing waveform 

8. Week
  • Cryptanalysis on Block Ciphers
  • Security of Block Ciphers, Attack Models, Measures of the Complexity of Cryptanalysis
  • Differential Cryptanalysis
  • Probability of Differential Propagation
  • Differential Propagation in Linear Computations

9. Week
  • Cryptanalysis (continued)
  • Probabilistic Differential Propagation in Nonlinear Computations
  • Differential Characteristic for AES-128 cipher
  • Differential Characteristic for FEAL cipher

10. Week
  • Side-Channel Analysis
  • Power Attacks
  • Information Leakage
  • Simple Power Analysis (SPA)
  • SPA Attack on RSA and its Countermeasure
  • Differential Power Analysis (DPA)
  • DPA Attack on RSA
  • Power analysis for various different RSA algorithms (Square-and-Multiply, Square-and-Multiply-Always, and Montgomery Powering Ladder)
  • DPA-Type Countermeasures

11. Week
  • Physical Unclonable Functions (PUF)
  • Ideal PUF 
  • PUF Types (Delay based PUF, Memory based PUF)
  • Intra-distance and Inter-distance
  • PUF Experiments
  • Helper Data Algorithm and Fuzzy Extractor
  • BCH Codes, Encoding, Decoding

12. Week
  • Fault Tolerant Computing

Home | Department | Undergraduate | Graduate | Research | Accreditations | Alumni

© 2010 CENG. All rights reserved.

Valid XHTML 1.0 Transitional Valid CSS!