1 Secure Hill Cipher Modification SHC-M A.G.Chefranov Eastern Mediterranean University, North Cyprus, Taganrog Institute of Technology, Federal University.

Slides:

Advertisements

Similar presentations

The Secure Hill Cipher Jeff Overbey MA Dr. Jerzy Wojdyło April 29, 2003 Based on S. Saeednia. How to Make the Hill Cipher Secure. Cryptologia 24.

Advertisements

“Advanced Encryption Standard” & “Modes of Operation”

Data Security 1 El_Gamal Cryptography. Data Security2 Introduction El_Gamal is a public-key cryptosystem technique El_Gamal is a public-key cryptosystem.

Two IFEA-M Modifications to Withstand New Attack Alexander G. Chefranov Computer Engineering Department Eastern Mediterranean University.

ORTHOGONAL ARRAYS APPLICATION TO PSEUDORANDOM NUMBERS GENERATION AND OPTIMIZATION PROBLEMS A.G.Chefranov †‡, T.A.Mazurova ‡, I.D.Sidorov ‡, T.S.Letia 

Data Encryption Standard (DES)

Announcements: Matlab: tutorial available at Matlab: tutorial available at

Cryptography and Network Security Chapter 6. Chapter 6 – Block Cipher Operation Many savages at the present day regard their names as vital parts of themselves,

Cryptography1 CPSC 3730 Cryptography Chapter 6 Triple DES, Block Cipher Modes of Operation.

Advanced Encryption Standard

Creating Secret Messages. 2 Why do we need to keep things secret? Historically, secret messages were used in wars and battles For example, the Enigma.

1 The AES block cipher Niels Ferguson. 2 What is it? Block cipher: encrypts fixed-size blocks. Design by two Belgians. Chosen from 15 entries in a competition.

1 Overview of the DES A block cipher: –encrypts blocks of 64 bits using a 64 bit key –outputs 64 bits of ciphertext A product cipher –basic unit is the.

Announcements: Assignment 2 finalized Assignment 2 finalizedQuestions?Today: Wrap up Hill ciphers Wrap up Hill ciphers One-time pads and LFSR One-time.

Chapter 3 – Block Ciphers and the Data Encryption Standard Jen-Chang Liu, 2004 Adopted from lecture slides by Lawrie Brown.

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

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

Decryption Algorithms Characterization Project ECE 526 spring 2007 Ravimohan Boggula,Rajesh reddy Bandala Southern Illinois University Carbondale.

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

Lecture 2: Message Authentication Anish Arora CSE5473 Introduction to Network Security.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Network Security (A Very Brief Introduction)

3.1 SERVICES AND MECHANISMS SERVICES AND MECHANISMS The International Telecommunication Union- Telecommunication Standardization Section (ITU-T) provides.

