| Abstrakt: |
Cloud users' confidential information safety has now been the likely key issue and is a core problem for the advancement of cloud computing. RSA (Rivest-Shamir-Adleman) algorithm, is one of the most well-known encryption techniques to ensure the confidentiality of cloud data. However, the reliability of RSA remains in the complexity of skillfully factoring the large integers. GNFS (General Number Field Sieve) algorithm is the most effective algorithm to factorize large numbers even greater than 110 digits, and cloud computing would have the groundbreaking ability to complete GNFS computations. However, the GNFS algorithm while factoring large numbers, takes a long time to solve linear systems, which is an important step. In the literature, this phase is made simpler by integrating the GNFS with the Block Wiedemann algorithm. To increase the effectiveness of the aforementioned existing algorithm, however, there are still certain changes that can be performed. Hence, in our work, we suggested a distributed model for an integrated GNFS with Block Wiedemann algorithm in the cloud to reduce the computation cost of solving large and sparse linear systems over GF(2). As per the theoretical and practical findings, the suggested model can significantly improve the efficiency of the GNFS algorithm compared to other current algorithms, in terms of computation time and clock speed. [ABSTRACT FROM AUTHOR] |
