Emeka Nwokedi
ABSTRACT
With the evolution of cryptography in the twentieth century, classical ciphers (transposition ciphers) are gradually being pushed out because it now possesses low security ratings, however we can still salvage them, as they have other desirable and admirable qualities which include: easy of design, medium technical know-how and low computational power and it is to achieve this that this study; “A three layer permutation Cryptosystem using a modification of Transposition cipher and two layers content permutation for Wills” was carried out . The aim of this study is to make columnar transposition more secure and relevant so that companies with low technology budget and know-how be secured from known cryptosystem attack. The method used to achieve the above aim is adding to columnar transposition the technique of rail cipher, this affected the sequence of transposition, and lead to a new encryption equation and function. Cryptanalysis was carried out using various tools (Cryptool 2, Dcode and Countwordsfree) and parameters, using a transposition decoder the cipher text gotten using the traditional transposition cryptosystem decrypted with a hundred percent word and character accuracy whilst using the improved system gave a thirty percent accuracy.
- O. Oluwaseun, “Strategies for Managing Information Flow in Nigeria Healthcare System Strategies for Managing Information Flow in Nigeria Healthcare System,” no. October, 2015, doi: 10.5120/ijais2015451443.Google Scholar
Cross Ref
- O. S. Akanji, O. A. Abisoye, S. A. Bashir, and O. A. Ojerinde, “A Survey on Slow DDoS Attack Detection Techniques,” ITED2020, vol. 3, 2020.Google Scholar
- S. A. Khan, “Design and Analysis of Playfair Ciphers with Different Matrix Sizes,” Int. J. Comput. Netw. Technol., vol. 3, no. 3, pp. 117–122, 2015, doi: 10.12785/ijcnt/030305.Google ScholarCross Ref
- K. K. M, M. A. S, and S. Rasool, “Efficient Digital Encryption Algorithm Based on Matrix Scrambling Technique,” Int. J. Netw. Secur. Its Appl., vol. 2, no. 4, pp. 30–41, 2010, doi: 10.5121/ijnsa.2010.2403.Google ScholarCross Ref
- A. T. Sadiq and L. Ali, “Attacking Transposition Cipher Using Improved Cuckoo Search,” no. March 2014, 2015.Google Scholar
- M. El–Beheiry, “StegoCrypt: Arithmetic and Rudin – Shapiro Sequence – Based Bit – Cycling and 3DES Bachelor Thesis,” 2019.Google Scholar
- C. Christensen, “Spring 2015 Chris Christensen MAT/CSC 483,” 2015.Google Scholar
- G. Lasry, M. Hayarden, and N. Kopal, “Cryptanalysis of the Columnar Transposition Cipher with Long Keys,” pp. 1–20, 2015.Google Scholar
- A. Mishra, “Enhancing Security of Caesar Cipher Using Different Methods,” Int. J. Res. Eng. Technol., vol. 02, no. 09, pp. 327–332, 2013, doi: 10.15623/ijret.2013.0209049.Google ScholarCross Ref
- J. Bergquist, “Blockchain Technology and Smart Contracts: Privacy-preserving Tools,” no. 17023, p. 62, 2017.Google Scholar
- I. I. and A. M. S. Ojeniyi, Joseph A, Bolaji O. Adedayo, “Hybridized Technique for Copy-Move Forgery Detection Using Discrete Cosine Transform and Speeded-Up Robust Feature Techniques,” no. April, pp. 22–30, 2018, doi: 10.5815/ijigsp.2018.04.03.Google ScholarCross Ref
- F. I. Lubis, H. F. S. Simbolon, T. P. Batubara, and R. W. Sembiring, “Combination of caesar cipher modification with transposition cipher,” Adv. Sci. Technol. Eng. Syst., vol. 2, no. 5, pp. 22–25, 2017, doi: 10.25046/aj020504.Google ScholarCross Ref
- R. B. Lee, Z. J. Shi, Y. L. Yin, R. L. Rivest, and M. J. B. Robshaw, “On permutation operations in cipher design,” Int. Conf. Inf. Technol. Coding Comput. ITCC, vol. 2, pp. 569–577, 2004, doi: 10.1109/ITCC.2004.1286714.Google ScholarCross Ref
- R. Hackworth, “Data encryption,” Itnow, vol. 37, no. 5, pp. 12–13, 1995, doi: 10.1093/combul/37.5.12.Google ScholarCross Ref
- M. J. Sobol, “Data encryption,” Inf. Syst. Secur., vol. 3, no. 3, pp. 27–31, 1994, doi: 10.1080/10658989409342465.Google ScholarCross Ref
- J. K. Ambulkar, “Poly Substitution Method for Encryption and Decryption,” vol. 02, no. 05, pp. 1810–1812, 2010.Google Scholar
- A. Jain, R. Dedhia, and A. Patil, “Enhancing the Security of Caesar Cipher Substitution Method using a Randomized Approach for more Secure Communication,” Int. J. Comput. Appl., vol. 129, no. 13, pp. 6–11, 2015, doi: 10.5120/ijca2015907062.Google ScholarCross Ref
- R. B. Muralidhar, “Substitution Cipher with NonPrefix Codes,” 2011.Google Scholar
- I. Idris, O. E. Oche, and J. K. Alhassan, “An Infallible Technique for Hiding Confidential Data in Compressed Video using LSB and RSA Algorithm,” no. Icta, pp. 1–5, 2016.Google Scholar
- A. O. Isah, J. K. Alhassan, and S. S. Olanrewaju, “Enhancing AES with Time-Bound and Feedback Artificial Agent Algorithms for Security and Tracking of Multimedia Data on Transition,” vol. 6, no. 4, pp. 162–178, 2017.Google Scholar
- R. Gupta, P. K. Sadh, and P. Gautam, “A Study of Implemented Classical Cipher,” vol. 5, no. July, pp. 1270–1275, 2018, doi: 10.22214/ijraset.2017.8180.Google ScholarCross Ref
- J. K. Alhassan, I. Ismaila, V. O. Waziri, and A. Abdulkadir, “A Secure Method to Hide Confidential Data Using Cryptography and Steganography,” no. Icta, pp. 105–110, 2016.Google Scholar
- O. Osho, Y. O. Zubair, J. A. Ojeniyi, and L. O. Osho, “A SIMPLE ENCRYPTION AND DECRYPTION SYSTEM,” Int. Conf. Sci. Technol. Educ. Arts, Manag. Soc. Sci. iSTEAMS, pp. 77–84, 2014.Google Scholar
- A. A. Adedipe, “Nigerian Internet Fraud: Policy / Law Changes That Can Improve Effectiveness,” 2016.Google Scholar
- R. Jamal, Z. Hussein, and S. By, “Transposition Cipher Text,” pp. 1–43, 2012.Google Scholar
- M. Heydari, G. L. Shabgahi, and M. M. Heydari, “Cryptanalysis of transposition ciphers with long key lengths using an improved genetic algorithm,” World Appl. Sci. J., vol. 21, no. 8, pp. 1194–1199, 2013, doi: 10.5829/idosi.wasj.2013.21.8.22.Google ScholarCross Ref
- C. Christensen, “Transposition Ciphers,” pp. 1–31, 2010.Google Scholar
- R. Frost, “Rail Fence Cipher Keyword Columnar Transposition,” vol. 124, no. Winter, 2009.Google Scholar
- M. Sokouti, B. Sokouti, and S. Pashazadeh, “An approach in improving transposition cipher system,” Indian J. Sci. Technol., vol. 2, no. 8, pp. 8–15, 2009, doi: 10.17485/ijst/2009/v2i8/29502.Google ScholarCross Ref
- A. S. Utama, “Rail Fence Cryptography in Securing Information,” Int. J. Sci. Eng. Res., no. July, 2016.Google Scholar
- R. Stout, “Where There ’ S a Will,” pp. 1–95, 1938.Google Scholar
- A. Gadzo, “Types of Wills,” pp. 39–41, 2021.Google Scholar
- K. B. Gee, “Chapter 1: Electronic Wills and the Future: When Today ’ s Techie Youth Become Tomorrow ’ s Testators,” vol. 105, no. June 2009, 2005.Google Scholar
- B. J. Lebowitz, “Electronic Wills: No Longer in a Galaxy Far , Far Away,” vol. 64, no. 1, 2017.Google Scholar
- N. Krueger, “LIFE , DEATH , AND REVIVAL OF ELECTRONIC WILLS LEGISLATION IN 2016 THROUGH 2019,” vol. 1298, no. 2017, 2019.Google Scholar
- S. Snail and N. Hall, “Electronic wills in South Africa,” Digit. Evid. Electron. Signat. Law Rev., vol. 7, no. 0, pp. 67–70, 2014, doi: 10.14296/deeslr.v7i0.1925.Google ScholarCross Ref
- S. Eva, “Are electronic wills on the way?,” 2021.Google Scholar
- K. Martin, “TECHNOLOGY AND WILLS – THE DAWN OF A NEW ERA COVID-19 special edition,” 2020.Google Scholar
- A. J. Ronak Dedhia, Abhijit Patil, “Enhancing the Security of Caesar Cipher Substitution Method using a Randomized Approach for more Secure Communication,” Int. J. Comput. Appl., vol. 129, no. 13, 2015, doi: 10.5120/ijca2015907062.Google ScholarCross Ref
- T. Wu, Y. Chen, and H. Lin, “Design and Construction of Secure Digital Will System,” vol. 13, no. 5, pp. 523–530, 2016.Google Scholar
- G. Samid, “The Ultimate Transposition Cipher (UTC).,” IACR Cryptol. ePrint Arch., vol. 2015, p. 1033, 2015.Google Scholar
- H. Lin, “Toward Secure Strong Designated Verifier Signature Scheme from Identity-Based System,” vol. 11, no. 4, pp. 315–321, 2014.Google Scholar
- H. Ali-Pacha, N. Hadj-Said, A. Ali-Pacha, M. A. Mohamed, and M. Mamat, “The six-dos transposition cipher based on the rubik's cube,” Int. J. Adv. Technol. Eng. Explor., vol. 8, no. 75, pp. 258–273, 2021, doi: 10.19101/IJATEE.2020.762150.Google ScholarCross Ref
- B. Thakkar and B. Thankachan, “A Multilevel Approach of Transposition Ciphers for Data Security over Cloud ISSN NO: 1869-9391 A Multilevel Approach of Transposition Ciphers for Data Security over Cloud,” no. May, 2021.Google Scholar
- M. S. Hossain Biswas , “A systematic study on classical cryptographic cypher in order to design a smallest cipher,” Int. J. Sci. Res. Publ., vol. 9, no. 12, p. p9662, 2019, doi: 10.29322/ijsrp.9.12.2019.p9662.Google ScholarCross Ref
- J. Yi and J. Yi, “Cryptanalysis of Homophonic Substitution- Transposition Cipher,” 2014.Google ScholarCross Ref
- E. Antal, P. Zajac, and O. Grošek, “Diplomatic Ciphers Used by Slovak Attaché During the WW2,” Proc. 3rd Int. Conf. Hist. Cryptol. HistoCrypt 2020, vol. 171, pp. 21–30, 2020, doi: 10.3384/ecp2020171004.Google ScholarCross Ref
- D. Rachmawati, S. Melvani Hardi, and R. Partogi Pasaribu, “Combination of columnar transposition cipher caesar cipher and lempel ziv welch algorithm in image security and compression,” J. Phys. Conf. Ser., vol. 1339, no. 1, 2019, doi: 10.1088/1742-6596/1339/1/012007.Google ScholarCross Ref
- G. Lasry, “A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics,” 2017.Google Scholar
Recommendations
Algorithm of cipher text containing key to produce cipher text transmitted in network security
AIKED'07: Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6A plaintext is separated into two parts, a fixed length part and a variable length part. The second part of the plaintext is encrypted to a cipher text using a key. In this paper, an encryption algorithm which encrypts the first part of the plaintext ...
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
A cut-and-paste operation can be a reversal, a transposition, or a transreversal on circular or linear permutations. There are several approximation algorithms for sorting signed permutations by combinations of these operations. For sorting unsigned ...
On the combinatorics of derangements and related permutations
Highlights- Provide a bijection combinatorial proof for the facts that The number of derangements of length n equals the number of permutations of length n that have ...
AbstractA derangement is a permutation in which no entry is at its original position. The number of derangements of [ n ] is called the “derangement number” or “de Montmort number”, and is denoted by D n. The sequence { D n } enumerates, in ...
Comments