New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Comp & Network Security

by: Alayna Veum

Comp & Network Security CS 4237

Alayna Veum

GPA 3.81


Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Class Notes
25 ?




Popular in Course

Popular in ComputerScienence

This 0 page Class Notes was uploaded by Alayna Veum on Monday November 2, 2015. The Class Notes belongs to CS 4237 at Georgia Institute of Technology - Main Campus taught by Staff in Fall. Since its upload, it has received 12 views. For similar materials see /class/234115/cs-4237-georgia-institute-of-technology-main-campus in ComputerScienence at Georgia Institute of Technology - Main Campus.

Similar to CS 4237 at

Popular in ComputerScienence


Reviews for Comp & Network Security


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 11/02/15
HHULCUJDQQ DQC QQQQ Introduction to Cryptography CS 4237 Definitions l Process data into unintelligible form reversible without data loss I Usually onetoone not compression l Other services 0 Integrity checking no tampering 0 Authentication not an imposter l Plaintext encryptione ciphertext decryption plaintext 9Q a Computatlonal Difficulty m E l Algorithm needs to be efficient 9 Otherwise only short keys can be used l Most schemes can be broken depends on T Q EG Try all possible keys 739 l Longer key is often more secure b O Encryption ONl 1 O Bruteforce cryptanalysis 02N twice as hard with each additional bit l Cryptanalysis tools i1 9 Specialpurpose hardware 9 Parallel machines 9 Internet coarsegrain parallelism a a n l Secret Key vs Secret Algorithm gs Eu 9 l Secret algonthm add1t10nal hurdle l Hard to keep secret if used widely r5 0 Reverse engineering social engineering l Commercial published g 0 Wide reView trust l Military avoid giving enemy good ideas E EU m 9Q Some Trivial Schemes Q U m g l Caesar c1pher substitution c1pher eruBeE l Captain Midnight Secret Decoder rings 7 9 shift variable by n IBM a HAL or 77 0 letter offset mod 26 gt 9 only 26 possible ways of secret coding 39 7 l Monoalphabetic Cipher O generalization arbitrary mapping of one letter to another a O 26 approximately 4 X 1026 O statistical analysis of letter frequencies l Onetime pad if 9 A random sequence ofO s and 1 s XORed to plaintext a U m Cryptanaly s1s Breaking an El E Encryption Scheme E El g l Ciphertext only 39 O Exhaustive search until recognizable plaintext j 9 Need enough ciphertext r 739 l Known plaintext 9 Secret may be revealed by spy time thus ltciphe1text g plaintextgt pair is obtained 9 Great for monoalphabetic ciphers l Chosen plaintext a 9 Choose text get encrypted 9 Useful if limited set of messages GQQQEQ EviCJQ 71 QEQQQQQQLDUJ Models for Evaluating Security l Unconditional security perfect secrecy 0 Uncertaintyentropy H pH pc l Complexitytheoretic security I Provable security 0 As difficult to break as solving wellknown and supposedly difficult problem I Computational security I Ad hoc security Brute Force Attacks I Number of encryptionsec 1 million to l billionsec l 56bit key broken in 1 week with 120000 processors 67m l 56bit key broken in 1 month with 28000 processors 16m l 64bit key broken in 1 week with 31 x 107 processors 17b l 128bit key broken in 1 week with 56 x 1026 processors LDEZY J Dmgm QQQQ Types of Cryptography l Hash functions no key I Secret key cryptography one key I Public key cryptography two keys public private Secret Key Cryptography l Same key is used for encryption and decryption 0 Symmetric cryptography l Ciphertext approximately the same length as plaintext l Substitution codes DES IDEA l Message transmission 0 Agree on key but how 0 Communicate over insecure channel I Secure storage crypt 9Q a Secret Key Cryptography Cont d El El Ff l Strong authentication prove knowledge of key without revealing it 7 0 Send challenge r verify the returned encrypted f V C 0 Fred can obtain chosen plaintext cihpertext pairs Challenge should chosen from a large pool 4 g l Integrity check xedlength checksum for E3 message 0 Send lVHC along with the message n Public Key Cryptography E E l Asymmetric cryptography Fl l Inventedpublished in 1975 l Two keys private d public 6 0 Encryption public key Decryption private key 0 Signing private key Verification public key I Much slower than secret key cryptography Public Key Cryptography Cont d I Data transmission 0 Alice encrypts ma using e 3 Bob decrypts to ma using db l Storage 0 Can create a safety copy using public key of trusted person I Authentication 0 No need to store secrets only need public keys 0 Secret key cryptography need to share secret key for every person to communicate with Public Key Cryptography Cont d l Digital signatures 0 Encrypt hash hm with private key Authorship Integrity Nonrepudiation can t do with secret key cryptography


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Kyle Maynard Purdue

"When you're taking detailed notes and trying to help everyone else out in the class, it really helps you learn and understand the I made $280 on my first study guide!"

Jim McGreen Ohio University

"Knowing I can count on the Elite Notetaker in my class allows me to focus on what the professor is saying instead of just scribbling notes the whole time and falling behind."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.