Dynamic data encryption using the concepts of ANN
Download as PPT, PDF1 like104 views
The document describes an encryption system utilizing dynamic key generation and asymmetric algorithms to secure plain text communication between sender and receiver. It outlines various procedures for locking and unlocking data, including the use of hidden layers for key management. Future enhancements could incorporate complex mathematical functions and additional hidden layers for improved security.
![Q W E R T Y U I O P
A S D F G H J K L Z
X C V B N M q w e r
t y u i o p a s d f
g h j k l z x c v b
n m 1 2 3 4 5 6 7 8
9 0 @ # $ % ^ & _ ~
` ! + - * / | { }
[ ] ( ) = : ; “ ‘ <
> , . ?](https://image.slidesharecdn.com/collegeprojectfinalcompatibleslideshare-170213115738/85/Dynamic-data-encryption-using-the-concepts-of-ANN-9-320.jpg)
Dynamic data encryption using the concepts of ANN
- 4. TXT KEY HIDDEN LAYER HIDDEN LAYER TXT KEY INTERNET SENDER SIDE RECEIVER SIDE PLAIN TEXT S E N D E R R E C E I V E R R.K. PLAIN TEXT ENCRYPTED TEXT ENCRYPTED TEXT AUTOMATIC LOCKING PROCEDURE MANUAL UNLOCKING PROCEDURE
- 5. FEATURES: • Dynamic key generation. • Asymmetric key algorithm. • No limitation in the length of the plain text. • Automatic locking.
- 6. PlainText KeyGen Algo Intermidiate CipherText EvenPositionElement OddPositionElement Final CipherText Exploring Hidden layers (1)
- 7. PlainText KeyremoveAlgo Intermidiate CipherText 1st Partition 2nd Partition Received CipherText Exploring Hidden layers (2)
- 9. Q W E R T Y U I O P A S D F G H J K L Z X C V B N M q w e r t y u i o p a s d f g h j k l z x c v b n m 1 2 3 4 5 6 7 8 9 0 @ # $ % ^ & _ ~ ` ! + - * / | { } [ ] ( ) = : ; “ ‘ < > , . ?
- 10. 1 2 3 4 5 6 7 Elements from 32th position to 62th position of key board Elements from 1st position to 31th position of key board … N Average of all the key elements and it’s corresponding position Key Generation
- 11. P R K1 O G K2 R A K3 M MESSAGE KEY ELEMENTS Locking Procedure (1)
- 12. P R K1 O G K2 R A K3 M K1 K2 K3 Z r B K1 e o K2 B t K3 z Locking Procedure (2)
- 13. P R O G R A M R G A P O R M G R A O M P R G R A O M P R Hidden Layer at Sender side
- 14. G R A O M P R O M P RG R A R A O MG P O R MR G A P R O G R A M P R Hidden Layer at Receiver side
- 15. M M K1 M M K2 M M K3 M M K4 M M K5 M M K6 M M K7 K1 K2 K3 K4 K5 K6 K7 K1 K2 K3 K4 K5 A Key at receiver’s end Elements from the key positions are fetched Key removal (part 1) Received ciphertext :
- 16. M M K1 M M K2 M M K3 M M K4 M M K5 M M K6 M M K7 M M M M M M M M M M M M M M Plain Text Key removal (part 2) (-) (-)(-) (-)(-) (-)(-) (-)(-)(-) (-) (-) (-) (-) A A A AA A A A A A A A A A P P P P P P P P P P P P P P K1 K2 K3 K4 K5 AKey at receiver’s end :
- 26. UNIT Only numbers Only strings Alphanumeric Strings Algorithm for key generation SUCCESS SUCCESS SUCCESS Algorithm for Locking SUCCESS SUCCESS SUCCESS Algorithm for Hidden Layer at sender side SUCCESS SUCCESS SUCCESS Algorithm for Hidden Layer at receiver side SUCCESS SUCCESS SUCCESS Unlocking Algorithm SUCCESS SUCCESS SUCCESS Unit Testing
- 28. FUTURE SCOPE • Complex mathematical functions can be introduced for generating keys. • More Hidden Layer can be incorporated. • Can be applied to Multimedia Messaging.