Cellular Automata Based Authentication (CAA ) Monalisa Mukherjee 1 Niloy Ganguly 2 P Pal Chaudhuri 1 1 Department of Computer Science & Technology, Bengal.

Slides:

Advertisements

Similar presentations

Chapter 3 Public Key Cryptography and Message authentication.

Advertisements

Rob Farraher Ken Pickering Lim Vu

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.

Information Hiding: Watermarking and Steganography

A New Scheme For Robust Blind Digital Video Watermarking Supervised by Prof. LYU, Rung Tsong Michael Presented by Chan Pik Wah, Pat Mar 5, 2002 Department.

Computer and Network Security Mini Lecture by Milica Barjaktarovic.

CS 6262 Spring 02 - Lecture #7 (Tuesday, 1/29/2002) Introduction to Cryptography.

Digital Signatures and Hash Functions. Digital Signatures.

Session 5 Hash functions and digital signatures. Contents Hash functions – Definition – Requirements – Construction – Security – Applications 2/44.

Hash functions a hash function produces a fingerprint of some file/message/data h = H(M)  condenses a variable-length message M  to a fixed-sized fingerprint.

Dr Alejandra Flores-Mosri Message Authentication Internet Management & Security 06 Learning outcomes At the end of this session, you should be able to:

Chapter 5 Cryptography Protecting principals communication in systems.

Watermarking Technology Ishani Vyas CS590 Winter 2008.

Chapter 4  Hash Functions 1 Overview  Cryptographic hash functions are functions that: o Map an arbitrary-length (but finite) input to a fixed-size output.

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

Encapsulation Security Payload Protocol Lan Vu. OUTLINE 1.Introduction and terms 2.ESP Overview 3.ESP Packet Format 4.ESP Fields 5.ESP Modes 6.ESP packet.

Watermarking and Steganography Watermarking is the practice of hiding a message about an image, audio clip, video clip, or other work of media within that.

1 Pertemuan 09 Hash and Message Digest Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

Multimedia Security Digital Video Watermarking Supervised by Prof. LYU, Rung Tsong Michael Presented by Chan Pik Wah, Pat Nov 20, 2002 Department of Computer.

Cryptography1 CPSC 3730 Cryptography Chapter 11, 12 Message Authentication and Hash Functions.

Network Security. Contents Security Requirements and Attacks Confidentiality with Conventional Encryption Message Authentication and Hash Functions Public-Key.

1 Message Authentication and Hash Functions Authentication Requirements Authentication Functions Message Authentication Codes Hash Functions Security of.

CRYPTOGRAPHIC DATA INTEGRITY ALGORITHMS

Network Security Essentials Fifth Edition by William Stallings Fifth Edition by William Stallings.

Chapter 8.  Cryptography is the science of keeping information secure in terms of confidentiality and integrity.  Cryptography is also referred to as.

Cryptography and Network Security Chapter 11 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Csci5233 Computer Security1 GS: Chapter 6 Using Java Cryptography for Authentication.

Digital Watermarking Parag Agarwal

Acknowledgements: William Stallings.William Stallings All rights Reserved Session 4 Public Key Cryptography (Part 2) Network Security Essentials Application.

AIS, Passwords Should not be shared Should be changed by user Should be changed frequently and upon compromise (suspected unauthorized disclosure)

Watermarking University of Palestine Eng. Wisam Zaqoot May 2010.

