Interested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
|
|
- Lenard Reynolds
- 5 years ago
- Views:
Transcription
1 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 written permission. Interested in lerning more? Check out the list of upcoming events offering "Security Essentils Bootcmp Style (Security 4)" t
2 A Look t Some of the Mthemtics Behind Rijndel Brett Crpenter Jnury 4, Introduction As lymn, I hve often been frustrted by the wy in which the mechnics of ciphers re pssed off s blck box into which plintext is inserted nd from which, with the help of mgic, ciphertext is retrieved. The brnch of mthemtics behind this mgic is known s cryptology. The purpose of this pper is to shed tiny ry of light on the concepts t work in this field. Specific ttention will be pid to Rijndel (pronounced Rhine-dhl), the Ntionl Institute of Stndrds nd Technology s recent choice for the Advnced Encryption Stndrd (AES). Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 I pologize in dvnce to ny mthemticins who might hppen to red this pper. Objectives The objectives of this pper re s follows: To introduce, t very high level, some of the concepts in mthemtics underlying cryptology nd the Rijndel block cipher To describe the Rijndel block cipher in light of these concepts Mthemticl Bckground The mthemticl concepts mentioned in the following sections re tken loosely from the fields of lgebr nd nlysis. This section describes the model tht the designers of Rijndel used to represent binry dt. Fields A field is set clled F, for exmple long with two opertions, ddition ( ) nd multipliction ( ). F is closed under these opertions; tht is, the sum or product of ny two elements of F is lso n element of F. A mthemticin might express this property s follows:, b F b F, b F b F It is importnt to note tht these opertions need not be wht we think of s stndrd ddition (+) nd multipliction (*); thus the use of the lternte symbols. SANS Institute -, Author retins full rights. The properties of field include the following, mong others: Key fingerprint Addition = is AF9 commuttive: FA7 F94 998D b = bfdb5 DED F8B5 6E4 A69 4E46 Multipliction is distributive: ( b c) = ( b) ( c) The rel number system, R, is n exmple of field. SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
3 GF( 8 ) A finite field tht is, field contining finite number of elements is used s the bsis for Rijndel: GF( 8 ). This is the Glois Field (GF) contining 8, or 56, elements. Note tht ny byte vlue cn be mpped to exctly one element of GF( 8 ). A common representtion of the elements of GF( 8 ) is polynomil of degree seven with coefficients in {,}. Go with me on this one! A byte, b, consisting of bits b 7 b 6 b 5 b 4 b b b b, is the mpped to GF( 8 ) s the polynomil x b6x + b5x + b4 x + b x + bx + b x b b + +. Key Exmple fingerprint : = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 The byte with hex vlue 9 (binry ) is mpped to 6 4 x + x + x + x. Sounds like this might come in hndy when deling with binry dt, right? Addition nd Multipliction in GF( 8 ) Rel numbers cn be dded nd multiplied. All of us do this every dy. For exmple, + = 4. Well, there is n nlogous opertion in GF( 8 ). The ddition ( ) of two elements results in the polynomil with coefficients tht re given by the sum modulo. Exmple : Written in hex, we hve: Or, in binry, we hve: x x + x + x + x = x + x + D4 = 98. SANS Institute -, Author retins full rights. =. x Thus, ddition ( ) in GF( 8 ) is the stndrd bitwise XOR opertion. Pretty Key strightforwrd fingerprint = so AF9 fr! FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 Multipliction ( ) is little trickier. It corresponds with multipliction of the polynomils modulo m(x), where SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
4 8 m ( x) = x + x + x + x + 4 or B in hex. Well, I hven t modulo d polynomil recently, but this is done to ensure tht the product is in fct n element of GF( 8 ), mong other things. Sounds resonble, though. Exmple : 4 7 ( x + x + ) ( x + x + x) = x( + x + x ) + ( x + x + x ) + ( x + x + x) = x + x + x + x + x Then, clculte the previous result modulo m(x): Key fingerprint = AF9 7 FA7 4 F94 998D FDB5 8 DED 4 x x x x x x x x F8B5 x 6E47 x A = + x + 4E46 ( ) mod( ) x + x + x This is equivlent to 5 4 = 9E in hex. 6 Like the ddition opertion in GF( 8 ), the multipliction opertion stisfies the requisite properties of field, s described bove. Result: 5 We now hve n bstrct representtion of our binry dt tht includes some bsic mthemticl opertions. Why Does Any of This Mtter? The steps described bove hve resulted in the following: digitl informtion, represented t the lowest logicl level s bits nd bytes, cn be mpped to mthemticl model tht hs certin nice qulities. In the cse of Rijndel, tht model is the finite field GF( 8 ). These qulities, nd their implictions, re then ultimtely used to encipher nd decipher the dt. For exmple, polynomils with coefficients in GF( 8 ) cn be used to represent rrys of bytes or multi-byte words. If,,, nd re elements of GF( 8 ), then x + x + x + is used to represent 4-byte vector, or 4-element rry of bytes, or 4-byte word. Imgine it s n rry of rrys. Thus, this model lends itself well to opertions t both the byte nd word level. These byte- nd word-level representtions re lso convenient for cipher tht is to be implemented on modern computer. SANS Institute -, Author retins full rights As nother exmple, multipliction of polynomils with coefficients in GF( 8 ) is done Key modulo fingerprint M(x), where = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 M ( x) = x 4 +, nd cn be conveniently represented s mtrix opertion: SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
5 c c c c = Agin, this lends itself well to being implemented on computer. Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 Finlly, multipliction by the polynomil x corresponds with bit-level shift left nd n XOR with the hex vlue B. This cn lso be represented s mtrix opertion: b b, b b where n nd b n re two polynomils of degree nd c n is their product: c c c c where c n is the product of x nd b n : The Rijndel Block Cipher = n b n = c n. x b n = c n. b b b b Overview As you might expect from the bckground given bove, the Rijndel block cipher is designed to use simple whole-byte opertions. Its supports independent key nd block sizes of 8, 9, or 56 bits. The description of the lgorithm given here is for the cse where key nd block sizes re both 8 bits. The Rounds Rijndel is composed of n initil XOR step, nine round trnsformtions (or rounds), nd n dditionl round performed t the end with one step omitted. The input to ech round is clled the Stte. Ech of the first nine rounds is in turn composed of four trnsformtions: SANS Institute -, Author retins full rights. ByteSub Key ShiftRow fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 MixColumn AddRoundKey The MixColumn trnsformtion is omitted from the tenth round. SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
6 The Inputs Since 8 bits is 6 bytes, our Stte ( m,n ) nd Cipher Key (k m,n ) cn be represented by 4*4 mtrices. Ech column contins four consecutive bytes, so ech successive row is word. The order of the bytes in the input block is preserved in this mnner..... k. k. k. k.,,,, k, k, k, k, k k k k,,,,,,,,,,,, k, k, k, k, The Stte The Cipher Key Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 The initil step is to XOR the Stte with Round Key. See AddRoundKey, below. Trnsformtion - ByteSub In this step, the individul bytes of the input block re substituted ccording to vlues given in n S-Box, or Substitution Tble. The Rijndel specifiction includes formul for creting this S-Box. In brief, given byte vlue is replced with its reciprocl in GF( 8 ), multiplied by bitwise modulo mtrix, nd XORed with hex 6. Some smple input nd corresponding ByteSub vlues re: Input ByteSub FF Trnsformtion - ShiftRow Next, the individul rows of the Stte re shifted left s follows: Exmple Row Offset SANS Institute -, Author retins full rights ShiftRow Key fingerprint = AF9 FA7 7 F D FDB5 DED 5 F8B5 6E4 7 A69 4E SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
7 Trnsformtion - MixColumn Next, ech column of the Stte is multiplied by the polynomil c(x) = x + x + x +, which is equivlent to multipliction by the mtrix. Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 Trnsformtion 4 - AddRoundKey Finlly, the Round Key is XORed with the Stte. An Expnded Key is generted from the Cipher Key by process clled Key Expnsion, which cn be performed before or during the cipher process. The result is key whose length is times the length of the originl Cipher Key, or 48 bits in our cse. The contents consists of the originl Cipher Key, followed by 8-bit blocks consisting of four-byte words such tht ech word is the XOR of the preceding four-byte word nd either the corresponding word in the previous block or function of it. Ech Round Key is 8-bit block of the Expnded Key. The Big Picture The steps of Rijndel re s follows: Initil AddRoundKey Round ByteSub ShiftRow MixColumn AddRoundKey Round 9 Byte Sub ShiftRow MixColumn AddRoundKey Round Byte Sub ShiftRow AddRoundKey Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 The following is nice illustrtion of Rijndel round: SANS Institute -, Author retins full rights. SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
8 Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 The Inverse Cipher The inverse of round is s follows: AddRoundKey InverseMixColumn InverseShiftRow InverseByteSub Figure : A Rijndel Round The AddRoundKey trnsformtion is simple XOR, nd so is its own inverse. By design, the other trnsformtions re invertible, so decryption is firly strightforwrd. This is one of those instnces where the nice qulities of GF( 8 ) come in hndy! Conclusion The mthemtics of cryptology is extremely complex nd lgorithm described bove ws designed to thwrt the efforts of cryptnlysts, or those who ttempt to brek ciphers. For exmple, they introduce confusion nd diffusion to foil sttisticl nlysis. The true brillince t work here is of course beyond the scope of this pper. It is, however, possible for us non-cryptologists to t lest visulize wht might occur to dt s it psses through cipher. SANS Institute -, Author retins full rights. References. Bltimore Technologies. Technicl Overview of RIJNDAEL - The AES. URL: Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 (4 Jn. ).. Rijmen, Vincent. Rijndel. 4 Dec.. URL: (4 Jn ). SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
9 . RSA Security. RSA Lbortories Frequently Asked Questions bout Tody s Cryptogrphy, Version 4... URL: (4 Jn. ). 4. Svrd, John J.G. The Advnced Encryption Stndrd (Rijndel).. URL: (4 Jn. ). 5. Schneier, Bruce. Applied Cryptogrphy. nd Edition, John Wiley & Sons, Inc, 996. Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 SANS Institute -, Author retins full rights. Key fingerprint = AF9 FA7 F94 998D FDB5 DED F8B5 6E4 A69 4E46 SANS Institute - As prt of GIAC prcticl repository. Author retins full rights.
10 Lst Updted: Jnury 8th, 9 Upcoming Trining SANS Security Est 9 New Orlens, LA Feb, 9 - Feb 9, 9 Live Event Security Est 9 - SEC4: Security Essentils Bootcmp Style New Orlens, LA Feb 4, 9 - Feb 9, 9 vlive SANS Anheim 9 Anheim, CA Feb, 9 - Feb 6, 9 Live Event SANS Northern VA Spring- Tysons 9 Tysons, VA Feb, 9 - Feb 6, 9 Live Event SANS Scottsdle 9 Scottsdle, AZ Feb 8, 9 - Feb, 9 Live Event SANS New York Metro Winter 9 Jersey City, NJ Feb 8, 9 - Feb, 9 Live Event SANS Dlls 9 Dlls, TX Feb 8, 9 - Feb, 9 Live Event SANS Secure Jpn 9 Tokyo, Jpn Feb 8, 9 - Mr, 9 Live Event SANS Reno Thoe 9 Reno, NV Feb 5, 9 - Mr, 9 Live Event Open-Source Intelligence Summit & Trining 9 Alexndri, VA Feb 5, 9 - Mr, 9 Live Event Mentor - SEC4 Rleigh, NC Feb 7, 9 - Mr 6, 9 Mentor SANS Bltimore Spring 9 Bltimore, MD Mr, 9 - Mr 9, 9 Live Event Bltimore Spring 9 - SEC4: Security Essentils Bootcmp Style Bltimore, MD Mr 4, 9 - Mr 9, 9 vlive Community SANS Indinpolis SEC4 Indinpolis, IN Mr 4, 9 - Mr 9, 9 Community SANS SANS Secure Indi 9 Bnglore, Indi Mr 4, 9 - Mr 9, 9 Live Event SANS St. Louis 9 St. Louis, MO Mr, 9 - Mr 6, 9 Live Event SANS London Mrch 9 London, United Mr, 9 - Mr 6, 9 Live Event Kingdom SANS Secure Singpore 9 Singpore, Singpore Mr, 9 - Mr, 9 Live Event SANS Sn Frncisco Spring 9 Sn Frncisco, CA Mr, 9 - Mr 6, 9 Live Event SANS Secure Cnberr 9 Cnberr, Austrli Mr 8, 9 - Mr, 9 Live Event SANS Norfolk 9 Norfolk, VA Mr 8, 9 - Mr, 9 Live Event SANS Munich Mrch 9 Munich, Germny Mr 8, 9 - Mr, 9 Live Event SANS vlive - SEC4: Security Essentils Bootcmp Style SEC4-9, Mr 9, 9 - Apr 5, 9 vlive Mentor Session - SEC4 Fredericksburg, VA Mr 9, 9 - My, 9 Mentor Community SANS Rleigh SEC4 Rleigh, NC Apr, 9 - Apr 6, 9 Community SANS SANS 9 Orlndo, FL Apr, 9 - Apr 8, 9 Live Event SANS 9 - SEC4: Security Essentils Bootcmp Style Orlndo, FL Apr, 9 - Apr 6, 9 vlive Mentor Session - SEC4 Tucson, AZ Apr 4, 9 - My 6, 9 Mentor SANS London April 9 London, United Apr 8, 9 - Apr, 9 Live Event Kingdom Blue Tem Summit & Trining 9 Louisville, KY Apr, 9 - Apr 8, 9 Live Event SANS Riydh April 9 Riydh, Kingdom Of Sudi Arbi Apr, 9 - Apr 8, 9 Live Event
Interested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationGlobal Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationGlobal Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationGlobal Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
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 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 informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationFault injection attacks on cryptographic devices and countermeasures Part 2
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
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 informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
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 information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More informationAES Advanced Encryption Standard
AES Advanced Encryption Standard AES is iterated block cipher that supports block sizes of 128-bits and key sizes of 128, 192, and 256 bits. The AES finalist candidate algorithms were MARS, RC6, Rijndael,
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 informationTool Vendor Perspectives SysML Thus Far
Frontiers 2008 Pnel Georgi Tec, 05-13-08 Tool Vendor Perspectives SysML Thus Fr Hns-Peter Hoffmnn, Ph.D Chief Systems Methodologist Telelogic, Systems & Softwre Modeling Business Unit Peter.Hoffmnn@telelogic.com
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(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X
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 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 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 informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
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 informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5a January 29, 2013 CPSC 467b, Lecture 5a 1/37 Advanced Encryption Standard AES Alternatives CPSC 467b,
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 informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
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 informationFloating Point Numbers and Interval Arithmetic
480: 05092008 -- floting point; intervl rith Floting Point Numbers nd Intervl Arithmetic Are floting point numbers just broken? (from http://www.cs.princeton.edu/introcs) To mthemticin like me floting
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5 January 23, 2012 CPSC 467b, Lecture 5 1/35 Advanced Encryption Standard AES Alternatives CPSC 467b,
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 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 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 informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
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 informationIntroduction to the new AES Standard: Rijndael
Introduction to the new AES Standard: Rijndael Paul Donis This paper will explain how the Rijndael Cipher Reference Code in C works. Rijndael is a block cipher that encrypts and decrypts 128, 192, and
More informationTree Structured Symmetrical Systems of Linear Equations and their Graphical Solution
Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime
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 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 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 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 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 informationAnalysis of the Use of Whirlpool s S-box, S1 and S2 SEED s S- box in AES Algorithm with SAC Test Novita Angraini, Bety Hayat Susanti, Magfirawaty
Information Systems International Conference (ISICO), 2 4 December 2013 Analysis of the Use of Whirlpool s S-box, S1 and S2 SEED s S- box in AES Algorithm with SAC Test Novita Angraini, Bety Hayat Susanti,
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 informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
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 informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
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 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 informationAdvanced Encryption Standard and Modes of Operation. Foundations of Cryptography - AES pp. 1 / 50
Advanced Encryption Standard and Modes of Operation Foundations of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) is a symmetric cryptographic algorithm AES has been originally requested
More informationHow to Design REST API? Written Date : March 23, 2015
Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly
More informationData Encryption Standard (DES)
Data Encryption Standard (DES) Best-known symmetric cryptography method: DES 1973: Call for a public cryptographic algorithm standard for commercial purposes by the National Bureau of Standards Goals:
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 informationImplementation of the block cipher Rijndael using Altera FPGA
Regular paper Implementation of the block cipher Rijndael using Altera FPGA Piotr Mroczkowski Abstract A short description of the block cipher Rijndael is presented. Hardware implementation by means of
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 informationInterested in learning more? Global Information Assurance Certification Paper. Copyright SANS Institute Author Retains Full Rights
Global Information Assurance Certification Paper Copyright SANS Institute Author Retains Full Rights This paper is taken from the GIAC directory of certified professionals. Reposting is not permited without
More informationAvailable at ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No.
Avilble t http://pvmu.edu.edu/pges/398.sp ISSN: 93-9466 Vol. 4, Issue December 009 pp. 434 444 Previously Vol. 4, No. Applictions nd Applied Mthemtics: An Interntionl Journl AAM On -ry Subdivision for
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 informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More informationStep-Voltage Regulator Model Test System
IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node
More informationSpring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.
15-112 Spring 2018 Midterm Exm 1 Mrch 1, 2018 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for lnguge
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
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 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 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 informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 Advance Encryption Standard (AES) Rijndael algorithm is symmetric block cipher that can process data blocks of 128 bits, using cipher keys with lengths of 128, 192, and 256
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 7 September 23, 2015 CPSC 467, Lecture 7 1/1 Advanced Encryption Standard AES Alternatives CPSC 467,
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Secret Key Cryptography Block cipher DES 3DES
More informationDesign of an Efficient Architecture for Advanced Encryption Standard Algorithm Using Systolic Structures
Design of an Efficient Architecture for Advanced Encryption Standard Algorithm Using Systolic Structures 1 Suresh Sharma, 2 T S B Sudarshan 1 Student, Computer Science & Engineering, IIT, Khragpur 2 Assistant
More informationWeek 5: Advanced Encryption Standard. Click
Week 5: Advanced Encryption Standard Click http://www.nist.gov/aes 1 History of AES Calendar 1997 : Call For AES Candidate Algorithms by NIST 128-bit Block cipher 128/192/256-bit keys Worldwide-royalty
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 informationLU Decomposition. Mechanical Engineering Majors. Authors: Autar Kaw
LU Decomposition Mechnicl Engineering Mjors Authors: Autr Kw Trnsforming Numericl Methods Eduction for STEM Undergrdutes // LU Decomposition LU Decomposition LU Decomposition is nother method to solve
More informationLecture 5: Spatial Analysis Algorithms
Lecture 5: Sptil Algorithms GEOG 49: Advnced GIS Sptil Anlsis Algorithms Bsis of much of GIS nlsis tod Mnipultion of mp coordintes Bsed on Eucliden coordinte geometr http://stronom.swin.edu.u/~pbourke/geometr/
More informationSome necessary and sufficient conditions for two variable orthogonal designs in order 44
University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Some necessry n sufficient conitions for two vrile orthogonl esigns in orer
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
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 informationBasics of Logic Design Arithmetic Logic Unit (ALU)
Bsics of Logic Design Arithmetic Logic Unit (ALU) CPS 4 Lecture 9 Tody s Lecture Homework #3 Assigned Due Mrch 3 Project Groups ssigned & posted to lckord. Project Specifiction is on We Due April 9 Building
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 informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationUnion-Find Problem. Using Arrays And Chains. A Set As A Tree. Result Of A Find Operation
Union-Find Problem Given set {,,, n} of n elements. Initilly ech element is in different set. ƒ {}, {},, {n} An intermixed sequence of union nd find opertions is performed. A union opertion combines two
More informationIntroduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
More informationGeorge Boole. IT 3123 Hardware and Software Concepts. Switching Algebra. Boolean Functions. Boolean Functions. Truth Tables
George Boole IT 3123 Hrdwre nd Softwre Concepts My 28 Digitl Logic The Little Mn Computer 1815 1864 British mthemticin nd philosopher Mny contriutions to mthemtics. Boolen lger: n lger over finite sets
More informationContent of this part
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Introduction to Cryptography ECE 597XX/697XX Part 4 The Advanced Encryption Standard (AES) Israel Koren ECE597/697 Koren Part.4.1
More information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
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 informationEliminating left recursion grammar transformation. The transformed expression grammar
Eliminting left recursion grmmr trnsformtion Originl! rnsformed! 0 0! 0 α β α α α α α α α α β he two grmmrs generte the sme lnguge, but the one on the right genertes the rst, nd then string of s, using
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 informationCryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings Chapter 5 Advanced Encryption Standard Advance Encryption Standard Topics Origin of AES Basic AES Inside Algorithm Final Notes Origins
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationOPERATION MANUAL. DIGIFORCE 9307 PROFINET Integration into TIA Portal
OPERATION MANUAL DIGIFORCE 9307 PROFINET Integrtion into TIA Portl Mnufcturer: 2018 burster präzisionsmesstechnik gmbh & co kg burster präzisionsmesstechnik gmbh & co kg Alle Rechte vorbehlten Tlstrße
More informationEncryption Details COMP620
Encryption Details COMP620 Encryption is a powerful defensive weapon for free people. It offers a technical guarantee of privacy, regardless of who is running the government It s hard to think of a more
More information