Lecture 14. Protocols. Key Distribution Center (KDC) or Trusted Third Party (TTP) KDC generates R1

Size: px
Start display at page:

Download "Lecture 14. Protocols. Key Distribution Center (KDC) or Trusted Third Party (TTP) KDC generates R1"

Transcription

1 Lectue 14 Potocols 1 Key Distiution Cente (KDC) o Tusted Thid Pty (TTP) KDC genetes R1 lice otins R1 Msg1: K () Msg2: K (R1 K (R1) ) Msg3: K (R1) o otins R1 nd knows to use s key fo communicting with lice lice nd o communicte using R1 s shot-tem (session) key fo encyption nd/ o dt integity Note: Msg2 is not tied to Msg1 Msg1 is possily old Msg2 is possily old nd so is Msg3 2 o nd lice don t uthenticte ech othe! 1

2 Typicl Key Distiution Scenio KDC (1) Request N 1 (2) E K [K s Request N 1 E K (K s )] (3) E K [K s ] (4) E Ks [N 2 ] (5) E Ks [f(n 2 )] Notes: Msg2 is tied to Msg1 Msg2 is fesh/new Msg3 is possily old * Msg1 is possily old (KDC doesn t uthenticte lice) o uthentictes lice o uthentictes KDC lice DOES NOT uthenticte o (ecll discussion in clss) 3 Pulic Key Distiution Genel schemes: Pulic nnouncement (e.g. in newsgoup o emil messge) Cn e foged Pulicly ville diectoy Cn e tmpeed with Pulic-key cetifictes (PKCs) issued y tusted off-line Cetifiction uthoities (Cs) 4 2

3 Cetifiction uthoities Cetifiction uthoity (C): inds pulic key to specific entity Ech entity (use host etc.) egistes its pulic key with C. o povides poof of identity to C. C cetes cetificte inding o to this pulic key. cetificte contining o s pulic key digitlly signed y C: C sys: this is o s pulic key o s pulic key o s identifying infomtion PK digitl signtue C pivte key SK C PK cetificte fo o s pulic key signed y C 5 Cetifiction uthoities When lice wnts to get o s pulic key: get o s cetificte (fom o o elsewhee). using C s pulic key veify the signtue on o s cetificte check fo expition check fo evoction (we ll tlk out this lte) extct o s pulic key PK digitl signtue PK o s pulic key C pulic key PK C 6 3

4 Cetificte Contins Seil nume (unique to issue) info out cetificte owne including lgoithm nd key vlue itself (not shown) info out cetificte issue vlid dtes digitl signtue y issue 7 ck to potocols 8 4

5 Needhm-Schoede Potocol (1978): 1 st distiuted secuity potocol 1.! T: N 2. T! : {N K {K } K } K 3.! : {K } K KDC 4.! : {N } K 1 2 lice 5.! : {N -1} K o 9 Secuity? Denning-Scco ttck: suppose Eve ecoded n old session fo which session key K is known to he: 1. " T: N 2. T " : {N K {K } K } K 3. " : {K } K t lte time: 1. E " : {K } K 2. " E: {N } K 3. E " : {N -1} K 10 5

6 Fixing the ttck o hs no guntees out the feshness of the messge in step 3. Eve exploits this to impesonte lice to o - old session keys e useful. Cn e fixed y dding timestmps: limits usefulness of old session keys Eve s ttck ecomes: 3: E! : {K T } K ttck is now thwted ecuse T is stle 11 PK-sed Needhm-Schoede potocol 1.{} 2.{PK } SKT KDC TTP 5.{PK } SKT 4.{} lice 3. [N ] PK 6. [N N ] PK o 7. [N ] PK CERT = Messge 2 CERT = Messge 5 PK : lice s pulic key PK : o s pulic key SK T : TTP s secet (pivte) key used fo signing Eveyone knows TTP s pulic key PK T 12 6

7 nothe ttck : Delivey of pulic key Does not guntee feshness of the pulic key How to solve it? Timestmp in messges 2 nd 5 o chllenges in messges 1&2 nd 4&5 Pulic Key Cetificte: ssign expition time/ dt to ech cetificte (messges 2 nd 5) 13 PK-sed Denning-Scco ttck 1. KDC TTP Cet ={PK } SK T Cet ={PK } SK T Cet C ={PK C C} SK T 2. Cet Cet lice 3. Cet Cet [ {K T } SK ] PK 4. Secue communiction with K o Thinks she is tlking to C Petends to e 3. Cet Cet C [ {K T } ] SK PK C 4. Secue communiction with K o 14 7

