DATA SECURITY WITH AES ENCRYPTION, ELLIPTIC CURVE ENCRYPTION AND SIGNATURE
- 1. Title: DATA SECURITY WITH AES ENCRYPTION, ELLIPTIC CURVE ENCRYPTION AND SIGNATURE _
- 2. Project Supervisor & Guide _ C.Atheeq Assistant Professor CSE Dept, Deccan College of Engineering &Technology Hyderabad. >> Mohammed Abdul Faizan 160318733029 BEVII Sem CSE, DCET >> Mohammed Abdul Lateef 160318733055 BEVII Sem CSE, DCET >> Mohd Abdul Rahman 160318733057 BE VII Sem CSE, DCET
- 3. Presentation Outline_____ i. Getting to know about our Domain ii. Current System / Literature Survey iii.Problems in Current system iv.Proposed System
- 4. Getting to know about our Domain- CRYPTOGRAPHY_ • Cryptography is the study of secure communications techniques that allow only the sender and intended recipient of a message to view its content. • When transmitting electronic data, the most common use of cryptography is to encrypt and decrypt email and other plain-text messages from files to databases etc. • Cryptography redefines ACID property and Benefits of Cryptography are the redefinition itself... 1.Authentication 2.Confidentiality 3.Impenetrable 4.Data- Integrity
- 5. Literature Survey / Current System _ • Database security is concerned with, the information security control that involves the data protection, stored functions protection, the database itself , its servers. • Database- used for various areas like hospital, defense, school, etc. to store the sensitive sensitive information, hence security of such databases is a primary concern where Cryptography comes into play.
- 6. o If a user needs to store or request the data, to do this the user needs to get authenticated. o When a user is authenticated, he will get key from a key generator and then he encrypts or decrypts the data within the database. o The basic characteristics of information that must be available in database system is, 1. Confidentiality 2. Integrity These are achieved in the system using AES encryption and ECDSA signature verification. Contd.
- 7. Fig: Key generator role for database store and retrieve - AES
- 8. Here in database, 1. AES symmetric encryption and ECC encryption, for database Confidentiality and 2. ECC signature, for database Integrity. are used. Current Implementation of the System:
- 9. o There are 3 lengths of AES encryption keys: 128-bit | 192-bit | 256-bit o Even though the key length of this encryption method varies, its block size - 128-bits (or 16 bytes) - stays fixed. o It all comes down to resources. For example, an app that uses AES-256 instead of AES-128 might drain your phone battery a bit faster. o Hence key length is directly proportional to the processing resources used. Keys Config:
- 10. THE ECDSA _ o Elliptic Curve Digital Signature Algorithm, is one of the public key cryptography encryption algorithms. o Keys are generated via ECC are smaller than the average keys generated by other digital signing algorithms. o * A digital signature is an authentication method used where a public key pair and a digital certificate are used as a signature to verify the identity of a recipient or sender of information.
- 11. THE 6 methods discussed in regards with Database Security. Type – 1. Rows-level encryption with AES Type – 2. Columns- level encryption with AES Type – 3. Elements level encryption with AES Type – 4. Rows-level encryption with AES and ECC Type – 5. Column level encryption with AES and ECC Type – 6. Elements level encryption with AES and ECC
- 12. 1. Rows, Column, Element-level encryption(Type 1,2,3)with AES are done with a key binding function for generation their respective Cipher blocks. 2. Rows, Column, Element-level encryption(Type 4,5,6 )with AES and ECC are done with a key binding function for generation their Digital Signatures. Brief Description of methods _
- 13. o In the current system of Database security there arises a problem, like o While signing of the Ciphers for the Signature generation, the authentication time is comparatively more for the receiver to decrypt the cipher. o This aspect is being resolved in our proposed system. Problem in Current System _
- 14. Proposed System: KEY AUTHENTICATION MANAGEMENT USING CHAOS THEORY & CHEBYSHEV POLYNOMIAL --- Guided by C.Atheeq
- 15. Objective of our Proposed system: • To minimize the authentication time of the verification at the receiver end & the signature generation at the sender end. • We propose a method to provide mutual authentication between communicating entities using chaos theory. Directions: o Chaos theory. o Chaotic Cryptology. o Chebyshev polynomial. o Implementation procedure.
- 16. CHAOS THEORY _ • 'Chaos'- def. Some information that is extremely complicated or with an absence of some order. • Chaotic systems are deterministic but their long term behavior causes difficulty in prediction with accuracy. • Chaos theory states that the apparent(clear or open to view) randomness of chaotic systems, there exists underlying patterns, repetitions, self-organization etc.
- 17. CHAOTIC CRYPTOLOGY _ a) It is application of mathematical-Chaos theory for Cryptography b) Used to privately and securely transmit the information. c) If chaotic parameters and cryptographic keys are mapped either symmetrically or asymmetrically they produce acceptable and functional outputs. d) Using this makes any intruder impossible to find the outputs without the knowledge of inputs. EX: Image encryption, random number generation, Hash functions.
- 18. CHEBYSHEV POLYNOMIAL... 1. Derived by Pafnuty Chebyshev, Russian mathematician for statistics, probability and mechanics. 2. Its is a function that describes the time dependence of a point in geometric space. 3. The Chebyshev polynomial are the sequences of major cosine functions-Tn(x) 4. Where ,n>=1; 5. There exists a semi group property of CHEBYSHEV POLYNOMIAL which is being implemented i.e., , n>=1;
- 19. Q.Where exactly are these polynomials to be used..? KEY MANAGEMENT USING CHAOS THEORY _ o By using chaos theory, the key is generated at sender as well as at receiver side and it is compared. o This process of mutual authentication in our proposed protocol take minimum computational load. o This mutual authentication gives the parameters to the Chebyshev polynomials to generate a unique and corresponding key for the Chaotic Cryptography.
- 20. Proof to be derived from Chaos theory and Chebyshev polynomials : (Sender) (Receiver ) • Where, m, n are public and private keys , x is the cipher/ message to be encrypted/ decrypted. From the above calculations it gets clear that the sender and receiver acquires the same secret key by using the chaos theory and does the mutual authentication in an effective manner.
- 21. 0 2000 4000 6000 8000 10000 12000 ECC Chaos 2 Comparison between RSA and Chaotic Maps in computational time Authentication time taken This protocol of minimizing the authentication time is our proposed system, so that the authentication mechanism takes minimum computational load.