Informatics and Control Systems Faculty. Student: Levan Julakidze Informatics and Control Systems Faculty Doctorate II year Leader: Zurab Kochladze TSU.

Slides:

Advertisements

Similar presentations

Using Cryptography to Secure Information. Overview Introduction to Cryptography Using Symmetric Encryption Using Hash Functions Using Public Key Encryption.

Advertisements

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (3) Information Security.

Topic 7: Using cryptography in mobile computing. Cryptography basics: symmetric, public-key, hash function and digital signature Cryptography, describing.

CS 483 – SD SECTION BY DR. DANIYAL ALGHAZZAWI (4) Information Security.

Cryptography The science of writing in secret code.

1 Counter-measures Threat Monitoring Cryptography as a security tool Encryption Digital Signature Key distribution.

Principles of Information Security, 2nd edition1 Cryptography.

Block Ciphers: Workhorses of Cryptography COMP 1721 A Winter 2004.

First Edition by William Stallings and Lawrie Brown Lecture slides by Lawrie Brown and edited by Archana Chidanandan Cryptographic Tools.

CC3.12 Erdal KOSE Privacy & Digital Security Encryption.

BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.

Cryptographic Technologies

Mar 5, 2002Mårten Trolin1 Previous lecture More on hash functions Digital signatures Message Authentication Codes Padding.

Cryptography (continued). Enabling Alice and Bob to Communicate Securely m m m Alice Eve Bob m.

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

EECC694 - Shaaban #1 lec #16 Spring Properties of Secure Network Communication Secrecy: Only the sender and intended receiver should be able.

Cryptography April 20, 2010 MIS 4600 – MBA © Abdou Illia.

Lecture 23 Symmetric Encryption

8: Network Security8-1 Symmetric key cryptography symmetric key crypto: Bob and Alice share know same (symmetric) key: K r e.g., key is knowing substitution.

Encryption Methods By: Michael A. Scott

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

Data Encryption Standard (DES). Symmetric Cryptography  C = E(P,K)  P = D(C,K)  Requirements  Given C, the only way to obtain P should be with  the.

Encryption is a way to transform a message so that only the sender and recipient can read, see or understand it. The mechanism is based on the use of.

 Introduction  Requirements for RSA  Ingredients for RSA  RSA Algorithm  RSA Example  Problems on RSA.

Lecture 3: Cryptographic Tools modified from slides of Lawrie Brown.

Chapter 12 Cryptography (slides edited by Erin Chambers)

1 Cryptography Basics. 2 Cryptography Basic terminologies Symmetric key encryption Asymmetric key encryption Public Key Infrastructure Digital Certificates.

A Cryptography Education Tool Anna Yu Department of Computer Science College of Engineering North Carolina A&T State University June 18, 2009.

Dr. Khalid A. Kaabneh Amman Arab University

Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.

T TT The Cryptography Istituto Tecnico Industriale “E.Divini” San Severino Marche.

Security+ Guide to Network Security Fundamentals, Third Edition Chapter 11 Basic Cryptography.

Systems of Equations as Matrices and Hill Cipher.

GROUP 11 Dhita Puspita Larasati Topan Firmansyah Dimas Kurnia Ayatullah Galih Purwanti Rahma Aprilia Handayani

Cryptography  Why Cryptography  Symmetric Encryption  Key exchange  Public-Key Cryptography  Key exchange  Certification.

CHAPTER 6 Cryptography. An Overview It is origin from the Greek word kruptos which means hidden. The objective is to hide information so that only the.

Chapter 20 Symmetric Encryption and Message Confidentiality.

Cryptography, Authentication and Digital Signatures

Midterm Review Cryptography & Network Security

Chapter 20 Symmetric Encryption and Message Confidentiality.

Classical Encryption techniques

Internet-security.ppt-1 ( ) 2000 © Maximilian Riegel Maximilian Riegel Kommunikationsnetz Franken e.V. Internet Security Putting together the.

Lecture 3 Page 1 Advanced Network Security Review of Cryptography Advanced Network Security Peter Reiher August, 2014.

11-Basic Cryptography Dr. John P. Abraham Professor UTPA.

Encryption. What is Encryption? Encryption is the process of converting plain text into cipher text, with the goal of making the text unreadable.

Lecture 2: Introduction to Cryptography

Lecture 23 Symmetric Encryption

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

Encryption Basics Module 7 Section 2. History of Encryption Secret - NSA National Security Agency –has powerful computers - break codes –monitors all.

K. Salah1 Cryptography Module I. K. Salah2 Cryptographic Protocols  Messages should be transmitted to destination  Only the recipient should see it.

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

DATA & COMPUTER SECURITY (CSNB414) MODULE 3 MODERN SYMMETRIC ENCRYPTION.

