Learning outcomes. Palettes and GIF. The colour palette. Using the colour palette The GIF file. CSM25 Secure Information Hiding

Size: px
Start display at page:

Download "Learning outcomes. Palettes and GIF. The colour palette. Using the colour palette The GIF file. CSM25 Secure Information Hiding"

Transcription

1 Learning outcomes Palettes and GIF CSM25 Secure Information Hiding Dr Hans Georg Schaathun University of Surrey Learn how images are represented using a palette Get an overview of hiding techniques in GIF et c. Understand how grayscale steganography can be adapted for palette images Spring 2007 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 The image format The image format The colour palette Using the colour palette The GIF file 0 The palette is a table of colours Typically 256 for images Sometimes 8 or 16 for screen view Each colour has an index The palette can be stored as array of (say) 256 entries each entry: RGB colour... using 3 8 bits The GIF file format uses the colour palette... in the spatial domain Like the grayscale image, GIF is a matrix, I entry (x, y) defines the colour of pixel (x, y) however I x,y is the index of a colour in the palette A GIF file has to store both A palette The pixel matrix (pixmap) Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

2 The image format The palette in Matlab Which is best? GIF? JPEG? true colour? Loading a palette image GIF saves space compared to true colour Perfect representation of selected colours Perfect for drawings and computer graphics where only selected colours are used JPEG is better for photos Colours are truer can blur, losing contrast and detail Remember to store the palette [pixmap,palette] = imread ( picture.gif ) imshow ( pixmap, palette ) otherwise, treated as a weird grayscale image You can work on palette and pixmap separately >> [X,P] = imread ( krinslogo.gif ) ; >> whos X P Name Size Bytes Class Attributes P 256x double X 120x uint8 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 The palette in Matlab Exercise Preliminaries A simple idea Suppose a GIF file uses a 8-bit palette. How much space does this GIF file save compared to a 24-bit true-colour image? Consider a image and a image. Give the answer as a percentage. How do you generate a random binary message (bit string) in matlab? Look up in the help system and find the necessary commands to generate a random N binary (logical) matrix. Data hiding is possible in the palette leaving the pixmap unaltered How? Any ideas? Two basic ideas changing colours changing order Main disadvantage: low capacity Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

3 Changing colours Changing order Minor changes to palette colours as if they were pixels in true colour only difference: there are only (say) 256 entries For instance, LSB Capacity bits (= 768 bits) Define a canonical colour order i.e. obtained by a deterministic sorting algorithm always same order, regardless of input order Assign colour indices according to canonical order For each message, assign a permutation P on {1, 2, 3,..., N} (N is palette size) Shuffle the palette using the permutation of the message Decoder can find canonical order (deterministic) and hence deduce P which maps to the message. N! = N possible messages Approx bits for an 8-bit palette Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Large-scale data hiding First attempt: LSB pixmap is main part of palette image file to hide a lot of data, the pixmap must be used the palette is small can cover a correspondingly small amount of data We still have a pixmap as before Logical to attempt LSB in the colour indices in selected pixels What happens? Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

4 Exercise LSB test What it looks like Take any GIF image from the web. Some test GIF images can be found on the module web pages. Make stego-images by embedding random binary messages of length 10%, 30%, 50% and 75% of capacity in the least significant bit. View the images. What does it look like? Extract the message again. Do you get the same message back? Hint: Reuse functions from previous exercises. Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 So, what do we do? Three possible solutions Green areas, are not too bad Visible, but still green Brown is terrible It is suddenly green Why is this? Neighbour colour in the palette, can be Similar or far away Somehow, we have to change to a similar colour Colour reduction Colour sorting Beyond sorting Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

5 Reduce the palette An ancient solution Sorting Another obvious one Reduce colour depth by 50% 256 colours 128 colours Duplicate each colour (or use a slight variation of it) Such that colour i and colour i + 1 are identical (or almost) Now LSB embedding is hardly perceptible visually How do you steganalyse it? Sort the palette before embedding Consecutive colours similar Unsort before shipping Sorted palette may be suspect The original order should look innocent Many different sort orders Sort by luminence Travelling salesman (EzStego) Let (r i, b i, g i ) be RGB of colour i Minimise P 255 i=0 [(r i r i+1 ) 2 + (b i b i+1 ) 2 + (g i g i+1 ) 2 ] Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Abandon sorting according to Jessica Fridrich Sort order and colour difference Input: Image I, Palette C = {c 1, c 2,..., c L }, Message m Output: Image J for each bit b of m choose a pixel I x,y if I x,y mod 2 b, then find c i C such that c i mod 2 = b and c i I x,y 2 is minimised I x,y := c i end if end for What is the distance c 1 c 2 2 between colours? Euclidean: R 1 R G 1 G B 1 B 2 2 Ignore chrominence: Y 1 Y 2 No obvious choice. Same problem for sorting and abandon sorting Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

