Modified Multi Prime RSA Cryptosystem

Kamardan, M. Ghazali; Aminudin, Nurul Nabilah; Che-Him, Norziha; Sufahani, Suliadi Firdaus; Khalid, Karniza; Roslan, Rozaini

doi:10.1088/1742-6596/995/1/012030

Cited by 8 publications

(9 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hinek formula has provided the iteration or bit operation estimation for decryption processing related to multi-prime numbers implementation, that: = ( ) , when r is the number of primes in the n modulo. It can be concluded that for more number of primes used in the modulus, the fewer iterations required for decryption computation [31]. Related to the maximum speed up ratio on decryption process ( ), Joseph in [54] has estimated by = .…”

Section: A Running Time Comparisonmentioning

confidence: 99%

“…Security measurement should be conducted in the transmission of monitoring data by considering the site's resources limitation and implementing suitable cryptography techniques. Especially in RSA implementation, the multi-prime numbers technique can generate keys faster than only uses two prime numbers, like in the standard RSA algorithm [31]- [33]. On the other side, the Chinese Remainder Theorem (CRT) can be implemented to increase the acceleration of the decryption process [1], [22], and [34].…”

Section: Introductionmentioning

confidence: 99%

“…In speed execution issues of RSA algorithm, the researchers tend to focus on increasing the key generation and decryption process speed. A combination of multi-prime numbers and the CRT methods are used for achieving the goals [31]. The modified RSA algorithms usually use more than two prime numbers than standard RSA that uses two prime numbers [36].…”

Section: Introductionmentioning

confidence: 99%

“…More generally, RSA modification based on multi-prime numbers by secretly keys sharing has been observed [12], [53]. Its combination with CRT also has been analyzed [31]. Two secret keys are used and combined in the calculation to improve complexity in the encryption and decryption mechanism.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation

Hermawan¹,

Winarko²,

Ashari³

2021

International Journal on Advanced Science, Engineering and Information Technology

View full text Add to dashboard Cite

RSA is the most popular public-key cryptography. The main strength of the algorithm is based on the difficulty of factoring in a large integer number. RSA has also been applied in a system with limited resource environments like single-board computers (SBC). To ensure data security, a recommendation to use a key size longer than 2048 bits generates challenges for implementing RSA in the SBC. This research proposes an EPNR (Eight Prime Numbers of Modified RSA) method, a modified double RSA based on eight prime numbers combined with the CRT method, to speed up the random key generation and decryption mechanism. The method is implemented in a Raspberry Pi 4 Model B+. The running time and security performances of the EPNR were analyzed and compared to the other models. Compared to the others model based on the standard RSA scheme, the proposed model is faster 21.78 times in a random key generation, 9.03 times in encryption and decryption processing. The EPNR has resistance to Wiener, statistical, and factorization attacks (GNFS and Fermat). Using standard RSA in the second encryption mechanism, the GNFS is not yet effective for attacking the proposed model. The modified Fermat Factorization algorithm is more difficult and needed more extra times for factoring a large composite number into eight prime numbers correctly. The method will be useful for implementing certificates authentication and distribution of the secret key. It is very suitable to enhance more secure RSA implementation in an SBC environment.

show abstract

Section: A Running Time Comparisonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation

Hermawan¹,

Winarko²,

Ashari³

2021

International Journal on Advanced Science, Engineering and Information Technology

View full text Add to dashboard Cite

show abstract

“…In the research of [13] modelled the patients' flow using discrete event simulation where many appointment scheduling is analysed and evaluated with an attempt to address the appointment scheduling problem for appointment systems which involved multiple classes of patients having different mean service times, punctualities, no-show probabilities and service time variability. Thus, it is found that significant performance improvements may be achieved through classification and sequencing of patients [25][26][27]. A research was developed to schedule the working shift of the nurses so that the availability and equality of the nurses were ensured.…”

Section: Schedulingmentioning

confidence: 99%

Review on Queueing Problem in Healthcare

Ariff¹,

Kamardan²,

Sufahani³

et al. 2018

IJET

Self Cite

View full text Add to dashboard Cite

This article shows the application of queueing, simulation and scheduling used in the field of healthcare. A summary of queueing, simulation and scheduling theory used in waiting time, appointment system and patient flow are summarised in this article. Different departments in the healthcare system are also considered in this article such as emergency department, outpatient department and the pharmacy. The aim is to provide the reader a general background into queueing, simulation and scheduling in the healthcare.

show abstract

Comparative Study of the Optimization of the Multi-prime RSA Algorithm

Ziyuan

2021

2021 International Conference on Signal Processing and Machine Learning (CONF-SPML)

View full text Add to dashboard Cite

Modified Multi Prime RSA Cryptosystem

Cited by 8 publications

References 5 publications

Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation

Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation

Review on Queueing Problem in Healthcare

Comparative Study of the Optimization of the Multi-prime RSA Algorithm

Contact Info

Product

Resources

About