Final Testbench: tb_final_shp.sv

Slides:



Advertisements
Similar presentations
6.375 Project Arthur Chang Omid Salehi-Abari Sung Sik Woo May 11, 2011
Advertisements

Exploring timing based side channel attacks against i CCMP Suman Jana, Sneha K. Kasera University of Utah Introduction
MD5 Message Digest Algorithm CS265 Spring 2003 Jerry Li Computer Science Department San Jose State University.
Architectural Support for Operating Systems. Announcements Most office hours are finalized Assignments up every Wednesday, due next week CS 415 section.
SHA (secure hash algorithm) Jen-Chang Liu, 2005 Adapted from lecture slides by Lawrie Brown.
Reducing Cache Misses (Sec. 5.3) Three categories of cache misses: 1.Compulsory –The very first access to a block cannot be in the cache 2.Capacity –Due.
Programmable System on Chip Fully Configurable Mixed Signal Array Allows for Completely Customizable System Designs Capable of Internal MCU.
THIS IS JEOPARDY Mean MedianRange Order of Operations.
Number Starter What is the sum of the first 10 multiples of 12? 1 x 12 = 2 x 12 = 3 x 12 = … 10 x 12 =
Team MUX Adam BurtonMark Colombo David MooreDaniel Toler.
ATmega128RFA1 Power Measurement. ATmega128RFA1 SoC (uC and Transceiver) Up to 16 MHz (i.e. almost 16 MIPS) Voltage range: 1.8v to 3.6v 16K bytes RAM 128.
Examples for the midterm. data = {4,3,6,3,9,6,3,2,6,9} Example 1 Mode = Median = Mean = Standard deviation = Variance = Z scores =
Data Analysis Mean, Median, Mode and Box and Whisker.
1 Hashes and Message Digests. 2 Hash Also known as –Message digest –One-way function Function: input message -> output One-way: d=h(m), but not h’(d)
Datapath Designs CK Cheng CSE Department UC, San Diego.
Primitive Operations. Communication Operations –Reader to tag Read Write –Tag to Tag Read Write Hash and Encryption Operations –Hash: MD5, Sha-1, Sha-256,
Hash and MAC Functions CS427 – Computer Security
Swankoski MAPLD 2005 / B103 1 Dynamic High-Performance Multi-Mode Architectures for AES Encryption Eric Swankoski Naval Research Lab Vijay Narayanan Penn.
Warm Up for 7/21 What are mean, median, mode, and range? How do you find the measures of central tendency?
Find the equation of the line that has... A B C D E F
Performed by:Yulia Turovski Lior Bar Lev Instructor: Mony Orbach המעבדה למערכות ספרתיות מהירות High speed digital systems laboratory הטכניון - מכון טכנולוגי.
RTL Design Methodology Transition from Pseudocode & Interface
Edge Detection. 256x256 Byte image UART interface PC FPGA 1 Byte every a few hundred cycles of FPGA Sobel circuit Edge and direction.
Lecture 5B Block Diagrams HASH Example.
 Inventory Management module is sub divided into different modules as under ◦ Inventory Requisition ◦ Inventory Order Assessment ◦ Inventory Placing.
