The Simeck Family of Lightweight Block Ciphers
|
|
- Emma Gilmore
- 6 years ago
- Views:
Transcription
1 The Simeck Family of Lightweight Block Ciphers Gagqiag Yag, Bo Zhu, Valeti Suder, Mark D. Aagaard, ad Guag Gog Electrical ad Computer Egieerig, Uiversity of Waterloo Sept 5, 205 Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, 205 / 25
2 Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
3 Simeck s Desig Goals Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
4 Lightweight Cryptography Simeck s Desig Goals Lightweight cryptography is devised to provide suitable, secure, ad compact ciphers (less tha 2000 GEs) that fit ito the resource costraied devices, such as passive RFID tags ad wireless sesor etwork odes. RFID tags Wireless sesor etwork odes Block ciphers: TEA, XTEA, PRESENT, KATAN, LED, EPCBC, KLEIN, LBlock, Piccolo, Twie, SIMON, ad SPECK. Stream ciphers: Trivium, Grai, WG (WG-5, WG-7, WG-8). Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
5 Simeck s Desig Goals A Smaller Block Cipher tha SIMON SIMON is optimized for hardware ad SPECK is optimized for software [Beaulieu et al., 203]. message key roud fu key sched key cost How to desig a smaller cipher family tha SIMON? The registers caot be chaged. We ca reduce the areas of oly the roud fuctio, key schedule, ad key costat. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
6 Simeck s Desig Goals A Smaller Block Cipher tha SIMON SIMON is optimized for hardware ad SPECK is optimized for software [Beaulieu et al., 203]. message key roud fu key sched key cost How to desig a smaller cipher family tha SIMON? The registers caot be chaged. We ca reduce the areas of oly the roud fuctio, key schedule, ad key costat. Simeck Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
7 Simeck s Desig Goals Simeck: A Family of Lightweight Block Ciphers Simeck is desiged to have similar security levels as SIMON but with smaller area. Simeck is desiged by combiig the best features of SIMON ad SPECK. Roud fuctio. Use a modified versio of SIMON s roud fuctio. Key schedule. Use roud fuctio for key schedule, similar to SPECK. Key costat. Use LFSR-based costat for key schedule, similar to SIMON, but simpler. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
8 Simeck s Desig Goals Simeck: A Family of Lightweight Block Ciphers Simeck is desiged to have similar security levels as SIMON but with smaller area. Simeck is desiged by combiig the best features of SIMON ad SPECK. Roud fuctio. Use a modified versio of SIMON s roud fuctio. Key schedule. Use roud fuctio for key schedule, similar to SPECK. Key costat. Use LFSR-based costat for key schedule, similar to SIMON, but simpler. Simeck has three istaces. Simeck32/64, Simeck48/96, Simeck64/28. The umber of rouds for Simeck are idetical with the correspodig SIMON. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
9 Desig Specificatios ad Ratioales Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
10 Desig Specificatios ad Ratioales Roud Fuctio msg i+ msg i msg i+ msg i key i key i SIMON msg i+2 Simeck msg i+2 is the word size (6, 24, 32). Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
11 Desig Specificatios ad Ratioales Roud Fuctio i the Parallel Architecture i mode msg b d i msg a i mode msg b d i msg a b b 0 a a 0 b b 0 a a 0 d out d out 8 2 k i 5 k i SIMON Simeck The parallel architecture processes roud per clock cycle ad the datapath is -bit width. Differet shift umbers do ot affect the area i parallel architecture. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
12 Desig Specificatios ad Ratioales Roud Fuctio i the Fully Serialized Architecture i mode d i d out msg b msg a b b 2 b 8 a a 2 a 8 a0 i mode d i b msg b d out msg a b 5 b0 a a 5 a0 ce ce 2 MUX MUX2 ce 8 MUX8 ce ce 5 MUX MUX5 SIMON (ki)l Simeck (ki)l The fully serialized architecture processes bit per clock cycle ad the datapath is -bit width. Differet shift umbers affect the area i the partially serialized architecture i hardware. Reduce MUX (multiplexer) for the fully serialized architecure. Simplify logic to select the MUXes. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
13 Desig Specificatios ad Ratioales Key Schedule i the Parallel Architecture key i i mode keyd keyc keyb keya d d0 c c0 b b0 a a0 ki 3 C (zj)i SIMON key i i mode keyd keyc keyb keya d d0 c c0 b b0 a a0 ki Simeck 5 C (zj)i Similar as the roud fuctio, the parallel architecture processes roud per clock cycle ad the datapath is -bit width. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, 205 / 25
14 i mode b b 0 a d a 0 d 0 Simplified Key Schedule c 0 Desig Specificatios ad Ratioales c c 0 k i b b 0 a a 0 k i 3 C (z j ) i 5 C (z j ) i SIMON Simeck The combiatioal circuit (dashed box i above) i the key schedule of SIMON ad Simeck i the parallel architecture are show as follows: SIMON Simeck (2 + ) XOR + ( ) XNOR ( + ) XOR + ( ) XNOR + AND I geeral, oe XOR gate is larger tha oe AND gate. Thus, Simeck s key schedule is smaller tha SIMON. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
15 Simplified Key Costat Desig Specificatios ad Ratioales The primitive polyomials for the LFSRs to geerate the key costats for Simeck ad SIMON. Simeck SIMON 32/64 X 5 + X 2 + X 5 + X 4 + X 2 + X + 48/96 X 5 + X 2 + X 5 + X 3 + X 2 + X + 64/28 X 6 + X + X 5 + X 3 + X 2 + X + Simeck s are all 2 XOR gates (4 GEs) less tha the oes used i SIMON. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
16 Desig Specificatios ad Ratioales Key Schedule i the Fully Serialized Architecture i mode key i key d key c key b key a b b 5 b 0 a (k d a 5 a i) l d 5 d 0 c c 5 c 0 0 ce ce 5 MUX MUX5 [C (z j) i] l Simeck Similar as the roud fuctio, the fully serialized architecture processes bit per clock cycle ad the datapath is -bit width. Differet shift umbers affect the area i the fully serialized architecture, as roud fuctio does. Reduce MUX. Simplify logic to select the MUXes. The combiatioal circuit (dashed box) is also decreased. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
17 Hardware Implemetatios Results Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
18 Hardware Implemetatios Results Our Implemetatio Results of Simeck32/64, 48/96, 64/28 i 30m Simeck Simeck32/64 Simeck48/96 CMOS 30m Partial Area (GEs) Max Throughput Total Power Total Power MHz serial Before P&R After P&R (MHz) (Kbps) (µw) (µw) -bit bit bit bit bit bit bit bit bit bit bit bit bit bit bit Simeck64/28 4-bit bit bit bit * Area obtaied by usig sythesis optio compile ultra oly. Area obtaied by usig sythesis optio compile ultra ad clock gatig. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
19 Hardware Implemetatios Results Our Implemetatio Results of SIMON32/64, 48/96, 64/28 i 30m SIMON SIMON32/64 SIMON48/96 CMOS 30m Partial Area (GEs) Max Throughput Total Power Total Power NSA MHz serial Before P&R After P&R Before P&R (MHz) (Kbps) (µw) (µw) -bit bit bit bit bit bit bit bit bit bit bit bit bit bit bit SIMON64/28 4-bit bit bit bit * Area obtaied by usig sythesis optio compile ultra oly. Area obtaied by usig sythesis optio compile ultra ad clock gatig. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
20 Results Compariso betwee Simeck ad SIMON Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
21 Results Compariso betwee Simeck ad SIMON Area (before the Place ad Route) Comparisos i CMOS 30m /28 Areas (GEs) / /64 NSA_SIMON Our_SIMON Our_Simeck Partial Serialized Size (par_sz) Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
22 Results Compariso betwee Simeck ad SIMON Area Comparisos betwee Simeck32/64 ad SIMON32/64 Breakdow of the Results (before the Place ad Route) i CMOS 30m Compoets Parallel (GEs) Fully Serialized (GEs) Simeck SIMON Differece Simeck SIMON Differece Cotrol Roud (comb) Datapath Key (comb) Regs + MUXes Totals Compile simple Compile ultra Compile ultra + clock gatig * Our ow SIMON results. Sythesis optios. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
23 Results Summary Results Compariso betwee Simeck ad SIMON Fully serialized architecture. The roud fuctio, key schedule ad key costat modules of SIMON32/64 accout for oly 6.4% of the total area. Simeck32/64 reduces this by 46%, which leads to 2.3% smaller total area i compariso to our implemetatios of SIMON32/64 ad 3.4% smaller tha the origial results i 30m. Similarly, Simeck48/96, Simeck64/28 are 3.3%, 3.5% smaller tha the origial results i 30m. Parallel architecture. Simeck32/64, 48/96, 64/28 are 3.7%, 3.3%, 3.7% respectively smaller tha the origial results i 30m. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
24 Security Aalysis Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
25 Security Aalysis Security Aalysis Chagig the shift umbers of the roud fuctio iflueces the security [Kölbl et al., CRYPTO 5]. Liear ad differetial diffusio. We made a trade-off betwee security ad area for Simeck. Simeck beefits from SIMON/SPECK s security aalysis due to the similarity betwee SIMON/SPECK ad Simeck [Kölbl ad Roy, eprit 205/706], [Bagheri, eprit 205/76]. Security aalysis summary. Cipher SIMON attacked rouds/total rouds Simeck attacked rouds/total rouds 32/64 23/32 72% (liear hull) 20/ % (impossible differetial) 48/96 25/36 69% (liear hull) 26/36 72% (differetial) 64/28 3/44 70% (liear hull) 33/44 75% (differetial) * [Beaulieu et al., eprit 205/585]. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
26 Coclusios Outlie Simeck s Desig Goals 2 Desig Specificatios ad Ratioales 3 Hardware Implemetatios Results 4 Results Compariso betwee Simeck ad SIMON 5 Security Aalysis 6 Coclusios Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
27 Coclusios Coclusios We have preseted Simeck: a ew family of lightweight block ciphers. We have provided a extesive exploratio for differet hardware architectures i order to make a balace betwee area, throughput, ad power cosumptio for SIMON ad Simeck i both CMOS 30m ad 65m ASICs. We have show that it is possible to desig a smaller cipher tha SIMON i terms of area ad power cosumptio. Simeck is slightly more vulerable tha SIMON to reduced roud attacks, but still has sufficiet margi for real-world applicatios. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
28 Appedix I: Our Implemetatio Results of Simeck32/64, 48/96, 64/28 i 65m Simeck Simeck32/64 Simeck48/96 CMOS 65m Partial Area (GEs) Max Throughput Total Power Total Power MHz Serial Before P&R After P&R (MHz) (Kbps) (µw) (µw) -bit bit bit bit bit bit bit bit bit bit bit bit bit bit bit Simeck64/28 4-bit bit bit bit * Area obtaied by usig sythesis optio compile ultra oly. Area obtaied by usig sythesis optio compile ultra ad clock gatig. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
29 Appedix II: Our Implemetatio Results of SIMON32/64, 48/96, 64/28 i 65m SIMON SIMON32/64 SIMON48/96 CMOS 65m Partial Area (GEs) Max Throughput Total Power Total Power MHz Serial Before P&R After P&R (MHz) (Kbps) (µw) (µw) -bit bit bit bit bit bit bit bit bit bit bit bit bit bit bit SIMON64/28 4-bit bit bit bit * Area obtaied by usig sythesis optio compile ultra oly. Area obtaied by usig sythesis optio compile ultra ad clock gatig. Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
30 Area (before the Place ad Route) Comparisos i CMOS 65m /28 Areas (GEs) / /64 Our_SIMON Our_Simeck Partial Serialized Size (par_sz) Yag, Zhu, Suder, Aagaard, Gog Simeck Family (CHES 205) Sept 5, / 25
BASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationOptimized Hardware Implementations of Lightweight Cryptography
Optimized Hardware Implementations of Lightweight Cryptography by Gangqiang Yang A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy
More informationLecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 2 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationLecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram
Lecture 3 RTL Desig Methodology Trasitio from Pseudocode & Iterface to a Correspodig Block Diagram Structure of a Typical Digital Data Iputs Datapath (Executio Uit) Data Outputs System Cotrol Sigals Status
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationDesign Space Exploration of the Lightweight Stream Cipher WG-8 for FPGAs and ASICs
Design Space Exploration of the Lightweight Stream Cipher WG- for FPGAs and ASICs Gangqiang Yang, Xinxin Fan, Mark Aagaard and Guang Gong University of Waterloo g37yang@uwaterloo.ca Sept 9, 013 Gangqiang
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More informationModule Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two
Give submodule mux32two: 2-to- MUX module mux32two (iput [3:] i,i, iput sel, output [3:] out); Module Istatiatio Fiite Machies esig methodology for sequetial logic -- idetify distict s -- create trasitio
More informationMessage Integrity and Hash Functions. TELE3119: Week4
Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationAnnouncements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components
Aoucemets Readig Chapter 4 (4.1-4.2) Project #4 is o the web ote policy about project #3 missig compoets Homework #1 Due 11/6/01 Chapter 6: 4, 12, 24, 37 Midterm #2 11/8/01 i class 1 Project #4 otes IPv6Iit,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationPolitecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects
Politecico di Milao Advaced Network Techologies Laboratory Iteret of Thigs Projects 2016-2017 Politecico di Milao Advaced Network Techologies Laboratory Geeral Rules Geeral Rules o Gradig 26/30 are assiged
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationSPIRAL DSP Transform Compiler:
SPIRAL DSP Trasform Compiler: Applicatio Specific Hardware Sythesis Peter A. Milder (peter.milder@stoybroo.edu) Fraz Frachetti, James C. Hoe, ad Marus Pueschel Departmet of ECE Caregie Mello Uiversity
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationPerformance Analysis of Multiclass FIFO: Motivation, Difficulty and a Network Calculus Approach
Performace Aalysis of Multiclass FIFO: Motivatio, Difficulty ad a Network alculus Approach Yumig Jiag Norwegia Uiversity of Sciece ad Techology (NTNU) 1 19 March 2014, 2d Workshop o Network alculus, Bamberg,
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More informationCTx / CTx-II. Ultra Compact SD COFDM Concealment Transmitters. Features: Options: Accessories: Applications:
Ultra Compact SD COFDM Cocealmet Trasmitters Features: Optimized for size Broadcast quality video H.264 Part 10 2 moo audio chaels Very low power cosumptio Remote cotrol via micro USB Bluetooth * Adroid
More informationAlgorithm Design Techniques. Divide and conquer Problem
Algorithm Desig Techiques Divide ad coquer Problem Divide ad Coquer Algorithms Divide ad Coquer algorithm desig works o the priciple of dividig the give problem ito smaller sub problems which are similar
More informationPrivate Key Cryptography. TELE3119: Week2
Private Key Cryptography TELE3119: Week2 Private Key Ecryptio Also referred to as: covetioal ecryptio symmetric key ecryptio secret-key or sigle-key ecryptio Oly alterative before public-key ecryptio i
More informationSecurity of Bluetooth: An overview of Bluetooth Security
Versio 2 Security of Bluetooth: A overview of Bluetooth Security Marjaaa Träskbäck Departmet of Electrical ad Commuicatios Egieerig mtraskba@cc.hut.fi 52655H ABSTRACT The purpose of this paper is to give
More informationCMSC Computer Architecture Lecture 5: Pipelining. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 5: Pipeliig Prof. Yajig Li Uiversity of Chicago Admiistrative Stuff Lab1 Due toight Lab2: out later today; due 2 weeks from ow Review sessio this Friday Turig award
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationCMSC Computer Architecture Lecture 3: ISA and Introduction to Microarchitecture. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 3: ISA ad Itroductio to Microarchitecture Prof. Yajig Li Uiversity of Chicago Lecture Outlie ISA uarch (hardware implemetatio of a ISA) Logic desig basics Sigle-cycle
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationCMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago
CMSC 22200 Computer Architecture Lecture 12: Virtual Memory Prof. Yajig Li Uiversity of Chicago A System with Physical Memory Oly Examples: most Cray machies early PCs Memory early all embedded systems
More informationExtending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis
Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationLightweight Cryptography: Designing Crypto for Low Energy and Low Power
Lightweight Cryptography: Designing Crypto for Low Energy and Low Power Miroslav Knežević NXP Semiconductors miroslav.knezevic@nxp.com September 12, 2015 WEEE 2015, Espoo, Finland Cryptography The Art
More informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationThe Idea. Leader Election. Outline. Why Rings? Network. We study leader election in rings. Specification of Leader Election YAIR. Historical reasons
The Idea Leader Electio Network We study leader electio i rigs Why Rigs? Outlie Specificatio of Leader Electio Historical reasos origial motivatio: regeerate lost toke i toke rig etworks Illustrates techiques
More informationWorld Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible
World Scietific Research Joural (WSRJ) ISSN: 2472-3703 www.wsr-j.org Research o Fresel Les Optical Receivig Atea i Idoor Visible Light Commuicatio Zhihua Du College of Electroics Egieerig, Chogqig Uiversity
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES
ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationDifferential Analysis on Simeck and SIMON with Dynamic Key-guessing Techniques
Differential Analysis on Simeck and SIMON with Dynamic Key-guessing Techniques Kexin Qiao,2, Lei Hu,2, Siwei Sun,2 State Key Laboratory of Information Security, Institute of Information Engineering, Chinese
More informationGoals of the Lecture Object Constraint Language
Goals of the Lecture Object Costrait Laguage Object-Orieted Aalysis ad Desig - Fall 1998 Preset the Object Costrait Laguage Ð As best as possible, with the limited iformatio available from UML i a Nutshell
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationGeneration of Distributed Arithmetic Designs for Reconfigurable Applications
Geeratio of Distributed Arithmetic Desigs for Recofigurable Applicatios Christophe Bobda, Ali Ahmadiia, Jürge Teich Uiversity of Erlage-Nuremberg Departmet of computer sciece Am Weichselgarte 3, 91058
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationAnalysis of Algorithms
Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite
More informationELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 5173L Digital Sigal Processig Itroductio to TMS320C6713 DSK Dr. Jigia Wu wuj@uar.edu ANALOG V.S DIGITAL 2 Aalog sigal processig ASP Aalog sigal
More informationThe identification of key quality characteristics based on FAHP
Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationA NOTE ON COARSE GRAINED PARALLEL INTEGER SORTING
Chater 26 A NOTE ON COARSE GRAINED PARALLEL INTEGER SORTING A. Cha ad F. Dehe School of Comuter Sciece Carleto Uiversity Ottawa, Caada K1S 5B6 æ {acha,dehe}@scs.carleto.ca Abstract Keywords: We observe
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationA Key Distribution method for Reducing Storage and Supporting High Level Security in the Large-scale WSN
Iteratioal Joural of Digital Cotet Techology ad its Applicatios Vol. 2 No 1, March 2008 A Key Distributio method for Reducig Storage ad Supportig High Level Security i the Large-scale WSN Yoo-Su Jeog *1,
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationFPGA IMPLEMENTATION OF BASE-N LOGARITHM. Salvador E. Tropea
FPGA IMPLEMENTATION OF BASE-N LOGARITHM Salvador E. Tropea Electróica e Iformática Istituto Nacioal de Tecología Idustrial Bueos Aires, Argetia email: salvador@iti.gov.ar ABSTRACT I this work, we preset
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationImproved triangular subdivision schemes 1
Improved triagular subdivisio schemes Hartmut Prautzsch 2 Georg Umlauf 3 Faultät für Iformati, Uiversität Karlsruhe, D-762 Karlsruhe, Germay E-mail: 2 prau@ira.ua.de 3 umlauf@ira.ua.de Abstract I this
More informationEfficient Synthesis of Networks On Chip
Efficiet Sythesis of Networks O Chip Alessadro Pito Luca P. Carloi Alberto L. Sagiovai-Vicetelli EECS Departmet, Uiversity of Califoria at Berkeley, Berkeley, CA 947-77 Abstract We propose a efficiet heuristic
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More informationOutline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs
Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationquality/quantity peak time/ratio
Semi-Heap ad Its Applicatios i Touramet Rakig Jie Wu Departmet of omputer Sciece ad Egieerig Florida Atlatic Uiversity oca Rato, FL 3343 jie@cse.fau.edu September, 00 . Itroductio ad Motivatio. relimiaries
More informationPrimitive polynomials selection method for pseudo-random number generator
Joural of hysics: Coferece Series AER OEN ACCESS rimitive polyomials selectio method for pseudo-radom umber geerator To cite this article: I V Aiki ad Kh Alajjar 08 J. hys.: Cof. Ser. 944 0003 View the
More informationModel Enhancement in Data Mining: Calibration, ROC Analysis, Model Combination and Mimetic Models
Model Ehacemet i Miig: Calibratio, ROC Aalysis, Model Combiatio ad Mimetic Models José Herádez-Orallo Dpto. de Sistemas Iformáticos y Computació, Uiversidad Politécica de Valecia, jorallo@dsic.upv.es Rome,
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationK-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns
K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge
More informationWhat Is Object-Orientation?
Iformatio Systems Cocepts What Is Object-Orietatio? Roma Kotchakov Birkbeck, Uiversity of Lodo Based o Chapter 4 of Beett, McRobb ad Farmer: Object Orieted Systems Aalysis ad Desig Usig UML, (4th Editio),
More informationNON-LINEAR MODELLING OF A GEOTHERMAL STEAM PIPE
14thNew Zealad Workshop 1992 NON-LNEAR MODELLNG OF A GEOTHERMAL STEAM PPE Y. Huag ad D. H. Freesto Geothermal stitute, Uiversity of Aucklad SUMMARY Recet work o developig a o-liear model for a geothermal
More informationENGR Spring Exam 1
ENGR 300 Sprig 03 Exam INSTRUCTIONS: Duratio: 60 miutes Keep your eyes o your ow work! Keep your work covered at all times!. Each studet is resposible for followig directios. Read carefully.. MATLAB ad
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationThe following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:
DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationFURTHER INTEGRATION TECHNIQUES (TRIG, LOG, EXP FUNCTIONS)
Mathematics Revisio Guides More Trigoometric ad Log Itegrals Page of 7 MK HOME TUITION Mathematics Revisio Guides Level: AS / A Level AQA : C Edexcel: C OCR: C OCR MEI: C FURTHER INTEGRATION TECHNIQUES
More information