[vc_row][vc_column width=”1\/2″][vc_custom_heading heading_semantic=”p” text_font=”font-213936″ text_size=”h5″ text_height=”fontheight-843833″ uncode_shortcode_id=”175189″]Kriativ-tech Volume 1, Issue 9, January 2023, Pages: xxx Received: Jan. 22, 2023; Accepted: Jan. 27, 2023. Published: Mar. 13, 2023.[\/vc_custom_heading][vc_custom_heading heading_semantic=”h3″ text_size=”h3″]Authors[\/vc_custom_heading][vc_custom_heading heading_semantic=”p” text_size=”h5″ uncode_shortcode_id=”562455″]<\/p>\n
Ant\u00f3nio Santos,\u00a0Assistant Professor at ISTEC<\/p>\n
[\/vc_custom_heading][\/vc_column][vc_column width=”1\/2″][vc_custom_heading]Media[\/vc_custom_heading][vc_button button_color=”accent” border_animation=”btn-ripple-out” border_width=”0″ link=”url:http%3A%2F%2Fwww.kriativ-tech.com%2Fwp-content%2Fuploads%2F2023%2F03%2FEnhancing-Caesars-Cipher.pdf|target:_blank” button_color_type=”uncode-palette” uncode_shortcode_id=”128481″]PDF[\/vc_button][vc_custom_heading heading_semantic=”h4″ text_size=”h4″]To cite this article[\/vc_custom_heading][vc_custom_heading heading_semantic=”p” text_size=”h6″ uncode_shortcode_id=”644607″]Ant\u00f3nio Santos, Enhancing Caesar\u2019s Cipher<\/b>
\nDOI: 10.31112\/kriativ-tech-2022-06-80[\/vc_custom_heading][\/vc_column][\/vc_row][vc_row row_height_percent=”0″ overlay_alpha=”50″ gutter_size=”1″ column_width_percent=”100″ shift_y=”0″ z_index=”0″][vc_column column_width_percent=”100″ gutter_size=”0″ override_padding=”yes” column_padding=”1″ overlay_alpha=”50″ shift_x=”0″ shift_y=”0″ shift_y_down=”0″ z_index=”0″ medium_width=”0″ mobile_width=”0″ width=”1\/1″][vc_custom_heading heading_semantic=”h3″ text_size=”h3″]Abstract[\/vc_custom_heading][vc_custom_heading heading_semantic=”p” text_font=”font-213936″ text_size=”h5″ text_height=”fontheight-843833″ uncode_shortcode_id=”109868″]Before the invention of computers all methods were calculated manually, and as such the cryptographic methods developed during that period took this limitation into account. The Caesar Cipher method was one of the first to be used and disseminated in several countries. This method is very simple, which means that with current means you can break your security quickly and easily. However, it has a characteristic that, given its nature, any change to the method increases its safety, and like other authors in this article, it will be shown that a small change will imply some improvement in the method’s safety; transforming the monoalphabetic substitution Caesar cipher into a polyalphabetic substitution cipher with a key created from the displacement element (key) supplied by the user.[\/vc_custom_heading][vc_empty_space empty_h=”2″][vc_custom_heading heading_semantic=”h3″ text_size=”h3″]Keywords[\/vc_custom_heading][vc_custom_heading heading_semantic=”p” text_size=”h5″ uncode_shortcode_id=”181309″]Encryption, Substitution cipher, Monoalphabetic, polyalphabetic, Caesar cipher, Vigen\u00e8re cipher.[\/vc_custom_heading][\/vc_column][\/vc_row][vc_row][vc_column column_width_percent=”100″ gutter_size=”0″ overlay_alpha=”50″ shift_x=”0″ shift_y=”0″ shift_y_down=”0″ z_index=”0″ medium_width=”0″ mobile_width=”0″ width=”1\/1″][vc_custom_heading heading_semantic=”h3″ text_size=”h3″]References[\/vc_custom_heading][vc_custom_heading heading_semantic=”p” text_font=”font-213936″ text_size=”h5″ uncode_shortcode_id=”174223″][1] Katz J, Lindell Y. (2015). Introduction to Modern Cryptography. 2nd ed. Florida: Taylor & Francis Group, LLC, CRC Press.
\n[2] Stinson DR, Paterson MB. (2018). Cryptography: Theory and Practice. 4th ed. Textbooks in Mathem\u00e1tics. Florida: CRC Press.
\n[3] Holden J. (2017). The Mathematics of Secrets: Cryptography from Caesar Ciphers to Digital Encryption. New Jersey: Princeton University Press.
\n[4] Kahate A. (2003). Cryptography and Network Security. New Delhi: Tata McGraw-Hill.
\n[5] Kipper G. (2004). Investigator\u00b4s Guide to Steganography. Florida: Auerbach Publications.
\n[6] Paar C, Pelzl J. (2010). Understanding Cryptography: A Textbook for Students and Practitioners. Berlin: Springer-Verlag.
\n[7] Delfs H, Knebl H. (2007). Introduction to Cryptography: Principles and Applications. 2nd ed. Berlin: Springer-Verlag.
\n[8] Aggarwal S. (2016). A Review on Enhancing Caesar Cipher. International Journal of Research Science & Management. 3 (6): 14-20.
\n[9] Shrivastava M, Jain S, Singh P. (2016). Content Based Symmetric Key Algorithm, International Conference on Computational Modeling and Security, Procedia Computer Science. 85: 222-227.
\n[10] Stallings W. (2011). Cryptography and network security: Principles and Practice. 5th ed. New York: Prentice Hall.
\n[11] Singh S. (1999). The Code Book, Anchor Books: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. New York: Anchor Boks.
\n[12] Stamp M, Low RM. (2007). Applied Cryptanalysis – Breaking Ciphers in the Real World, San Jose: Wiley-Interscience, John Wiley & Sons, Inc..
\n[13] Cobb C. (2004). Cryptography for Dummies, New Jersey: Wiley Publishing.
\n[14] Kumari S. (2017). A research Paper on Cryptography Encryption and Compression Techniques. International Journal Of Engineering And Computer Science. 6(4): 20915-20919.
\n[15] Katz J, Lindell Y. (2008). Introduction to Modern Cryptography. Florida: Taylor & Francis Group, LLC, CRC Press.
\n[16] Trappe W, Washington L. (2006). Introduction to Cryptography with Coding Theory. 2nd ed. New Jersey: Pearson Education Inc., Pearson-Prentice Hall.
\n[17] Churchhouse R. (2004). Codes and ciphers: Julius Caesar, the Enigma and the Internet. Cambridge: Cambridge University Press.
\n[18] Easttom W. (2021). Modern Cryptography Applied Mathematics for Encryption and Information Security. Cham: Springer Nature Switzerland AG, Springer.
\n[19] Sinkov A. (1966). Elementary Cryptanalysis – A Mathematical Approach. 5th Printing. Washington The Mathematical Association of America.
\n[20] Baldoni M.W, Ciliberto C. and Cattaneo G.M.P. (2009). Elementary Number Theory, Cryptography and Code. Roma: Springer-Verlag.
\n[21] Bauer C. (2013). Secret History: The Story of Cryptology. Filadelfia: Chapman and Hall\/CRC.
\n[22] Schneier B. (1996). Applied Cryptography, 2nd ed. Illinois: John Wiley & Sons.
\n[23] Musa S.M. (2018). Network Security and Cryptography: A Self-teaching Introduction. Virg\u00ednia: Mercury Learning & Information.
\n[24] Mathur A. (2012). A Research paper: An ASCII value based dataencryption algorithm and its comparison with other symmetric data encryption algorithms. International Journal on Computer Science and Engineering (IJCSE). 4(9): 1650-1657..
\n[25] Singh P, Sen P. (2017). Enhancing Security of Caesar Cipher Using Divide and Conquer Approach. International Journal of Advance Research in Science and Enginheering. 6 (02): 144-150.
\n[26] Jain A, Dedhia R, Patil (2015). A. Enhancing the Security of Caesar Cipher Substitution Method using a Randomized Approach for more Secure Communication. International Journal of Computer Applications. 129(13): 6-11.
\n[27] Singh A, Nandal A, Malik S. (2012). Implementation of Caesar Cipher with Rail Fence for Enhancing Data Security. International Journal of Advanced Research in Computer Science and Software Engineering. (12): 78-82.
\n[28] Senthil K, Prasanthi K, Rajaram R. (2013). A Modern Avatar Of Julius Caesar and Vigenere Cipher. Proceedings of IEEE International Conference on Computational Intelligence and Computing Research.
\n[29] Bowne S. (2018). Hands-On Cryptography with Python. Birmingham: Packt Publishing.[\/vc_custom_heading][\/vc_column][\/vc_row]<\/p>\n","protected":false},"excerpt":{"rendered":"
Ant\u00f3nio Santos,\u00a0Assistant Professor at ISTEC
\nDOI: 10.31112\/kriativ-tech-2022-06-80<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[],"_links":{"self":[{"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/posts\/66494"}],"collection":[{"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=66494"}],"version-history":[{"count":3,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/posts\/66494\/revisions"}],"predecessor-version":[{"id":66503,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=\/wp\/v2\/posts\/66494\/revisions\/66503"}],"wp:attachment":[{"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=66494"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=66494"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kriativ-tech.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=66494"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}