Theory and Applications of GF(2 p ) Cellular Automata P. Pal Chaudhuri Department of CST Bengal Engineering College (DU) Shibpur, Howrah India (LOGIC ON.

Cryptography, Authentication and Digital Signatures

Technical Seminar Presentation-2004 Presented by : ASHOK KUMAR SAHOO (EI ) NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY Presented By Ashok Kumar.

Russell Taylor. How the law supports Copyright Copyright Designs and Patents Act 1988 Copyright arises when an individual or organisation creates a work,

Digital image processing is the use of computer algorithms to perform image processing on digital images which is a subfield of digital signal processing.

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

4 th lecture.  Message to be encrypted: HELLO  Key: XMCKL H E L L O message 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message + 23 (X) 12 (M) 2 (C) 10 (K) 11.

Theory of Computation II Topic presented by: Alberto Aguilar Gonzalez.

Network Security David Lazăr.

A Case for a Parallelizable Hash Alan Kaminsky and Stanislaw Radziszowski Department of Computer Science B. Thomas Golisano College of Computing and Information.

11.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Message Integrity and Message Authentication.

1 Number Theory and Advanced Cryptography 6. Digital Signature Chih-Hung Wang Sept Part I: Introduction to Number Theory Part II: Advanced Cryptography.

Niloy Ganguly Biplab K Sikdar P Pal Chaudhuri Presented by Niloy Ganguly Indian Institute of Social Welfare and Business Management. Calcutta

Cellular Automata Machine For Pattern Recognition Pradipta Maji 1 Niloy Ganguly 2 Sourav Saha 1 Anup K Roy 1 P Pal Chaudhuri 1 1 Department of Computer.

STEGANOGRAPHY AND DIGITAL WATERMARKING KAKATIYA INSTITUTE OF TECHNOLOGY AND SCIENCES,WARANGAL.

Lecture 2: Introduction to Cryptography

Cryptography 1 Crypto Cryptography 2 Crypto  Cryptology  The art and science of making and breaking “secret codes”  Cryptography  making “secret.

Cryptographic Hash Functions Prepared by Dr. Lamiaa Elshenawy

Intro to Cryptography Lesson Introduction

Cellular Automata Based Hamming Hash Family : Synthesis and Application CELLULAR AUTOMATA BASED HAMMING HASH FAMILY : SYNTHESIS AND APPLICATION Niloy Ganguly.

Cryptographic Hash Functions

CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.

Network Security Celia Li Computer Science and Engineering York University.

IT 221: Introduction to Information Security Principles Lecture 5: Message Authentications, Hash Functions and Hash/Mac Algorithms For Educational Purposes.

Security. Security Needs Computers and data are used by the authorized persons Computers and their accessories, data, and information are available to.

Cryptographic Hash Function. A hash function H accepts a variable-length block of data as input and produces a fixed-size hash value h = H(M). The principal.

IMAGE AUTHENTICATION TECHNIQUES Based on Automatic video surveillance (AVS) systems Guided by: K ASTURI MISHRA PRESENTED BY: MUKESH KUMAR THAKUR REG NO:

1 Digital Water Marks. 2 History The Italians where the 1 st to use watermarks in the manufacture of paper in the 1270's. A watermark was used in banknote.

Cryptographic Hash Functions

Cryptographic Hash Function

DONE BY S.MURALIRAJAN M.NIRMAL

Cryptographic Hash Functions

Presented by: Dr. Munam Ali Shah

ICS 454 Principles of Cryptography

ICS 454 Principles of Cryptography

A Self-Reference Watermarking Scheme Based on Wet Paper Coding

Hashing Hash are the auxiliary values that are used in cryptography.

A Self-Reference Watermarking Scheme Based on Wet Paper Coding

Hash Function Requirements

Presentation transcript:

Cellular Automata Based Authentication (CAA ) Monalisa Mukherjee 1 Niloy Ganguly 2 P Pal Chaudhuri 1 1 Department of Computer Science & Technology, Bengal Engineering College ( D. U ), Howrah, West Bengal, India Department of Business Administration, Indian Institute of Social Welfare and Business Management, Calcutta, West Bengal, India

CA Research Group (BECDU) Importance 1. Authentication & Verification of data source 2. Protection of copyright & detection of intrusion 3. Prevention of Cyber-Crime Wide Applications E-Commerce, Medical, Technology, Government, Law Authentication

CA Research Group (BECDU) Message Digest Generation Function Message Digest Generation Functions Accepts a message of arbitrary length as the input Transforms a key of fixed length called “fingerprint” or “message digest” as the output One-way hash function with the addition of a secret key forms the basis of this transformation Authentication Compares fingerprint produced at source and destination end Important for the security protocols in Message authentication, Data integrity and Digital signature

CA Research Group (BECDU) SOURCE MessageDigest Cellular Automata (CA) based Authentication (CAA) MessageDigest DESTINATION Digest Hash Private key Hash Private key Compare Same Not Hacked Hacker

CA Research Group (BECDU) Importance of Proposed Method Limitations of the conventional MD5 based message authentication -Not withstand the advanced cryptanalytic attacks -The hash function used is weak In the above background, we propose an efficient message digest generation scheme. The proposed scheme employs a special class of GF(2 p ) Cellular Automata (CA ) 2 p Predecessor Single Attractor Cellular Automata(SACA )

CA Research Group (BECDU) p p p p 1i-1ii+1n 0/1 Input Output Input Output 0/1 An n Cell GF(2 P ) CA W i W i+1 W i-1 Input p - 1

CA Research Group (BECDU) Structure of a 3 Cell GF ( 2 2 ) CA Cell 2 Cell 1 Cell 0 Clock T = S 1 = T S XOR

CA Research Group (BECDU) STATE TRANSITION OF A 3 CELL GF ( 2 2 ) SACA T = Depth = 3, Attractor - 0 No. of predecessors = 2 p = 4 No. of non reachable states = 48

CA Research Group (BECDU) Structure of a 3 Cell GF ( 2 2 ) CA Clock T = S 1 = T S 0 + F Cell 2 Cell 1 Cell 0 XNOR F =

CA Research Group (BECDU) T = DUAL SACA F =

CA Research Group (BECDU) SACA AND ITS DUAL DUAL SACA SACA

CA Research Group (BECDU) HASHING USING SACA AND ITS DUAL SACA DUAL SACA Hashing 300 Hashed value 113

CA Research Group (BECDU) bits Message Hash Function – 2-cell GF(2 2 ) SACA Key Size = Message Authentication Through CAA Matrix from first token Private Key

CA Research Group (BECDU) Matrix from first token Message Authentication Through CAA F = 1 3 SACA DUAL SACA Private Key

CA Research Group (BECDU) Matrix from first token Message Authentication Through CAA F = 1 2 Message Digest

CA Research Group (BECDU) Brute Force Attack Key Size can be increased with minimum cost Attack Changing key Related Key Cryptanalysis Differential Cryptanalysis Security Analysis For CAA

CA Research Group (BECDU) Attack changing Message File Size No of Ones in xored cyphertext Key 128bit Key 256bit 128 P=4P=8P=8P=16MD P1 = C1 = P2 = C2 = XORED = No of 1’s = 4

CA Research Group (BECDU) Attack changing key File Size No of Ones in xored cyphertext Key 128bit Key 256bit 128 P=4P=8P=8P=16MD K1 = C1 = K2 = C2 = XORED = No of 1’s = 4

CA Research Group (BECDU) Differential Cryptanalysis No of 1’s = 5 P1 = C1 = P2 = C2 = XORED= XORED= No of 1’s = 3 P1 = C1 = P2 = C2 = XORED= XORED= No of 1’s = 3No of 1’s = 4

CA Research Group (BECDU) Differential Cryptanalysis No of 1’s = 5 P1 = C1 = P2 = C2 = XORED= XORED= No of 1’s = 3 P1 = C1 = P2 = C2 = XORED= XORED= No of 1’s = 3No of 1’s = 4 P1 P2 = 3 C1 C2 Freq 1 n1n1n1n1 2 n2n2n2n2 3 n3n3n3n3 4 n4n4n4n4 5 n5n5n5n5 6 n6n6n6n6 7 n7n7n7n7 8 n8n8n8n8 Standard Deviation of distribution

CA Research Group (BECDU) Differential Cryptanalysis Avg. Std. Devn. Of XOR Distribution (%) using CAA P=16P=8P=8P=4 Key 256bit Key 128bit File Size

CA Research Group (BECDU) Time Needed for MD5 & CAA File Size CPU Time in Seconds P=1P=2P=4P=8 MD5 n=128n=64n=32n= Speed calculated in WindowsNT , IBM

CA Research Group (BECDU) Watermarking – Its Importance Invisible Fragile Watermarking - Image Authentication / Ownership - Tamper Detection - Verification of Image Integrity Application - Legal matters - News reporting, Medical

CA Research Group (BECDU) Watermarking Existing Tools - MD5 based One-way Hash Function Advantages - Easy Software implementation - License free nature Disadvantages - Non-keyed primitive - Lacks sound & realistic cryptanalysis

CA Research Group (BECDU) Watermark Insertion / Extraction Host Image Watermark Image Watermarked Image Insertion Scheme CA Based Hashing

CA Research Group (BECDU) Watermark Insertion / Extraction Host Image Watermark Image Watermarked Image Insertion Scheme Extraction Scheme Watermarked Image Watermark Image

CA Research Group (BECDU) Proposed Scheme Resists Holliman-Memon Attack Vector Quantization Attack Higher PSNR Watermarking Image Name Data in Bytes PSNR Values in dB unit P = 4P = 8MD5 Lena Concord Rabbit

CA Research Group (BECDU) Current & Future Works on Watermarking Invisible Robust Watermarking - Survives Image Cropping & Compression Audio & Video Watermarking Application - Prevent Unauthorized Access & Forgery - Copyright Protection & Authentication

Thank you Niloy Ganguly