CHAPTER 17 INFORMATION SCIENCE. Binary and decimal numbers a short review: For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) 4731 =
|
|
- Aron Brown
- 6 years ago
- Views:
Transcription
1 Math 167 Ch 17 Review 1 (c) Janice Epstein, 2013 CHAPTER 17 INFORMATION SCIENCE Binary and decimal numbers a short review: For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) 4731 = Math 167 Ch 17 Review 2 (c) Janice Epstein, 2013 An orbiting satellite can follow 16 different directions that are labeled 0 to 15 in binary (0000 to 1111). Each message is sent as the command along with 3 check digits. The check digits are arranged so that certain sums have even parity. These are called parity-check sums where the parity of a number refers to whether a number is even or odd. Even numbers have even parity and odd numbers have odd parity. For our satellite, the following sums must be even (0 mod 2) a1 a2 a3 c1, a1 a3 a4 c2, and a2 a3 a4 c3 What are the check digits for command 9? For binary numbers we have 2 digits available, 0 and For this type of parity-check sum, we can use a Venn diagram to help find the check digits or find errors. Express the following binary numbers as decimal numbers: = = Express the following decimal numbers as binary numbers: 55 = Fix the error in the code if it is known only one digit has an error. 88 =
2 Math 167 Ch 17 Review 3 (c) Janice Epstein, 2013 A set of words composed of 0 s and 1 s that has a message and parity check sums appended to the message is called a binary linear code. The resulting strings are called code words. The process of determining the message you were sent is called decoding. If you are sent a message x and receive the message as y, how can it be decoded? The distance between two strings of equal length is the number of positions in which the strings differ. (a) and (b) and The nearest neighbor decoding method decodes a message as the code word that agrees with the message in the most positions provided there is only one such message. How good a code is at detecting and correcting errors is determined by the weight of the code. The weight of a binary code is the minimum number of 1 s that occur among all non-zero code words of that code. Consider a code of weight t, The code can detect t-1 or fewer errors. t 1 If t is odd, the code will correct or fewer errors. 2 t 2 If t is even, the code will correct any or fewer errors. 2 Math 167 Ch 17 Review 4 (c) Janice Epstein, 2013 Consider the code C = { , , , } (a) What is the weight of the code? (b) How many errors can this code detect? (c) How many errors can this code correct? (d) Decode the message received as A compression algorithm converts data from an easy-to-use format to one that is more compact. jpg photo files use data compression as do most video and audio files. Delta function encoding uses the differences in one value to the next to encode the data. The data below is the closing price of the Dow Jones on Oct. 1, 2012 Oct 5, Compress the data using delta function encoding and determine how much the data is compressed
3 Math 167 Ch 17 Review 5 (c) Janice Epstein, 2013 Binary codes can also be compressed by assigning short codes to characters that occur frequently and longer codes to characters that occur rarely. We have 5 symbols, p, µ, σ,, and. If we give all the symbols a code of the same length, we would need 3 binary digits (000 to 101). So a string of 6 symbols would be 6 x 3 = 18 characters long. Can we devise a different binary code if we knew how often each character occurred? Use Huffman coding is a way to assign shorter code words to those characters that occur more often. Math 167 Ch 17 Review 6 (c) Janice Epstein, 2013 The process of disguising data is called encryption. Cryptology is the study of making and breaking secret codes. A Caesar cipher shifts the letters of the alphabet by fixed amount. EXAMPLE Create a Caesar cipher that shifts the alphabet by 10 letters and use it to encrypt the message THANKS. p 0.16 µ 0.19 σ The message below was created with a Caesar cipher with a shift of 14. What is the original message?
4 Math 167 Ch 17 Review 7 (c) Janice Epstein, 2013 A decimation cipher multiplies the position of each letter by a fixed number k (called the key) and then uses modular arithmetic. To use a decimation cipher, 1. Assign the letters A Z to the numbers Choose a value for the key, k, that is an odd integer from 3 to 25 but not 13 (why not?) 3. Multiply the value of each letter (i) by the key (k) and find the remainder when divided by To decrypt a message, the encrypted value x needs to be multiplied by the decryption letter j and then the remainder mod 26 is the original letter. Math 167 Ch 17 Review 8 (c) Janice Epstein, A Vigenère cipher uses a key word to encode the characters. Use a Vigenère cipher with a key word of MINT to encode the message N E W P R I N T E R Use a decimation cipher with a key of 11 to encrypt THANKS T H A N K S A Vigenère cipher with a key word of LEX was used to encode the message below. Decode it. D Y M P V J L R The message below was encrypted with a key of 21. The decryption key is 5. Decode the message. Q R G S M O J T K To increase security, codes can be added together. Find using binary addition. In binary addition, if the sum is even, enter a 0.
5 Math 167 Ch 17 Review 9 (c) Janice Epstein, 2013 SAMPLE EXAM QUESTIONS FROM CHAPTER Convert the binary number to a decimal number. (A) 3 (B) 25 (C) 6 (D) What is the distance between received words and ? (A) 1 (B) 2 (C) 3 (D) 4 (E) more than 4 3. Add the binary sequences and How many 1s digits are in the sum? (A) 1 (B) 2 (C) 3 (D) 4 (E) more than 4 4. Use delta encoding to compress the data By how many characters is the data compressed? (A) 9 (B) 10 (C) 11 (D) 13 Math 167 Ch 17 Review 10 (c) Janice Epstein, 2013 Questions 6 and 7 use the code {1100, 1010, 1001, 0110, 0101, 0011}. 6. What is the weight of this code? (A) 0 (B) 1 (C) 2 (D) 3 (E) 4 7. Which one of the following is a true statement about this code? (A) This code can detect and correct two errors (B) This code can detect two errors and correct 1 error (C) This code can detect and correct one error. (D) This code can detect one error and correct 0 errors (E) None of these Question 8 (6 points) Given binary codes A 0, C 10, I 110, S 1110, B (a) Encode the message CASSI (b) Decode the message Use the nearest-neighbor Venn diagram method to decode the received word (A) 1001 (B) 0100 (C) 1101 (D) 1011 (E) None of these Question 9 (5 points) What is the code word for the message 110, if the code word is the message appended with three check digits found using the parity-check sums a 1 + a 2 + a 3, a 1 + a 3 and a 2 + a 3?
6 Math 167 Ch 17 Review 11 (c) Janice Epstein, 2013 Math 167 Ch 17 Review 12 (c) Janice Epstein, 2013 Question 10 (7 points) Use a Huffman code to assign binary codes to the directions that occur with the probabilities given below. Up Down Left Right Question 12 (5 points) Use a Caesar cipher with a shift of 3 to encode the word BINARY. Question 11 (5 points) Use a decimation cipher with key 9 to encode the word CABLE. Question 13 (6 points) Use the Vigenere cipher with the key word PEN to encode BASEBALL.
For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) 10,
Math 167 Ch 17 WIR 1 (c) Janice Epstein and Tamara Carter, 2015 CHAPTER 17 INFORMATION SCIENCE Binary and decimal numbers a short review: For decimal numbers we have 10 digits available (0, 1, 2, 3, 9)
More informationChapter 16 Identification Numbers Understand the purpose of a check digit. Know what a bmod
(c) Epstein 2013 1 Exam 3 Review Exam 3 Learning Objectives Chapter 16 Identification Numbers Understand the purpose of a check digit. Know what a bmod m means and be able to calculate xmod y. Know the
More informationChapter 17: Information Science Lesson Plan
Lesson Plan For All Practical Purposes Binary Codes Mathematical Literacy in Today s World, 7th ed. Encoding with Parity Check Sums Cryptography Web Searches and Mathematical Logic 2006, W.H. Freeman and
More informationis evenly divisibly by 10. What is the check digit for the mild RO TEL?
Math 167 Ch 16 Review 1 (c) Janice Epstein 2014 CHAPTER 16 IDENTIFICATION NUMBERS Consider the UPC code on a can of RO TEL tomatoes The scanner is not working so the clerk enters the numbers by hand as
More informationThe UPC codes use a check digit to minimize scanning errors. A check digit is a digit included in a code to help detect errors.
Math 167 Ch 16 WIR 1 (c) Janice Epstein and Tamara Carter 2015 CHAPTER 16 IDENTIFICATION NUMBERS Consider the UPC code on a can of RO TEL tomatoes The scanner is not working so the clerk enters the numbers
More informationCryptography Worksheet
Cryptography Worksheet People have always been interested in writing secret messages. In ancient times, people had to write secret messages to keep messengers and interceptors from reading their private
More informationRecap. Definition (Encryption: Caesar Cipher)
Recap Definition (Encryption: Caesar Cipher) + 3 = mod 26 Recap Definition (Encryption: Caesar Cipher) + 3 = mod 26 Definition (Encryption: Shift Cipher) + d = mod 26, d anumber Recap Definition (Encryption:
More informationNUMB3RS Activity: Creating Codes. Episode: Backscatter
Teacher Page 1 NUMB3RS Activity: Creating Codes Topic: Codes Grade Level: 10-12 Objective: Explore several coding methods Time: 30+ minutes Materials: TI-83/84 Plus calculator Introduction While lecturing
More informationCryptography. What is Cryptography?
Cryptography What is Cryptography? Cryptography is the discipline of encoding and decoding messages. It has been employed in various forms for thousands of years, and, whether or not you know it, is used
More informationLecture 02: Historical Encryption Schemes. Lecture 02: Historical Encryption Schemes
What is Encryption Parties involved: Alice: The Sender Bob: The Receiver Eve: The Eavesdropper Aim of Encryption Alice wants to send a message to Bob The message should remain hidden from Eve What distinguishes
More informationFall 2017 CIS 3362 Final Exam. Last Name: First Name: 1) (10 pts) Decrypt the following ciphertext that was encrypted using the shift cipher:
Fall 2017 CIS 3362 Final Exam Last Name: First Name: 1) (10 pts) Decrypt the following ciphertext that was encrypted using the shift cipher: mubsecujejxuvydqbunqc 2) (10 pts) Consider an affine cipher
More informationThis document contains additional questions; it is not intended to be treated as a complete paper.
1 AS COMPUTER SCIENCE Paper 2 Additional Questions These questions focus primarily on topics that were not covered by the AQA AS and A-level Computing specifications, introduced in 2009. It is hoped that
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted
More informationCHW 261: Logic Design
CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER
More informationObjectives. Connecting with Computer Science 2
Objectives Learn why numbering systems are important to understand Refresh your knowledge of powers of numbers Learn how numbering systems are used to count Understand the significance of positional value
More informationGreat Theoretical Ideas in Computer Science. Lecture 27: Cryptography
15-251 Great Theoretical Ideas in Computer Science Lecture 27: Cryptography What is cryptography about? Adversary Eavesdropper I will cut his throat I will cut his throat What is cryptography about? loru23n8uladjkfb!#@
More informationEncryption à la Mod Name
Rock Around the Clock Part Encryption à la Mod Let s call the integers,, 3,, 5, and the mod 7 encryption numbers and define a new mod 7 multiplication operation, denoted by, in the following manner: a
More informationSenior Math Circles Cryptography and Number Theory Week 1
Senior Math Circles Cryptography and Number Theory Week 1 Dale Brydon Feb. 2, 2014 1 One-Time Pads Cryptography deals with the problem of encoding a message in such a way that only the intended recipient
More informationCryptography. Cryptography is much more than. What is Cryptography, exactly? Why Cryptography? (cont d) Straight encoding and decoding
Copyright 2000-2001, University of Washington Cryptography is much more than Cryptography Cryptography systems allow 2 parties to communicate securely. The intent is to give privacy, integrity and security
More informationBasics of Information Worksheet
Basics of Information Worksheet Concept Inventory: Notes: Measuring information content; entropy Two s complement; modular arithmetic Variable-length encodings; Huffman s algorithm Hamming distance, error
More informationCSN Telecommunications. 5: Error Coding. Data, Audio, Video and Images Prof Bill Buchanan
CSN874 Telecommunications 5: Error Coding Data, Audio, Video and Images http://asecuritysite.com/comms Prof Bill Buchanan CSN874 Telecommunications 5: Error Coding: Modulo-2 Data, Audio, Video and Images
More informationSolve the matrix equation AX B for X by using A.(1-3) Use the Inverse Matrix Calculator Link to check your work
Name: Math 1324 Activity 9(4.6)(Due by Oct. 20) Dear Instructor or Tutor, These problems are designed to let my students show me what they have learned and what they are capable of doing on their own.
More informationSome Stuff About Crypto
Some Stuff About Crypto Adrian Frith Laboratory of Foundational Aspects of Computer Science Department of Mathematics and Applied Mathematics University of Cape Town This work is licensed under a Creative
More informationA nice outline of the RSA algorithm and implementation can be found at:
Cryptography Lab: RSA Encryption and Decryption Lab Objectives: After this lab, the students should be able to Explain the simple concepts of encryption and decryption to protect information in transmission.
More informationModern Cryptography Activity 1: Caesar Ciphers
Activity 1: Caesar Ciphers Preliminaries: The Caesar cipher is one of the oldest codes in existence. It is an example of a substitution cipher, where each letter in the alphabet is replaced by another
More informationDigital Fundamentals. CHAPTER 2 Number Systems, Operations, and Codes
Digital Fundamentals CHAPTER 2 Number Systems, Operations, and Codes Decimal Numbers The decimal number system has ten digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 The decimal numbering system has a base of
More informationCIS 3362 Final Exam 12/4/2013. Name:
CIS 3362 Final Exam 12/4/2013 Name: 1) (10 pts) Since the use of letter frequencies was known to aid in breaking substitution ciphers, code makers in the Renaissance added "twists" to the standard substitution
More informationInformation Science 2
Information Science 2 - Path Lengths and Huffman s Algorithm- Week 06 College of Information Science and Engineering Ritsumeikan University Agenda l Review of Weeks 03-05 l Tree traversals and notations
More informationCh. 7 Error Detection and Correction
Ch. 7 Error Detection and Correction Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and corrected. 2 1. Introduction Let us
More informationC = E(p) = (p + k) mod (n) p = D(C) = (C k) mod (n)
Substitutions ciphers (monoalphabetic) A substitution technique is one in which the characters of plaintext are replaced by other characters or by numbers or symbols. If the plaintext is viewed as a sequence
More informationCRYPTOLOGY KEY MANAGEMENT CRYPTOGRAPHY CRYPTANALYSIS. Cryptanalytic. Brute-Force. Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext
CRYPTOLOGY CRYPTOGRAPHY KEY MANAGEMENT CRYPTANALYSIS Cryptanalytic Brute-Force Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext 58 Types of Cryptographic Private key (Symmetric) Public
More informationThe Caesar Cipher Informatics 1 Functional Programming: Tutorial 3
The Caesar Cipher Informatics 1 Functional Programming: Tutorial 3 Heijltjes, Wadler Due: The tutorial of week 5 (23/24 Oct.) Reading assignment: Chapters 8 and 9 (pp. 135-166) Please attempt the entire
More informationCS1800 Discrete Structures Fall 2017 October 25, CS1800 Discrete Structures Midterm Version B
CS1800 Discrete Structures Fall 2017 October 25, 2017 Instructions: CS1800 Discrete Structures Midterm Version B 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More informationMath 25 and Maple 3 + 4;
Math 25 and Maple This is a brief document describing how Maple can help you avoid some of the more tedious tasks involved in your Math 25 homework. It is by no means a comprehensive introduction to using
More informationCS1800 Discrete Structures Fall 2017 October 25, CS1800 Discrete Structures Midterm Version B
CS1800 Discrete Structures Fall 2017 October 25, 2017 Instructions: CS1800 Discrete Structures Midterm Version B 1. The exam is closed book and closed notes. You may not use a calculator or any other electronic
More information15110 Principles of Computing, Carnegie Mellon University - CORTINA. Digital Data
UNIT 7A Data Representa1on: Numbers and Text 1 Digital Data 10010101011110101010110101001110 What does this binary sequence represent? It could be: an integer a floa1ng point number text encoded with ASCII
More informationAdvanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science
Advanced Computer Networks Department of Computer Science DCS COMSATS Institute of Information Technology Rab Nawaz Jadoon Assistant Professor COMSATS University, Lahore Pakistan Advanced Computer Networks
More informationLearning Programme Fundamentals of data representation AS Level
Learning Programme Fundamentals of data representation AS Level Topic/Content Objectives/Skills Homework Assessment Stretch & Challenge (Thirst for Learning) Number systems Be familiar with the concept
More informationDigital Systems and Binary Numbers
Digital Systems and Binary Numbers Mano & Ciletti Chapter 1 By Suleyman TOSUN Ankara University Outline Digital Systems Binary Numbers Number-Base Conversions Octal and Hexadecimal Numbers Complements
More informationA New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam Patel 3 Rakesh Patel 4
IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 08, 2014 ISSN (online): 2321-0613 A New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam
More information2/7/2013. CS 472 Network and System Security. Mohammad Almalag Lecture 2 January 22, Introduction To Cryptography
CS 472 Network and System Security Mohammad Almalag malmalag@cs.odu.edu Lecture 2 January 22, 2013 Introduction To Cryptography 1 Definitions Cryptography = the science (art) of encryption Cryptanalysis
More informationCryptographic Methods for Deciphering/Identifying Ciphers in MATLAB
Cryptographic Methods for Deciphering/Identifying Ciphers in MATLAB 1 Christian Pinto, BTech, 2 Harrison Carranza, MIS 1 The New York City College of Technology CUNY, USA, christian.pinto@mail.citytech.cuny.edu
More informationSankalchand Patel College of Engineering, Visnagar B.E. Semester V (CE/IT) INFORMATION SECURITY Practical List
1. IMPLEMENT CAESAR CIPHER WITH VARIABLE KEY It is an encryption technique in which each plaintext letter is to be replaced with one a fixed number of places (in following implementation, key) down the
More informationCS1800 Discrete Structures Spring 2017 Profs. Gold & Schnyder April 28, CS1800 Discrete Structures Final
S1800 Discrete Structures Spring 2017 Profs. Gold & Schnyder pril 28, 2017 S1800 Discrete Structures Final Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements Access to Canvas? 2 nd Edition vs. 1 st Edition HW1 due on Tuesday, 2/7 Discrete Math Readings/Quizzes on Canvas due on Tuesday, 2/14 Agenda Last time:
More informationNature Sunday Academy Lesson Plan
Title Computer Security Description: Nature Sunday Academy Lesson Plan 2013-14 The objective of the lesson plan aims to help students to understand the general goals of security, the essential concerns
More informationBINARY SYSTEM. Binary system is used in digital systems because it is:
CHAPTER 2 CHAPTER CONTENTS 2.1 Binary System 2.2 Binary Arithmetic Operation 2.3 Signed & Unsigned Numbers 2.4 Arithmetic Operations of Signed Numbers 2.5 Hexadecimal Number System 2.6 Octal Number System
More informationBasic Concepts and Definitions. CSC/ECE 574 Computer and Network Security. Outline
CSC/ECE 574 Computer and Network Security Topic 2. Introduction to Cryptography 1 Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationMath From Scratch Lesson 22: The RSA Encryption Algorithm
Math From Scratch Lesson 22: The RSA Encryption Algorithm W. Blaine Dowler January 2, 2012 Contents 1 What Is Encryption? 1 2 What Is RSA Encryption? 2 2.1 Key Generation............................ 2
More informationENEE x Digital Logic Design. Lecture 3
ENEE244-x Digital Logic Design Lecture 3 Announcements Homework due today. Homework 2 will be posted by tonight, due Monday, 9/2. First recitation quiz will be tomorrow on the material from Lectures and
More informationGroups of two-state devices are used to represent data in a computer. In general, we say the states are either: high/low, on/off, 1/0,...
Chapter 9 Computer Arithmetic Reading: Section 9.1 on pp. 290-296 Computer Representation of Data Groups of two-state devices are used to represent data in a computer. In general, we say the states are
More informationBehrang Noohi. 22 July Behrang Noohi (QMUL) 1 / 18
Behrang Noohi School of Mathematical Sciences Queen Mary University of London 22 July 2014 Behrang Noohi (QMUL) 1 / 18 Introduction Secure Communication How can one send a secret message? Steganography
More informationSubstitution Ciphers, continued. 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet.
Substitution Ciphers, continued 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet. Non-periodic case: Running key substitution ciphers use a known text (in a standard
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 1 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Analog Quantities Most natural quantities
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 11 Coding Strategies and Introduction to Huffman Coding The Fundamental
More informationCS 135: Fall Project 2 Simple Cryptography
CS 135: Fall 2010. Project 2 Simple Cryptography Project Rules: You should work on the project in your assigned team. This project is worth 60 points towards your total projects grade. If you choose to
More informationLecture 2 Algorithms with numbers
Advanced Algorithms Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2013-2014 Lecture 2 Algorithms with numbers 1 RSA Algorithm Why does RSA work? RSA is based
More informationLecture 07: Private-key Encryption. Private-key Encryption
Lecture 07: Three algorithms Key Generation: Generate the secret key sk Encryption: Given the secret key sk and a message m, it outputs the cipher-text c (Note that the encryption algorithm can be a randomized
More informationText Compression through Huffman Coding. Terminology
Text Compression through Huffman Coding Huffman codes represent a very effective technique for compressing data; they usually produce savings between 20% 90% Preliminary example We are given a 100,000-character
More informationSecret Key Cryptography
Secret Key Cryptography 1 Block Cipher Scheme Encrypt Plaintext block of length N Decrypt Secret key Cipher block of length N 2 Generic Block Encryption Convert a plaintext block into an encrypted block:
More informationIntro. To Multimedia Engineering Lossless Compression
Intro. To Multimedia Engineering Lossless Compression Kyoungro Yoon yoonk@konkuk.ac.kr 1/43 Contents Introduction Basics of Information Theory Run-Length Coding Variable-Length Coding (VLC) Dictionary-based
More informationCS1800 Discrete Structures Final Version A
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use
More informationCHAPTER V NUMBER SYSTEMS AND ARITHMETIC
CHAPTER V-1 CHAPTER V CHAPTER V NUMBER SYSTEMS AND ARITHMETIC CHAPTER V-2 NUMBER SYSTEMS RADIX-R REPRESENTATION Decimal number expansion 73625 10 = ( 7 10 4 ) + ( 3 10 3 ) + ( 6 10 2 ) + ( 2 10 1 ) +(
More informationCryptography Lesson Plan
Cryptography Lesson Plan Overview - Cryptography Summary There is a large amount of sensitive information being stored on computers and transmitted between computers today, including account passwords,
More informationCSCI 454/554 Computer and Network Security. Topic 2. Introduction to Cryptography
CSCI 454/554 Computer and Network Security Topic 2. Introduction to Cryptography Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationLab 1: Cipher Fundamentals
Lab 1: Cipher Fundamentals Objective: The key objective of this lab is to be introduced to some of the fundamental principles involved in cryptography, including the usage of Base-64, hexadecimal, the
More informationCryptography I ALFE APRTGHAL KAP BQQQ ADCQTPEMY KSANG A KGA-ETAM MFLK FQRUQY
Cryptography I ALFE APRTGHAL KAP BQQQ ADCQTPEMY KSANG A KGA-ETAM MFLK FQRUQY Math Circle January 14, 2018 1. For as long as humans have existed, humans have tried to hide information from other humans.
More information15 July, Huffman Trees. Heaps
1 Huffman Trees The Huffman Code: Huffman algorithm uses a binary tree to compress data. It is called the Huffman code, after David Huffman who discovered d it in 1952. Data compression is important in
More informationOutline. Cryptography. Encryption/Decryption. Basic Concepts and Definitions. Cryptography vs. Steganography. Cryptography: the art of secret writing
Outline CSCI 454/554 Computer and Network Security Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues Topic 2. Introduction to Cryptography 2 Cryptography Basic Concepts
More information15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2
15110 PRINCIPLES OF COMPUTING SAMPLE EXAM 2 Name Section Directions: Answer each question neatly in the space provided. Please read each question carefully. You have 50 minutes for this exam. No electronic
More informationFault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes
Fault Tolerance & Reliability CDA 5140 Chapter 2 Additional Interesting Codes m-out-of-n codes - each binary code word has m ones in a length n non-systematic codeword - used for unidirectional errors
More informationLab 1: Cipher Fundamentals
Lab 1: Cipher Fundamentals Objective: The key objective of this lab is to be introduced to some of the fundamental principles involved in cryptography, including the usage of Base-64, hexadecimal, the
More informationOVE EDFORS ELECTRICAL AND INFORMATION TECHNOLOGY
1 Information Transmission Chapter 6 Cryptology OVE EDFORS ELECTRICAL AND INFORMATION TECHNOLOGY Learning outcomes After this lecture the student should undertand what cryptology is and how it is used,
More informationChapter 2 Number Systems and Codes Dr. Xu
Chapter 2 Number Systems and Codes Dr. Xu Chapter 2 Objectives Selected areas covered in this chapter: Converting between number systems. Decimal, binary, hexadecimal. Advantages of the hexadecimal number
More informationL2. An Introduction to Classical Cryptosystems. Rocky K. C. Chang, 23 January 2015
L2. An Introduction to Classical Cryptosystems Rocky K. C. Chang, 23 January 2015 This and the next set of slides 2 Outline Components of a cryptosystem Some modular arithmetic Some classical ciphers Shift
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Quiz 2 Agenda Lecture: Chapter 2 (2-7 through 2-11):
More informationLab 5: Ciphers and Crypto Fundamentals
Lab 5: Ciphers and Crypto Fundamentals Aim: Bill, Richard, Charley The aim of this lab is to give an introduction to ciphers, basic encoding/decoding techniques and frequency analysis, as to provide some
More informationClassic Cryptography: From Caesar to the Hot Line
Classic Cryptography: From Caesar to the Hot Line Wenyuan Xu Department of Computer Science and Engineering University of South Carolina Overview of the Lecture Overview of Cryptography and Security Classical
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 1 Block Ciphers A block cipher is an encryption scheme in which the plaintext
More informationJNTU World JNTU World. JNTU World. Cryptography and Network Security. Downloaded From JNTU World (http://(http:// )(http:// )JNTU World
Cryptography and Network Security )(http:// ) Downloaded From (http://(http:// )(http:// ) Downloaded From (http://(http:// Introduction The art of war teaches us not on the likelihood of the enemy s not
More informationThe inverse of a matrix
The inverse of a matrix A matrix that has an inverse is called invertible. A matrix that does not have an inverse is called singular. Most matrices don't have an inverse. The only kind of matrix that has
More informationRSA (material drawn from Avi Kak Lecture 12, Lecture Notes on "Computer and Network Security" Used in asymmetric crypto.
RSA (material drawn from Avi Kak (kak@purdue.edu) Lecture 12, Lecture Notes on "Computer and Network Security" Used in asymmetric crypto. protocols The RSA algorithm is based on the following property
More informationClassical Encryption Techniques. CSS 322 Security and Cryptography
Classical Encryption Techniques CSS 322 Security and Cryptography Contents Terminology and Models Requirements, Services and Attacks Substitution Ciphers Caesar, Monoalphabetic, Polyalphabetic, One-time
More informationCryptosystems. Lecture 34. Robb T. Koether. Hampden-Sydney College. Mon, Nov 24, 2014
Cryptosystems Lecture 34 Robb T. Koether Hampden-Sydney College Mon, Nov 24, 2014 Robb T. Koether (Hampden-Sydney College) Cryptosystems Mon, Nov 24, 2014 1 / 20 1 Assignment 2 Cryptosystems 3 Caesar Ciphers
More informationData Representation 1
1 Data Representation Outline Binary Numbers Adding Binary Numbers Negative Integers Other Operations with Binary Numbers Floating Point Numbers Character Representation Image Representation Sound Representation
More informationCMSC 2833 Lecture 18. Parity Add a bit to make the number of ones (1s) transmitted odd.
Parity Even parity: Odd parity: Add a bit to make the number of ones (1s) transmitted even. Add a bit to make the number of ones (1s) transmitted odd. Example and ASCII A is coded 100 0001 Parity ASCII
More informationNo. of blue jelly beans No. of bags
Math 167 Ch5 Review 1 (c) Janice Epstein CHAPTER 5 EXPLORING DATA DISTRIBUTIONS A sample of jelly bean bags is chosen and the number of blue jelly beans in each bag is counted. The results are shown in
More informationChapter 3. Cryptography. Information Security/System Security p. 33/617
Chapter 3 Cryptography Information Security/System Security p. 33/617 Introduction A very important tool for security is cryptography Cryptography is the (art and) science of keeping information secure
More informationQuantum Encryption Keys
Quantum Technology PROGRAMME ACTIVITY SHEETS Quantum Encryption Keys SHARING DECRYPTION KEYS AND DECODING MESSAGES Every time you send an email or you pay for something online, or with your debit card,
More informationBits and Bit Patterns
Bits and Bit Patterns Bit: Binary Digit (0 or 1) Bit Patterns are used to represent information. Numbers Text characters Images Sound And others 0-1 Boolean Operations Boolean Operation: An operation that
More informationCredit Cards. Validating Credit Cards. Answers
Answers 7 8 9 10 11 12 TI-Nspire Coding Student 60 min Validating Credit Cards Imagine you are building a website that requires financial transactions to take place. Users need to enter their credit card
More informationMulti-Level Encryption using SDES Key Generation Technique with Genetic Algorithm
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume - 3 Issue - 8 August, 2014 Page No. 7596-7576 Multi-Level Encryption using SDES Key Generation Technique with
More informationPublic Key Cryptography
graphy CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L07, Steve/Courses/2011/S2/CSS322/Lectures/rsa.tex,
More informationECE 646 Fall 2009 Final Exam December 15, Multiple-choice test
ECE 646 Fall 2009 Final Exam December 15, 2009 Multiple-choice test 1. (1 pt) Parallel processing can be used to speed up the following cryptographic transformations (please note that multiple answers
More informationA different kind of Crypto
A different kind of Crypto Parker Schmitt November 16, 2014 1 Contents 1 Introduction 3 2 A brief discussion of modern crypto 3 2.1 How modern (non-payload) crypto works............. 4 2.2 Known Plaintext
More informationENCRYPT AND DECRYPT IMAGE USING VIGENERE CIPHER
Volume 118 No. 24 2018 ISSN: 1314-3395 (on-line version) url: http://www.acadpubl.eu/hub/ http://www.acadpubl.eu/hub/ ENCRYPT AND DECRYPT IMAGE USING VIGENERE CIPHER Vaka Vamshi Krishna Reddy 1, Sreedhar
More informationCSE COMPUTER USE: Fundamentals Test 1 Version D
Name:, (Last name) (First name) Student ID#: Registered Section: Instructor: Lew Lowther Solutions York University Faculty of Pure and Applied Science Department of Computer Science CSE 1520.03 COMPUTER
More informationEntropy Coding. - to shorten the average code length by assigning shorter codes to more probable symbols => Morse-, Huffman-, Arithmetic Code
Entropy Coding } different probabilities for the appearing of single symbols are used - to shorten the average code length by assigning shorter codes to more probable symbols => Morse-, Huffman-, Arithmetic
More informationCOMM1003. Information Theory. Dr. Wassim Alexan Spring Lecture 4
COMM1003 Information Theory Dr. Wassim Alexan Spring 2018 Lecture 4 Cryptology Cryptology is the most general term and it splits into two parts: Cryptography and Cryptanalysis Cryptography is the science
More information2015 Mu Alpha Theta National Convention Alpha Algorithms. 1. What is the smallest prime that divides 703? a) 13 b) 17 c) 29 d) 37 e) NOTA
1. What is the smallest prime that divides 703? a) 13 b) 17 c) 29 d) 37 e) NOTA 2. Evaluate: a) b) c) d) 64 e) NOTA 3. Let and, and let be a matrix such that. What is? a) b) c) d) No such exists e) NOTA
More information