Key KeyDesign DesignQuestions Questionsand andAnswers Answersfor for Designing Designingthe the Proper ProperOrganization OrganizationStructure Structure
View full slide show




Generating the session key list Source Address Dest Address Last Session Key Key ID MD5 Hash (Session Key) Next Key ID Session Key List RSA Encrypt Server Private Key Server Key  Server rolls a random 32-bit seed as the initial key ID  Server generates each session key as hash of IP addresses and key ID  Low order 32 bits of the session key become the key ID for the next session key  Server encrypts the last key using RSA and its private key to produce the server key  Server uses the session key list in reverse order and generates a new one when exhausted Mar 22, 2019 14
View full slide show




A Database Schema in SQL CREATE TABLE EMPLOYEE (FNAME VARCHAR(15) NOT NULL, MINIT CHAR, LNAME VARCHAR(15) NOT NULL, SSN SSN_TYPE NOT NULL, BDATE DATE ADDRESS VARCHAR(30), SEX CHAR, SALARY DECIMAL(10,2), SUPERSSN SSN_TYPE, DNO INT NOT NULL, PRIMARY KEY (SSN), FOREIGN KEY (SUPERSSN) REFERENCES EMPLOYEE(SSN), FOREIGN KEY (DNO) REFERENCES DEPARTMENT(DNUMBER)); CREATE TABLE DEPARTMENT (DNAME VARCHAR(15) NOT NULL, DNUMBER INT, NOT NULL, MGRSSN SSN_TYPE NOT NULL, MGRSTARTDATE DATE PRIMARY KEY (DNUMBER), UNIQUE (DNAME) FOREIGN KEY (MGRSSN) REFERENCES EMPLOYEE(SSN)); CREATE TABLE DEPT_LOCATIONS (DNUMBER INT NOT NULL, DLOCATION VARCHAR(15) NOT NULL, PRIMARY KEY (DNUMBER, DLOCATION), FOREIGN KEY (DNUMBER) REFERENCES DEPARTMENT(DNUMBER)); CREATE TABLE PROJECT (PNAME VARCHAR(15) NOT NULL, PNUMBER INT NOT NULL, PLOCATION VARCHAR(15) DNUM INT NOT NULL, PRIMARY KEY (PNUMBER), UNIQUE (PNAME) FOREIGN KEY (DNUM) REFERENCES DEPARTMENT(DNUMBER)); CREATE TABLE WORKS_ON (ESSN SSN_TYPE NOT NULL, PNO INT NOT NULL, HOURS DECIMAL(3,1) NOT NULL, PRIMARY KEY (ESSN, PNO), FOREIGN KEY (ESSN) REFERENCES EMPLOYEE(SSN), FOREIGN KEY (PNO) REFERENCES PROJECT(PNUMBER)); CREATE TABLE DEPENDENT (ESSN SSN_TYPE NOT NULL, DEPENDENT_NAME VARCHAR(15) NOT NULL, SEX CHAR, BDATE DATE, RELATIONSHIP VARCHAR(8) PRIMARY KEY (ESSN, DEPENDENT_NAME), FOREIGN KEY (ESSN) REFERENCES EMPLOYEE(SSN)); CSCI 253 -- Database Modelling 5
View full slide show




03/18/19 18:25 13-27 Public Key Cryptography 0 Public-key cryptography is a cryptographic approach which involves the use of asymmetric key algorithms instead of or in addition to symmetric key algorithms. 0 Unlike symmetric key algorithms, it does not require a secure initial exchange of one or more secret keys to both sender and receiver. 0 The asymmetric key algorithms are used to create a mathematically related key pair: a secret private key and a published public key. Use of these keys allows protection of the authenticity of a message by creating a digital signature of a message using the private key, which can be verified using the public key. 0 It also allows protection of the confidentiality and integrity of a message, by public key encryption, encrypting the message using the public key, which can only be decrypted using the private key.
View full slide show




