Time and Space Complexity Reduction of a Cryptanalysis Algorithm
|
|
- Harvey Kelley
- 6 years ago
- Views:
Transcription
1 Te and Space Coplexty Reducton of a Cryptanalyss Algorth Mohaad Ghasezadeh Electrcal and Coputer Engneerng Departent, Yazd Unversty, Yazd, Iran.ghasezadeh@yazdun.ac.r Receved: /4/6; Accepted: /5/4 Pages: 9-46 Abstract Bnary Decson Dagra (n short BDD s an effcent data structure whch has been used wdely n coputer scence and engneerng. BDD-based attack n key strea cryptanalyss s one of the best fors of attack n ts category. In ths paper, we propose a new key strea attack whch s based on ZDD(Zero-suppressed BDD. We show how a ZDD-based key strea attack s ore effcent n te and space coplexty over ts BDD-based varant aganst the E type of the Bluetooth securty echans. We pleented t by usng the CUDD - Colorado Unversty Decson Dagra package. Experental results show great proveents. We have also derved a atheatcal proof, whch shows that t s better than the BDDbased attack ethod even for the worst case analyss. Keywords: Bnary Decson Dagra, Cryptanalyss, Algorth coplexty. Introducton In cryptography, pseudo rando sequences are frequently used. A pseudo rando sequence generator requres to be unforly dstrbuted, ndependent, and noncorrelated [8]. In pleentaton of key strea generators, the FSR (near Feedback Shft Regster s beng used because all above condtons are et and the correspondng algebrac analyss s qute sple. The FSR-based key strea generators consst of two coponents: a lnear bt strea generator and a nonlnear copresson functon C,.e. K=(,C. Frst they generate the key strea Y=C((k, for the cpher key k, then Y and the plan text P are btwse XORed to produce the cpher text E. In cryptanalyss of these generators, the encrypton syste s supposed to be known and we are nterested n fndng k. BDD and ts varants are data structures that are used effectvely n coputer scence and engneerng. These data structures gve copact and canoncal representatons for Boolean functons. Recently, a new attack aganst FSR-based key strea generators s ntroduced by Krause [] whch s based on a varant of BDD known as FBDD. ater Shacked and Wool [9] ntroduced ther OBDD-based attack to E key strea generator. In ths paper, we ntroduce a new attack to key strea generators whch uses ZDD. Experental results show that t akes a rearkable reducton n te and space coplexty regardng OBDD and FBDD based attacks. We have also derved a proof whch confrs the experental results. Ths paper s organzed as follows. Secton provdes the basc defntons and the an concepts: E encrypton syste and a bref ntroducton to BDD and ZDD. In secton the proposed attack s ntroduced. Frst the FBDD attack s dscussed, then the 9
2 Te and Space Coplexty Reducton of M. Ghasezadeh attack to E wth OBDD s revewed. Fnally our ZDD-based attack s ntroduced. Secton 4 s dedcated to the theoretcal coplexty analyss of our ethod. Secton 5 provdes concludes.. Prelnares. E Key Strea Generator E s an FSR-based key strea generator whch s used n Bluetooth securty echans. FSR-based key strea generators consst of two coponents, a lnear bt strea generator and a nonlnear copresson functon. After ntalzaton, the lnear bt strea generator, generates the bt strea Z. It eploys four near Feedback Shft Regsters(FSR, whose output s the nput to the copresson functon C. The output of the copresson functon would be the key strea Y = C( ( k. The lengths of the four FSR are = 5, =, = and = 9, and ther feedback polynoals are: 5 8 p ( x = x + x + x + x p ( x = x + x + x + x p ( x = x + x + x + x p ( x = x + x + x + x + At the begnnng, the lnear generator needs to be loaded wth an ntal value for the four FSRs(8 bts n total. Suaton of the four output bts of the FSRs ake the nput of the copresson functon. The copresson functon s usually organzed wth a fnte state achnec :(,,,,, E ΣΓ I F δ, States of the FSM are ={ q : 5},ts nput alphabet Σ ={,,,,4}, output alphabet Γ ={,} and I, F stand for the set of ntal and fnal states. The set of FSM transton rulesδ Σ Γ have eleents n the for of ( qn, a q n + [, 9, 4].. BDD versus ZDD There are several known ethods for representng Boolean forulas. The ost portant of the are: Truth table, Karnough ap and Boolean expressons. BDD or ore precsely ROBDD s also a data structure nvented for ths purpose. Ths data structure s a graph whch can be obtaned fro the bnary decson tree of the Boolean forula by applyng ergng and reovng rules [, 6]. Altogether ths ethod s better than other ethods. The benefts of ROBDD are:. Provdes a canoncal representaton,.represents Boolean functons ore copactly and.offers faster Boolean operatons. A set can be represented by ts characterstc functon. In ths regard, accordng to each eleent/subset we consder a nter n the correspondng characterstc functon. Theoretcal analyss and practcal experents has shown that a varant of BDD called ZDD (Zero suppressed Bnary Decson Dagras [7] s ore sutable for representng such a characterstc functon. A ZDD can also be obtaned fro bnary decson tree of a Boolean forula. In a BDD whenever -edge and -edge of a node pont to the sae node that node ust be 4
3 Journal of Advances n Coputer Research (Vol., No., August 9-46 reoved, but n a ZDD whenever the -edge of a node ponts to -ternal, that node ust be reoved. The ergng rule s the sae for both of the. In a ZDD each path fro the root to the -ternal stands for an eleent of the set [, 5].. ZDD Based Cryptanalyss Of E In ths secton we frst ntroduce the FBDD based attacker of Krause [], then we reveal the otvaton led us usng ZDD nstead of FBDD or OBDD. Fnally we ntroduce and dscuss our ZDD-based attacker.. FBDD Based Cryptanalyss Of Key Strea Generator Krause n hs work [] assues that except for key k, all other paraeters are known, also he assues that the attacker s able to obtan the frst bts of the key strea Y. The goal of the attacker s coputng k {{,} n }. Snce n an FSR, the frst output bts are the sae as ts ntal values, Z = ( k would contan k n the frst bts. Therefore the proble reduces to fndng a bt strea Z satsfyng the followng condtons:. Z can be produced by the lnear bt strea generator.. C (Z s prefx of the observed key strea Y. For, and the bt strea z {,} the followng tes are defned: C G s an oracle graph representng the order n whch the bts of Z are beng read by the copresson functon C. R s a nal G C FBDD graph whch decdes whether Z can be produced by or not. s a nal G C FBDD graph whch decdes whether C (Z s a prefx of Y or not. P s a nal G C FBDD graph whch decdes whether Z can be produced by where C (Z s a prefx of Y or not. In ths ethod, the key s consdered to be n bts and t coputes, where denotes the length of the consecutve bts requred for fndng the key k. Consderng above forulatons, the followng algorth can copute k :. P n.. for n + to do: P ( P R. return Z where P ( Z =. On the other words, the above loop terates untl P has only one assgnent z {,} where P ( Z =.. Reducton of FBDD-based Cryptanalyss usng OBDDs The algorth descrbed by Krause s generc and needs to be adapted. Shacked and Wool [9] ade reductons and adopted t for E, by usng OBDD nstead of FBDD. 4
4 Te and Space Coplexty Reducton of M. Ghasezadeh Krause n [4] generalzed OBDD attack to oblvous key strea generator. In the OBDD attack the output bts of (k are consdered as: Z =(..., z4j, z4j +, z4j+, z4j +,..., where z4 j+ ( k. Ths orderng leads to the followng equatons for the lnear key strea generator : =4 j : z = z z z z ( 48 8 = 4 j + : z = z = 4 j + : z = z 6 96 = 4 j + : z = z Afterwards, accordng to the obtaned equatons, R graph s produced by buldng OBDDs for each z. In buldng OBDDs whch check bts for each, the algorth calls the frst bts n ts bt strea. The goal of the algorth s to copute these leadng bts of. Accordng to above equatons, an algorth ust buld OBDDs for : j 4. A BDD structure called basc chan s used to copute graph whch represents sus of 4 bts. For each state and each of the 5 possble sus, f the output bt atches the bt gven n the key streay, t can proceed to next chan; otherwse ths path would lead to a Ternal. z j. ZDD-Based Cryptanalyss Of E Cobnatons of n tes can be represented by an n-bt vector, x,... x, where ( n x {,} deternes whether x s ncluded n the cobnaton or not. In ths way, a set of cobnatons can be represented wth a Boolean functon. Such a Boolean functon s called characterstc functon of the set. In general, OBDDs are ore effcent n copact representaton of characterstc functons than other ethods, but Mnato[7] has shown that f we change the elnaton rule, we can represent characterstcs functons uch ore effcently. The goal of key strea Cryptanalyss s to analyse all possble keys and fnd the rght one. FBDD attack can be reduced by usng OBDD, because these generators have the sae orderng, n buldng R and graphs as well as n buldng P. The copresson functon of these generators can be shown wth a fnte state achne. We ay use ZDD to construct a ore effcent attack on ths knd of key strea generators (to attack E key strea generator. In our ZDD attack aganst E generator, we pleented the R graph n a slar way as n OBDD attack, the only dfference s usng ZDD nstead of OBDD. Each synthetc ZDD contans of 5 varables and 9 vertces, therefore, t requres 456 vertces. We coputed the graph by the followng ethod; Snce fnte state achne of E generator has 6 states, we used 4 varables the followng functon can be coputed:, to ark the states. Thus n q 4
5 Journal of Advances n Coputer Research (Vol., No., August 9-46 Clearly, = F ( q, q, q, q, z z,, z,.., 4 +, z conssts of 4 + 4varables. It stands for all the possble paths n the fnte state achne after readng + nput sybols. We pleented usng the followng algorth:. If C ncludes transton rule ( q, a q + AND correspondent output rule E ( q, a b AND b = b ( b s th bt n known key strea Y: (a Copute q and q + based on q : q = ( q ( q ( q ( q where ( q s q or ( q s ( q accordng to labels of the states of the achne. For exaple n step, the 5 th state s : ( q ( q ( q ( q. (b For all. Copute z = 4 + X a, copute: j = ( q+ z4+ z4+ z4+ z4 functon based on:. Copute by reovng = ( X... X j q = (( X... ( X j ( q fro. We need to enton that fnally we are nterested n coputng 8. The constructed correctly decdes whether C(Z s prefx ofy or not. By scannng all the paths fro root to T, we copute all Z s whch produce the sae prefx asy. A pseudo rando sequence ust be dstrbuted unforly,.e., the probablty of occurrence ust be equal to the probablty of occurrence. Ths property along wth other requred propertes, enforce the constructed to be a sparse graph. In pleentng our proposed attack, we apped the proble to a cobnatoral set proble. In fact, n each teraton of coputng, we checked all possble cobnatons of nput bts and fnal states. Most operaton on sets such as unon, ntersect, dfference are already defned and pleented for ZDD. In addton soe other useful functons lke: Z.onset(N selects the subset of the cobnatons ncludng N, and then deletes N fro each cobnaton. Z.offset(N returns the subset of the cobnatons excludng N. Z.Count(N returns nuber of cobnatons n the ZDD Z. are avalable n ost BDD packages. We ran our algorth n C along wth the CUDD package[]; Our algorth can be dsplayed wth the followng pseudo code: 4
6 Te and Space Coplexty Reducton of M. Ghasezadeh δ For eleent { If q, a q ( q, a b ( b = b } (( + { q } = ZDDIntersect( q,( q,( q,( q q = ZDDIntersect(( q,( q, ( q,( q Z4 j +, For { } f For every Z 4 j + = a + + X ZDDIntersect( q, z, z, z, q j = + 4+ ZDDUnon( j, ZDDIntersct ( X j,. Oneset( q, f (( q == ( q q. Oneset( q X j z 4+, Theoretcal Coplexty Analyss The te coplexty of the algorth s deterned by the space coplexty of the constructed ZDD durng the entre process of constructon. Frst, lets take a look at the coplexty of functons whch are used n the algorth: The te coplexty of producng the ZDD representng F ( x,..., x n s O ( GF, where G F denotes the nuber of vertexes n constructed graph. Te coplexty of each set operaton such as unon and ntersect of two graph F,G s O ( G F. GG In the algorth, durng the steps, t ntroduces 4 new varables, and one constrant z = 4 a j +, then the nuber of assgnents s ultpled by. After steps t has two constrants, z4 j s deterned, then the nuber of assgnents s ultpled by. After steps t has three constrants, z4 j and z4 j + are deterned, then the nuber of assgnents s ultpled by. After step t has four constrants and there are no ore choces, then the nuber of assgnents wll be constant. In the next steps, the nuber of assgnents start to decrease to half. On the other hand, due to ZDD propertes, the average nuber of vertces n each path would be 44
7 Journal of Advances n Coputer Research (Vol., No., August 9-46 C(4,.. = 4 therefore, based on above arguents, we can copute the hgher bound as ( : 8 : : P = ( : P = ( : P = ( ( : P = ( : P = On the other hand, P s obtaned by ntersecton of and R, then we can copute the other hgher bound: : Te( P = R = 4 : Te( P = ( : Te( P = ( : Te( P = ( : Te( P = ( = ( 8 In practce, has approxately 4 nodes. The overall upper bound of coplexty can be obtaned fro ntersecton of the above two bounds, whch wll gve a space coplexty of, and te coplexty of 8. We need to enton that ths s a nonrefned approxaton bound, accurate analyss would gve even better values. Here we can see that usng ZDD gves a graph wth 8 nodes less than ts predecessor whch used OBDD. 5. Concluson Zero-suppressed Bnary Decson Dagra (n short ZBDD or ZDD s a varant of BDD. Whle BDD gves ore copact representaton and ore effcent operatons on Bollean forulas, ZDD gves ore copact representaton and ore effcent operatons on characterstcs functons representngd sets of subsets. Ths research shows, by utlzng ths property, how ZDD can be used to construct an attacker ore effcent than the outstandng OBDD-based attacker. 6. References [] Randal E. Bryant. Graph-Based Algorths for Boolean Functon Manpulaton. IEEE Transactons on Coputers, 5(8:677-69, 986. [] Fluhrer, Scott R. and ucks, Stefan. Analyss of the E Encrypton Syste. 8th Annual Internatonal Workshop on Selected Areas n Cryptography, pages 8-48, ondon, UK,. Sprnger-Verlag. [] Matthas Krause. BDD-Based Cryptanalyss of Keystrea Generators. EUROCRYPT, pages - 7,. 45
8 Te and Space Coplexty Reducton of M. Ghasezadeh [4] Matthas Krause. OBDD-Based Cryptanalyss of Oblvous Keystrea Generators. Theor. Cop. Sys., 4(:-, 7. [5] Matthas Krause and Drk Stegeann. Reducng the Space Coplexty of BDD-Based Attacks on Keystrea Generators. th annual Fast Software Encrypton Workshop, pages 6-78, 6. [6] Chrstoph Menel and Thorsten Theobald. Algorths and data structures n VSI desgn: OBDD - foundatons and applcatons. Berln, Hedelberg, New York: Sprnger-Verlag, 998. [7] Shn-ch Mnato, Zero-suppressed bdds and ther applcatons, n:proceedngs of Internatonal Journal on Software Tools for Technology Transfer, Sprnger,, pp [8] Matt Robshaw. Strea Cphers. Techncal report, RSA aboratores, 995. [9] Yanv Shaked and Avsha Wool. Cryptanalyss of the Bluetooth E cpher usng OBDDs. Proceedngs of 9th Inforaton Securty Conference, NCS 476, pages 87-, 6. [] Fabo Soenz. CUDD: Colorado Unversty Decson Dagra Package. edu/~fabo/cudd/, 9. 46
Applied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationAn Optimal Bound for Sum of Square Roots of Special Type of Integers
The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationDetermination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm
Internatonal Conference on Inforaton Technology and Manageent Innovaton (ICITMI 05) Deternaton of the Confdence Level of PSD Estaton wth Gven D.O.F. Based on WELCH Algorth Xue-wang Zhu, *, S-jan Zhang
More informationTowards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF(2 k )
Towards strong securty n ebedded and pervasve systes: energy and area optzed seral polynoal ultplers n GF( k ) Zoya Dyka, Peter Langendoerfer, Frank Vater and Steffen Peter IHP, I Technologepark 5, D-53
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationStudy of the possibility of eliminating the Gibbs paradox within the framework of classical thermodynamics *
tudy of the possblty of elnatng the Gbbs paradox wthn the fraework of classcal therodynacs * V. Ihnatovych Departent of Phlosophy, Natonal echncal Unversty of Ukrane Kyv Polytechnc Insttute, Kyv, Ukrane
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSolutions for Homework #9
Solutons for Hoewor #9 PROBEM. (P. 3 on page 379 n the note) Consder a sprng ounted rgd bar of total ass and length, to whch an addtonal ass s luped at the rghtost end. he syste has no dapng. Fnd the natural
More informationSINCE the 1990s, chaotic cryptography has attracted more
1 On the Securty of the Y-Tan-Sew Chaotc Cpher Shujun L, Guanrong Chen, Fellow, IEEE and Xuanqn Mou Abstract Ths paper presents a coprehensve analyss on the securty of the Y-Tan-Sew chaotc cpher proposed
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationChapter 1. Theory of Gravitation
Chapter 1 Theory of Gravtaton In ths chapter a theory of gravtaton n flat space-te s studed whch was consdered n several artcles by the author. Let us assue a flat space-te etrc. Denote by x the co-ordnates
More informationRevision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax
.9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationAlgorithm for reduction of Element Calculus to Element Algebra
Algorth for reducton of Eleent Calculus to Eleent Algebra Introducton M. Manukyan, V. Harutunyan The XML databases currently act defnte nterest aong researchers of databases for the followng reasons: 1.
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationCollaborative Filtering Recommendation Algorithm
Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationDecision Diagrams Derivatives
Decson Dagrams Dervatves Logc Crcuts Desgn Semnars WS2010/2011, Lecture 3 Ing. Petr Fšer, Ph.D. Department of Dgtal Desgn Faculty of Informaton Technology Czech Techncal Unversty n Prague Evropský socální
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationOn the Construction of Polar Codes
On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationApproximate Technique for Solving Class of Fractional Variational Problems
Appled Matheatcs, 5, 6, 837-846 Publshed Onlne May 5 n ScRes. http://www.scrp.org/journal/a http://dx.do.org/.436/a.5.6578 Approxate Technque for Solvng Class of Fractonal Varatonal Probles Ead M. Soloua,,
More informationOn the Construction of Polar Codes
On the Constructon of Polar Codes Ratn Pedarsan School of Coputer and Councaton Systes, Lausanne, Swtzerland. ratn.pedarsan@epfl.ch S. Haed Hassan School of Coputer and Councaton Systes, Lausanne, Swtzerland.
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationA Novel Feistel Cipher Involving a Bunch of Keys supplemented with Modular Arithmetic Addition
(IJACSA) Internatonal Journal of Advanced Computer Scence Applcatons, A Novel Festel Cpher Involvng a Bunch of Keys supplemented wth Modular Arthmetc Addton Dr. V.U.K Sastry Dean R&D, Department of Computer
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationChapter 13. Gas Mixtures. Study Guide in PowerPoint. Thermodynamics: An Engineering Approach, 5th edition by Yunus A. Çengel and Michael A.
Chapter 3 Gas Mxtures Study Gude n PowerPont to accopany Therodynacs: An Engneerng Approach, 5th edton by Yunus A. Çengel and Mchael A. Boles The dscussons n ths chapter are restrcted to nonreactve deal-gas
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More informationComments on a secure dynamic ID-based remote user authentication scheme for multiserver environment using smart cards
Comments on a secure dynamc ID-based remote user authentcaton scheme for multserver envronment usng smart cards Debao He chool of Mathematcs tatstcs Wuhan nversty Wuhan People s Republc of Chna Emal: hedebao@63com
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationTHE ADJACENCY-PELL-HURWITZ NUMBERS. Josh Hiller Department of Mathematics and Computer Science, Adelpi University, New York
#A8 INTEGERS 8 (8) THE ADJACENCY-PELL-HURWITZ NUMBERS Josh Hller Departent of Matheatcs and Coputer Scence Adelp Unversty New York johller@adelphedu Yeş Aküzü Faculty of Scence and Letters Kafkas Unversty
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationOn Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1
Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de
More informationDifferential Cryptanalysis of Nimbus
Dfferental Cryptanalyss of Nmbus Vladmr Furman Computer Scence Department, Technon - Israel Insttute of Technology, Hafa 32000, Israel. vfurman@cs.technon.ac.l. Abstract. Nmbus s a block cpher submtted
More informationInternational Journal of Mathematical Archive-9(3), 2018, Available online through ISSN
Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationTwo Conjectures About Recency Rank Encoding
Internatonal Journal of Matheatcs and Coputer Scence, 0(205, no. 2, 75 84 M CS Two Conjectures About Recency Rank Encodng Chrs Buhse, Peter Johnson, Wlla Lnz 2, Matthew Spson 3 Departent of Matheatcs and
More information4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation
4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More information04 - Treaps. Dr. Alexander Souza
Algorths Theory 04 - Treaps Dr. Alexander Souza The dctonary proble Gven: Unverse (U,
More informationIntegral Transforms and Dual Integral Equations to Solve Heat Equation with Mixed Conditions
Int J Open Probles Copt Math, Vol 7, No 4, Deceber 214 ISSN 1998-6262; Copyrght ICSS Publcaton, 214 www-csrsorg Integral Transfors and Dual Integral Equatons to Solve Heat Equaton wth Mxed Condtons Naser
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More informationSemi-supervised Classification with Active Query Selection
Sem-supervsed Classfcaton wth Actve Query Selecton Jao Wang and Swe Luo School of Computer and Informaton Technology, Beng Jaotong Unversty, Beng 00044, Chna Wangjao088@63.com Abstract. Labeled samples
More informationWorst Case Interrupt Response Time Draft, Fall 2007
Worst Case Interrupt esponse Te Draft, Fall 7 Phlp Koopan Carnege Mellon Unversty Copyrght 7, Phlp Koopan eproducton and dssenaton beyond students of CMU ECE 8-348 s prohbted.. Overvew: Interrupt Servce
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationEXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD
www.arpapress.co/volues/vol16issue/ijrras_16 10.pdf EXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD Chengbo Tan & Qnghua Feng * School of Scence, Shandong
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationDeparture Process from a M/M/m/ Queue
Dearture rocess fro a M/M// Queue Q - (-) Q Q3 Q4 (-) Knowledge of the nature of the dearture rocess fro a queue would be useful as we can then use t to analyze sle cases of queueng networs as shown. The
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationCALCULUS CLASSROOM CAPSULES
CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules
More informationThe Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value
Appl. Math. Inf. Sc. 6 No. 3 745-750 (0) 745 Appled Matheatcs & Inforaton Scences An Internatonal Journal The Non-equdstant New Inforaton Optzng MGM(n) Based on a Step by Step Optu Constructng Background
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationMessage modification, neutral bits and boomerangs
Message modfcaton, neutral bts and boomerangs From whch round should we start countng n SHA? Antone Joux DGA and Unversty of Versalles St-Quentn-en-Yvelnes France Jont work wth Thomas Peyrn 1 Dfferental
More informationReliability estimation in Pareto-I distribution based on progressively type II censored sample with binomial removals
Journal of Scentfc esearch Developent (): 08-3 05 Avalable onlne at wwwjsradorg ISSN 5-7569 05 JSAD elablty estaton n Pareto-I dstrbuton based on progressvely type II censored saple wth bnoal reovals Ilhan
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationBy M. O'Neill,* I. G. Sinclairf and Francis J. Smith
52 Polynoal curve fttng when abscssas and ordnates are both subject to error By M. O'Nell,* I. G. Snclarf and Francs J. Sth Departents of Coputer Scence and Appled Matheatcs, School of Physcs and Appled
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationOn the Calderón-Zygmund lemma for Sobolev functions
arxv:0810.5029v1 [ath.ca] 28 Oct 2008 On the Calderón-Zygund lea for Sobolev functons Pascal Auscher october 16, 2008 Abstract We correct an naccuracy n the proof of a result n [Aus1]. 2000 MSC: 42B20,
More informationNEW CONSTRUCTIONS IN LINEAR CRYPTANALYSIS OF BLOCK CIPHERS
Proceedngs of ACS 000, Szczecn, pp.53-530 NEW CONSTRUCTIONS IN LINEAR CRYPTANALYSIS OF BLOCK CIPHERS ANNA ZUGAJ, KAROL GÓRSKI, ZBIGNIEW KOTULSKI, ANDRZEJ PASZKIEWICZ 3, JANUSZ SZCZEPAŃSKI ENIGMA Informaton
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More information