6 General principles Reading General approaches in the spatial domain Visual steganalysis Statistical steganalysis... similar to other representations in the spatial domain Structural steganalysis Consider the file format Does it look normal? Core Reading David Wayner: Disappearing Cryptography Chapter 17 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Structural steganalysis General, Spatial Approaches Structural steganalysis considers file format et c. Palette structure can be significant Duplicate colours? Unusual palette order? General structural artifacts (not limited to palette images) Resolution requirements; palette size; et c. Bad or limited software can create artifacts Most attacks on spatial, grayscale images apply χ 2 /pairs of values pairs analysis RS analysis Statistics may vary parameters may need tuning reasoning is the same Let s explore it in excersises. Dr Hans Georg Schaathun Palettes and GIF Spring / 30 Dr Hans Georg Schaathun Palettes and GIF Spring / 30

7 Exercise Steganalysis Take the stego-images created in the previous message, and plot the χ 2 statistic as a function of N. What do you observe? Remark Extra, challenging exercises on the exercise sheet on the web page. Dr Hans Georg Schaathun Palettes and GIF Spring / 30

Steganalysis in JPEG

Steganalysis in JPEG Steganalysis in JPEG CSM25 Secure Information Hiding Dr Hans Georg Schaathun University of Surrey Spring 2007 Dr Hans Georg Schaathun Steganalysis in JPEG Spring 2007 1 / 24 Learning Outcomes learn additional

More information

NEW PIXEL SORTING METHOD FOR PALETTE BASED STEGANOGRAPHY AND COLOR MODEL SELECTION

NEW PIXEL SORTING METHOD FOR PALETTE BASED STEGANOGRAPHY AND COLOR MODEL SELECTION NEW PIXEL SORTING METHOD FOR PALETTE BASED STEGANOGRAPHY AND COLOR MODEL SELECTION Sos S. Agaian 1 and Juan P. Perez 2 1NSP Lab, The University of Texas at San Antonio, Electrical Engineering Department,

More information

Learning Outcomes. Information Theory and Synthetic Steganography. Reading. The communications problem

Learning Outcomes. Information Theory and Synthetic Steganography. Reading. The communications problem Learning Outcomes Information Theory and Synthetic Steganography CSM25 Secure Information Hiding Dr Hans Georg Schaathun University of Surrey Spring 2009 Week 8 understand the relationship between steganography

More information

Information Theory and Synthetic Steganography

Information Theory and Synthetic Steganography Information Theory and Synthetic Steganography CSM25 Secure Information Hiding Dr Hans Georg Schaathun University of Surrey Spring 2009 Week 8 Dr Hans Georg Schaathun Information Theory and Synthetic Steganography

More information

Fisher Information Determines Capacity of ε-secure Steganography

Fisher Information Determines Capacity of ε-secure Steganography Fisher Information Determines Capacity of ε-secure Steganography Tomáš Filler and Jessica Fridrich Dept. of Electrical and Computer Engineering SUNY Binghamton, New York 11th Information Hiding, Darmstadt,

More information

MAT 343 Laboratory 6 The SVD decomposition and Image Compression

MAT 343 Laboratory 6 The SVD decomposition and Image Compression MA 4 Laboratory 6 he SVD decomposition and Image Compression In this laboratory session we will learn how to Find the SVD decomposition of a matrix using MALAB Use the SVD to perform Image Compression

More information

Information Hiding and Covert Communication

Information Hiding and Covert Communication Information Hiding and Covert Communication Andrew Ker adk @ comlab.ox.ac.uk Royal Society University Research Fellow Oxford University Computing Laboratory Foundations of Security Analysis and Design

More information

Information Hiding. Andrew D. Ker. 10 Lectures, Hilary Term (complete) Department of Computer Science, Oxford University

Information Hiding. Andrew D. Ker. 10 Lectures, Hilary Term (complete) Department of Computer Science, Oxford University Information Hiding (complete) Andrew D. Ker 10 Lectures, Hilary Term 2016 Department of Computer Science, Oxford University ii Contents 0 Introduction 1 0.1 Preliminary Material..............................

More information

Complete characterization of perfectly secure stego-systems with mutually independent embedding operation

Complete characterization of perfectly secure stego-systems with mutually independent embedding operation Complete characterization of perfectly secure stego-systems with mutually independent embedding operation Tomáš Filler and Jessica Fridrich Dept. of Electrical and Computer Engineering SUNY Binghamton,

More information

