Structural Cryptanalysis of the Message Based Random Variable Length Key Encryption Algorithm (mrvlk)

Volume 12, Issue 3, pp 201-210 http://dx.doi.org/10.22436/jmcs.012.03.04

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2676 Downloads
• 4311 Views

Authors

Azam Davahli - Computer Department, Science and Research Branch, Islamic Azad University, Kerman, Iran. Hamid Mirvaziri - Computer Department, faculty of engineering, Shahid Bahonar University, Kerman, Iran. Media Aminian - Computer Department, Science and Research Branch, Islamic Azad university, Kerman, Iran.

Abstract

This article has presented a Structural cryptanalysis on MRVLK (Message Based Random Variable Length Key Encryption). In this cipher, key length is started from small amount of bits and then will be grown in size. The cipher has variable rounds, random bitwise rotations and dynamic key length that provide resistance to linear and differential cryptanalysis. In spite of these advantages, some disadvantages are observed such as correlation between the ciphertexts in each stage which facilitates structural attack. Even random mechanism such as S-box in this cipher cannot prevent this attack. The attack performs analysis on the final ciphertext and reveals the plaintext of MRVLK by exploiting the fact that the structure of the ciphertext is obvious and weak. The presented attack efficiently utilizes this information and prompts the operations cryptanalysis. Performance of this attack is evaluated in terms of running time. The results show that the original plaintext is achievable to minimal cost.

Share and Cite

Keywords

• Cryptanalysis
• Block Cipher
• MRVLK
• Structural Attack
• Random key.

MSC

•  94A60
•  68P25

References

• [1] E. Barkan, E. Biham, N. Keller, Instant structural cryptanalysis of GSM encrypted communication, Crypto, 21 (2008), 600-616.


• [2] W. Mao, Modern Cryptography - Theory and Practice, in New Jersey, (Hewlett-Packard Company), prentice hall, chapter3, (2003), 78-108.
  • Google Scholar


• [3] S. Goldwasser, S. Micali, Probabilistic encryption, Computer and System Sciences, 28(2) (1984), 270-299
  • View Article
  • Google Scholar


• [4] P. Saraswathi, M. Venkatesulu , A Block Cipher Algorithm for Multimedia Content Protection with Random Substitution using Binary Tree Traversal, Computer Science, 8(2) (2012), 1541-1546.
  • Google Scholar


• [5] R. Kazemi, S. Delavar, The Moments of the Profile in Random Binary Digital Trees, Journal of Mathematics and Computer Science, 6(3) (2013), 176–190.
  • Google Scholar


• [6] S. H. Kamali, M. Hedayati, R. Shakerian, S. Ghasempour, Using Identity-Based Secret Public Keys Cryptography for Heuristic Security Analyses in Grid Computing, Journal of Mathematics and Computer Science, 3(4) (2011), 357–375.
  • View Article
  • Google Scholar


• [7] Pushpendra Pardeep, Kumar Pateriya, PC1-RC4 and PC2-RC4 Algorithms: Pragmatic Enrichment Algorithms to Enhance RC4 Stream Cipher Algorithm, International Journal of Computer Science and Network, 1(3) (2012), 36.
  • Google Scholar


• [8] K. C. Bai, M. V. Satyanarayana, P. A. Vijaya, Variable Size Block Encryption using Dynamic-key Mechanism (VBEDM), International Journal of Computer Applications, 27(7) (2011), 27-30.
  • Google Scholar


• [9] H. Mirvaziri, K. Jimari, M. Ismail, Message Based Random Variable Length Key Encryption Algorithm, Computer Science, 5(8) (2009), 573-578.
  • Google Scholar


• [10] C. H. Canneere, A. Biryukov, B. Preneel , An Introduction to Block Cipher Cryptanalysis, Proceedings of the IEEE, 94(2) (2006), 346 – 356.
  • View Article
  • Google Scholar


• [11] Y. Tsunoo, E. Tsujihara , M. Shigeri, H. Kubo, K. Minematsu, Improving cache attacks by considering cipher structure, Inf. Security, 5(3) (2006), 166-176.
  • View Article
  • Google Scholar


• [12] A. Biryukov, A. Shamir, Structural Cryptanalysis of SASAS, In Lecture Notes in Computer Science 2045, Springer-Verlag Berlin Heidelberg, (2001), 394-405.
  • MathSciNet
  • Google Scholar
  • MATH


