Deepak Kumar Cryptographic Algorithm - Explained Now we will get into detailed working of this algorithm, with an example, and understanding the Variables in the Code to run the simulation. First, we will consider sending the text “Hi”, [ Stored as EncryptText in the Code ] from Machine A to Machine B. This text is parsed and first “H” is sent from Machine A to Machine B. We can take the ASCII value of H, which has three digits. Let’s suppose, consider it as ( 516 ), [ Stored in array InputValues[ ] in the Code ] for convenience. Now we will take the input value of First Digit 5 to be sent from Machine A to Machine B as in Figure 2. To transfer digit 5 [ Stored as InputValues [0] in the Code ], First Machine B pokes Machine A with a Random Number 3 [ Stored as MacBRandomNumber in the Code ]. Input Value in Machine A [ Stored as MacAInput in the Code ] is 6, which is obtained from Random Number 3 and Machine A Key [0] [ Stored as MacAKey...
Deepak Kumar Cryptographic Algorithm Overview This is a simple symmetric key cryptographic algorithm, which uses a simple [0-9] Decimal array to transfer data from one machine to another. It can withstand attacks by attackers using Quantum Computers, or any other sophisticated computers. Goals The goal of this algorithm is to send a text from Machine A to Machine B, even if intruders disrupt the communication, with huge computing abilities. Specifications This cryptographic algorithm establishes communication between two Machines A and B. This uses a Decimal array [0-9], to repeatedly transfer data from A to B. The basic structure of DK Algorithm This algorithm is symmetric. Machine A and Machine B hold identical cryptographic keys, with every digit, a unique number from 0 to 9. If Machine B wants to receive data from Machine A, Machine B sends a random number ( 0 to 9) to Machine A. Machine A performs permutation, with its initial cr...