8 Lowe s ttck (Impesontion y inteleving) Oiginl 3. : [N ] PK 6. : [N N ] PK 7. : [N ] PK ttck E plys : 1.3. E: [N ] PKe 2.3. E : [N ] PK 2.6. E: [N N ] PK 1.6. E : [N N ] PK Fix 3. : [N ] PK 1.7. E: [N ] PKe 2.7. E : [N ] PK 6. : [ N N ] PK 7. : [N ] PK 15 PK-sed Needhm-Schoede potocol 1.{} 2.{PK } SKT KDC TTP 5.{PK } SKT 4.{} lice 3. [N ] PK 6. [N N ] PK o 7. [N ] PK 16 8

9 Reflection ttck nd fix Oiginl potocol 1. : 2. : { } K 3. : ttck 1. E : 2. E : : Stting new session 3. E : { } K : Reply to (2) 4. E : { } K : Reply to (1) 5. E : Solutions? Use 2 diffeent uni-diecionl keys k (!) nd k (!) Remove symmety (diection msg identifies) 17 Inteleving ttcks Potocol fo mutul uthentiction 1. : 2. : { } SK 3. : { } SK ttck 1. E : 2. E : { } SK 3. E : 4. E : { } SK 5. E : { } SK ttck due to symmetic messges (2) (3) 18 9

10 Lessons lened? Designing secue potocols is hd. Thee e mny documented filues in the litetue. Good potocols e ledy stnddized (e.g. ISO 9798 X.509 ) use them! The polem of veifying secuity gets much hde s potocols get moe complex (moe pties messges ounds) 19 If inteested in knowing moe ed the ppe: Pogmming Stn s Compute y ndeson nd Needhm ville t:

11 Some Secue Potocol exmples 21 uthenticted Pulic-Key-sed Key Exchnge (Sttion-to-Sttion o STS Potocol) Choose ndom v Compute v K = ( y ) mod p SIG = { y y } lice lice y v = mod p CERT y SIG o CERT lice SIG lice o Choose ndom w Compute w K = ( y ) mod p w y = mod p SIG = { y y } o o 22 11