Improved Adaptive LSB Steganography based on Chaos and Genetic Algorithm

Improved Adaptive LSB Steganography based on Chaos and Genetic Algorithm Improved Adaptive LSB Steganography based on Chaos and Genetic Algorithm Lifang Yu, Yao Zhao 1, Rongrong Ni, Ting Li Institute of Information Science, Beijing Jiaotong University, BJ 100044, China Abstract

More information

QISLSQb: A Quantum Image Steganography Scheme Based on Least Significant Qubit

QISLSQb: A Quantum Image Steganography Scheme Based on Least Significant Qubit 06 International Conference on Mathematical, Computational and Statistical Sciences and Engineering (MCSSE 06) ISBN: 978--60595-396-0 QISLSQb: A Quantum Image Steganography Scheme Based on Least Significant

More information

ROC Curves for Steganalysts

ROC Curves for Steganalysts ROC Curves for Steganalysts Andreas Westfeld Technische Universität Dresden Institut für Systemarchitektur 01062 Dresden mailto:westfeld@inf.tu-dresden.de 1 Introduction There are different approaches

More information

Information and Entropy. Professor Kevin Gold

Information and Entropy. Professor Kevin Gold Information and Entropy Professor Kevin Gold What s Information? Informally, when I communicate a message to you, that s information. Your grade is 100/100 Information can be encoded as a signal. Words

More information

Quantitative Steganalysis of LSB Embedding in JPEG Domain

Quantitative Steganalysis of LSB Embedding in JPEG Domain Quantitative Steganalysis of LSB Embedding in JPEG Domain Jan Kodovský, Jessica Fridrich September 10, 2010 / ACM MM&Sec 10 1 / 17 Motivation Least Significant Bit (LSB) embedding Simplicity, high embedding

More information

Research Article Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm

Research Article Improved Adaptive LSB Steganography Based on Chaos and Genetic Algorithm Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2010, Article ID 876946, 6 pages doi:10.1155/2010/876946 Research Article Improved Adaptive LSB Steganography Based

More information

Steganalysis with a Computational Immune System

Steganalysis with a Computational Immune System DIGITAL FORENSIC RESEARCH CONFERENCE Steganalysis with a Computational Immune System By Jacob Jackson, Gregg Gunsch, Roger Claypoole, Gary Lamont Presented At The Digital Forensic Research Conference DFRWS

More information

Compression. Reality Check 11 on page 527 explores implementation of the MDCT into a simple, working algorithm to compress audio.

Compression. Reality Check 11 on page 527 explores implementation of the MDCT into a simple, working algorithm to compress audio. C H A P T E R 11 Compression The increasingly rapid movement of information around the world relies on ingenious methods of data representation, which are in turn made possible by orthogonal transformations.the

More information

Hiding Data in a QImage File

Hiding Data in a QImage File Hiding Data in a QImage File Gabriela Mogos Abstract The idea of embedding some information within a digital media, in such a way that the inserted data are intrinsically part of the media itself, has

More information

8 The SVD Applied to Signal and Image Deblurring

8 The SVD Applied to Signal and Image Deblurring 8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an

More information

4. Quantization and Data Compression. ECE 302 Spring 2012 Purdue University, School of ECE Prof. Ilya Pollak

4. Quantization and Data Compression. ECE 302 Spring 2012 Purdue University, School of ECE Prof. Ilya Pollak 4. Quantization and Data Compression ECE 32 Spring 22 Purdue University, School of ECE Prof. What is data compression? Reducing the file size without compromising the quality of the data stored in the

More information

2. Definition & Classification

2. Definition & Classification Information Hiding Data Hiding K-H Jung Agenda 1. Data Hiding 2. Definition & Classification 3. Related Works 4. Considerations Definition of Data Hiding 3 Data Hiding, Information Hiding Concealing secret

More information

A Hybrid Method with Lorenz attractor based Cryptography and LSB Steganography

A Hybrid Method with Lorenz attractor based Cryptography and LSB Steganography International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article A Hybrid

More information

Review for Exam 1. Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA

Review for Exam 1. Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA Review for Exam Erik G. Learned-Miller Department of Computer Science University of Massachusetts, Amherst Amherst, MA 0003 March 26, 204 Abstract Here are some things you need to know for the in-class

More information

Introduction to SVD and Applications

Introduction to SVD and Applications Introduction to SVD and Applications Eric Kostelich and Dave Kuhl MSRI Climate Change Summer School July 18, 2008 Introduction The goal of this exercise is to familiarize you with the basics of the singular

More information

Multimedia & Computer Visualization. Exercise #5. JPEG compression

