Academic literature on the topic 'Multi-Prime RSA'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multi-Prime RSA.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multi-Prime RSA"

1

Baek, Yoo-Jin. "Key Recovery Algorithm from Randomly-Given Bits of Multi-Prime RSA and Prime Power RSA." Journal of the Korea Institute of Information Security and Cryptology 26, no. 6 (2016): 1401–11. http://dx.doi.org/10.13089/jkiisc.2016.26.6.1401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Talunohi, Iwada Grawilser, Ibnu Jaki Lubis, Sutarman Sutarman, and Ade Candra. "Performance Comparison Analysis of Multi Prime RSA and Multi Power RSA." CESS (Journal of Computer Engineering, System and Science) 8, no. 2 (2023): 576. http://dx.doi.org/10.24114/cess.v8i2.47350.

Full text
Abstract:
Saat ini cukup banyak algoritma yang digunakan untuk pengamanan informasi dalam sistem atau perangkat lunak. Masing-masing algoritma tersebut memiliki tingkat waktu dalam key generate, enrkripsi dan dekripsi yang berbeda-beda. Dalam menggunakan algoritma tersebut harus mempertimbangkan waktu jika ingin menerapkan dalam suatu sistem atau perangkat lunak. Dalam penelitian ini, akan melakukan perbandingan kinerja dari dua algoritma asimetris yaitu Multi Power RSA dan Multi Prime RSA yang masing-masing merupakan varian dari RSA. Algoritma ini terdiri dari 2 kunci yaitu kunci publik dan kunci priva
APA, Harvard, Vancouver, ISO, and other styles
3

Kamardan, M. Ghazali, N. Aminudin, Norziha Che-Him, Suliadi Sufahani, Kamil Khalid, and Rozaini Roslan. "Modified Multi Prime RSA Cryptosystem." Journal of Physics: Conference Series 995 (April 2018): 012030. http://dx.doi.org/10.1088/1742-6596/995/1/012030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Surinder, Kaur 1. Pooja Bhardwaj 2. and Shivani Mankotia 3. *. "Study of Multi-Prime RSA." Fusion: Practice and Applications (FPA) 1, no. 1 (2020): 40–48. https://doi.org/10.5281/zenodo.3825935.

Full text
Abstract:
<em>Fusion: Practice and Applications (FPA)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Vol. 1, No. 1, PP. 40-48, 2020</em>
APA, Harvard, Vancouver, ISO, and other styles
5

Pradhan, Sushma, and Birendra Kumar Sharma. "Improved Semantically Secured Variant of RSA Public Key Cryptosystem." International Journal of Informatics and Communication Technology (IJ-ICT) 4, no. 3 (2015): 91. http://dx.doi.org/10.11591/ijict.v4i3.pp91-97.

Full text
Abstract:
&lt;p&gt;Boneh and Shacham gave a nice survey on four variants (Batch RSA, Multi-Prime RSA, Multi-Power RSA, and Rebalanced RSA). Batch RSA and Multi-Prime RSA were then combined to increase the decryption/signature generation performance. Here in this paper we further tried to increase the encryption/ signature verification performance. The proposed scheme is semantically secure also.&lt;/p&gt;
APA, Harvard, Vancouver, ISO, and other styles
6

Mehta, Jay, and Hitarth Rana. "Safest-Value of the Number of Primes in RSA Modulus and an Improvised Generalized Multi-Moduli RSA." Mathematics 13, no. 10 (2025): 1690. https://doi.org/10.3390/math13101690.

Full text
Abstract:
Several attacks on the well-known RSA cryptosystem that can be extended to a multi-prime version of RSA reveal that it is preferable to use the modulus having more prime factors. On the contrary, the larger the number of prime factors of the modulus, the greater the risk of its factorization, due to the reduced size of its prime factors. In this paper, we derive an optimal value of the number of prime factors in a multi-prime RSA modulus and introduce the notion of the “safest-value” and determine such safest-values for moduli of different sizes. By utilizing this concept, we propose an enhanc
APA, Harvard, Vancouver, ISO, and other styles
7

Dogondaji, A., B. Sani, A. Ibrahim, and S. Abubakar. "Cryptanalysis Attacks on Multi Prime Power Modulus Through Analyzing Prime Difference." International Journal of Science for Global Sustainability 9, no. 1 (2023): 9. http://dx.doi.org/10.57233/ijsgs.v9i1.405.

Full text
Abstract:
The Security of Rivest, Shamir and Adleman Cryptosystem known as RSA and its variants rely on the difficulty of integer factorization problem. This paper presents a short decryption exponent attack on RSA variant based on the key equation where prime difference was carefully analyzed and came up with an approximation of as which enabled us to obtain an improved bound that led to the polynomial time factorization of the variant .
APA, Harvard, Vancouver, ISO, and other styles
8

ZHANG, Hui, and Tsuyoshi TAKAGI. "Improved Attacks on Multi-Prime RSA with Small Prime Difference." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E97.A, no. 7 (2014): 1533–41. http://dx.doi.org/10.1587/transfun.e97.a.1533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

R., SaiGanesh*1 Dr. K. Venkataramana2. "Optimized Digital Signature Algorithm with Multi-Prime RSA." International Journal of Scientific Research and Technology 2, no. 3 (2025): 434–39. https://doi.org/10.5281/zenodo.15078329.