12 12 23 x.509 uthentiction & Key Distiution Potocols SK PK K othe t } ] [ {2 SK PK K othe t } ] [ {2 SK PK K othe t } ] [ {1 SK PK K othe t } ] [ {3 SK PK K othe t } ] [ {3 SK } {3 One-wy! Two-wy! Tee-wy "!

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s:

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s: Chpte 7 Kleene s Theoem 7.1 Kleene s Theoem The following theoem is the most impotnt nd fundmentl esult in the theoy of FA s: Theoem 6 Any lnguge tht cn e defined y eithe egul expession, o finite utomt,

More information

Week 8. Topic 2 Properties of Logarithms

Week 8. Topic 2 Properties of Logarithms Week 8 Topic 2 Popeties of Logithms 1 Week 8 Topic 2 Popeties of Logithms Intoduction Since the esult of ithm is n eponent, we hve mny popeties of ithms tht e elted to the popeties of eponents. They e

More information

Key Establishment Protocols. Cryptography CS 507 Erkay Savas Sabanci University

Key Establishment Protocols. Cryptography CS 507 Erkay Savas Sabanci University Key Establishment Potocols Cyptogaphy CS 507 Ekay Savas Sabanci Univesity ekays@sabanciuniv.edu Key distibution poblem Secuity of the keys Even if the cyptogaphic algoithms & potocols ae cyptogaphically

More information

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x SIO 22B, Rudnick dpted fom Dvis III. Single vile sttistics The next few lectues e intended s eview of fundmentl sttistics. The gol is to hve us ll speking the sme lnguge s we move to moe dvnced topics.

More information

Lecture 7. Public Key Cryptography (Diffie-Hellman and RSA)

Lecture 7. Public Key Cryptography (Diffie-Hellman and RSA) Lectue 7 Pulic Key Cytogahy (Diffie-Hellman and RSA) 1 Pulic Key Cytogahy Asymmetic cytogahy Invented in 1974-1978 (Diffie-Hellman and Rivest-Shami- Adleman) Two keys: ivate (SK), ulic (PK) Encytion: with

More information

Deterministic simulation of a NFA with k symbol lookahead

Deterministic simulation of a NFA with k symbol lookahead Deteministic simultion of NFA with k symbol lookhed SOFSEM 7 Bl Rvikum, Clifoni Stte Univesity (joint wok with Nic Snten, Univesity of Wteloo) Oveview Definitions: DFA, NFA nd lookhed DFA Motivtion: utomted

More information

10 Statistical Distributions Solutions

10 Statistical Distributions Solutions Communictions Engineeing MSc - Peliminy Reding 1 Sttisticl Distiutions Solutions 1) Pove tht the vince of unifom distiution with minimum vlue nd mximum vlue ( is ) 1. The vince is the men of the sques

More information

Physics 604 Problem Set 1 Due Sept 16, 2010

Physics 604 Problem Set 1 Due Sept 16, 2010 Physics 64 Polem et 1 Due ept 16 1 1) ) Inside good conducto the electic field is eo (electons in the conducto ecuse they e fee to move move in wy to cncel ny electic field impessed on the conducto inside

More information

2-Way Finite Automata Radboud University, Nijmegen. Writer: Serena Rietbergen, s Supervisor: Herman Geuvers

2-Way Finite Automata Radboud University, Nijmegen. Writer: Serena Rietbergen, s Supervisor: Herman Geuvers 2-Wy Finite Automt Rdoud Univesity, Nijmegen Wite: Seen Rietegen, s4182804 Supeviso: Hemn Geuves Acdemic Ye 2017-2018 Contents 1 Intoduction 3 2 One wy utomt, deteministic nd non-deteministic 5 3 Ovehed

More information

Discrete Model Parametrization

Discrete Model Parametrization Poceedings of Intentionl cientific Confeence of FME ession 4: Automtion Contol nd Applied Infomtics Ppe 9 Discete Model Pmetition NOKIEVIČ, Pet Doc,Ing,Cc Deptment of Contol ystems nd Instumenttion, Fculty

More information

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2.

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2. Element Uniqueness Poblem Dt Stuctues Let x,..., xn < m Detemine whethe thee exist i j such tht x i =x j Sot Algoithm Bucket Sot Dn Shpi Hsh Tbles fo (i=;i

More information

FI 2201 Electromagnetism

FI 2201 Electromagnetism FI 1 Electomgnetism Alexnde A. Isknd, Ph.D. Physics of Mgnetism nd Photonics Resech Goup Electosttics ELECTRIC PTENTIALS 1 Recll tht we e inteested to clculte the electic field of some chge distiution.

More information

Language Processors F29LP2, Lecture 5

Language Processors F29LP2, Lecture 5 Lnguge Pocessos F29LP2, Lectue 5 Jmie Gy Feuy 2, 2014 1 / 1 Nondeteministic Finite Automt (NFA) NFA genelise deteministic finite utomt (DFA). They llow sevel (0, 1, o moe thn 1) outgoing tnsitions with

More information

CHAPTER 18: ELECTRIC CHARGE AND ELECTRIC FIELD

CHAPTER 18: ELECTRIC CHARGE AND ELECTRIC FIELD ollege Physics Student s Mnul hpte 8 HAPTR 8: LTRI HARG AD LTRI ILD 8. STATI LTRIITY AD HARG: OSRVATIO O HARG. ommon sttic electicity involves chges nging fom nnocoulombs to micocoulombs. () How mny electons

More information

3.1 Magnetic Fields. Oersted and Ampere

3.1 Magnetic Fields. Oersted and Ampere 3.1 Mgnetic Fields Oested nd Ampee The definition of mgnetic induction, B Fields of smll loop (dipole) Mgnetic fields in mtte: ) feomgnetism ) mgnetiztion, (M ) c) mgnetic susceptiility, m d) mgnetic field,

More information

ITI Introduction to Computing II

ITI Introduction to Computing II ITI 1121. Intoduction to Computing II Mcel Tucotte School of Electicl Engineeing nd Compute Science Abstct dt type: Stck Stck-bsed lgoithms Vesion of Febuy 2, 2013 Abstct These lectue notes e ment to be

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by Clss Summy.5 Eponentil Functions.6 Invese Functions nd Logithms A function f is ule tht ssigns to ech element D ectly one element, clled f( ), in. Fo emple : function not function Given functions f, g:

More information

5pm (submit via Grade scope. Friday. and monitor Piazza. will. try. knowledge. nothing than The fact that the statement is true

5pm (submit via Grade scope. Friday. and monitor Piazza. will. try. knowledge. nothing than The fact that the statement is true Yt Pove At CS 355 Lectue 4 ( 4111 Poblem set 1 due Fidy t Poblem set 2 will be posted Fidy 5pm (submit vi Gde scope No fice hous Thusdy / Fidy will ty nd mito Pizz Pevious lectue intoduced noti intective

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows: Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl

More information

Electric Potential. and Equipotentials

Electric Potential. and Equipotentials Electic Potentil nd Euipotentils U Electicl Potentil Review: W wok done y foce in going fom to long pth. l d E dl F W dl F θ Δ l d E W U U U Δ Δ l d E W U U U U potentil enegy electic potentil Potentil

More information

Lecture 25: Pairing Based Cryptography

Lecture 25: Pairing Based Cryptography 6.897 Special Topics in Cyptogaphy Instucto: Ran Canetti May 5, 2004 Lectue 25: Paiing Based Cyptogaphy Scibe: Ben Adida 1 Intoduction The field of Paiing Based Cyptogaphy has exploded ove the past 3 yeas

More information

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game.

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game. Phsicl Secuit Countemesues This entie sheet Telmo, AHI I m going to put heptdecgon into gme. Cssie Hung Mechnicl lockpicking is mechnicked geometic constuctions with compss nd stightedge. Ech lock will

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations

Resources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

Probabilistic Retrieval

Probabilistic Retrieval CS 630 Lectue 4: 02/07/2006 Lectue: Lillin Lee Scibes: Pete Bbinski, Dvid Lin Pobbilistic Retievl I. Nïve Beginnings. Motivtions b. Flse Stt : A Pobbilistic Model without Vition? II. Fomultion. Tems nd

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

π,π is the angle FROM a! TO b

π,π is the angle FROM a! TO b Mth 151: 1.2 The Dot Poduct We hve scled vectos (o, multiplied vectos y el nume clled scl) nd dded vectos (in ectngul component fom). Cn we multiply vectos togethe? The nswe is YES! In fct, thee e two

More information

Review of Mathematical Concepts

Review of Mathematical Concepts ENEE 322: Signls nd Systems view of Mthemticl Concepts This hndout contins ief eview of mthemticl concepts which e vitlly impotnt to ENEE 322: Signls nd Systems. Since this mteil is coveed in vious couses

More information

Lecture 8. Public Key Cryptography (Diffie-Hellman and RSA)

Lecture 8. Public Key Cryptography (Diffie-Hellman and RSA) Lecture 8 Pulic Key Crytogrhy (Diffie-Hellmn nd RSA) 1 Pulic Key Crytogrhy Asymmetric crytogrhy Inented in 1974-1978 (Diffie-Hellmn nd Riest-Shmir- Adlemn) To keys: rite (SK), ulic (PK) Encrytion: ith

More information

Course Updates. Reminders: 1) Assignment #8 available. 2) Chapter 28 this week.

Course Updates. Reminders: 1) Assignment #8 available. 2) Chapter 28 this week. Couse Updtes http://www.phys.hwii.edu/~vne/phys7-sp1/physics7.html Remindes: 1) Assignment #8 vilble ) Chpte 8 this week Lectue 3 iot-svt s Lw (Continued) θ d θ P R R θ R d θ d Mgnetic Fields fom long

More information

U>, and is negative. Electric Potential Energy

U>, and is negative. Electric Potential Energy Electic Potentil Enegy Think of gvittionl potentil enegy. When the lock is moved veticlly up ginst gvity, the gvittionl foce does negtive wok (you do positive wok), nd the potentil enegy (U) inceses. When

More information

A Survey of Methods for Generating a Test Sequence for Conformance Testing of Finite State Machine

A Survey of Methods for Generating a Test Sequence for Conformance Testing of Finite State Machine ISSN:2229-693 Hnn Ndeem et l, Int.J.Compute Technology & Applictions,Vol 5 (2),435-446 A Suvey of Methods fo Geneting Test Sequence fo Confomnce Testing of Finite Stte Mchine Zin Eid King Adul Aziz Univesity

More information

CSCI 340: Computational Models. Transition Graphs. Department of Computer Science

CSCI 340: Computational Models. Transition Graphs. Department of Computer Science CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t

More information

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system 436-459 Advnced contol nd utomtion Extensions to bckstepping contolle designs Tcking Obseves (nonline dmping) Peviously Lst lectue we looked t designing nonline contolles using the bckstepping technique

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +

Definite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 + Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd

More information

SPA7010U/SPA7010P: THE GALAXY. Solutions for Coursework 1. Questions distributed on: 25 January 2018.

SPA7010U/SPA7010P: THE GALAXY. Solutions for Coursework 1. Questions distributed on: 25 January 2018. SPA7U/SPA7P: THE GALAXY Solutions fo Cousewok Questions distibuted on: 25 Jnuy 28. Solution. Assessed question] We e told tht this is fint glxy, so essentilly we hve to ty to clssify it bsed on its spectl

More information

Friedmannien equations

Friedmannien equations ..6 Fiedmnnien equtions FLRW metic is : ds c The metic intevl is: dt ( t) d ( ) hee f ( ) is function which detemines globl geometic l popety of D spce. f d sin d One cn put it in the Einstein equtions

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Optimization. x = 22 corresponds to local maximum by second derivative test

Optimization. x = 22 corresponds to local maximum by second derivative test Optimiztion Lectue 17 discussed the exteme vlues of functions. This lectue will pply the lesson fom Lectue 17 to wod poblems. In this section, it is impotnt to emembe we e in Clculus I nd e deling one-vible

More information

The Area of a Triangle

The Area of a Triangle The e of Tingle tkhlid June 1, 015 1 Intodution In this tile we will e disussing the vious methods used fo detemining the e of tingle. Let [X] denote the e of X. Using se nd Height To stt off, the simplest

More information

Algebra Based Physics. Gravitational Force. PSI Honors universal gravitation presentation Update Fall 2016.notebookNovember 10, 2016

Algebra Based Physics. Gravitational Force. PSI Honors universal gravitation presentation Update Fall 2016.notebookNovember 10, 2016 Newton's Lw of Univesl Gvittion Gvittionl Foce lick on the topic to go to tht section Gvittionl Field lgeb sed Physics Newton's Lw of Univesl Gvittion Sufce Gvity Gvittionl Field in Spce Keple's Thid Lw

More information

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.)

