Research Article

Partitioned Soft Sets and Their Application to Cryptology

Volume: 15 Number: 1 April 30, 2026
EN

Partitioned Soft Sets and Their Application to Cryptology

Abstract

Soft set theory, introduced by Molodtsov in 1999, is a mathematical tool for dealing with uncertainty and vagueness in a parameterized way. Cryptology is a method of protecting information and communications so that only those for whom the information is intended can read and process it. In this article, we defined partitioned soft sets, which represent a new concept in soft set theory. Using these partitioned soft sets, we then constructed a new type of cipher method called a soft cipher. It is a variation of a cipher method. Finally, we developed a computer program with examples for the soft cipher method.

Keywords

Soft sets, partitioned soft sets, cryptology, caesar cipher, soft cipher

References

  1. D. Molodstov, Soft set theory-first results, Computers and Mathematics with Applications 37 (4-5) (1999) 19–31.
  2. H. Aktaş, N. Çağman, Soft sets and soft groups, Information Science 177 (13) (2007) 2726–2735.
  3. U. Acar, F. Koyuncu, B. Tanay, Soft sets and soft rings, Computers and Mathematics with Applications 59 (11) (2010) 3458–3463.
  4. D. Singh, I. A. Onyeozili, On the ring structure of soft set theory, International Journal of Scientific and Technology Research 2 (3) (2013) 96–101.
  5. Y. Yang, X. Xin, P. He, Applications of soft union sets in the ring theory, Journal of Applied Mathematics 2013 (1) (2013) 474890.
  6. P. K. Maji, A. R. Roy, R. Biswas, An application of soft sets in a decision making problem, Computers Mathematics with Applications 44 (8-9) (2002) 1077–1083.
  7. F. Fatimah, D. Rosadi, R. F. Hakim, J. C. R. Alcantud, Probabilistic soft sets and dual probabilistic soft sets in decision-making, Neural Computing and Applications 31 (1) (2019) 397–407.
  8. Y. Liu, K. Qin, L. Mart´ınez, Improving decision making approaches based on fuzzy soft sets and rough soft sets, Applied Soft Computing 65 (2018) 320–332.
  9. Y. B. Jun, C. H. Park, Applications of soft sets in Hilbert algebras, Iranian Journal of Fuzzy Systems 6 (2) (2009) 75–86.
  10. P. Yadav, R. Singh, El-Algebra in soft sets, Journal of Algebraic Statistics 13 (2) (2022) 1455–1462.
APA
Çağman, N., Çifçi, F., & Kanat, İ. H. (2026). Partitioned Soft Sets and Their Application to Cryptology. Journal of New Results in Science, 15(1), 15-28. https://doi.org/10.54187/jnrs.1714223
AMA
1.Çağman N, Çifçi F, Kanat İH. Partitioned Soft Sets and Their Application to Cryptology. JNRS. 2026;15(1):15-28. doi:10.54187/jnrs.1714223
Chicago
Çağman, Naim, Fikret Çifçi, and İbrahim Halil Kanat. 2026. “Partitioned Soft Sets and Their Application to Cryptology”. Journal of New Results in Science 15 (1): 15-28. https://doi.org/10.54187/jnrs.1714223.
EndNote
Çağman N, Çifçi F, Kanat İH (April 1, 2026) Partitioned Soft Sets and Their Application to Cryptology. Journal of New Results in Science 15 1 15–28.
IEEE
[1]N. Çağman, F. Çifçi, and İ. H. Kanat, “Partitioned Soft Sets and Their Application to Cryptology”, JNRS, vol. 15, no. 1, pp. 15–28, Apr. 2026, doi: 10.54187/jnrs.1714223.
ISNAD
Çağman, Naim - Çifçi, Fikret - Kanat, İbrahim Halil. “Partitioned Soft Sets and Their Application to Cryptology”. Journal of New Results in Science 15/1 (April 1, 2026): 15-28. https://doi.org/10.54187/jnrs.1714223.
JAMA
1.Çağman N, Çifçi F, Kanat İH. Partitioned Soft Sets and Their Application to Cryptology. JNRS. 2026;15:15–28.
MLA
Çağman, Naim, et al. “Partitioned Soft Sets and Their Application to Cryptology”. Journal of New Results in Science, vol. 15, no. 1, Apr. 2026, pp. 15-28, doi:10.54187/jnrs.1714223.
Vancouver
1.Naim Çağman, Fikret Çifçi, İbrahim Halil Kanat. Partitioned Soft Sets and Their Application to Cryptology. JNRS. 2026 Apr. 1;15(1):15-28. doi:10.54187/jnrs.1714223