• [13] N. Jorge, P. Bart, V. Joos, Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family, In Lecture Notes in Computer Science 1978, Springer-Verlag Berlin Heidelberg, (2001), 244-261.
  • View Article
  • Google Scholar
  • MATH


• [14] J. Borghoff, L. R. Knudsen, G. Leander, S. S. Thomsen, Slender-Set Differential Cryptanalysis, Crypto, 26 (2013), 11-38.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [15] M. Macchetti, Cryptanalysis of AES and Camellia with Related S-boxes, In Lecture Notes in Computer Science 7918, Springer-Verlag Berlin Heidelberg, (2013), 208-221.
  • View Article
  • Google Scholar
  • MATH


• [16] N. Courtois, T. Mourouzis, Enhanced Truncated Differential Cryptanalysis of GOST, In Proc. 10th Int. Conference on Security and Cryptography (SECRYPT 13), (2013), 411-418.
  • Google Scholar


• [17] A. Ehsani, An Application of Co-Medial Algebras with Quasigroup Operations on Cryptology, Journal of Mathematics and Computer Science, 10(2) (2014), 113–118.


• [18] C. Yeon, Linear Cryptanalysis of Reduced-Round Present, In Lecture Notes in Computer Science 5985, Springer-Verlag Berlin Heidelberg, (2010), 302-317.
  • View Article
  • Google Scholar


• [19] E. Shamir, E. Biham, Differential Cryptanalysis of the Full 16-Round DES, In Lecture Notes in Computer Science 740, Springer-Verlag Berlin Heidelberg, (1992), 487–496.
  • Google Scholar


• [20] D. B. Dhaigude, Prefunctions and System of Differential Equation via Laplace Transform, Journal of Mathematics and Computer Science, 7(4) (2013), 293–304.
  • Google Scholar


• [21] E. Biham, O. Dunkelmanl, N. Keller, Enhancing Differential-Linear Cryptanalysis, In Lecture Notes in Computer Science 2887, Springer-Verlag Berlin Heidelberg, (2003), 254-266
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [22] H. Mirvaziri, New Cryptographic Algorithms for Hash Function, Block Cipher and Key Agreement, Ph.D. thesis. Malaysia Bangi, Malaysia, ( 2010),


• [23] A. Hedayatpanah Shaldehi, Using Eta (η) correlation ratio in analyzing strongly nonlinear relationship between two Variables in Practical researches, Journal of Mathematics and Computer Science, 7(3) (2013), 213–220.
  • Google Scholar


• [24] N. Koblitz, Algebraic Aspects of Cryptography, Springer, Vol. 3 (2004)
  • Google Scholar


• [25] M. Khorsi, A. Bozorgi-Amiri, B. Ashjari, A Nonlinear Dynamic Logistics Model for Disaster Response under Uncertainty, Journal of Mathematics and Computer Science, 7(1) (2013), 63–72.
  • Google Scholar


• [26] J. Biazar, M. Hosami, Two Efficient Approaches based on Radial Basis Functions to Nonlinear Time-dependent Partial Differential Equations, Journal of Mathematics and Computer Science, 9(1) (2014), 1–11.
  • Google Scholar


• [27] D. A. Osvik, A. Shamir, E. Tromer, Cache attacks and countermeasures: The case of AES, In Lecture Notes in Computer Science 3860, Springer-Verlag Berlin Heidelberg, (2006), 1-20.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [28] S. Mangard, A Simple Power-Analysis (SPA) Attack on Implementations of the AES Key Expansion, In Lecture Notes in Computer Science 2587, Springer-Verlag Berlin Heidelberg, (2002), 343–358.
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [29] P. Kocher, J. Jaffe, B. Jun, Introduction to Differential Power Analysis and Related Attacks, Crypto. Eng, 1 (2011), 5–27.
  • Google Scholar


• [30] N. L. Brian, M. Reiter, C. H. Wang, M. Wright, Timing Attacks in Low-Latency Mix Systems, In Lecture Notes in Computer Science 3110, Springer-Verlag Berlin Heidelberg, (2004), 251-265.
  • View Article
  • Google Scholar


• [31] F. X. Standaert , Integrated Circuits and Systems, Springer, Chapter2 (2011)