Administering a heap of H bytes Address = 0Address = H - 1 Free List Pointer :
Milling Circles and Arcs and Milling with Canned Cycles 04/23/08.
An optimization of the SAFER+ algorithm for custom hardware and TMS320C6x DSP implementation. By: Sachin Garg Vikas Sharma.
Run-Length Encoding Project (RLE)
ECE 545 Project 1 Introduction & Specification Part I.
网上报账系统包括以下业务: 日常报销 差旅费报销 借款业务 1. 填写报销内容 2. 选择支付方式 (或冲销借款) 3. 提交预约单 4. 打印预约单并同分类粘 贴好的发票一起送至财务 处 预约报销步骤: 网上报账系统 薪酬发放管理系统 财务查询系统 1.
TOPIC : SEQUENTIAL AND PARALLEL BLOCKS Module 2.3 : Behavioral modeling in verilog.
PICo Arithmetic and Logic Unit The Need for Speed (with minimal area and power)
Copyright © Cengage Learning. All rights reserved. Section 3.1 Measures of Central Tendency: Mode, Median, and Mean.
1 Comparing FPGA vs. Custom CMOS and the Impact on Processor Microarchitecture Henry Wong Vaughn Betz, Jonathan Rose.
ECE 111 (Spring 2017) Professor Bill Lin
Design and Analysis of Low-Power novel implementation of encryption standard algorithm by hybrid method using SHA3 and parallel AES.
GBT-FPGA 120 MHz Modification Status
“The quick brown fox jumps over the lazy dog”
5.6 – Solving Equations with Decimals
MD5 A Hash Algorithm….
Final Project 6 Submission
Counters & Time Delays.
SERIAL PORT PROGRAMMING
14-BIT, 125MHz ADC Module Pedestal Subtraction Mircea Bogdan
Reliable Transport CS 3700 Project 3.
Ticket in the Door Find the mean, median and mode of the data.
© T Madas.
These 19 words are given and fixed
Example Best and Median Results
EMT 348: Microcontroller Timer/counter
MD5 A Hash Algorithm….
מדינת ישראל הוועדה לאנרגיה אטומית
Round ONE: 1. Round ONE: 1 Round One: 1 Teams: 2-5 members Time: 2 minutes Build Item: A TOOL 1.
CORE MIGRATION CORE MIGRATION
Reliable Transport CS 3700 Project 3.
Dynamic High-Performance Multi-Mode Architectures for AES Encryption
Improving IPC by Kernel Design
CS455/CpE 442 Intro. To Computer Architecure
EDLC(Embedded system Development Life Cycle ).
CNET 315 Microprocessor & Assembly Language
COMPUTER NETWORKS CS610 Lecture-5 Hammad Khalid Khan.
UNIT-III Pin Diagram Of 8086
Alireza Hodjat IVGroup
Lecture 23.
RTL Design Methodology Transition from Pseudocode & Interface
How to improve (decrease) CPI
Previously, we discussed about “prototyping” code for SHA1 and SHA256
Unit 1 Statistics Mean, Median and Mode.
CBETA bunch pattern and BPM trigger generator Version 2
Presentation transcript:

Final Testbench: tb_final_shp.sv Message size = 505 bytes → 9 blocks MD5 = 64 rounds/block SHA1 = 80 rounds/block SHA256 = 64 rounds/block #cycles for 1 round/cycle = 9 * (80 + 64 + 64) = 1872 Most implementations require around 2000 cycles (extra cycles needed for overhead) Not possible to take less than 1872 cycles without unfolding (i.e., doing more than 1 round per cycle)

Last Quarter: Top Delay Results Design 1: #ALUTs = 6123, #Registers = 1335, Area = 7458 Fmax = 136.370 MHz, #Cycles = 1772 Delay = 12.994 microsec, Area*Delay = 96.910 millisec*area Design 2: #ALUTs = 3926, #Registers = 1863, Area = 5789 Fmax = 105.230 MHz, #Cycles = 1380 Delay = 13.114 microsec, Area*Delay = 75.918 millisec*area Design 3: #ALUTs = 2150, #Registers = 1172, Area = 3322 Fmax = 142.960 MHz, #Cycles = 1934 Delay = 13.528 microsec, Area*Delay = 44.941 millisec*area

Last Quarter: Top Area/Delay Results Design 1: #ALUTs = 2150, #Registers = 1172, Area = 3322 Fmax = 142.960 MHz, #Cycles = 1934 Delay = 13.528 microsec, Area*Delay = 44.941 millisec*area Design 2: #ALUTs = 2132, #Registers = 1165, Area = 3297 Fmax = 141.700 MHz, #Cycles = 2003 Delay = 14.135 microsec, Area*Delay = 46.605 millisec*area Design 3: #ALUTs = 2582, #Registers = 1271, Area = 3853 Fmax = 138.310 MHz, #Cycles = 1971 Delay = 14.251 microsec, Area*Delay = 54.908 millisec*area

Last Quarter: Median Results Median Delay = 21.222 microsec Median Area*Delay = 99.461 millisec*area

This Quarter: Minimum Passing Delay ≤ 50 microsec Area*Delay ≤ 300 millisec*area

Quartus Optimization Modes You can use different optimization modes for “Delay” results and “Area*Delay” Results (see menu under Compiler Settings) However, “Performance” mode sometimes lead to worse performance and “Area” mode sometimes lead to worse area.