Analysing a Cryptosystem in a Parikh Soft Matrix
Abstract
The soft set is a frequent topic developed for dealing with uncertainties in the present environment. In most of our real-life situations, we are using Parikh matrix knowingly or unknowingly. Parikh is a vector set that can be derived from words. It is mainly used to convert continuous letters to matrix form. Hereby, we had defined a new matrix called Parikh Soft matrix and also defined some of the new products on the Parikh soft matrices such as Hadamard Parikh soft product and Characteristic Parikh soft product. We also use the elementary cryptosystem algorithm which was widely used in web development, software programs, and others. To make the defined matrix more efficient, some propositions have also been defined. For real-life applications, we introduced Parikh soft cryptosystem as a new cryptosystem method by using Parikh Soft matrix product on Parikh Soft matrices. In today’s world, we share everything through only online text such as Gmail, Facebook, etc. As it was increasing another side security system is also getting decreased. So, by this proposed method we could increase the encryption system. This style of representation is useful for storing uncertainty in computer memory. We define Parikh Soft encryption and Parikh Soft decryption
References
1. A. Mateescu and A. Salomaa; Matrix Indicators for Subword Occurrences and Ambiguity. Internat. J. Found. Comput. Sci., 15(2), 277–292 (2004).
2. A. Mateescu; A. Salomaa; K. Salomaa and S. Yu; A Sharpening of the Parikh Mapping. RAIRO-Theor. Inform. Appl., 35(6), 551–564 (2001).
3. A. Mateescu; A. Salomaa and S. Yu; Subword Histories and Parikh Matrices. J. Comput. System Sci., 68(1), 1–21 (2001).
4. A. Sezgin and A. O. Atagün; On Operations of Soft Sets. Computers and Mathematics with Applications, 61 (5), 1457–1467 (2011).
5. D. A. Molodtsov; Soft Set Theory - First Results. Comput Math Appl., 37(4–5), 19–31 (1999).
6. D. A. Molodtsov; The Description of a Dependence with the help of Soft Sets. Journal of Computer and Systems Sciences International, 40 (6), 977–984 (2001).
7. D. Dubois and H. Prade; Fuzzy Set and Systems: Theory and Applications. Academic Press, Boston (1980).
8. D. Pei and D. Miao (2005); From Soft Sets to Information Systems. 2005 IEEE International Conference on Granular Computing, 2, 617-621.
9. D. Stinson D; Cyrptography: Theory and Practice. CRC Press, New Jersey (1995).
10. E. Aygun; Soft Matrix Poduct and Soft Cryptosystem. Filomat, 32 (19), 6519-6530 (1980).
11. E. Aygün; AES Encryption and a Cryptosystem obtained with Soft Set II. Cumhuriyet Science Journal, 40 (1), 68 – 78 (2019).
12. E. Million; The Hadamard Product. Volume 1, (2007).
13. G. Poovanandran and W. C. Teh (2018); Parikh Matrices and M-ambiguity Sequence. Journal of Physics: Conf. Series,1132, 012012.
14. G. Poovanandran and W. C. The; Elementary Matrix Equivalence and Core Transformation Graphs for Parikh Matrices. Discrete Applied Mathematics, 251, 276-289 (2018).
15. H. Aktas and N. Çagman; Soft Sets and Soft Groups. Inform. Science, 177 (13), 2726-2735 (2007).
16.J. Daeman and V. Rijmen; The Design of Rijndael: AES: The Advanced Encryption Standard. Berlin Heidelberg: Springer-Verlag (2002).
17. K. Gong; P. Wang and Z. Xiao; Bijective Soft Set Decision System-Based Parameters Reduction under Fuzzy Environments. Appl Math Model, 37(6), 4474–4485 (2013).
18. L. A. Zadeh; Fuzzy Sets. Information and Control, 8 (3), 338–353 (1965).
19. M. M. Mushrif; S. Sengupta and A. K. Ray (2006); Texture Classification using a Novel, Soft-Set Theory-based Classification Algorithm. Computer Vision – ACCV 2006, Lecture Notes in Computer Science,3851, 246–254.
20. Molotov; The Theory of Soft Sets. URSS Publishers., Moscow (in Russian) (2004).
21. N. Çağman and S. Enginoğlu; Soft Matrix Theory and Its Decions Making. Computers and Mathemetics with Applications, 59 (10), 3308-3314 (2010).
22. P. K. Maji; R. Biswas and A. R. Roy; Soft Set Theory. Computers & Mathematics with Applications, 45(4-5), 555-562 (2003).
23. R. A. Horn; Topics in Matrix Analysis. Cambridge University Press (1994).
24. R. L. Rivest and M. Dertouzos; On Data Banks and Privacy Homomorphisms. In Foundations of Secure Computation, 169–179 (1978).
25. R. Parikh; On Context-Free Languages. J. Assoc. Comput. Mach., 13, 570–581 (1966).
26. S. Bera; K. Mahalingam and K. G. Subramanian; Properties of Parikh Matrices of Words obtained by an Extension of a Restricted Shuffle Operator. Internat. J. Found. Comput. Sci., 29(3), 403-413 (2018).
27. Z. Pawlok and A. Skowron; Rudiments of Soft Sets. Information Sciences 177 (1), 3–27 (2007).
28. Z. Xiao; L. Chen; B. Zhong and S. Ye (2005); Recognition for Soft Information Based on the Theory of Soft Sets. In Discourse Elements J.Chen (Ed.), Proceedings of ICSSSM-05, 2, IEEE,1104–1106.
Trion Studio