Multimedia & Computer Visualization. Exercise #5. JPEG compression dr inż. Jacek Jarnicki, dr inż. Marek Woda Institute of Computer Engineering, Control and Robotics Wroclaw University of Technology {jacek.jarnicki, marek.woda}@pwr.wroc.pl Exercise #5 JPEG compression

More information

8 The SVD Applied to Signal and Image Deblurring

8 The SVD Applied to Signal and Image Deblurring 8 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an

More information

Matrix Embedding with Pseudorandom Coefficient Selection and Error Correction for Robust and Secure Steganography

Matrix Embedding with Pseudorandom Coefficient Selection and Error Correction for Robust and Secure Steganography Matrix Embedding with Pseudorandom Coefficient Selection and Error Correction for Robust and Secure Steganography Anindya Sarkar, Student Member, IEEE, Upamanyu Madhow, Fellow, IEEE, and B. S. Manjunath,

More information

Image Data Compression

Image Data Compression Image Data Compression Image data compression is important for - image archiving e.g. satellite data - image transmission e.g. web data - multimedia applications e.g. desk-top editing Image data compression

More information

New Steganographic scheme based of Reed- Solomon codes

New Steganographic scheme based of Reed- Solomon codes New Steganographic scheme based of Reed- Solomon codes I. DIOP; S.M FARSSI ;O. KHOUMA ; H. B DIOUF ; K.TALL ; K.SYLLA Ecole Supérieure Polytechnique de l Université Dakar Sénégal Email: idydiop@yahoo.fr;

More information

The course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab.

The course web site s notes entitled Switches, Gates and Circuits which can be found at will be useful to you throughout the lab. Circuits Lab Names: Objectives Learn how circuits work, different properties of circuits, and how to derive truth tables, circuits from functions and simply circuits using Boolean circuit equivalence..

More information

6 The SVD Applied to Signal and Image Deblurring

6 The SVD Applied to Signal and Image Deblurring 6 The SVD Applied to Signal and Image Deblurring We will discuss the restoration of one-dimensional signals and two-dimensional gray-scale images that have been contaminated by blur and noise. After an

More information

Mathematics Masters Examination

Mathematics Masters Examination Mathematics Masters Examination OPTION 4 Fall 2015 MATHEMATICAL COMPUTER SCIENCE NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the twelve

More information

Lecture 7: More Arithmetic and Fun With Primes

Lecture 7: More Arithmetic and Fun With Primes IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July

More information

Conformational Analysis of n-butane

Conformational Analysis of n-butane Conformational Analysis of n-butane In this exercise you will calculate the Molecular Mechanics (MM) single point energy of butane in various conformations with respect to internal rotation around the

More information

Homework 5 Solutions

Homework 5 Solutions 18-290 Signals and Systems Profs. Byron Yu and Pulkit Grover Fall 2018 Homework 5 Solutions. Part One 1. (12 points) Calculate the following convolutions: (a) x[n] δ[n n 0 ] (b) 2 n u[n] u[n] (c) 2 n u[n]

More information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes

More information

Stego key searching for LSB steganography on JPEG decompressed image

Stego key searching for LSB steganography on JPEG decompressed image . RESEARCH PAPER. SCIENCE CHINA Information Sciences March 2016, Vol. 59 032105:1 032105:15 doi: 10.1007/s11432-015-5367-x Stego key searching for LSB steganography on JPEG decompressed image Jiufen LIU

More information

The Haar Wavelet Transform: Compression and. Reconstruction

The Haar Wavelet Transform: Compression and. Reconstruction The Haar Wavelet Transform: Compression and Damien Adams and Halsey Patterson December 14, 2006 Abstract The Haar Wavelet Transformation is a simple form of compression involved in averaging and differencing

More information

CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment.

CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment. CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES A selection of the following questions will be chosen by the lecturer to form the Cryptology Assignment. The Cryptology Assignment is due by 5pm Sunday 1

More information

1 Ex. 1 Verify that the function H(p 1,..., p n ) = k p k log 2 p k satisfies all 8 axioms on H.

