Top Banner

Click here to load reader

1 Lecture 2: Introduction to Cryptography Outline uses of cryptography secret key cryptography public key cryptography message digests

Jan 05, 2016




  • Lecture 2: Introduction to CryptographyOutlineuses of cryptographysecret key cryptographypublic key cryptographymessage digests

  • Secret Key CryptographyOriginally a way to keep secret data privateEncode a message using a secret keyA long and colorful historyToday, it has many usesPrivacyAuthentication verifying someone (somethings) identityData Integrity reassuring the recepient of the message that the message has not been altered since it was generated by a legitimate source

  • What is Encryption?You and I agree on a secret way to transform dataLater, we use that transform on data we want to pass over an unsafe communications channelInstead of coming up with new transforms, design a common algorithm customized with a key

  • Secret Key Encryption for PrivacyPlaintextCiphertextPlaintextKeyKey

  • How Secure is Encryption?An attacker who knows the algorithm were using could try all possible keysSecurity of cryptography depends on the limited computational power of the attackerA fairly small key (e.g. 64 bits) represents a formidable challenge to the attackerAlgorithms can also have weaknesses, independent of key size

  • How do we know how good an algorithm is?A problem of mathematics: it is very hard to prove a problem is hardIts never impossible to break a cryptographic algorithm - we want it to be as hard as trying all keysFundamental Tenet of Cryptography: If lots of smart people have failed to solve a problem then it probably wont be solved (soon)

  • To Publish or Not to PublishIf the good guys break your algorithm, youll hear about itIf you publish your algorithm, the good guys provide free consulting by trying to crack itThe bad guys will learn your algorithm anywayToday, most commercial algorithms are published; most military algorithms are not

  • Breaking an Encrypton Schemethree basic attacksciphertext only attacker has access to encrypted messages only known plaintext attacker knows some pairschosen plaintext attacker is capable of generating ciphertext for chosen plaintextencryption schemes have to withstand all three types of attacks

  • Uses of CryptographyTransmitting secret data over an insecure channelStoring secret data on an insecure mediumMessage integrity checksum/authentication code (MIC/MAC)Authentication: challenge the other party to encrypt or decrypt a random number

  • Secret Key Integrity ProtectionGenerateMACVerifyMACMACPlaintextYes/NoKeyKey

  • Challenge / Response AuthenticationAlice (knows K)Bob (knows K)Im AlicePick Random REncrypt R using K(getting C)If youre Alice, decrypt CR

  • Secret Key AlgorithmsDES (Data Encryption Standard)56 bit key (+ 8 parity bits) controversial!Input and output are 64 bit blocksslow in software, based on (sometime gratuitous) bit diddling

    IDEA (International Data Encryption Algorithm)128 bit keyInput and output are 64 bit blocksdesigned to be efficient in software

  • Secret Key AlgorithmsTriple DESApply DES three times (EDE) using K1, K2, K3 where K1 may equal K3Input and output 64 bit blocksKey is 112 or 168 bits

    Advanced Encryption Standard (AES)New NIST standard to replace DES.Public Design and Selection Process. Key Sizes 128,192,256. Block size 128.

  • Secret Key AlgorithmsRC2 (Rivests Cipher #2)Variable key sizeInput and output are 64 bit blocks

    RC4 (Rivests Cipher #4)Variable key sizeExtremely efficientStream cipher - one time use keys

    Many other secret key algorithms existIt is hard to invent secure ones!No good reason to invent new ones

  • XOR (Exclusive-OR)Bitwise operation with two inputs where the output bit is 1 if exactly one of the two input bits is one(B XOR A) XOR A) = BIf A is a one time pad, very efficient and secureCommon encryption schemes (e.g. RC4) calculate a pseudo-random stream from a key

  • Public Key CryptographyTwo keys per user: a private key and a public key. The keys reverse each others effects.Encrypt a message for Alice using her public keyDecryption requires her private keyGenerating Digital Signatures requires the private keyVerifying them requires the public key

  • Public Key Encryption for PrivacyPlaintextCiphertextPlaintextPublic KeyPrivate Key

  • Public Key Integrity ProtectionGenerateSignatureVerifySignatureSignaturePlaintextYes/NoPrivate KeyPublic Key

  • Public Key AuthenticationAlice (knows As private key)Bob (knows As public key)Im AlicePick Random REncrypt R usingAs public key(getting C)If youre Alice, decrypt CRDecrypt C

  • Message Digest FunctionsAlso known as cryptographic hashesNon-reversible functionTakes an arbitrary size message and mangles it into a fixed size digestIt should be impossible to find two messages with the same MD, or come up with a message with a given MDUseful as a shorthand for a longer thing

  • Message Digest FunctionsDigestMessageDigest Value

  • Message Digest FunctionsMD2, MD4, and MD5 used to be most popular. SHA-1 taking overAll produce 128 bit digestsMD4 and MD2 were recently broken and MD5 has significant weaknessesSHA-1 was proposed by the U.S. government. It produces a 160 bit digestMessage digests are not difficult to design, but most are not secure

  • Combining Cryptographic Functions for PerformancePublic key cryptography is slow compared to hashes and secret key cryptographyPublic key cryptography is more convenient & secure in setting up keysAlgorithms can be combined to get the advantages of both

  • Hybrid EncryptionInstead of:MessageEncrypted with Alices Public KeyUse:RandomlyChosen KEncrypted withAlices Public KeyMessageEncrypted withSecret Key K+Message

  • Hybrid SignaturesInstead of:MessageSigned with Bobs Private KeyUse:MessageMessageSigned with Bobs Private KeyDigest (Message)Message+

  • Signed and Encrypted MessageRandomlyChosen KEncrypted withAlices Public KeyMessageEncrypted withSecret Key K+Digest (Message)+Signed withBobs Private Key

Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.