Cover
Vol. 20 No. 1 (2024)

Published: June 30, 2024

Pages: 104-110

Original Article

Parallel Search Using Probabilistic DNA Sticker Model to Cryptanyze One Time Pad Polyalphabetic Cipher

Basim Sahar Yaseen 1
1Computer Science Department, Shatt Al-Arab University College, Basra, Iraq
History
  • Received: August 16, 2023
  • Revised: September 19, 2023
  • Accepted: October 20, 2023
  • Available Online: November 26, 2023
DOI

https://doi.org/10.37917/ijeee.20.1.11

Abstract

Nowadays, it is difficult to imagine a powerful algorithm of cryptography that can continue cryptanalyzing and attacking without the use of unconventional techniques. Although some of the substitution algorithms are old, such as Vigen`ere, Alberti, and Trithemius ciphers, they are considered powerful and cannot be broken. In this paper we produce the novelty algorithm, by using of biological computation as an unconventional search tool combined with an uninhibited analysis method is the vertical probabilistic model, that makes attacking and analyzing these ciphers possible and very easy to transform the problem from a complex to a linear one, which is a novelty achievement. The letters of the encoded message are processed in the form of segments of equal length, to report the available hardware components. Each letter codon represents a region of the memory strand, and the letters calculated for it are symbolized within the probabilistic model so that each pair has a triple encoding: the first is given as a memory strand encoding and the others are its complement in the sticker encoding; These encodings differ from one region to another. The solution space is calculated and then the parallel search process begins. Some memory complexities are excluded even though they are within the solution paths formed, because the natural language does not contain its sequences. The precision of the solution and the time consuming of access to it depend on the length of the processed text, and the precision of the solution is often inversely proportional to the speed of access to it. As an average of the time spent to reach the solution, a text with a length of 200 cipher characters needs approximately 15 minutes to give 98% of the correct components of the specific hardware. The aim of the paper is to transform OTP substitution analysis from a NP problem to a O(nm) problem, which makes it easier to find solutions to it easily with the available capabilities and to develop methods that are harnessed to attack difficult and powerful ciphers that differ in class and type from the OTP polyalphabetic substitution ciphers.

Keywords

References

  1. S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F. Goodman, P. W. Rothemund, and L. M. Adleman, “A sticker-based model for dna computation,” Journal of Computational Biology, vol. 5, no. 4, pp. 615–629, 1998.
  2. K.-H. Zimmermann, “Efficient dna sticker algorithms for np-complete graph problems,” Computer Physics Communications, vol. 144, no. 3, pp. 297–309, 2002.
  3. B. S.Yaseen, Stream Cipher Cryptanalysis Using DNA Algorithms. Doctorate Dissertation, Babylon University, Iraq, 2019.
  4. L. H. Dung, T. M. Duc, and B. Truyen, “Variant of otp cipher with symmetric-key solution,” Journal of Science and Technique-Le Quy Don Technical University, p. 213, 2020. 110 | Yaseen
  5. P. Bonavoglia, “Trithemius, bellaso, vigen`ere origins of the polyalphabetic ciphers,” 2020.
  6. N. Nagaraj, “One-time pad as a nonlinear dynamical sys- tem,” Communications in Nonlinear Science and Numer- ical Simulation, vol. 17, no. 11, pp. 4029–4036, 2012.
  7. D. Rijmenants, “The complete guide to secure communi- cations with the one time pad cipher,” Cipher Machines & Cryptology, pp. 1–27, 2010.
  8. B. S. Yaseen, “Constructing probabilistic model for vi- genere otp cryptanalysis,” Materials Today: Proceed- ings, vol. 60, pp. 1747–1752, 2022.
  9. R. Siromoney and B. Das, “Dna algorithm for breaking a propositional logic based cryptosystem,” Bulletin of the EATCS, vol. 79, pp. 170–177, 2003.
  10. A. S. Polenov, “The computing of np-complete problems in polynomial time using dna-logic,” World applied sci- ences journal, vol. 30, no. 9, pp. 1188–1192, 2014.
  11. S. B. Sadkhan and B. S. Yaseen, “A dna-sticker algo- rithm for cryptanalysis lfsrs and nlfsrs based stream cipher,” in 2018 International Conference on Advanced Science and Engineering (ICOASE), pp. 301–305, IEEE, 2018.
  12. S. B. Sadkhan-SMIEEE and B. S. Yaseen, “Db based dna computer to attack stream cipher,” in 2019 2nd Interna- tional Conference on Electrical, Communication, Com- puter, Power and Control Engineering (ICECCPCE), pp. 230–233, IEEE, 2019.
  13. S. B. Sadkhan and B. S. Yaseen, “Hybrid method to implement a parallel search of the cryptosystem keys,” in 2019 International Conference on Advanced Science and Engineering (ICOASE), pp. 204–207, IEEE, 2019.
  14. N. A. Abdulmehdi and S. A. Kadum, “Cryptanalysis us- ing dna-sticker algorithm,” in Journal of Physics: Con- ference Series, vol. 1818, p. 012088, IOP Publishing, 2021.
  15. B. S. Yaseen, “Cryptanalysis of otp cipher using prob- abilistic splicing dna computer,” Journal of Design of engineering, no. 8, pp. 10739–10748, 2021.
  16. B. S. Yaseen, “Splicing dna model for unknown stream cipher cryptanalysis,” in 2021 2nd Information Tech- nology To Enhance e-learning and Other Application (IT-ELA), pp. 46–51, IEEE, 2021.