Alireza Hodjat IVGroup

Slides:



Advertisements
Similar presentations
AES Side Channel Attacks
Advertisements

TIE Extensions for Cryptographic Acceleration Charles-Henri Gros Alan Keefer Ankur Singla.
H.264 Intra Frame Coder System Design Özgür Taşdizen Microelectronics Program at Sabanci University 4/8/2005.
ECE 734: Project Presentation Pankhuri May 8, 2013 Pankhuri May 8, point FFT Algorithm for OFDM Applications using 8-point DFT processor (radix-8)
Cryptography and Network Security Chapter 5 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Cryptography and Network Security Chapter 5
Graduate Computer Architecture I Lecture 16: FPGA Design.
Bryan Lahartinger. “The Apriori algorithm is a fundamental correlation-based data mining [technique]” “Software implementations of the Aprioiri algorithm.
Zheming CSCE715.  A wireless sensor network (WSN) ◦ Spatially distributed sensors to monitor physical or environmental conditions, and to cooperatively.
Cryptography and Network Security
1 The AES block cipher Niels Ferguson. 2 What is it? Block cipher: encrypts fixed-size blocks. Design by two Belgians. Chosen from 15 entries in a competition.
Team W1 Design Manager: Rebecca Miller 1. Bobby Colyer (W11) 2. Jeffrey Kuo (W12) 3. Myron Kwai (W13) 4. Shirlene Lim (W14) Stage VI: February 25 h 2004.
AES clear a replacement for DES was needed
Cryptography and Network Security (AES) Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 10/18/2009 INCS 741: Cryptography 10/18/20091Dr.
Team W1 Design Manager: Rebecca Miller 1. Bobby Colyer (W11) 2. Jeffrey Kuo (W12) 3. Myron Kwai (W13) 4. Shirlene Lim (W14) Stage VII: March 1 st 2004.
The Design of Improved Dynamic AES and Hardware Implementation Using FPGA 游精允.
Cryptography and Network Security Chapter 5. Chapter 5 –Advanced Encryption Standard "It seems very simple." "It is very simple. But if you don't know.
Dr. Lo’ai Tawalbeh 2007 Chapter 5: Advanced Encryption Standard (AES) Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus.
Study of AES Encryption/Decription Optimizations Nathan Windels.
Chapter 5 Advanced Encryption Standard. Origins clear a replacement for DES was needed –have theoretical attacks that can break it –have demonstrated.
1 University of Palestine Information Security Principles ITGD 2202 Ms. Eman Alajrami 2 nd Semester
Chapter 5 –Advanced Encryption Standard "It seems very simple." "It is very simple. But if you don't know what the key is it's virtually indecipherable."
A Compact and Efficient FPGA Implementation of DES Algorithm Saqib, N.A et al. In:International Conference on Reconfigurable Computing and FPGAs, Sept.
9/17/15UB Fall 2015 CSE565: S. Upadhyaya Lec 6.1 CSE565: Computer Security Lecture 6 Advanced Encryption Standard Shambhu Upadhyaya Computer Science &
Distortion Correction ECE 6276 Project Review Team 5: Basit Memon Foti Kacani Jason Haedt Jin Joo Lee Peter Karasev.
SHA-3 Candidate Evaluation 1. FPGA Benchmarking - Phase Round-2 SHA-3 Candidates implemented by 33 graduate students following the same design.
New Block Cipher for Ultra-Compact Hardware   BeeM みかか A. Satoh K. Aoki.
AMIN FARMAHININ-FARAHANI CHARLES TSEN KATHERINE COMPTON FPGA Implementation of a 64-bit BID-Based Decimal Floating Point Adder/Subtractor.
Swankoski MAPLD 2005 / B103 1 Dynamic High-Performance Multi-Mode Architectures for AES Encryption Eric Swankoski Naval Research Lab Vijay Narayanan Penn.
DES Algorithm Data Encryption Standard. DES Features Block cipher, 64 bits per block 64-bit key, with only 56 bits effective ECB mode and CBC mode.
AES Advanced Encryption Standard. Requirements for AES AES had to be a private key algorithm. It had to use a shared secret key. It had to support the.
May Wu Jinyuan, (Fermilab Huang Yifei (IMSA) 1 An FPGA Computing Demo Core for Space Charge Simulation Wu, Jinyuan (Fermilab)
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU Under-Graduate Project Improving Timing, Area, and Power Speaker: 黃乃珊 Adviser: Prof.
Implementing and Optimizing a Direct Digital Frequency Synthesizer on FPGA Jung Seob LEE Xiangning YANG.
Fifth Edition by William Stallings
Chapter 2 (C) –Advanced Encryption Standard. Origins clearly a replacement for DES was needed –have theoretical attacks that can break it –have demonstrated.
Advanced Encryption Standard Dr. Shengli Liu Tel: (O) Cryptography and Information Security Lab. Dept. of Computer.
RTL Design Methodology Transition from Pseudocode & Interface
2001/02/16TGC off-detector PDR1 Sector Logic Status Report Design Prototype-(-1) Prototype-0 Schedule.
Lecture5 – Introduction to Cryptography 3/ Implementation Rice ELEC 528/ COMP 538 Farinaz Koushanfar Spring 2009.
CDA 4253 FPGA System Design RTL Design Methodology 1 Hao Zheng Comp Sci & Eng USF.
Distortion Correction ECE 6276 Project Review Team 5: Basit Memon Foti Kacani Jason Haedt Jin Joo Lee Peter Karasev.
Design of OCDMA Demonstrator Yun Ping Yang, Alireza Hodjat, Herwin Chan, Eric Chen, Josh Conway.
CS480 Cryptography and Information Security
HPEC 2003 Linear Algebra Processor using FPGA Jeremy Johnson, Prawat Nagvajara, Chika Nwankpa Drexel University.
Backprojection Project Update January 2002
Parallel Beam Back Projection: Implementation
School of Computer Science and Engineering Pusan National University
Automated Extra Pipeline Analysis of Applications mapped to Xilinx UltraScale+ FPGAs
Serial Multipliers Prawat Nagvajara
Data Encryption Standard
Instructor: Dr. Phillip Jones
CGRA Express: Accelerating Execution using Dynamic Operation Fusion
Implementation of IDEA on a Reconfigurable Computer
Software Defined Radio Expanded
Memory Hierarchies.
STUDY AND IMPLEMENTATION
Multiplier-less Multiplication by Constants
UCLA Electrical Engineering Department
UCLA Electrical Engineering Department
ECE 448 Lecture 13 Multipliers Timing Parameters
Dynamic High-Performance Multi-Mode Architectures for AES Encryption
Block Ciphers: DES and AES
SYMMETRIC ENCRYPTION.
Comparison of Various Multipliers for Performance Issues
How to improve (decrease) CPI
Pipelined Array Multiplier Aldec Active-HDL Design Flow
Cryptography and Network Security Chapter 5 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Fiber Optic Transciever Buffer
Advanced Encryption Standard
Presentation transcript:

Alireza Hodjat IVGroup High Throughput AES Alireza Hodjat IVGroup

The AES Algorithm Key Addition Substitution Shift Row Mix Column ki Key Sch_Sub Key Sch_rt Key Sch_xor kn

Outer-round Pipelining

Inner- and Outer-round Pipelining

The Highest Possible Throughput The choice of 128-bit key only Completely unrolled loop Pipelined Between each round (Outer-round) Inside each round (Inner-round) This causes huge area consumption.

Area Optimization Area optimization inside each round Two different techniques: Resource sharing Re-timing Break the critical path and perform the algorithm in multiple clock cycles Critical path: Substitution Area-delay trade-off

Sbox Area-Delay Trade-off Sbox area-delay trade-off for ASIC Design Type Critical path Area Re-timing Direct No-Pipeline 1.19 ns 2.086 Kgates No Indirect 3.67 ns 1.167 Kgates One stage pipeline   0.78 ns 3.51 Kgates Yes 2 pipe stages Three stage pipeline 1.11 ns 1.65 Kgates 3 pipe stages Sbox area-delay trade-off for FPGA Design Type Critical path Area Re-timing Direct No-Pipeline 4.05 ns 136 LUTs No Indirect 10.41 ns 94 LUTs One stage pipeline 3.91 ns Yes 2 pipe stages Three stage pipeline 5.95 ns 90 LUTs 3 pipe stages No-pipeline Using Block RAM   4.87 ns 0 LUTs Direct Implementation: Look-up table Indirect Implementation: GF(24) Wolkerstorfer Design Patrick’s codes  

AES Encrypt Datapath 4 3 2 1 S M +

Key Scheduling Datapath 4 3 2 1 + S

Design 1: Straight Forward 4 3 2 1 S M + 1 Cycle 1 Round

Design 2: Use re-timing for Sbox 4 3 2 1 S M + 1 Cycle 1 Round

Design 3: Use resource sharing 4 3 2 1 M + S-D S-C S-B S-A 4 Cycle 1 Round

Design 4: Use resource sharing and re-timing for Sbox 3 2 1 M + S-A-1 S-A-2 S-C-1 S-C-2 S-B-1 S-B-2 S-D-1 S-D-2 5 Cycle 1 Round 5 Cycle 5 Cycle

Design 5: Resource sharing and pipelining and re-timing for Sbox 4 3 2 1 Mix Column + S-A-1 S-A-2 S-C-1 S-C-2 S-B-1 S-B-2 S-D-1 S-D-2 1 Cycle 1 Round

Inner-Round Pipeline for Design 5 M S2 A 1 2 3 4 1 2 3 4 1 2 3 4 Round 1 Round 2 … Time

Performance Estimation Design   # 1 # 2 # 3 # 4 # 5 Clock per Sample 1 4 5 Pipe stages per round 4 stages 3 stages Total pipe stages 4  10 stages 3  10 stages Latency 4  10 cycles 4  3  10 cycles 5  3  10 cycles (4  10) + 4 cycles FPGA Throughput (200MHz) 25.6 Gbit/s 6.4 Gbit/s ASIC Critical path 1.5 ns 650 MHz 1 ns 1 GHz Estimated Area Less than 500 Kgates Less than 900 Kgates Less than 150 Kgates Less than 300 Kgates Less than 250 Kgates ASIC Throughput (128*650) 83.2 Gbit/s (128*1) 128 Gbit/s (128*650/4) 20.8 Gbit/s (128*1/5) 25.6 Gbit/s (128*1/4) 32 Gbit/s