BINOMIAL THEOREM SOLUTION. 1. (D) n. = (C 0 + C 1 x +C 2 x C n x n ) (1+ x+ x 2 +.) BINOMIAL THEOREM SOLUTION. (D) ( + + +... + ) (+ + +.) The coefficiet of + + + +... + fo. Moeove coefficiet of is + + + +... + if >. So. (B)... e!!!! The equied coefficiet coefficiet of i e -.!...!. (A),

More information

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus 7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e

More information

NS-IBTS indices calculation procedure

NS-IBTS indices calculation procedure ICES Dt Cente DATRAS 1.1 NS-IBTS indices 2013 DATRAS Pocedue Document NS-IBTS indices clcultion pocedue Contents Genel... 2 I Rw ge dt CA -> Age-length key by RFA fo defined ge nge ALK... 4 II Rw length

More information

Electric Field F E. q Q R Q. ˆ 4 r r - - Electric field intensity depends on the medium! origin

Electric Field F E. q Q R Q. ˆ 4 r r - - Electric field intensity depends on the medium! origin 1 1 Electic Field + + q F Q R oigin E 0 0 F E ˆ E 4 4 R q Q R Q - - Electic field intensity depends on the medium! Electic Flux Density We intoduce new vecto field D independent of medium. D E So, electic

More information

About Some Inequalities for Isotonic Linear Functionals and Applications

About Some Inequalities for Isotonic Linear Functionals and Applications Applied Mthemticl Sciences Vol. 8 04 no. 79 8909-899 HIKARI Ltd www.m-hiki.com http://dx.doi.og/0.988/ms.04.40858 Aout Some Inequlities fo Isotonic Line Functionls nd Applictions Loedn Ciudiu Deptment

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

AT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a

AT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a Section 2.7: Inequlities In this section, we will Determine if given vlue is solution to n inequlity Solve given inequlity or compound inequlity; give the solution in intervl nottion nd the solution 2.7

More information