Security in Computing Cryptography (Introduction) Derived from Greek words: ‘Kruptos’ (hidden) and ‘graphein’ (writing.

Diffusion and Confusion Two properties that a good cryptosystem should have: Diffusion: change of one character in the plaintext results in several characters.

Confusion and Diffusion1 Ref: William Stallings, Cryptography and Network Security, 3rd Edition, Prentice Hall, 2003.

Cryptography and Network Security Chapter 6. Multiple Encryption & DES  clear a replacement for DES was needed theoretical attacks that can break it.

Systems of Equations as Matrices and Hill Cipher.

Cryptography and Network Security (CS435) Part Two (Classic Encryption Techniques)

Day 18. Concepts Plaintext: the original message Ciphertext: the transformed message Encryption: transformation of plaintext into ciphertext Decryption:

Wireless Security Presented by: Amit Kumar Singh Instructor : Dr. T. Andrew Yang.

Midterm Review Cryptography & Network Security

Day 37 8: Network Security8-1. 8: Network Security8-2 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key:

Rather than just shifting the alphabet Could shuffle (jumble) the letters arbitrarily Each plaintext letter maps to a different random cipher text letter.

CS555Spring 2012/Topic 111 Cryptography CS 555 Topic 11: Encryption Modes and CCA Security.

Introduction to Ciphers Breno de Medeiros. Cipher types From “Cipher”, Wikipedia article.

Cryptography Part 1: Classical Ciphers Jerzy Wojdyło May 4, 2001.

Classical Crypto By: Luong-Sorin VA, IMIT Dith Nimol, IMIT.

Dr. Reuven Aviv, Nov 2008 Conventional Encryption 1 Conventional Encryption & Message Confidentiality Acknowledgements for slides Henric Johnson Blekinge.

Modes of Usage Dan Fleck CS 469: Security Engineering These slides are modified with permission from Bill Young (Univ of Texas) 11 Coming up: Modes of.

Yu-Li Lin and Chien-Lung Hsu Department of Information Management, Chang-Gung University Information Science(SCI) Reporter: Tzer-Long Chen.

Wired Equivalent Privacy (WEP): The first ‘confidentiality’ algorithm for the wireless IEEE standard. PRESENTED BY: Samuel Grush and Barry Preston.

Le Trong Ngoc Security Fundamentals (2) Encryption mechanisms 4/2011.

Lecture 2: Introduction to Cryptography

24-Nov-15Security Cryptography Cryptography is the science and art of transforming messages to make them secure and immune to attacks. It involves plaintext,

NEW DIRECTIONS IN CRYPTOGRAPHY Made Harta Dwijaksara, Yi Jae Park.

Introduction to Information Security Lect. 6: Block Ciphers.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Security PART VII.

1 Symmetric key cryptography: DES DES: Data Encryption Standard US encryption standard [NIST 1993] 56-bit symmetric key, 64 bit plaintext input How secure.

CRYPTOGRAPHY PRESENTED BY : NILAY JAYSWAL BRANCH : COMPUTER SCIENCE & ENGINEERING ENTRY NO. : 14BCS033 1.

Shahram Khazaei Siavash Ahmadi Fall 2015

Invitation to Computer Science 5 th Edition Chapter 8 Information Security.

Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,

Discrete Mathematical Structures: Theory and Applications 1 Cryptography (advanced extra curricular topic)  Cryptography (from the Greek words Kryptos,

Lecture 3 Page 1 CS 236 Online Introduction to Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.

CS526Topic 2: Classical Cryptography1 Information Security CS 526 Topic 2 Cryptography: Terminology & Classic Ciphers.

Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim

Modes of Operation block ciphers encrypt fixed size blocks – eg. DES encrypts 64-bit blocks with 56-bit key need some way to en/decrypt arbitrary amounts.

@Yuan Xue Quick Review.

Columnar Transposition

Advanced Encryption Standard (Symmetric key Algorithm)

Cryptography and Network Security

Fun with Cryptography The Science of Secrecy.

Classical Ciphers – I Terminology CSCI284 Spring 2004 GWU Shift Cipher

Cryptanalysis of Block Ciphers

Introduction to Cryptography I

Hill Cipher The Hill Cipher uses matrix multiplication to encrypt a message. First, you need to assign two numbers to each letter in the alphabet and also.

Symmetric Encryption or conventional / private-key / single-key

The RC4 Algorithm Network Security.

Presentation transcript:

1 Secure Hill Cipher Modification SHC-M A.G.Chefranov Eastern Mediterranean University, North Cyprus, Taganrog Institute of Technology, Federal University of South Russia, Russia

2 Introduction Hill cipher is very attractive due to its simplicity Some recent publications devoted to the Hill cipher: 1. Ismail et al., J. Zhejiang Univ SCIENCE A (12): Thilaka & Rajalakshmi, Cryptologia, 2005, 29:4, Lin et al., Zhōngguó gōngchéng xuékān (Zhōngguó gōngchéng xuékān), 2004, vol. 27, no. 5, pp Saeednia, S.: How to Make the Hill Cipher Secure. Cryptologia, Vol (2000)

3 Hill cipher Proposed in 1929 C=K·P+B Can be broken in the known plaintext- ciphertext attack

4 Secure Hill cipher SHC Proposed by Saeednia, 2000 Initial settings. All matrices considered below are m·m sized over Zm, (e.g., m=26 for English language texts). A sender, S, and a receiver, R, share an invertible key matrix K. A plaintext, P, and a cipher-text, C, are also matrices. Encryption. The sender S chooses a permutation, t, over Zm, and, using it, builds a permutation matrix, Mt. For example, if then

5 Secure Hill cipher SHC

6 S->R: C, u

7 Secure Hill cipher SHC Decryption: The weakness of SHC is in the transfer of the Hill encrypted vector u via network channels

8 Modification of the secure Hill cipher SHC-M  Initial settings. Shared data: K, SEED  Encryption. Sender, S, selects a number, n, and calculates S->R: C, n xor SEED  Decryption. Receiver, R, given n and SEED, calculates t. Having t, calculates Kt. Having Kt and C, calculates the plaintext P

9 Conclusion Thus far, we proposed a modification to SHC which gives more strength to it due to the avoidance of secret information transfer via network channels. In our approach, only the number of a permutation is transferred (together with a cipher-text)