Fault injection attacks on cryptographic devices and countermeasures Part 2
|
|
- Alyson Harris
- 5 years ago
- Views:
Transcription
1 Fult injection ttcks on cryptogrphic devices nd countermesures Prt Isrel Koren Deprtment of Electricl nd Computer Engineering University of Msschusetts Amherst, MA Countermesures - Exmples Must first detect injected fult, then prevent ttcker from observing erroneous output Block the output (e.g., generte ll zeroes output), or Produce rndom output misleding the ttcker, or/nd Erse the secret key fter certin number of ttcks 1. Active protection use sensors to detect vritions in voltge, frequency, light etc IBM 4764 crypto processor. Duplicte encryption (decryption) process (hrdwre or time redundncy) nd compre results injected fults trnsient nd will mnifest differently Sptil dupliction redundnt encryption unit or use decryption unit & compre to originl plintext Temporl dupliction reuse hrdwre or re-execute softwre Above techniques my incur high hrdwre nd/or time penlty
2 3. Error Detecting Codes (EDCs( EDCs) Error-detection codes my require less overhed but possibly hve lower coverge Code genertor, prediction circuits nd comprtor(s) Common Codes (seprble): 1. Prity codes. Residue codes 3. Error correcting codes (e.g., Hmming code) Specilized codes AES liner code for the liner prt nd inverse clcultion for the non-liner prt (S-Box) A nonliner code llowing fult coverge vs. hrdwre overhed trdeoff Performnce nd re overheds Performnce 30% - 100% Are 15% - 170% 3 Error Detecting Codes (EDCs( EDCs) First generte check bits For ech opertion within encryption predict check bits Periodiclly compre predicted check bits to generted ones Predicting check bits for ech opertion - most complex step Should be compred to dupliction 4
3 Exmple: Prity prediction for AES Byte-level prity is nturl - totl of 16 prity bits ShiftRows: rotting the prity bits AddRoundKey: dd prity bits of stte to those of key SubBytes: Expnd Sbox to 56 9 dd output prity bit; to propgte incoming errors (rther thn hving to check) expnd to 51 9 put incorrect prity bit for inputs with incorrect prity ( 7) MixColumns: Expressions below where s i, j is msb of stte byte i,j (7) Trnsformtion Input p0, j= p0, j p, j p3, j S0, j S Prity Bit(s) (input stte mtrix) (7) p = p p p S S Prity Prediction Trnsformtion p p 1, j, j 3, j = p = p 0, j 0, j 1, j p p 1, j 1, j, j p p 3, j, j 3, j S S 1, j (7), j (7) 3, j S S (7) 1, j (7), j (7) 3, j (7) 0, j Predicted Prity Bit(s) Trnsformtion Result (output stte mtrix) 5 AES Scheduling of Checks Compring predicted to generted prity bits After ech opertion After ech round At end of encryption smllest hrdwre & time overheds should not msk error indiction (Error propgtion mtrix) Trnsformtion level SubBytes ShiftRows MixColumns Round level XorRoundKey Encryption level 6
4 Error Coverge Prity bits 100 % coverge of single fults1 7 Error Detection Overheds Design I (S-Box) Are (µm ) Ltency (ns) AT Bse 33, ,069,883 w/error Detection 71, ,999,969 Overhed % +4.55% % Design II (S-Box) Are (µm ) Ltency (ns) AT Bse 6, ,107,4 w/error Detection 59, ,185,67 Overhed % +31.6% % Ltency overhed is minly due to the code comprtor Cn be reduced by moving comprtor out of the criticl pth Common design improvements cn be followed E.g., pipelining to hide ltency 8
5 Reducing the Performnce Overhed Apply complete temporl redundncy to AES but Drsticlly reduce the performnce penlty Double-Dt-Rte (DDR) technique Perform the two encryptions rounds (tht would be compred) during the sme clock cycle Use rising nd flling clock edge Lower mximum clock frequency No penlty if embedded in slow system Detection relies on the two computtions not ffected by the sme fult which cn be multi-cycle one Authors clim: smll percentge (~6%) of undetected fults; goes up to 39% for 6-cycle fults Mistri nd Leveugle, EDCs for other Block Ciphers Other ciphers use different bsic opertions, e.g., Bit-oriented opertions (DES) Modulr rithmetic with unusul modulus (IDEA) Determine the best EDC for given cipher, for exmple: Cipher DES IDEA MARS RC5 RC6 Rijndel (AES) Twofish Suggested Code Prity Residue, but expensive Residue, but expensive Prity or residue Residue Prity, per byte Prity, per byte 10
6 Detection Coverge - RC5 (Residue) 11 Protecting RSA Rndomized multiplictive msking use rndom integers M p = S d p d p mod( p r1) modϕ ( r ) 1 M1 = S mod r1 = S mod( q r) If nd M1 = M p mod r 1 M = M q mod r output M CRT ( M, M ) else Error detected p = q A fult injected during the CRT combintion not detected M q d q d q modϕ ( r ) M = S mod r r1 r Shmir, 1999 Another option: Use Residue codes Fits modulr rithmetic The result residue check bits of ny opertion cn be esily obtined from the check bits of the opernds 1
7 Residue code for RSA: Overheds The residue modulus is 16 1 The lising probbility (i.e., error not detected) is Countermesures - pssive SCAs
8 Countermesures - pssive SCAs Countermesures - pssive SCAs
9 Countermesures - pssive SCAs Countermesures - pssive SCAs
10 Countermesures - pssive SCAs Countermesures - pssive SCAs
11 Countermesures - pssive SCAs Countermesures - pssive SCAs
12 Countermesures - pssive SCAs Countermesures - pssive SCAs
13 Countermesures - pssive SCAs Fult Detection not lwys sufficient Exmple RSA Cn be protected ginst fult injection using residue check or encrypting M & compring to S Is vulnerble to power nlysis more power consumed if d i =1 Modified to use sme power + fult detection Still vulnerble to fult injection Inject fult in clcultion of b if correct M, one bit of d is deduced Fulty result not needed! Shut down if severl fults detected! Yen nd Joye, 000 6
14 Montgomery-step Algorithm Intermedite vlues of & b re used nd n injected fult will be detected Provides nother wy to detect fults: & b must be of form (M,SM) Checking this reltion detects most fults except bits of d or number of loop itertions these must be checked seprtely (e.g., EDC) Joye nd Yen, 00 7 Sfe-error error Resistnt Algorithm Avoid decision tests Check errors in d nd loop counter Error detected if 1 S 0 mod N Girud, 005 Algorithm_4 0 = S S for i from n- to 1 do if (loop counter nd d not modified) then else 1 = = return return error ( S, N, dn 1,..., d0) mod N = mod N 1 0 d d i 1 i 0 = = 0 d mod N i i d ( 1 d 0, ) i mod N mod N 8
15 AES - Successful ttck even if fults detected Provide ll-zero input to AES encryption An initil round key is dded (XOR) : stte=key Before SubBytes inject stuck-t-0 fult into bit j If result is correct then bit j of key is 0 Even duplicting the encryption will not help it does not mtter whether the fult ws detected or not Unless the number of llowed fults is limited Attck is complicted exct timing nd precise loction of fult nd fult type If strict timing nd loction re not prcticl repeting the experiment mny times will llow extrcting the secret key Attck cn be done if byte (or severl bytes) re reset to 0 If key byte j is reset to 0, perform 56 encryptions with byte j of messge ssuming vlues 0 to 55 the one tht mtches the fulty ciphertext revels byte j of key (.k. Collision Fult ttck) Blomer nd Seifert, Combining Pssive nd Active Attcks Mny current cryptogrphic devices include seprte countermesures ginst power ttcks nd fult injection ttcks Two new questions/chllenges Cn countermesure ginst one type of ttcks mke the other one simpler to execute? Wht hppens if the ttcker uses combintion of pssive nd ctive ttcks? 30
16 Cn the presence of error checking circuitry mke power ttck simpler? Correltion Power Anlysis (CPA) Bsed on liner reltionship between power nd Hmming weight of dt processed AES implementtion with no error check circuit Correct key distinguishble fter 160 trces 31 Differentil Power Anlysis 1. Collect mny ciphertexts nd the power trces for the lst round. Guess byte of the finl round key 3. Clculte the trget byte bsed on the guess 4. Select one bit of the trget byte B 5. Divide the power trces into sets: those for B=1 nd those for B=0 6. Clculte the verges of the sets nd the difference between the verges 7. If the verge depends on B there will be spike in the dt indicting correltion 8. If the guess (of the key byte) is correct the power should depend on the vlue of B 3
17 33 34
18 Correltion Power nlysis * Construct power model to estimte the power for every vlue of one byte of the lst round key * Clculte the correltion between the estimted power nd the power trces * The highest correltion indictes the correct key byte 35 Power Attcks in the presence of error checking AES with prity bit per byte Correct key distinguishble fter 130 trces For residue mod 3 code correct key distinguishble fter 100 trces 36
19 Fult Injections tht mke DPA fesible Circuit techniques to protect HW implementtions ginst DPA hve been developed Specilly designed blnced gtes for which the power consumption is equl for ll dt Fults injected in the blncing prt of the circuit will imblnce it but will not cuse logicl error Cn not be detected by ny redundncy scheme If 4 out of 137 gtes were mde imblnced (through fult injection) the protected circuit ws s vulnerble to DPA s n unprotected circuit A possible countermesure is dding differentil current comprtors tht would detect the imblnces Kulikowski, Krpovsky nd Tubin, Protecting RSA ginst DPA nd Fults The fult resistnt lgorithm is multiplictively blinded by rndom number r mking it DPA resistnt s well The increse in execution time vs. Algorithm_4 is bout 45% A fult is not detected if injected during the computtion of = mod N Modified lgorithm developed in 008 by Kim & Quisquter Algorithm_5 Select rndom number r 0 r; 1 = rs; for i from n-1 to 1 do return ( S, N, dn 1,..., d0) = = r 1 = 10 mod N 0 = 0 mod N = mod N d d i i = N i d mod d i = d mod N i = mod N ( 0, 1) Fumroli nd Vigilnt,
20 Protecting AES ginst DPA nd Fults To protect n fult-resistnt AES implementtion ginst DPA one cn msk ll 16 dt bytes with rndom number r1 nd ll key bytes with r Injecting fults in the first XOR opertion using the Collision Fult Attck llowed recovering the key with 11 fult injections (Amiel, Clvier nd Tunstl, 006) To protect ginst the bove use 16 different rndom msks insted of one Cn not use S-Boxes (would need 16 tbles for ech vlue of ri) This implementtion incresed the re by ~40% nd the ltency by ~50% 39 AES DPA nd DFA Recent results Recently (010) modified collision fult ttck ws developed requiring ~1568 fults to be injected One countermesure tht hs been suggested duplicte the AES rounds tht re exposed to the ttck The duplicted rounds should be performed with two different msks Bytes should be processed in rndom order The first 3 nd lst 3 rounds duplicted leding to Ltency overhed of bout 400% vs. the previous 50% 40
21 Conclusions The need to protect cryptogrphic devices ginst pssive nd ctive side chnnel ttcks is well estblished A strong cipher is insufficient Hrdwre nd/or softwre ids must be included in the design to counterct side chnnel ttcks Current techniques incur high overhed Interctions mong different side chnnel ttcks must be further investigted Seprtely protecting ginst individul side chnnel ttcks is insufficient The currently known techniques to counter both pssive nd ctive ttcks hve high overhed 41
What do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationParallel Square and Cube Computations
Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-169 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationEngineer To Engineer Note
Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More informationEECS150 - Digital Design Lecture 23 - High-level Design and Optimization 3, Parallelism and Pipelining
EECS150 - Digitl Design Lecture 23 - High-level Design nd Optimiztion 3, Prllelism nd Pipelining Nov 12, 2002 John Wwrzynek Fll 2002 EECS150 - Lec23-HL3 Pge 1 Prllelism Prllelism is the ct of doing more
More informationUsing Error Detection Codes to detect fault attacks on Symmetric Key Ciphers
Using Error Detection Codes to detect fault attacks on Symmetric Key Ciphers Israel Koren Department of Electrical and Computer Engineering Univ. of Massachusetts, Amherst, MA collaborating with Luca Breveglieri,
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationECEN 468 Advanced Logic Design Lecture 36: RTL Optimization
ECEN 468 Advnced Logic Design Lecture 36: RTL Optimiztion ECEN 468 Lecture 36 RTL Design Optimiztions nd Trdeoffs 6.5 While creting dtpth during RTL design, there re severl optimiztions nd trdeoffs, involving
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationSIMPLIFYING ALGEBRA PASSPORT.
SIMPLIFYING ALGEBRA PASSPORT www.mthletics.com.u This booklet is ll bout turning complex problems into something simple. You will be ble to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give
More informationTransparent neutral-element elimination in MPI reduction operations
Trnsprent neutrl-element elimintion in MPI reduction opertions Jesper Lrsson Träff Deprtment of Scientific Computing University of Vienn Disclimer Exploiting repetition nd sprsity in input for reducing
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More information9 Graph Cutting Procedures
9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationOn String Matching in Chunked Texts
On String Mtching in Chunked Texts Hnnu Peltol nd Jorm Trhio {hpeltol, trhio}@cs.hut.fi Deprtment of Computer Science nd Engineering Helsinki University of Technology P.O. Box 5400, FI-02015 HUT, Finlnd
More informationLooking up objects in Pastry
Review: Pstry routing tbles 0 1 2 3 4 7 8 9 b c d e f 0 1 2 3 4 7 8 9 b c d e f 0 1 2 3 4 7 8 9 b c d e f 0 2 3 4 7 8 9 b c d e f Row0 Row 1 Row 2 Row 3 Routing tble of node with ID i =1fc s - For ech
More informationQubit allocation for quantum circuit compilers
Quit lloction for quntum circuit compilers Nov. 10, 2017 JIQ 2017 Mrcos Yukio Sirichi Sylvin Collnge Vinícius Fernndes dos Sntos Fernndo Mgno Quintão Pereir Compilers for quntum computing The first genertion
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationComputer Arithmetic Logical, Integer Addition & Subtraction Chapter
Computer Arithmetic Logicl, Integer Addition & Sutrction Chpter 3.-3.3 3.3 EEC7 FQ 25 MIPS Integer Representtion -it signed integers,, e.g., for numeric opertions 2 s s complement: one representtion for
More informationCS481: Bioinformatics Algorithms
CS481: Bioinformtics Algorithms Cn Alkn EA509 clkn@cs.ilkent.edu.tr http://www.cs.ilkent.edu.tr/~clkn/teching/cs481/ EXACT STRING MATCHING Fingerprint ide Assume: We cn compute fingerprint f(p) of P in
More informationControl-Flow Analysis and Loop Detection
! Control-Flow Anlysis nd Loop Detection!Lst time! PRE!Tody! Control-flow nlysis! Loops! Identifying loops using domintors! Reducibility! Using loop identifiction to identify induction vribles CS553 Lecture
More informationGeometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationVulnerability Analysis of Electric Power Communication Network. Yucong Wu
2nd Interntionl Conference on Advnces in Mechnicl Engineering nd Industril Informtics (AMEII 2016 Vulnerbility Anlysis of Electric Power Communiction Network Yucong Wu Deprtment of Telecommunictions Engineering,
More informationPrivacy-preserving Social Recommendations in Geosocial Networks
Privcy-preserving Socil Recommendtions in Geosocil Networks Bisheng Liu nd Urs Hengrtner Cheriton School of Computer Science University of Wterloo {bisheng.liu, urs.hengrtner}@ uwterloo.c Abstrct Geosocil
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationLECT-10, S-1 FP2P08, Javed I.
A Course on Foundtions of Peer-to-Peer Systems & Applictions LECT-10, S-1 CS /799 Foundtion of Peer-to-Peer Applictions & Systems Kent Stte University Dept. of Computer Science www.cs.kent.edu/~jved/clss-p2p08
More informationMIPS I/O and Interrupt
MIPS I/O nd Interrupt Review Floting point instructions re crried out on seprte chip clled coprocessor 1 You hve to move dt to/from coprocessor 1 to do most common opertions such s printing, clling functions,
More informationII. THE ALGORITHM. A. Depth Map Processing
Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A
More informationExam #1 for Computer Simulation Spring 2005
Exm # for Computer Simultion Spring 005 >>> SOLUTION
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing
More informationApproximate computations
Living with floting-point numers Stndrd normlized representtion (sign + frction + exponent): Approximte computtions Rnges of vlues: Representtions for:, +, +0, 0, NN (not numer) Jordi Cortdell Deprtment
More informationEncoding techniques for evading n-gram based Intrusion Detection Systems
Encoding techniques for evding n-grm bsed Intrusion Detection Systems Studienrbeit Moritz Bechler moritz.bechler@student.uni-tuebingen.de Universität Tübingen Wilhelm Schickrd Institut SPRING 7 5.7.2012
More informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Globl Informtion Assurnce Certifiction Pper Copyright SANS Institute Author Retins Full Rights This pper is tken from the GIAC directory of certified professionls. Reposting is not permited without express
More informationPractical Statistical Static Timing Analysis with Current Source Models
Prcticl Sttisticl Sttic Timing Anlysis with Current Source Models Debjit Sinh, ldimir Zolotov, Sheshshyee K. ghunthn 2, Michel H. Wood, Kerim Klfl IBM Systems, Poughkeepsie, USA IBM Thoms J. Wtson eserch,
More informationUT1553B BCRT True Dual-port Memory Interface
UTMC APPICATION NOTE UT553B BCRT True Dul-port Memory Interfce INTRODUCTION The UTMC UT553B BCRT is monolithic CMOS integrted circuit tht provides comprehensive MI-STD- 553B Bus Controller nd Remote Terminl
More informationOn the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis
On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es
More informationAccelerating 3D convolution using streaming architectures on FPGAs
Accelerting 3D convolution using streming rchitectures on FPGAs Hohun Fu, Robert G. Clpp, Oskr Mencer, nd Oliver Pell ABSTRACT We investigte FPGA rchitectures for ccelerting pplictions whose dominnt cost
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationDigital Design. Chapter 6: Optimizations and Tradeoffs
Digitl Design Chpter 6: Optimiztions nd Trdeoffs Slides to ccompny the tetbook Digitl Design, with RTL Design, VHDL, nd Verilog, 2nd Edition, by Frnk Vhid, John Wiley nd Sons Publishers, 2. http://www.ddvhid.com
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationA TRIANGULAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Attia Mousa 1 and Eng. Salah M. Tayeh 2
A TRIANGLAR FINITE ELEMENT FOR PLANE ELASTICITY WITH IN- PLANE ROTATION Dr. Atti Mous nd Eng. Slh M. Teh ABSTRACT In the present pper the strin-bsed pproch is pplied to develop new tringulr finite element
More informationEfficient Regular Expression Grouping Algorithm Based on Label Propagation Xi Chena, Shuqiao Chenb and Ming Maoc
4th Ntionl Conference on Electricl, Electronics nd Computer Engineering (NCEECE 2015) Efficient Regulr Expression Grouping Algorithm Bsed on Lbel Propgtion Xi Chen, Shuqio Chenb nd Ming Moc Ntionl Digitl
More informationAn Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
An Efficient Divide nd Conquer Algorithm for Exct Hzrd Free Logic Minimiztion J.W.J.M. Rutten, M.R.C.M. Berkelr, C.A.J. vn Eijk, M.A.J. Kolsteren Eindhoven University of Technology Informtion nd Communiction
More informationCS 268: IP Multicast Routing
Motivtion CS 268: IP Multicst Routing Ion Stoic April 5, 2004 Mny pplictions requires one-to-mny communiction - E.g., video/udio conferencing, news dissemintion, file updtes, etc. Using unicst to replicte
More informationAlgorithm Design (5) Text Search
Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationStack Manipulation. Other Issues. How about larger constants? Frame Pointer. PowerPC. Alternative Architectures
Other Issues Stck Mnipultion support for procedures (Refer to section 3.6), stcks, frmes, recursion mnipulting strings nd pointers linkers, loders, memory lyout Interrupts, exceptions, system clls nd conventions
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More informationApproximation by NURBS with free knots
pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde
More informationScanner Termination. Multi Character Lookahead
If d.doublevlue() represents vlid integer, (int) d.doublevlue() will crete the pproprite integer vlue. If string representtion of n integer begins with ~ we cn strip the ~, convert to double nd then negte
More informationData sharing in OpenMP
Dt shring in OpenMP Polo Burgio polo.burgio@unimore.it Outline Expressing prllelism Understnding prllel threds Memory Dt mngement Dt cluses Synchroniztion Brriers, locks, criticl sections Work prtitioning
More informationAn Integrated Simulation System for Human Factors Study
An Integrted Simultion System for Humn Fctors Study Ying Wng, Wei Zhng Deprtment of Industril Engineering, Tsinghu University, Beijing 100084, Chin Foud Bennis, Dmien Chblt IRCCyN, Ecole Centrle de Nntes,
More informationRevisiting the notion of Origin-Destination Traffic Matrix of the Hosts that are attached to a Switched Local Area Network
Interntionl Journl of Distributed nd Prllel Systems (IJDPS) Vol., No.6, November 0 Revisiting the notion of Origin-Destintion Trffic Mtrix of the Hosts tht re ttched to Switched Locl Are Network Mondy
More informationHVLearn: Automated Black-box Analysis of Hostname Verification in SSL/TLS Implementations
2017 IEEE Symposium on Security nd Privcy HVLern: Automted Blck-box Anlysis of Hostnme Verifiction in SSL/TLS Implementtions Suphnnee Sivkorn, George Argyros, Kexin Pei, Angelos D. Keromytis, nd Sumn Jn
More informationPreserving Constraints for Aggregation Relationship Type Update in XML Document
Preserving Constrints for Aggregtion Reltionship Type Updte in XML Document Eric Prdede 1, J. Wenny Rhyu 1, nd Dvid Tnir 2 1 Deprtment of Computer Science nd Computer Engineering, L Trobe University, Bundoor
More informationISG: Itemset based Subgraph Mining
ISG: Itemset bsed Subgrph Mining by Lini Thoms, Stynryn R Vlluri, Kmlkr Krlplem Report No: IIIT/TR/2009/179 Centre for Dt Engineering Interntionl Institute of Informtion Technology Hyderbd - 500 032, INDIA
More informationEpson Projector Content Manager Operation Guide
Epson Projector Content Mnger Opertion Guide Contents 2 Introduction to the Epson Projector Content Mnger Softwre 3 Epson Projector Content Mnger Fetures... 4 Setting Up the Softwre for the First Time
More informationCSE 401 Midterm Exam 11/5/10 Sample Solution
Question 1. egulr expressions (20 points) In the Ad Progrmming lnguge n integer constnt contins one or more digits, but it my lso contin embedded underscores. Any underscores must be preceded nd followed
More informationEssential Question What are some of the characteristics of the graph of a rational function?
8. TEXAS ESSENTIAL KNOWLEDGE AND SKILLS A..A A..G A..H A..K Grphing Rtionl Functions Essentil Question Wht re some of the chrcteristics of the grph of rtionl function? The prent function for rtionl functions
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationSimplifying Algebra. Simplifying Algebra. Curriculum Ready.
Simplifying Alger Curriculum Redy www.mthletics.com This ooklet is ll out turning complex prolems into something simple. You will e le to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give this
More informationNode-covering, Error-correcting Codes and Multiprocessors with Very High Average Fault Tolerance
IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 9, SEPTEMBER 1997 997 Node-covering, Error-correcting Codes nd Multiprocessors with Very High Averge Fult Tolernce Shntnu Dutt, Member, IEEE, nd Nihr R. Mhptr,
More informationCache Timing Side-Channel Vulnerability Checking with Computation Tree Logic
Cche Timing Side-Chnnel Vulnerbility Checking with Computtion Tree Logic ABSTRACT Cches re one of the key fetures of modern processors s they help to improve memory ccess timing through cching recently
More informationMid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:
Fll term 2012 KAIST EE209 Progrmming Structures for EE Mid-term exm Thursdy Oct 25, 2012 Student's nme: Student ID: The exm is closed book nd notes. Red the questions crefully nd focus your nswers on wht
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationCSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline
CSCI1950 Z Comput4onl Methods for Biology Lecture 2 Ben Rphel Jnury 26, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Outline Review of trees. Coun4ng fetures. Chrcter bsed phylogeny Mximum prsimony Mximum
More informationCSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe
CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()
More informationError-Resilient LZW Data Compression
Error-Resilient LZW t Compression Yonghui Wu Stefno Lonrdi ept. Computer Science & Engineering University of Cliforni Riverside, CA 92521 {yonghui stelo}@cs.ucr.edu Wojciech Szpnkowski eprtment of Computer
More information2014 Haskell January Test Regular Expressions and Finite Automata
0 Hskell Jnury Test Regulr Expressions nd Finite Automt This test comprises four prts nd the mximum mrk is 5. Prts I, II nd III re worth 3 of the 5 mrks vilble. The 0 Hskell Progrmming Prize will be wrded
More information