Full text
Abstract:
Digital signatures are an essential cryptographic technique used to ensure the authenticity, integrity, and non-repudiation of digital messages. This paper presents on optimizing RSA-based digital signatures by integrating Multi-Prime RSA, Chinese Remainder Theorem (CRT)-based signing, Sliding Window Exponentiation, and SHA-3 hashing to enhance performance and security. Multi-Prime RSA improves efficiency by using multiple primes, reducing computational complexity while maintaining strong encryption. The CRT-based optimization accelerates signing by breaking computations into smaller modular e
APA, Harvard, Vancouver, ISO, and other styles
10

Kaur, Surinder, Pooja Bharadwaj, and Shivani Mankotia. "Study of Multi-Level Cryptography Algorithm: Multi-Prime RSA and DES." International Journal of Computer Network and Information Security 9, no. 9 (2017): 22–29. http://dx.doi.org/10.5815/ijcnis.2017.09.03.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multi-Prime RSA"

1

Villena, Reynaldo Caceres. "Reconstrução da chave secreta do RSA multi-primo." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13082014-141746/.

Full text
Abstract:
Em 2009, N. Heninger e H. Shacham apresentaram um algoritmo de reconstrução que permite recuperar a chave secreta sk do criptossistema RSA básico em tempo polinomial tendo em forma aleatória 27 % dos seus bits. Sabemos que podemos obter uma versão com erros (bits modicados) da chave secreta RSA graças aos ataques cold boot. O algoritmo apresentado por Heninger-Shacham corrige esses erros fazendo uso das relações matemáticas que existe entre as chaves pública e secreta do criptossistema RSA básico. O objetivo deste trabalho é estudar esse algoritmo para implementar e analisar seu análogo para o
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multi-Prime RSA"

1

Bahig, Hatem M., Ashraf Bhery, and Dieaa I. Nassr. "Cryptanalysis of Multi-Prime RSA with Small Prime Difference." In Information and Communications Security. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34129-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Hui, and Tsuyoshi Takagi. "Attacks on Multi-Prime RSA with Small Prime Difference." In Information Security and Privacy. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39059-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hinek, M. Jason, Mo King Low, and Edlyn Teske. "On Some Attacks on Multi-prime RSA." In Selected Areas in Cryptography. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36492-7_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zheng, Mengce, Noboru Kunihiro, and Honggang Hu. "Improved Factoring Attacks on Multi-prime RSA with Small Prime Difference." In Information Security and Privacy. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60055-0_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nitaj, Abderrahmane, Willy Susilo, and Joseph Tonien. "A Generalized Attack on the Multi-prime Power RSA." In Progress in Cryptology - AFRICACRYPT 2022. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-17433-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gueron, Shay, and Vlad Krasnov. "Speed Records for Multi-prime RSA Using AVX2 Architectures." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-32467-8_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Guanghui, Yuejun Liu, Yongbin Zhou, and Yiwen Gao. "Recovering Multi-prime RSA Keys with Erasures and Errors." In Information Security Practice and Experience. Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-7032-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Takayasu, Atsushi, and Noboru Kunihiro. "General Bounds for Small Inverse Problems and Its Applications to Multi-Prime RSA." In Information Security and Cryptology - ICISC 2014. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15943-0_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Multi-Prime RSA." In Chapman & Hall/CRC Cryptography and Network Security Series. Chapman and Hall/CRC, 2009. http://dx.doi.org/10.1201/9781420075199.ch9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multi-Prime RSA"

1

Syanti, Nurfadhilah, Mohammad Andri Budiman, and Sawaluddin. "Real Running Time Analysis of Multi Prime RSA Algorithm and XRSA in Securing Digital Messages." In 2024 International Conference on Information Technology Research and Innovation (ICITRI). IEEE, 2024. http://dx.doi.org/10.1109/icitri62858.2024.10699043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sani, Nur Atiqah Abdul, and Hailiza Kamarulhaili. "RSA cryptography and multi prime RSA cryptography." In PROCEEDINGS OF THE 24TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES: Mathematical Sciences Exploration for the Universal Preservation. Author(s), 2017. http://dx.doi.org/10.1063/1.4995903.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pathirage, T. D., H. P. D. K. Wijewardana, L. A. S. Lakshan, Hassaan Hydher, and Lasith Yasakethu. "Multi-Prime RSA Verilog Implementation Using 4-Primes." In 2021 10th International Conference on Information and Automation for Sustainability (ICIAfS). IEEE, 2021. http://dx.doi.org/10.1109/iciafs52090.2021.9605975.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krishnamurthy, A., Yiyan Tang, C. Xu, and Y. Wang. "An efficient implementation of multi-prime RSA on DSP processor." In 2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698). IEEE, 2003. http://dx.doi.org/10.1109/icme.2003.1221342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ma, Ziyuan. "Comparative Study of the Optimization of the Multi-prime RSA Algorithm." In 2021 International Conference on Signal Processing and Machine Learning (CONF-SPML). IEEE, 2021. http://dx.doi.org/10.1109/conf-spml54095.2021.00039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hermawan, Nanang Triagung Edi, Edi Winarko, and Ahmad Ashari. "Multi prime numbers principle to expand implementation of CRT method on RSA algorithm." In THE 2ND SCIENCE AND MATHEMATICS INTERNATIONAL CONFERENCE (SMIC 2020): Transforming Research and Education of Science and Mathematics in the Digital Age. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0041856.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mathur, Shikha, and Deepika Gupta. "A Modified RSA Approach for Encrypting and Decrypting Text and Images Using Multi- Power, Multi Public Keys, Multi Prime Numbers and K-nearest Neighbor Algorithm." In the International Conference. ACM Press, 2016. http://dx.doi.org/10.1145/2979779.2979833.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!