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

EEM 530 - 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
Grading:
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:

  1. Field Operations
  2. Prime Fields and its Arithmetic
  3. Binary fields and its Arithmetic
  4. Extension Fields and its Arithmetic

 


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

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

© 2011 CENG. All rights reserved.

Valid XHTML 1.0 Transitional Valid CSS!