School of Electrical and Computer Engineering, Cornell University. ECE 303: Electromagnetic Fields and Waves. Fall 2007

School of Electrical and Computer Engineering, Cornell University. ECE 303: Electromagnetic Fields and Waves. Fall 2007 School of Electicl nd Compute Engineeing, Conell Univesity ECE 303: Electomgnetic Fields nd Wves Fll 007 Homewok 3 Due on Sep. 14, 007 by 5:00 PM Reding Assignments: i) Review the lectue notes. ii) Relevnt

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

Time in Seconds Speed in ft/sec (a) Sketch a possible graph for this function.

Time in Seconds Speed in ft/sec (a) Sketch a possible graph for this function. 4. Are under Curve A cr is trveling so tht its speed is never decresing during 1-second intervl. The speed t vrious moments in time is listed in the tle elow. Time in Seconds 3 6 9 1 Speed in t/sec 3 37

More information

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems.

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems. Physics 55 Fll 5 Midtem Solutions This midtem is two hou open ook, open notes exm. Do ll thee polems. [35 pts] 1. A ectngul ox hs sides of lengths, nd c z x c [1] ) Fo the Diichlet polem in the inteio

More information

A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size against Self-Defensive Pirates

A Public-Key Black-Box Traitor Tracing Scheme with Sublinear Ciphertext Size against Self-Defensive Pirates A Public-Key Blc-Box Tito Tcin Sceme wit Subline Cipetext Size inst Self-Defensive Pites T. Mtsusit nd H. Imi TOSHIBA Copotion Univesity of Toyo Copyit 004 Tosib Copotion. All its eseved. Content distibution

More information

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt

Computing data with spreadsheets. Enter the following into the corresponding cells: A1: n B1: triangle C1: sqrt Computing dt with spredsheets Exmple: Computing tringulr numers nd their squre roots. Rell, we showed 1 ` 2 ` `n npn ` 1q{2. Enter the following into the orresponding ells: A1: n B1: tringle C1: sqrt A2:

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

STRAND B: NUMBER THEORY

STRAND B: NUMBER THEORY Mthemtics SKE, Strnd B UNIT B Indices nd Fctors: Tet STRAND B: NUMBER THEORY B Indices nd Fctors Tet Contents Section B. Squres, Cubes, Squre Roots nd Cube Roots B. Inde Nottion B. Fctors B. Prime Fctors,

More information

Scaling ORAM for Secure Computation

Scaling ORAM for Secure Computation Session C: Olivious RAM CCS 7, Octoe -Noveme, 7, Dlls, TX, USA Scling ORAM fo Secue Computtion ABSTRACT Jck Doene Nothesten Univesity j@ckdoenenet We design nd implement Distiuted Olivious Rndom Access

More information

Physics 1502: Lecture 4 Today s Agenda

Physics 1502: Lecture 4 Today s Agenda 1 Physics 1502: Today s genda nnouncements: Lectues posted on: www.phys.uconn.edu/~cote/ HW assignments, solutions etc. Homewok #1: On Mastephysics today: due next Fiday Go to masteingphysics.com and egiste

More information

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science.

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science. CS 701 Finl Exm (Reminde) Fidy, Deeme 12, 4:00 6:00 P.M., 1289 Comute Siene. Andesen s Algoithm An lgoithm to uild oints-to gh fo C ogm is esented in: Pogm Anlysis nd Seiliztion fo the C ogmming Lnguge,

More information

Note 12. Introduction to Digital Control Systems

Note 12. Introduction to Digital Control Systems Note Introduction to Digitl Control Systems Deprtment of Mechnicl Engineering, University Of Ssktchewn, 57 Cmpus Drive, Ssktoon, SK S7N 5A9, Cnd . Introduction A digitl control system is one in which the

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

EECE 260 Electrical Circuits Prof. Mark Fowler

EECE 260 Electrical Circuits Prof. Mark Fowler EECE 60 Electicl Cicuits Pof. Mk Fowle Complex Numbe Review /6 Complex Numbes Complex numbes ise s oots of polynomils. Definition of imginy # nd some esulting popeties: ( ( )( ) )( ) Recll tht the solution

More information

10/04/18. P [P(x)] 1 negl(n).

10/04/18. P [P(x)] 1 negl(n). Mastemath, Sping 208 Into to Lattice lgs & Cypto Lectue 0 0/04/8 Lectues: D. Dadush, L. Ducas Scibe: K. de Boe Intoduction In this lectue, we will teat two main pats. Duing the fist pat we continue the

More information

Fluids & Bernoulli s Equation. Group Problems 9

Fluids & Bernoulli s Equation. Group Problems 9 Goup Poblems 9 Fluids & Benoulli s Eqution Nme This is moe tutoil-like thn poblem nd leds you though conceptul development of Benoulli s eqution using the ides of Newton s 2 nd lw nd enegy. You e going

More information

PHYS 1444 Lecture #5

PHYS 1444 Lecture #5 Shot eview Chapte 24 PHYS 1444 Lectue #5 Tuesday June 19, 212 D. Andew Bandt Capacitos and Capacitance 1 Coulom s Law The Fomula QQ Q Q F 1 2 1 2 Fomula 2 2 F k A vecto quantity. Newtons Diection of electic

More information

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15

Regular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15 Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll

More information

The Evaluation Theorem

The Evaluation Theorem These notes closely follow the presenttion of the mteril given in Jmes Stewrt s textook Clculus, Concepts nd Contexts (2nd edition) These notes re intended primrily for in-clss presenttion nd should not

More information

Lesson 25: Adding and Subtracting Rational Expressions

Lesson 25: Adding and Subtracting Rational Expressions Lesson 2: Adding nd Subtrcting Rtionl Expressions Student Outcomes Students perform ddition nd subtrction of rtionl expressions. Lesson Notes This lesson reviews ddition nd subtrction of frctions using

More information

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z

#A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z #A29 INTEGERS 17 (2017) EQUALITY OF DEDEKIND SUMS MODULO 24Z Kurt Girstmir Institut für Mthemtik, Universität Innsruck, Innsruck, Austri kurt.girstmir@uik.c.t Received: 10/4/16, Accepted: 7/3/17, Pulished:

More information

The Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr

The Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr The Congestion of n-cube Layout on a Rectangula Gid S.L. Bezukov J.D. Chavez y L.H. Hape z M. Rottge U.-P. Schoede Abstact We conside the poblem of embedding the n-dimensional cube into a ectangula gid

More information

St Andrew s Academy Mathematics Department Higher Mathematics VECTORS

St Andrew s Academy Mathematics Department Higher Mathematics VECTORS St ndew s cdemy Mthemtics etment Highe Mthemtics VETORS St ndew's cdemy Mths et 0117 1 Vectos sics 1. = nd = () Sketch the vectos nd. () Sketch the vectos nd. (c) Given u = +, sketch the vecto u. (d) Given

More information

AP Calculus AB Exam Review Sheet B - Session 1

AP Calculus AB Exam Review Sheet B - Session 1 AP Clcls AB Em Review Sheet B - Session Nme: AP 998 # Let e the nction given y e.. Find lim nd lim.. Find the solte minimm vle o. Jstiy tht yo nswe is n solte minimm. c. Wht is the nge o? d. Conside the

More information

Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples

Reasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis

More information

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries Moe Efficient Oblivious Tansfe Extensions with Secuity fo Malicious Advesaies Gilad Ashaov Yehuda Lindell Thomas Schneide Michael Zohne Hebew Univesity Ba-Ilan Univesity Damstadt Damstadt EUROCRYPT 2015

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Energy Dissipation Gravitational Potential Energy Power

Energy Dissipation Gravitational Potential Energy Power Lectue 4 Chpte 8 Physics I 0.8.03 negy Dissiption Gvittionl Potentil negy Powe Couse wesite: http://fculty.uml.edu/andiy_dnylov/teching/physicsi Lectue Cptue: http://echo360.uml.edu/dnylov03/physicsfll.html

More information

Summary: Binomial Expansion...! r. where

Summary: Binomial Expansion...! r. where Summy: Biomil Epsio 009 M Teo www.techmejcmth-sg.wes.com ) Re-cp of Additiol Mthemtics Biomil Theoem... whee )!!(! () The fomul is ville i MF so studets do ot eed to memoise it. () The fomul pplies oly

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

More information

Geometry of the homogeneous and isotropic spaces

Geometry of the homogeneous and isotropic spaces Geomety of the homogeneous and isotopic spaces H. Sonoda Septembe 2000; last evised Octobe 2009 Abstact We summaize the aspects of the geomety of the homogeneous and isotopic spaces which ae most elevant

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

ELECTRO - MAGNETIC INDUCTION

ELECTRO - MAGNETIC INDUCTION NTRODUCTON LCTRO - MAGNTC NDUCTON Whenee mgnetic flu linked with cicuit chnges, n e.m.f. is induced in the cicuit. f the cicuit is closed, cuent is lso induced in it. The e.m.f. nd cuent poduced lsts s

More information

STD: XI MATHEMATICS Total Marks: 90. I Choose the correct answer: ( 20 x 1 = 20 ) a) x = 1 b) x =2 c) x = 3 d) x = 0