03/18/19 18:31 13-64 Public Key Cryptography 0 Public-key cryptography is a cryptographic approach which involves the use of asymmetric key algorithms instead of or in addition to symmetric key algorithms. 0 Unlike symmetric key algorithms, it does not require a secure initial exchange of one or more secret keys to both sender and receiver. 0 The asymmetric key algorithms are used to create a mathematically related key pair: a secret private key and a published public key. Use of these keys allows protection of the authenticity of a message by creating a digital signature of a message using the private key, which can be verified using the public key. 0 It also allows protection of the confidentiality and integrity of a message, by public key encryption, encrypting the message using the public key, which can only be decrypted using the private key.
View full slide show




MapReduce Flow Input = Key, Value Key, Value … Map Map Map Key, Value Key, Value Key, Value Key, Value Key, Value Key, Value … … … Sort Reduce(K, V[ ]) Output = Key, Value Key, Value … Split Input into Key-Value pairs. For each K-V pair call Map. Each Map produces new set of K-V pairs. For each distinct key, call reduce. Produces one K-V pair for each distinct key. Output as a set of Key Value Pairs.
View full slide show




MapReduce Flow Input =Key, Value Key, Value … Map Map Map Key, Value Key, Value Key, Value Key, Value Key, Value Key, Value … … … Sort Reduce(K, V[ ]) Output =Key, Value Key, Value … Split Input into Key-Value pairs. For each K-V pair call Map. Each Map produces new set of K-V pairs. For each distinct key, call reduce. Produces one KV pair for each distinct as key. Output a set of Key Value Pairs. 219 MIAS Tutorial Summer 2011
View full slide show




ER to Relational Mapping (2) KEY KEY Key constraint KEY Foreign Key Merge KEY KEY KEY Foreign Key NOT NULL Total participation Merge KEY PKEY PKEY KEY NOT NULL PKEY: Partial key 03/22/2019 Merge PKEY becomes part of the composite key 60
View full slide show




Major Issues Involved • Choosing the proper airfoil that is easily constructed as well as providing the highest lift and necessary drag. • Designing proper wing flaps to stabilize control and functionality. • Designing a proper tail to optimize control and aerial performance. • Determining the proper angle of attack to insure takeoff.
View full slide show




Public-key Algorithms • Public-key algorithms are asymmetric algorithms based on the use of two different keys instead of one. – Private key: This key must be know only by its owner. – Public key: This key is known to everyone (it is public). • The key that is used for encryption is different from the key that is used for decryption. – However, the decryption key cannot, in any reasonable amount of time, be calculated from the encryption key and vice versa. • Public-key systems have a clear advantage over symmetric algorithms: – There is no need to agree on a common key for both the sender and the receiver. © 2012 Cisco and/or its affiliates. All rights reserved. 115
View full slide show




Public-key Encryption  Public-key encryption uses two different keys at once -- a private key and a public key.  The private key is known only to one computer, the public key is available to all.  Use the receiver’s public key to encrypt your message. Only the possessor of the private key can decrypt the message.  A message encrypted with a private key, can be decrypted with the corresponding public key.  The key pair is based on prime numbers (numbers that only have divisors of itself and one, such as 2, 3, 5, 7, 11 and so on) of long length.  The encryption is computationally intensive.  Used together with symmetric-key encryption. Succeeding with Technology – 3rd Edition
View full slide show




Example 10: PV of Uneven Cash Flows BA II Plus Calculator Press CF Press 2nd KEY then CE|C KEY then ENTER then 2ND KEY then CPT KEY CF0 = 0, press Enter and ↓ key CF1 = 100, press Enter and ↓ key F01 = 1, press Enter and ↓ key CF2 = 200, press Enter and ↓ key F02 = 1, press Enter and ↓ key Press NPV KEY I = 10, press Enter and ↓ key Press CPT KEY NPV = $256.20 6-33
View full slide show