Page 39 - programme book

AM-014
Comparative Analysis of Running Time and Memory Consumption of
Rivest-Shamir-Adleman Cryptosystem and Its Four Variants

Mohamad Azani Mohamad Nasir 1, b) and Muhammad Asyraf Asbullah 2, a) ,

1 Department of Mathematics & Statistics, Faculty of Science, Universiti Putra Malaysia,
43400 UPM Serdang, Selangor, Malaysia.
2 Institute for Mathematical Research, Universiti Putra Malaysia,
43400 UPM Serdang, Selangor, Malaysia.

a) Corresponding author: ma_asyraf@upm.edu.my
b) 199191@student.upm.edu.my

Abstract. This work presents a comparative analysis of Rivest-Shamir-Adleman (RSA) cryptosystem
variants. The scope of the work is limited to five cryptosystems: RSA, Somsuk-RSA, Modified-RSA
(MRSA), Easy Simple Factoring-RSA (ESF-RSA) Phony-RSA. The aim is to simulate five variants
of the RSA cryptosystem using Maple programming. Then, identify which cryptosystem has the
largest running time and memory consumption for key generation, encryption, and decryption. The
single-precision multiplication (spm) is used to determine running time and Maple programming for
actual running time. As a result, ESF and RSA are the fastest cryptosystems for key generation, ESF-
RSA is the fastest cryptosystem for encryption, and Phony-RSA is the fastest for decryption. In
addition, the ESF consumes the smallest memory, whereas; MRSA consumes the largest memory to
compute all processes.

Keywords: RSA, cryptosystem, running time, memory consumption, single precision

AM-015
Approximation Theory in UP-algebras Based on Intuitionistic Fuzzy Sets

P Jayaraman 1, a) and S. D. Sudha 1,b)

1) Department ofMathematics, Bharathiyar University, Coimbatore 641 046, Tamil nadu, India.

a) Corresponding author: jrmsathya@gmail.com
b) sudhaa88@gmail.com

Abstract. The theory of fuzzy sets has several applications in real-life situations, and many scholars
have researched fuzzy set theory. After introducing the concept of fuzzy sets, several research studies
were conducted on the generalizations of fuzzy sets. In this article, we introduced the concept of
intuitionistic fuzzy sets and discussed their relationship with other kinds of fuzzy sets. Further, we
discussed the operation properties, applied intuitionistic fuzzy sets to UP-algebras, and investigated
various properties. This paper aims to study upper and lower approximations of intuitionistic fuzzy
sets in UP algebra.

Keywords: UP-algebra, intuitionistic fuzzy set, intuitionistic fuzzy UP-subalgebra, intuitionistic
fuzzy near UP-filter, intuitionistic fuzzy UP-filter