Cite Article
Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation
Choose citation formatBibTeX
@article{IJASEIT13700, author = {Nanang Triagung Edi Hermawan and Edi Winarko and Ahmad Ashari}, title = {Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation}, journal = {International Journal on Advanced Science, Engineering and Information Technology}, volume = {11}, number = {6}, year = {2021}, pages = {2375--2384}, keywords = {RSA algorithm; multi-prime numbers; single-board computer; information security.}, abstract = {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.}, issn = {2088-5334}, publisher = {INSIGHT - Indonesian Society for Knowledge and Human Development}, url = {http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=13700}, doi = {10.18517/ijaseit.11.6.13700} }
EndNote
%A Hermawan, Nanang Triagung Edi %A Winarko, Edi %A Ashari, Ahmad %D 2021 %T Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation %B 2021 %9 RSA algorithm; multi-prime numbers; single-board computer; information security. %! Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation %K RSA algorithm; multi-prime numbers; single-board computer; information security. %X 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. %U http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=13700 %R doi:10.18517/ijaseit.11.6.13700 %J International Journal on Advanced Science, Engineering and Information Technology %V 11 %N 6 %@ 2088-5334
IEEE
Nanang Triagung Edi Hermawan,Edi Winarko and Ahmad Ashari,"Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation," International Journal on Advanced Science, Engineering and Information Technology, vol. 11, no. 6, pp. 2375-2384, 2021. [Online]. Available: http://dx.doi.org/10.18517/ijaseit.11.6.13700.
RefMan/ProCite (RIS)
TY - JOUR AU - Hermawan, Nanang Triagung Edi AU - Winarko, Edi AU - Ashari, Ahmad PY - 2021 TI - Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation JF - International Journal on Advanced Science, Engineering and Information Technology; Vol. 11 (2021) No. 6 Y2 - 2021 SP - 2375 EP - 2384 SN - 2088-5334 PB - INSIGHT - Indonesian Society for Knowledge and Human Development KW - RSA algorithm; multi-prime numbers; single-board computer; information security. N2 - 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. UR - http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=13700 DO - 10.18517/ijaseit.11.6.13700
RefWorks
RT Journal Article ID 13700 A1 Hermawan, Nanang Triagung Edi A1 Winarko, Edi A1 Ashari, Ahmad T1 Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation JF International Journal on Advanced Science, Engineering and Information Technology VO 11 IS 6 YR 2021 SP 2375 OP 2384 SN 2088-5334 PB INSIGHT - Indonesian Society for Knowledge and Human Development K1 RSA algorithm; multi-prime numbers; single-board computer; information security. AB 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. LK http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=13700 DO - 10.18517/ijaseit.11.6.13700