Cryptography Gerard Klonarides. What is cryptography? Symmetric Encryption Symmetric Encryption Asymmetric Encryption Asymmetric Encryption Other cryptography.

MM Clements Cryptography. Last Week Firewalls A firewall cannot protect against poor server, client or network configuration A firewall cannot.

EE 122: Lecture 24 (Security) Ion Stoica December 4, 2001.

Computer Security By Rubel Biswas. Introduction History Terms & Definitions Symmetric and Asymmetric Attacks on Cryptosystems Outline.

Department of Computer Science Chapter 5 Introduction to Cryptography Semester 1.

CMSC 414 Computer and Network Security Lecture 2 Jonathan Katz.

CRYPTOGRAPHY Cryptography is art or science of transforming intelligible message to unintelligible and again transforming that message back to the original.

Public Key Cryptography. Asymmetric encryption is a form of cryptosystem in which Encryption and decryption are performed using the different keys—one.

PART VII Security.

ADVANCED ENCRYPTION STANDARDADVANCED ENCRYPTION STANDARD

DISSERTATION ON CRYPTOGRAPHY.

10/7/2019 Created by Omeed Mustafa 1 st Semester M.Sc (Computer Science department) Cyber-Security.

Presentation transcript:

Informatics and Control Systems Faculty

Student: Levan Julakidze Informatics and Control Systems Faculty Doctorate II year Leader: Zurab Kochladze TSU Associated Professor Leader: Tinatin Kaishauri GTU Full Professor

Cryptography (From Greek means “secret writing”) is the practice and study of techniques for secure communication in the presence of third parties.

 Classified as symmetric and asymmetric classes.  Symmetric algorithms are a class of algorithms for cryptography that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. The keys may be identical or there may be a simple transformation to go between the two keys. The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link.

 Asymmetric algorithms, is a class of cryptographic algorithms which requires two separate keys, one of which is secret (or private) and one of which is public. Although difference, the two parts of this key pair are mathematically linked. The public key is used to encrypt plaintext or to verify a digital signature, whereas the private key is used to decrypt ciphertext or to create a digital signature.

 As it is widely known for protection of the information generally symmetric block algorithms shall be applied, as the open key systems speed is quite low.

 In order to cover the open text structure the most effective way is to apply for two transformations: confusion and diffusion.  Confusion is the transformation, the goal of which is to cover the connection among the keys and the ciphertext, and the goal of the diffusion is to render each symbol of the ciphertext dependent onto all the symbols of the open text, which would enable us to cover the open text structure.

 As in symmetric algorithms it is impossible to use the complex mathematical transformations (that diminishes the fast action of the algorithm), in order to achieve such goals in the modern symmetric cryptography replacement and displacement operations are applied for with the multiple iterations.

 Unfortunately, the block ciphers have significant fallback. That is their determined nature, which is expressed in the fact that the same text by means of the same keys is always transferred into the same cipher text. This fallback is tried to be suppressed by means of the encrypting regimes, in which the initialization vector is applied for, which enables to transfer the same text with the same keys into various cipher texts.

 In 2002 the Article by M. Liskov, R. Rivest and D. Wagner was published, the idea stated in which that, initialization vector might be used not in the regime of encrypting, but in the algorithm itself. Such ciphers are called tweakable block ciphers.

 In 1929 American mathematician Lester S.Hill by means of utilization of the linear algebra created n- gram encrypting algorithm, which enables to make one outgoing symbol of the ciphertext dependet onto the n number of the incoming symbols.

 In crypto algorithm 256 bits block is encrypted with the confidential keys. Upon entrance into the algorithm, the block to be encrypted shall be represented by means of the matrix, which is called the standing matrix, where each is the binary byte. Binary line to be encrypted shall be recorded in the matrix from the left to the right horizontally.

 This operation mathematically might be recorded quite simply: M×A(mod256). Where A is the matrix and that matrix shall by all means have the reverse matrix.

Iftwowro ngsdon‘t

makearig ht,tryth

N and M matrix calculated by us in advance: N matrix: M matrix:

 The received A 1 matrix is brought with 256 module and transferred into the binary system:

 With the analogue method we act at B matrix only instead of N matrix we use M matrix and result is:

 Decryption is the reversed process of encryption with the insignificant differences. While encrypting instead of the applied N and M matrixes we use 256 module reversed N -1 and M -1 matrixes accordingly. N -1 matrix:

 M -1 matrix:

 We have considered only a single operation, which provides the open text structure effective covering into the ciphertext. In our case 127 bits changed from 256 bits, which is good result.  The algorithm is currently under construction and will be available in the near future, the possibility of his performances.