Posts

New Post

Markov Chains || Step-By-Step || ~xRay Pixy

Image
Learn Markov Chains step-by-step using real-life examples. Video Chapters: Markov Chains 00:00 Introduction 00:19 Topics Covered 01:49 Markov Chains Applications 02:04 Markov Property 03:18 Example 1 03:54 States, State Space, Transition Probabilities 06:17 Transition Matrix 08:17 Example 02 09:17 Example 03 10:26 Example 04 12:25 Example 05 14:16 Example 06 16:49 Example 07 18:11 Example 08 24:56 Conclusion

Monoalphabetic Substitution Cipher Techniques

  Monoalphabetic Substitution Cipher, also known as a simple substitution cipher, relies (depends) on a fixed replacement structure. That is substitution is fixed for each letter of the alphabet.  A simple example is where each letter is encrypted as the next letter in the alphabet: "a simple message" becomes "B TJNQMF NFTTBHF". Each letter can be encrypted to any symbol [&,%,?,/,*,{},@,~,+,-] not just another letter. 1.) Additive Cipher The Simplest Monoalphabetic cipher is an Additive cipher. This cipher is sometimes called Shift Cipher. When the Cipher is Additive, the Plain Text, Cipher Text and key are integers in Z(26). For Encryption: C = (p + k) mod 26 For Decryption: P = (c - k) mod 26 Where, C = Cipher Text                   P = Plain Text                   k = Key  The secret key between Alice and Bob is also an integer value. The encryption Algorithm adds the key to t...
More posts