1 Ex. 1 Verify that the function H(p 1,..., p n ) = k p k log 2 p k satisfies all 8 axioms on H. Problem sheet Ex. Verify that the function H(p,..., p n ) = k p k log p k satisfies all 8 axioms on H. Ex. (Not to be handed in). looking at the notes). List as many of the 8 axioms as you can, (without

More information

An introduction to plotting data

An introduction to plotting data An introduction to plotting data Eric D. Black California Institute of Technology v2.0 1 Introduction Plotting data is one of the essential skills every scientist must have. We use it on a near-daily basis

More information

12. Machine learning I. Regression Overfitting Classification Example: Handwritten digit recognition Support vector machines (SVMs)

12. Machine learning I. Regression Overfitting Classification Example: Handwritten digit recognition Support vector machines (SVMs) 12. Machine learning I Regression Overfitting Classification Example: Handwritten digit recognition Support vector machines (SVMs) 48 Regression Suppose we are given N pairs of a vector x and a scalar

More information

FACULTY OF SCIENCE ACADEMY OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING OBJECT ORIENTED PROGRAMMING DATE 07/2014 SESSION 8:00-10:00

FACULTY OF SCIENCE ACADEMY OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING OBJECT ORIENTED PROGRAMMING DATE 07/2014 SESSION 8:00-10:00 FACULTY OF SCIENCE ACADEMY OF COMPUTER SCIENCE AND SOFTWARE ENGINEERING MODULE CAMPUS CSC2A10 OBJECT ORIENTED PROGRAMMING AUCKLAND PARK CAMPUS (APK) EXAM JULY 2014 DATE 07/2014 SESSION 8:00-10:00 ASSESOR(S)

More information

Lecture 6 - Raster Data Model & GIS File Organization

Lecture 6 - Raster Data Model & GIS File Organization Lecture 6 - Raster Data Model & GIS File Organization I. Overview of Raster Data Model Raster data models define objects in a fixed manner see Figure 1. Each grid cell has fixed size (resolution). The

More information

Solution to Midterm Examination

Solution to Midterm Examination YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #13 Xueyuan Su November 4, 2008 Instructions: Solution to Midterm Examination This is a closed book

More information

Learning Objectives:

Learning Objectives: Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how -type flip-flops can be connected to form a synchronous counter to meet a given specification; explain

More information

DISCRETE HAAR WAVELET TRANSFORMS

DISCRETE HAAR WAVELET TRANSFORMS DISCRETE HAAR WAVELET TRANSFORMS Catherine Bénéteau University of South Florida Tampa, FL USA UNM - PNM Statewide Mathematics Contest, 2011 SATURDAY, FEBRUARY 5, 2011 (UNM) DISCRETE HAAR WAVELET TRANSFORMS

More information

Homework Set #2 Data Compression, Huffman code and AEP

Homework Set #2 Data Compression, Huffman code and AEP Homework Set #2 Data Compression, Huffman code and AEP 1. Huffman coding. Consider the random variable ( x1 x X = 2 x 3 x 4 x 5 x 6 x 7 0.50 0.26 0.11 0.04 0.04 0.03 0.02 (a Find a binary Huffman code

More information

Image and Multidimensional Signal Processing

Image and Multidimensional Signal Processing Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Image Compression 2 Image Compression Goal: Reduce amount

More information

Image Compression - JPEG

Image Compression - JPEG Overview of JPEG CpSc 86: Multimedia Systems and Applications Image Compression - JPEG What is JPEG? "Joint Photographic Expert Group". Voted as international standard in 99. Works with colour and greyscale

More information

PSEUDORANDOM BINARY SEQUENCES GENERATOR

PSEUDORANDOM BINARY SEQUENCES GENERATOR PSEUDORANDOM BINARY SEQUENCES GENERATOR 1. Theoretical considerations White noise is defined as a random process with power spectral density that is constant in an infinite frequency band. Quasi-white

More information

Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments

Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2006 jzhang@cse.unsw.edu.au

More information

COS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017

COS433/Math 473: Cryptography. Mark Zhandry Princeton University Spring 2017 COS433/Math 473: Cryptography Mark Zhandry Princeton University Spring 27 Previously on COS 433 Security Experiment/Game (One- time setting) b m, m M c Challenger k ß K c ß Enc(k,m b ) b IND-Exp b ( )

More information

Lecture 4: Codes based on Concatenation

Lecture 4: Codes based on Concatenation Lecture 4: Codes based on Concatenation Error-Correcting Codes (Spring 206) Rutgers University Swastik Kopparty Scribe: Aditya Potukuchi and Meng-Tsung Tsai Overview In the last lecture, we studied codes

More information

Imperfect Stegosystems

Imperfect Stegosystems DISSERTATION DEFENSE Imperfect Stegosystems Asymptotic Laws and Near-Optimal Practical Constructions Tomá² Filler Dept. of Electrical and Computer Engineering SUNY Binghamton, New York April 1, 2011 2

More information

CPSC 467: Cryptography and Computer Security

CPSC 467: Cryptography and Computer Security CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 16 October 30, 2017 CPSC 467, Lecture 16 1/52 Properties of Hash Functions Hash functions do not always look random Relations among

More information

Steganalysis of Spread Spectrum Data Hiding Exploiting Cover Memory

Steganalysis of Spread Spectrum Data Hiding Exploiting Cover Memory Steganalysis of Spread Spectrum Data Hiding Exploiting Cover Memory Kenneth Sullivan, Upamanyu Madhow, Shivkumar Chandrasekaran, and B.S. Manjunath Department of Electrical and Computer Engineering University

More information

Solutions to the Mathematics Masters Examination

Solutions to the Mathematics Masters Examination Solutions to the Mathematics Masters Examination OPTION 4 Spring 2007 COMPUTER SCIENCE 2 5 PM NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each

More information

Big O 2/14/13. Administrative. Does it terminate? David Kauchak cs302 Spring 2013

Big O 2/14/13. Administrative. Does it terminate? David Kauchak cs302 Spring 2013 /4/3 Administrative Big O David Kauchak cs3 Spring 3 l Assignment : how d it go? l Assignment : out soon l CLRS code? l Videos Insertion-sort Insertion-sort Does it terminate? /4/3 Insertion-sort Loop

More information

Problem 1: (3 points) Recall that the dot product of two vectors in R 3 is

Problem 1: (3 points) Recall that the dot product of two vectors in R 3 is Linear Algebra, Spring 206 Homework 3 Name: Problem : (3 points) Recall that the dot product of two vectors in R 3 is a x b y = ax + by + cz, c z and this is essentially the same as the matrix multiplication

More information

Building a Computer Adder

Building a Computer Adder Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.

More information

Department of Electrical Engineering, Polytechnic University, Brooklyn Fall 05 EL DIGITAL IMAGE PROCESSING (I) Final Exam 1/5/06, 1PM-4PM

Department of Electrical Engineering, Polytechnic University, Brooklyn Fall 05 EL DIGITAL IMAGE PROCESSING (I) Final Exam 1/5/06, 1PM-4PM Department of Electrical Engineering, Polytechnic University, Brooklyn Fall 05 EL512 --- DIGITAL IMAGE PROCESSING (I) Y. Wang Final Exam 1/5/06, 1PM-4PM Your Name: ID Number: Closed book. One sheet of

More information

Moving into the information age: From records to Google Earth

Moving into the information age: From records to Google Earth Moving into the information age: From records to Google Earth David R. R. Smith Psychology, School of Life Sciences, University of Hull e-mail: davidsmith.butterflies@gmail.com Introduction Many of us

More information

MPSteg-color: a new steganographic technique for color images

MPSteg-color: a new steganographic technique for color images MPSteg-color: a new steganographic technique for color images Giacomo Cancelli, Mauro Barni Università degli Studi di Siena Dipartimento di Ingegneria dell Informazione, Italy {cancelli,barni}@dii.unisi.it

More information

Cryptography and Number Theory

Cryptography and Number Theory Chapter 2 Cryptography and Number Theory 2.1 Cryptography and Modular Arithmetic 2.1.1 Introduction to Cryptography For thousands of years people have searched for ways to send messages in secret. For

More information

Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments. Tutorial 1. Acknowledgement and References for lectures 1 to 5

Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments. Tutorial 1. Acknowledgement and References for lectures 1 to 5 Lecture : Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP959 Multimedia Systems S 006 jzhang@cse.unsw.edu.au Acknowledgement

More information

Cryptography and Security Final Exam

Cryptography and Security Final Exam Cryptography and Security Final Exam Serge Vaudenay 29.1.2018 duration: 3h no documents allowed, except one 2-sided sheet of handwritten notes a pocket calculator is allowed communication devices are not

More information

The Bell-LaPadula Model

The Bell-LaPadula Model The Bell-LaPadula Model CSM27 Computer Security Dr Hans Georg Schaathun University of Surrey Autumn 2007 Dr Hans Georg Schaathun The Bell-LaPadula Model Autumn 2007 1 / 25 The session Session objectives

More information

9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise

9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise 9 THEORY OF CODES Chapter 9 Theory of Codes After studying this chapter you should understand what is meant by noise, error detection and correction; be able to find and use the Hamming distance for a

More information

Image Compression. 1. Introduction. Greg Ames Dec 07, 2002

Image Compression. 1. Introduction. Greg Ames Dec 07, 2002 Image Compression Greg Ames Dec 07, 2002 Abstract Digital images require large amounts of memory to store and, when retrieved from the internet, can take a considerable amount of time to download. The

More information

Exercise Sheet Cryptography 1, 2011

Exercise Sheet Cryptography 1, 2011 Cryptography 1 http://www.cs.ut.ee/~unruh/crypto1-11/ Exercise Sheet Cryptography 1, 2011 Exercise 1 DES The Data Encryption Standard (DES) is a very famous and widely used block cipher. It maps 64-bit

More information

Project 2: Using linear systems for numerical solution of boundary value problems

Project 2: Using linear systems for numerical solution of boundary value problems LINEAR ALGEBRA, MATH 124 Instructor: Dr. T.I. Lakoba Project 2: Using linear systems for numerical solution of boundary value problems Goal Introduce one of the most important applications of Linear Algebra

More information

Public-Key Cryptosystems CHAPTER 4

Public-Key Cryptosystems CHAPTER 4 Public-Key Cryptosystems CHAPTER 4 Introduction How to distribute the cryptographic keys? Naïve Solution Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage:

More information

1. In Activity 1-1, part 3, how do you think graph a will differ from graph b? 3. Draw your graph for Prediction 2-1 below:

1. In Activity 1-1, part 3, how do you think graph a will differ from graph b? 3. Draw your graph for Prediction 2-1 below: PRE-LAB PREPARATION SHEET FOR LAB 1: INTRODUCTION TO MOTION (Due at the beginning of Lab 1) Directions: Read over Lab 1 and then answer the following questions about the procedures. 1. In Activity 1-1,

More information

Lecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures

Lecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures Lecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures Boaz Barak November 27, 2007 Quick review of homework 7 Existence of a CPA-secure public key encryption scheme such that oracle

More information

The Design Procedure. Output Equation Determination - Derive output equations from the state table

The Design Procedure. Output Equation Determination - Derive output equations from the state table The Design Procedure Specification Formulation - Obtain a state diagram or state table State Assignment - Assign binary codes to the states Flip-Flop Input Equation Determination - Select flipflop types

More information

Math 512 Syllabus Spring 2017, LIU Post

Math 512 Syllabus Spring 2017, LIU Post Week Class Date Material Math 512 Syllabus Spring 2017, LIU Post 1 1/23 ISBN, error-detecting codes HW: Exercises 1.1, 1.3, 1.5, 1.8, 1.14, 1.15 If x, y satisfy ISBN-10 check, then so does x + y. 2 1/30

More information

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way EECS 16A Designing Information Devices and Systems I Spring 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate

More information

Basic Concepts in Number Theory and Finite Fields

Basic Concepts in Number Theory and Finite Fields Basic Concepts in Number Theory and Finite Fields Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 4-1 Overview

More information

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 2

Designing Information Devices and Systems I Spring 2019 Lecture Notes Note 2 EECS 6A Designing Information Devices and Systems I Spring 9 Lecture Notes Note Vectors and Matrices In the previous note, we introduced vectors and matrices as a way of writing systems of linear equations

More information

Image Compression. Fundamentals: Coding redundancy. The gray level histogram of an image can reveal a great deal of information about the image

Image Compression. Fundamentals: Coding redundancy. The gray level histogram of an image can reveal a great deal of information about the image Fundamentals: Coding redundancy The gray level histogram of an image can reveal a great deal of information about the image That probability (frequency) of occurrence of gray level r k is p(r k ), p n

More information

Introduction to Hash Tables

Introduction to Hash Tables Introduction to Hash Tables Hash Functions A hash table represents a simple but efficient way of storing, finding, and removing elements. In general, a hash table is represented by an array of cells. In

More information

CPSC 467: Cryptography and Computer Security

CPSC 467: Cryptography and Computer Security CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 14 October 16, 2013 CPSC 467, Lecture 14 1/45 Message Digest / Cryptographic Hash Functions Hash Function Constructions Extending

More information

Numerical Analysis. Carmen Arévalo Lund University Arévalo FMN011

Numerical Analysis. Carmen Arévalo Lund University Arévalo FMN011 Numerical Analysis Carmen Arévalo Lund University carmen@maths.lth.se Discrete cosine transform C = 2 n 1 2 1 2 1 2 cos π 2n cos 3π 2n cos (2n 1)π 2n cos 6π 2n cos 2(2n 1)π 2n cos 2π 2n... cos (n 1)π 2n

More information

Quantum Information & Quantum Computation

Quantum Information & Quantum Computation CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday

More information

Speeding up characteristic 2: I. Linear maps II. The Å(Ò) game III. Batching IV. Normal bases. D. J. Bernstein University of Illinois at Chicago

Speeding up characteristic 2: I. Linear maps II. The Å(Ò) game III. Batching IV. Normal bases. D. J. Bernstein University of Illinois at Chicago Speeding up characteristic 2: I. Linear maps II. The Å(Ò) game III. Batching IV. Normal bases D. J. Bernstein University of Illinois at Chicago NSF ITR 0716498 Part I. Linear maps Consider computing 0

More information

Lecture 5: Hashing. David Woodruff Carnegie Mellon University

Lecture 5: Hashing. David Woodruff Carnegie Mellon University Lecture 5: Hashing David Woodruff Carnegie Mellon University Hashing Universal hashing Perfect hashing Maintaining a Dictionary Let U be a universe of keys U could be all strings of ASCII characters of

More information

Image Data Compression. Steganography and steganalysis Alexey Pak, PhD, Lehrstuhl für Interak;ve Echtzeitsysteme, Fakultät für Informa;k, KIT

Image Data Compression. Steganography and steganalysis Alexey Pak, PhD, Lehrstuhl für Interak;ve Echtzeitsysteme, Fakultät für Informa;k, KIT Image Data Compression Steganography and steganalysis 1 Stenography vs watermarking Watermarking: impercep'bly altering a Work to embed a message about that Work Steganography: undetectably altering a

More information

Communication Complexity. The dialogues of Alice and Bob...

Communication Complexity. The dialogues of Alice and Bob... Communication Complexity The dialogues of Alice and Bob... Alice and Bob make a date Alice and Bob make a date Are you free on Friday? Alice and Bob make a date Are you free on Friday? No, have to work

More information

Learning goals: students learn to use the SVD to find good approximations to matrices and to compute the pseudoinverse.

Learning goals: students learn to use the SVD to find good approximations to matrices and to compute the pseudoinverse. Application of the SVD: Compression and Pseudoinverse Learning goals: students learn to use the SVD to find good approximations to matrices and to compute the pseudoinverse. Low rank approximation One

More information

Image Compression. Qiaoyong Zhong. November 19, CAS-MPG Partner Institute for Computational Biology (PICB)

Image Compression. Qiaoyong Zhong. November 19, CAS-MPG Partner Institute for Computational Biology (PICB) Image Compression Qiaoyong Zhong CAS-MPG Partner Institute for Computational Biology (PICB) November 19, 2012 1 / 53 Image Compression The art and science of reducing the amount of data required to represent

More information

convert a two s complement number back into a recognizable magnitude.

convert a two s complement number back into a recognizable magnitude. 1 INTRODUCTION The previous lesson introduced binary and hexadecimal numbers. In this lesson we look at simple arithmetic operations using these number systems. In particular, we examine the problem of

More information

Problem-Solving via Search Lecture 3

Problem-Solving via Search Lecture 3 Lecture 3 What is a search problem? How do search algorithms work and how do we evaluate their performance? 1 Agenda An example task Problem formulation Infrastructure for search algorithms Complexity

More information

Computer Number Systems

Computer Number Systems Computer Number Systems All computers are electronic devices and can ultimately do one thing: detect whether an electrical signal is on or off. Therefore, the earliest computer scientists realized that

More information

The data for Practical 2 is available for download at the dropbox link embedded in the I sent you.

The data for Practical 2 is available for download at the dropbox link embedded in the  I sent you. EGM310 UNDERWATER REMOTE SENSING PRACTICALS RORY QUINN PRACTICAL 2: MBES BACKSCATTER DATA Aim of practical To gain confidence in interpreting backscatter data derived from multi-beam echo-sounder surveys,

More information

NO Distribute Apr_4_02

NO Distribute Apr_4_02 Capacity is the Wrong Paradigm Ira S. Moskowitz, LiWu Chang, and Richard E. Newman y Information Technology Division, Mail Code 5540 Center for High Assurance Computer Systems Naval Research Laboratory

More information

Capacity is the Wrong Paradigm

Capacity is the Wrong Paradigm Capacity is the Wrong Paradigm Ira S. Moskowitz Center for High Assurance Computer Systems-5540 Naval Research Laboratory Washington, DC 20375 LiWu Chang Center for High Assurance Computer Systems-5540

More information

Please bring the task to your first physics lesson and hand it to the teacher.

Please bring the task to your first physics lesson and hand it to the teacher. Pre-enrolment task for 2014 entry Physics Why do I need to complete a pre-enrolment task? This bridging pack serves a number of purposes. It gives you practice in some of the important skills you will

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION SUPPLEMENTARY INFORMATION doi:10.1038/nature11875 Method for Encoding and Decoding Arbitrary Computer Files in DNA Fragments 1 Encoding 1.1: An arbitrary computer file is represented as a string S 0 of

More information

Cheng Soon Ong & Christian Walder. Canberra February June 2018

Cheng Soon Ong & Christian Walder. Canberra February June 2018 Cheng Soon Ong & Christian Walder Research Group and College of Engineering and Computer Science Canberra February June 218 Outlines Overview Introduction Linear Algebra Probability Linear Regression 1

More information