The document describes a cryptography model for secure communication between two parties. It involves encrypting a message using a numbering system for letters and a public key, performing matrix multiplication on the encrypted message, and transmitting both the encrypted message and a quotient. The receiver decrypts the message by reversing the encryption process using the same public key and their private key. The model allows encrypted communication while preventing unintended parties from understanding the actual message. It has applications in security, data storage, finance, government, healthcare and online games.
The document describes a cryptography model for secure communication between two parties. It involves encrypting a message using a numbering system for letters and a public key, performing matrix multiplication on the encrypted message, and transmitting both the encrypted message and a quotient. The receiver decrypts the message by reversing the encryption process using the same public key and their private key. The model allows encrypted communication while preventing unintended parties from understanding the actual message. It has applications in security, data storage, finance, government, healthcare and online games.
The document describes a cryptography model for secure communication between two parties. It involves encrypting a message using a numbering system for letters and a public key, performing matrix multiplication on the encrypted message, and transmitting both the encrypted message and a quotient. The receiver decrypts the message by reversing the encryption process using the same public key and their private key. The model allows encrypted communication while preventing unintended parties from understanding the actual message. It has applications in security, data storage, finance, government, healthcare and online games.
FROM DA-IICT B.TECH 1st YEAR(2019-20) ID:201901161 ICT(information and communication technology) FINAL PROJECT OF DISCRETE MATHEMATICS
ASSIGNED BY : PROFESSOR MANISH K. GUPTA
COURSE : SC 205 CRYPTOGRAPHY IN SECURE COMMUNICATION IN THIS VIDEO I WILL DISCUSS ABOUT A SECURE COMMUNICATION PROBLEM. PROBLEM • SUPPOSE TWO PERSON WANT TO COMMUNICATE EACH OTHER BUT THEY WANT THAT THEIR MESSAGE BECOME SAFE AND PRIVATE AND NO ONE CAN READ THEIR MESSAGE. • 1) DO ENCRYPTION: CONVERT THIS PLAIN TEXT INTO CIPHER- TEXT(DATA INTO A DIFFERENT FORM WHICH IS INCOMPREHENSIBLE). • 2) DO DECRYPTION : CONVERT RECEIVED CIPHER-TEXT INTO PLAINTEXT. SOLUTION • SUPPOSE WE WANT TO SEND THE MESSAGE: "HELLO WORLD". • LET'S FIRST ENCRYPT THIS MESSAGE: • 1ST WE DENOTE NUMBERS TO EACH ALPHABET: • A=1,B=2,C=3,D=4,E=5,F=6,G=7,H=8,I=9,J=10,K=11,L=12,M=13,N=14,O=15,P=16,Q=17, R=18,S=19,T=20,U=21,V=22,W=23,X=24,Y=25,Z=26,AND SPACE=0.- - - - -(1). • SO , FROM ABOVE ”HELLO WORLD” BECOME: • ”8 5 12 12 15 0 23 15 18 12 4” - - - (2). • TAKE OUR PUBLIC KEY N=27 AND PRIVATE KEY AS 2X2 MATRIX.
• KEY = 2 3 -1 0
• NOW CONVERT (2) IN MATRIX WHOSE COLUMN IS 2.
SO WE GET, 8 5 12 12 A = 15 0 23 15 18 12 4 0 HERE LAST INDEX IS EMPTY SO WE ADD 0(SPACE) THERE. • NOW MULTIPLY A WITH KEY 8 5 12 12 A X KEY = 15 0 2 3 23 15 -1 0 18 12 4 0 SO, 11 24 12 36 A X KEY= 13 45 31 69 24 54 8 12 • NOW DIVIDE ALL NUMBERS OF THIS MATRIX WITH N SO WE WILL GET, • REMINDER: 11 24 12 9 3 18 4 15 24 0 8 12, AND • QUOTIENT: 0 0 0 1 1 1 1 1 2 0 2 0 0. • NOW CONVERT ALL NUMBERS OF REMINDER IN ALPHABET USING(1) AND WE WILL GET: • ”KXLICRDOX HL”. • SEND THIS ABOVE MESSAGE AND QUOTIENT TO THE RECEIVER. • NOW WE WILL DO DECRYPTION OF THIS RECEIVED MESSAGE: • HERE RECEIVER WILL GET THIS MESSAGE ”KXLICRDOX HL” AND QUOTIENT. • 1ST CONVERT THIS ALPHABET INTO NUMBERS USING (1). • WE WILL GET: “11 24 12 9 3 18 4 15 24 0 8 12”. • TAKE MULTIPLICATION OF QUOTIENT’S EACH NUMBER WITH N AND ADD REMINDER IN IT. • 1ST NUMBER WE’LL GET IS Y1=27×0 + 11 = 11. • THEN Y2=27×0 + 24 = 24. • LIKE THIS, Y4=27×1 + 9 = 36. • SO WE’LL GET, “11 24 12 36 30 45 31 69 24 54 8 12.” • CONVERT THESE NUMBERS IN MATRIX WHOSE COLUMN IS 2. 11 24 12 36 30 45 B= 31 69 24 54 8 12 • NOW MULTIPLY B WITH KEYˉ(KEY INVERSE) THEN WE WILL GET OUR ORIGINAL MATRIX. • HERE, KEY = 2 3 -1 0
SO, KEYˉ = 1/3 0 -3
1 2 Y = B X KEYˉ 11 24 12 36 Y= 30 45 1/3 0 -3 31 69 12 24 54 8 12 SO, 8 5 12 12 Y = 15 0 23 15 18 12 4 0 NOW CONVERT Y’S EACH NUMBER IN ALPHABET. • WE’LL GET : “HELLO WORLD “ • HERE LAST SPACE IS NEGLIGIBLE SO REMOVE THAT SPACE AND WE WILL GET: “HELLO WORLD” • THAT IS OUR ORIGINAL MESSAGE. • SO , WE ENCRYPT OUR MESSAGE SECURELY AND DECRYPT USING SOME PARTICULAR METHOD SO THAT ONLY RECEIVER CAN READ THE MESSAGE. APPLICATION OF THIS MODEL
• THIS MODEL IS USEFUL TO COMMUNICATE SECRETLY, ALLOWING THE
WORLD TO SEE THE ENCRYPTED MESSAGE IN CASE ANYONE IS LISTENING IN, WHILE NOT ALLOWING THEM TO KNOW THE ACTUAL MESSAGE. ONLY THE INTENDED RECIPIENT CAN READ IT. • THERE ARE MANY MORE BENEFITS OF THIS MODEL: • 1) THIS MODEL IS USED ALMOST EXCLUSIVELY IN SECURITY RELATED AREAS. IT CAN LIMIT ONLY APPROVED PEOPLE TO ACCESS SECRET DATA. • 2) THIS MODEL IS USED IN SECURELY STORING DATA ON YOUR COMPUTER, LIKE YOUR PASSWORD KEEPER. • 3) THIS MODEL CAN BE USED IN FINANCIAL, GOVERNMENT, MEDICAL, EVEN MULTIPLAYER GAMES TO SECURE DATA AND INFORMATION. F YOU LIKE MY VIDEO, PLEASE LIKE SHARE AND SUBSCRIBE.