Abstract
Since its inception, substitution ciphers have been a popular type of cipher, and over time, academics have studied them in an effort to discover patterns that will allow them to be broken. They created it because substitution ciphers are a reasonably simple type of cipher. Through a survey of the literature, this paper investigates the encryption and decryption of three sub-types of monoalphabetic ciphers: shift cipher, affine cipher, and random substitution cipher. Letter frequency analysis is the foundation of the primary decryption technique. After that, two sub-kinds of monoalphabetic ciphers, Hill cipher and Playfair cipher, which are resistant to this decryption method because the letters encrypted hardly keep the original frequency, will be introduced. The paper shows that statistical analysis of letter frequency is only useful for deciphering single-table substitution ciphers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.