STD: XI MATHEMATICS Total Marks: 90. I Choose the correct answer: ( 20 x 1 = 20 ) a) x = 1 b) x =2 c) x = 3 d) x = 0 STD: XI MATHEMATICS Totl Mks: 90 Time: ½ Hs I Choose the coect nswe: ( 0 = 0 ). The solution of is ) = b) = c) = d) = 0. Given tht the vlue of thid ode deteminnt is then the vlue of the deteminnt fomed

More information

Auchmuty High School Mathematics Department Advanced Higher Notes Teacher Version

Auchmuty High School Mathematics Department Advanced Higher Notes Teacher Version The Binomial Theoem Factoials Auchmuty High School Mathematics Depatment The calculations,, 6 etc. often appea in mathematics. They ae called factoials and have been given the notation n!. e.g. 6! 6!!!!!

More information

= ΔW a b. U 1 r m 1 + K 2

= ΔW a b. U 1 r m 1 + K 2 Chpite 3 Potentiel électiue [18 u 3 mi] DEVOIR : 31, 316, 354, 361, 35 Le potentiel électiue est le tvil p unité de chge (en J/C, ou volt) Ce concept est donc utile dns les polèmes de consevtion d énegie

More information

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010 CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w

More information

22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 20

22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 20 .615, MHD Theoy of Fusion Systes Pof. Feideg Lectue Resistive Wll Mode 1. We hve seen tht pefectly conducting wll, plced in close poxiity to the pls cn hve stong stilizing effect on extenl kink odes..

More information

Continuous Joint Distributions Chris Piech CS109, Stanford University

Continuous Joint Distributions Chris Piech CS109, Stanford University Continuous Joint Distriutions Chris Piech CS09, Stnford University CS09 Flow Tody Discrete Joint Distriutions: Generl Cse Multinomil: A prmetric Discrete Joint Cont. Joint Distriutions: Generl Cse Lerning

More information

Three-dimensional systems with spherical symmetry

Three-dimensional systems with spherical symmetry Thee-dimensiona systems with spheica symmety Thee-dimensiona systems with spheica symmety 006 Quantum Mechanics Pof. Y. F. Chen Thee-dimensiona systems with spheica symmety We conside a patice moving in

More information

7.1 Integral as Net Change Calculus. What is the total distance traveled? What is the total displacement?

7.1 Integral as Net Change Calculus. What is the total distance traveled? What is the total displacement? 7.1 Integrl s Net Chnge Clculus 7.1 INTEGRAL AS NET CHANGE Distnce versus Displcement We hve lredy seen how the position of n oject cn e found y finding the integrl of the velocity function. The chnge

More information

COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature

COSC 3361 Numerical Analysis I Numerical Integration and Differentiation (III) - Gauss Quadrature and Adaptive Quadrature COSC 336 Numericl Anlysis I Numericl Integrtion nd Dierentition III - Guss Qudrture nd Adptive Qudrture Edgr Griel Fll 5 COSC 336 Numericl Anlysis I Edgr Griel Summry o the lst lecture I For pproximting

More information

Gauss Law. Physics 231 Lecture 2-1

Gauss Law. Physics 231 Lecture 2-1 Gauss Law Physics 31 Lectue -1 lectic Field Lines The numbe of field lines, also known as lines of foce, ae elated to stength of the electic field Moe appopiately it is the numbe of field lines cossing

More information

Compact and Unforgeable Key Establishment over an ATM Network

Compact and Unforgeable Key Establishment over an ATM Network Compct nd Unforgeble Key Estblishment over n ATM Networ Yuling Zheng (Monsh University, Austrli) Hidei Imi (University of Toyo, Jpn) 1 Outline of the tl Motivtion of this reserch Introduction to signcryption

More information