{'fraction_non_alphanumeric': 0.022687998216177046, 'fraction_numerical': 0.016946318077930764, 'mean_word_length': 4.699602859412232, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Novel Improvement With an Effective Expansion to Enhance the MD5 Hash Function for Verification of a Secure E-Document

MD5 is a one-way cryptographic function used in various fields for maintaining data integrity. The application of a Hash function can provide much protection and privacy and subsequently reduce data usage. Most users are familiar with validating electronic documents based on a Hash function, such as the MD5 algorithm and other hash functions, to demonstrate the data integrity. There are many weaknesses of the current MD5 algorithm, mainly its failures and weaknesses against varying types of attacks, such as brute force attacks, rainbow table attacks, and Christmas attacks. Therefore, the method proposed in this paper enhances the MD5 algorithm by adding a dynamic variable length and a high efficiency that simulates the highest security available. Whereas the logistic system was used to encode ribonucleic acid (RNA) by generating a random matrix based on a new key that was created using the initial permutation (IP) tables used in the data encryption stander (DES) with the linear-feedback shift register (LFSR), this work proposes several structures to improve the MD5 hash function. The experimental results demonstrate its high resistance to hackers while maintaining a suitable duration. This paper discusses the design of a confident hash algorithm. This algorithm has characteristics that enable it to succeed in the field of digital authentication and data integrity.


I. INTRODUCTION
The large interest in information security has centered on the balanced protection of the confidentiality, integrity and availability of data, with the amount of data required to be analyzed and provided for protection continuously varying with every case. Since there is a limited number of trained and experienced personnel that are able to verify the validity of these biases manually, it is necessary to find an efficient and inexpensive method, particularly one that does not require vast experience or an advanced level of training. Hence, it is dependent on computer methods [1]- [6]. It can store and retain sensitive and important information and data securely by eliminating data fraud, enhancing data safety and security. This is done by using the Hash function, which in turn provides high protection and privacy to the user, e.g., the message digest algorithm, which can be abbreviated as ''MD5'' and is a one-way cryptographic function used in various fields for maintenance and to demonstrate data integrity. How-The associate editor coordinating the review of this manuscript and approving it for publication was Jiafeng Xie. ever, the problem with the digital verification tools of the MD5 function lies in the collision, which many researchers report indicates a weak point of this encryption function [7]- [11]. Researchers have examined the weaknesses of the MD5 algorithm by conducting a large number of studies, research efforts, and analyses. The research has examined some types of attacks that are effective against the current algorithm, such as dictionary attacks, the rainbow table attacks, and brute force attacks. Researchers have discussed the weakness in the solutions that are currently used to solve the weakness of the MD5 algorithm in Web applications [12].
Researchers recommend that more powerful security and elasticity can be achieved by modifying the length of the current MD5 128-bit algorithm, as an output with variable length can achieve high performance and security. The research also proposes the use of a key to eliminate threats that commonly appear in rainbow attacks and dictionary attacks [13]. There are many weaknesses of the current MD5 algorithm, especially its failure and weakness against various types of attacks. Therefore, an enhanced MD5 algorithm with a dynamic variable length and high efficiency that simulates the highest security is proposed. In this paper, a novel and efficient approach is presented to expand the size of the output hash of the MD5 algorithm. This approach adds further protection against known attacks, as a new idea is applied using the chaos theory and produces different fragment sizes to prevent all general hostile attacks. The goal is to generate a chaotic map that provides a random generation of values. As such, the output of the Hash is determined through the Runge-Kutta rules, which generates values based on the initial values that are obtained from the four output registers of the MD5 function, represented by A, B, C, and D, respectively. This provides a high randomness that is difficult for attackers to decipher. In this technique, the MD5 hash function is used to create the digest by modifying the initial conditions of all the chaotic maps used in the enhanced algorithm. Furthermore, the research shows that the development of the implementation of the improved MD5 algorithm plays a major role in maintaining the integrity of data from manipulation and forgery and increases the reliability and authenticity of the data.
Several methods have been proposed in the field of validation, including those presented in [14] where researchers have proposed a SIQ authentication protocol that relies on elliptic curve coding.

II. PREVIOUS WORKS
Due to the development of the present era, the high reliance on data transmission and information on the Internet for communication purposes required the encryption of data and information to identify and restrict malicious intruders from infiltration and access to read messages, and allows the process of encrypting information to users of the systems to transfer information and data with great security. From previous studies, it is possible to record and perceive that in many cases and modifications have been applying to the MD5 algorithm to address their security issues. However, there are several conceptual and methodological weaknesses that expose the chances of high error opportunities. A Message authentication system makes this authentication system more secure Several studies have reported that, in order to counter attacks according to the concept of secure systems assays in the handshake protocol, they need to authenticate all messages using the tick value so that the attacker cannot modify the file the algorithm that used to do this can be other the strongest algorithm or the weaker algorithm Therefore there was a need to pay attention to the structural algorithm of Hash to be stronger by adding strength and complexity while maintaining an acceptable level of execution time. The researchers suggested overcoming the limitations of the MD5 function by relying on parallel coding, as the researchers combined this coding between MD5 and Blowfish function in order to increase and provide sufficient strength and security [15]. Others present an implemented hybrid cryptography that uses both MD5 and the proprieties of an elliptic curve cryptosystem (ECC) to generate key steam [16]. Other strategies to enhancement MD5 done by applying the concept of steganography is combined with cryptography for Increasing security. The message was encrypted by MD5 hash function and applying the Advanced Encryption Standard (AES) [17], also the AES together with message digests (MD5) hash function to increase a security authenticity on cloud computing Proposed by [18]. Thus, this investigation will confer for modifying the round functions of MD5 Incorporating Hirose Compression Function with precise identification of rules and creation of a look-up table to improve the security of the cipher text [19]. This research will then modify the MD5 algorithm, in this paper, a novel technique to increase the retail size of the MD5 algorithm to implement further safeguard upon known retail attacks. The unusual purpose applied a mix of XOR and AND operators to produce a 1280-bit fragmentation size to prevent. Common attacks to increase security level to prevent brute force attacks and rainbow table [20]. Sponge formation inflexion of the MD5 and SHA1 hash functions [8]. The features of the MD5 algorithm were employed in several fields among which was the handling of the URL. This is to overcome, reduce and form the wrong positive actor and enhance the display of allocated crawlers [21]. Researchers have worked to maintain data security and integrity by adopting a proposal that provides a homomorphic partial RSA combination and MD5 hashing algorithm [22]. There is other research dealing with the use of the MD5 hash function, through the preparation of various plans and the adoption of multiple techniques in order to overcome the weaknesses inherent in the MD5 function. Among them, the researchers proposed a new plan, and the confusion and coding techniques are completely different due to the method of sequencing the block code of the jamming used at the bit level after stirring and DNA coding. In this procedure, the MD5 hash function is applied to formulate hash digestion to modify the initial conditions for all used messy maps [23]. The researchers proposed a new algorithm referring to Robust Integrity Verification Algorithm (RIVA). This algorithm helped to cancel the memory mappings of file pages after they were transferred, to improve the integrity of file transfers via checksum calculation tasks to read files directly from the disk [24]. This paper reports the design of a new hash algorithm with key integrity that accepts the conditions of message integrity and sources authentication. In this paper, a new hash algorithm has been introduced that involves a 64-bit key. The time taken by the proposed algorithm increases by 15-20% from the current security level. However, in cases wherever document security is the primary priority, regardless of time [25]. The features of the MD5 algorithm were used to protect devices when connected to the Internet and making it safe to be part of the Internet of Things [26]. A method to ensure Rabin CDC based duplication data reversal technology has been introduced to produce resizable parts and MD5 use in the cloud computing environment [27]. There are a lot of researches to increase diffusion of data one of these approaches based on a new method for rearranging both rows and columns with a fixed shift row depends only on the row to improve diffusion [28]. VOLUME 8, 2020 Different methods used to generate random number one of these depend on Mouse Movement with 3D Chaotic Logistic Maps a random binary sequences generator that produces sequence of bits [29]. In this paper was designed as a new idea for the development of a segmentation algorithm based on different technologies including the generation of a new key with key integration that serves the requirements of message integrity and sources authentication.
We have been able to build the general structure of our scheme that meets the research requirements to enchantment the MD5 algorithm by proposed dynamic methods with variable length and a high efficiency that simulates the highest security available, which exceeds many of the technical and structural weaknesses of many of the studies that have been found.

III. MESSGE DIGEST 5(MD5)HASH FUNCTION
The message-digest algorithm (MD5) as one-way cryptographic hash functions generally provides a 128-bit hash value. MD5 was designed by Ronald Rivest in 1991 to replace a more immediate hash function MD4, and was designated in 1992 as RFC 1321 [30].

A. MAIN STURCTURE OF STANDARD MD5 HASH FUNCTION
The conversion of text to another encrypted text by using the MD5 function, which can be summarized in five basic stages as shown in the following: 1. Appending the padding bits as preprocess. This step helped to make the length of the message corresponding to 448, modulo 512 by adding a number of bits between (1. . . 512), so that the resulting message length is a multiple of 512. This will extend the message so that it is only 64 bits. The ''1'' bit is added to the message and then a set of 0 is appended so that the final block length matches 448. 2. Append the length of message In this step, the extension to the original message length was added, this extension represents the 64-bit length of the original message at the end of the bits in the previous step. If the message length is a k bit, we add the value k mod 2 64 . The result of the previous two steps is a message of length L * 512. Suppose this letter consists of a collection of words of each word with a length of 32 bits. That is, the letter ranges from (0. . .N-1) such that N = L * 16.

Initialize MD buffer
Recorders are configured as a four-word buffer (A, B, C, and D) to calculate the message digest. Each of these recorders is configured to be the 32-bit length in a hexadecimal byte and low order by using the following initial values: Initialize variables: (A = 67452301, B = efcdab89, C = 98badcfe, D = 10325476). The final result of the algorithm is found in these recorders, that 128 bits = 4 * 32.

Process the message block
The processed in different steps to produce the required output. This step represents the most important step in the algorithm. In this step, 16-word message blocks are processed, which is equal to 512 bits. It consists generally of four cycles; each cycle has its own function: F, G, H, I, and in each cycle, there are 16 steps. In each round, 16 steps are performed on the recorders, where the output of words of this step is entered into four rounds in each round is scattered for these words.

Output
After processing of all blocks, plain text is converted into ciphertext or hash form as a message digest, where the final value MD5 hash is 128 bits. See Figure 1, a detailed copy of the [MD5] algorithm can be obtained in [30].

B. WEAKNESS OF THE EXISTING MD5 ALGGORITHM
The research aims to develop a MD5 algorithm that can be used to create an electronic authentication system that makes this system more secure from other authentication system. This would be an improvement when compared to the current MD5 algorithm, which contains much vulnerability that made it vulnerable to various attacks, including attacks with brute force, rainbow schedule, dictionary, Christmas, etc. Despite this, the current MD5 algorithm is still used in applications, including validation of data; security protocols, data transfer and storage for verification.
The research focuses on eliminating the weaknesses that are inherent in the current MD5 algorithm, thereby ensuring data integrity and secure. The proposed algorithm has focused to improve the MD5 algorithm by dynamically changing the length of its output and using a variety of techniques to aggregate data in its encrypted form.
The Christmas style attack varies from the brute force scenario as the Christmas attack is characterized by the size of the data, an aspect that is essential. This makes it faster and more reliable than the brute force attack. The consequence of the Christmas attack is consequently, high if the size of the hash is small [31] Dictionary Attack is another attack that uses a dictionary data list, which is applied as a password through which the message is determined by using all the available possibilities to penetrate the algorithm and to reverse the brute force attack. The speed of hashing with a dictionary attack is much faster than brute force technique [32]. The rainbow attack is considered to be the most accurate when compared to the dictionary attack and brute force. The rainbow attack is a table that is typically utilized to break down and cracking cryptographic hash functions, by reverse password hashes [33].

IV. MODIFICATION AND IMPROVEMENT OF MD5 ALGORITHM
This paper was designed as a new ideation for the development of a segmentation algorithm based on different technologies, including the generation of a new key with key integration that fulfils the requirements of message integrity and source's authentication.
A logistic system was used to encode the Ribonucleic acid (RNA)by generating a random matrix based on a new key that is created using the initial permutation (IP) tables that are used in the data encryption stander (DES) with a linearfeedback shift register (LFSR). The use of these tools helped to make balance between time and complexity.

A. PROPOSED ENHANCEMENT OF MD5
In this paper, a new hash algorithm is proposed. This includes a key, which is created using two different primitive irreducible polynomials to generate a different binary element of the field GF (2 m ) from a base finite field with a degree (32) of the list. Next, the LFSR is applied to both polynomials by running the LFSR algorithm 64 times and reduces the output carrier number from each iteration by applying this method to two different sets of 64 bits from both polynomials (sq1, sq2). Subsequently, the XOR function is applied between sq1 and sq2 to obtain the initial key, and then the procedure of the initial permutation of the data encryption stander (DES) is used to create the main key. The main key is repeated as required until the size of the key is the same as that of the block message.

B. METHODOLOGY & KEY GENERATION
The issue of maintaining the privacy and security of data is an important matter in the application of electronic documents across different networks, particularly when dealing with unauthorized infiltration activities that attempt to see the data in the document and manipulate the content of these documents. These activities, if not curtailed, can lead to a creation of a fake copy or stolen data and acts of espionage. The MD5 algorithm used in the proposed system has been improved through these aspects 1. In this way, the explicit text has been converted to binary (0,1). 2. The text size was calculated by calculating the number of bits in order to enter it into the secret key generation algorithm proposed in this paper. 3. From the optimization, the first aspect is to increase the complexity that dependent on a linear-feedback shift register (LFSR). 4. Through using two levels of primitive irreducible polynomials of degree 32 through which a new key advantage can be generated. 5. By using two primitive irreducible polynomials of 32 degree to generate 32-series. 6. First two polynomial equations have been selected class on the first serial to output a new serial first bearing the 64-bit length Sq1. 8. Applying the LFSR function on the second serial to output a new serial second bearing the 64-bit length of Sq1. 9. Extracting the initial key through the XOR between (sq1, sq2). 10. Generating the main key by entering the primary key that was generated from the previous step to the initial permutation tables that were used in DES to output 64-bits, where the LFSR 64 roles are applied in each cycle. The load is extracted to be the sum of the other 64-bit outputs, and this would differ from the previous 64-bits. 11. Dividing the message file into several blocks each block has 768 bits instead of 512 bits, for more speed. 12. In the proposed system, RNA coding techniques will be somewhat different because the method of encoding cryptography is used at the bit level after flipping VOLUME 8, 2020 and using multiple permutation methods and RNA encoding. MRNA coding is built by relying on the outputs of the binary text with the outputs of the secret key generated in the previous step, where the construction method was based on taking two bits of the binary text, where it is combined with two bits with the outputs of the secret key and the result is compared with the MRNA table for Coded. 13. Each block is encoded using the product key of the previous step that uses Ribonucleic acid (RNA) Where the RNA chain is transformed to binary codes. 14. It is extracted from MRNA coding the message, which is in the form of decimal numbers, each number is composed of 10 orders, as well as nBits, which represents the number of bits. These parameters drawn in the fourth step are the main inputs to the stages of hash formation in MD5 in order to obtain hash. 15. The outputs of these codecs are processed to make them able to be inputted into the MD5 algorithm. 16. The output of four registers (A,B,C,D ) of the MD5 algorithm are extracted as input to Fourth-order Runge-Kutta method that used to solve the differential equation in the delay function to obtain high-quality hash value that encrypted by switching of chaotic neural network maps [13] see Figure 3 that shows general flow chart of the proposed system.
The length of the Hash is variable, as it has the dynamic ability to change the length of the Hash depending on the type of Hash required. See Figure 4 that demonstration the general block diagram of the proposed system.

V. PROSPOSED METHODS
In this work a novel five different methods are used to generate a new different robust hash from MD5 function. The amount of data that required to be analyzed and provided for protection varies continuously from one case to another. it is necessary to find an efficient and inexpensive method, and do not require high experience or advanced training level. that depend on computer methods such as MD5 Hash function. Five novel methods have been proposed in this research paper to improve the performance of an MD5 hash function as shown below: - Method 1:this method exposed the fusion of MD5 with chaotic theorem (Fourth-order Runge-Kutta method that used to solve the differential equation) & new security key ; the key size that used in this method is the same as the file size the main structure of this method demonstrated in figure 1 above. The output hash length is (128-bit, 256-bit, 384-bit, 512-bit . . . etc).
Method 2: this method exposed the fusion of MD5 with a new security key that used in method 1 that was explained previously in the section (5. Methodology & Key generation), the length of key is the same of plain text. The output hash length from method 2 is (128 bit) and this length is the same length that created by Basic MD5 hash but with different values, see Figure 5.
Method 3:This method creates MD5 hash value by fusion of Basic steps of MD5 hash function with chaotic theorem only. The chaotic plane depends on (Fourth-order Runge-Kutta method that used to solve the differential equation) that used in method1. The output hash length is (128-bit, 256-bit, 384-bit,512-bit . . . etc). The value of method 3 differs from the value generated by method 1, which can be observed clearly in experimental results.
Method 4:This method is showing a light version of method 2 that fusion of MD5 with a new security key that used in method 1 that was explained previously in the section (5. Methodology & Key generation), the length of key is fixed that is predetermined by the user. The key is engaged and injected into the text to be encrypted by performing a function XOR and the insertion key take two form (other fixed steps or fixed ratio from the original file) the same of plain text. But the output hash length from method 4 is (128 bit) and this length is the same length that created by Basic MD5 hash but with different values see figure 6.

VI. BASIC MEASURES OF PERFORMANCE
This section discusses the confidentiality conditions performed by the suggested approach, which show the robustness of the algorithm as compared to other types of hash algorithms.

A. WEAKNESS OF CONFIDEDTIALITY REQUIREMENTS FOR THE SYSTEM SUCCESSFUL
In order for the system to be confidential, the designer of the system must take into account in its design to meet the basic requirements that achieve the confidentiality of the system. The Confusion is an important concept, for designing of the VOLUME 8, 2020 program, the Confusion make sure to fill all the gaps through which the code breaker can analyze the system to know the explicit text through its knowledge of the encrypted text.
At the same time Diffusion appear as another important concept, Diffusion is When designing a program, you must make sure that all logical relationships are cancelled and the analyst cannot identify the decryption algorithm and find the key. The successful algorithm that prevents the analyst breaks it even if he can know the explicit text. The degree of secrecy the regime has depends on the possibility of breaking it. A highly confidential system is preferred. It is possible that the system is theoretically fracture but difficult to break in practice because the encryption process does not have a known technique for code analysis explicit text or key used.
The proposed new reduction algorithm is based on the MD5 reduction algorithm with better grasp of the excellent functions of the other algorithm. It can be noted that the hash values that produced by our proposed algorithm are different lengths depending on how the data is important, that values to be encrypted (128, 160, 256, 384, 512, 1024, 2024) compared to a 128-bit value that produced only by the MD5 algorithm. Despite the high flexibility and dynamic scalability of the hash values in this algorithm, I have managed to maintain the same execution time for all outputs of lengths per file. This makes our proposed algorithm more difficult to break because of the increased level of security it has achieved.

B. THE SIMPLICITY OF THE KEY
The simplicity of the key and the ease with which it is remembered are the most important characteristics of which the key is preferred. In the proposed algorithm, the choice of keys depends on the diversity of features that give to the key the strength and the simplicity at the same time.

C. THE COMPLICATION OF BOTH THE ENCRYPTION AND DECYPTION METHO
A suitable encryption system should be easy and flexible to decrypt, though, at the same time, the process of analyzing and breaking the code should be difficult and not possible. This is done by making the encoding time and decoding time efficiently (polynomial time), while the time it takes to decode the code is (exponential time). After adding the expansion function in the proposed algorithm to develop a function, MD5, the algorithm needs more further time than the traditional algorithm of MD5, but the difference is not large as it increases and slightly by the length of the message.
However, compared to other reduction algorithms such as SHA 1, for example, the time of implementation of the proposed algorithm is less expensive, and for the complexity of the system, the complexity rate of the algorithm can be calculated from (2 ∧ 64) because the algorithm consists of 4 cycles per cycle Of 16 steps. 16 * 4 = 64). If compare with other algorithm like SHA1 hash algorithm that has more complexity of 2 ∧ 80 that consists of 4 cycles per 20-step cycle.
The suggested algorithm consists of 4 cycles in each 16step cycle, and expansion equations were added to the algorithm to increase the relative complexity of the algorithm. The values of the proposed hash algorithm have a dynamic length such as (128, 160, 256, 384, 512, 1024). Despite the variety of outputs of lengths, the time taken to obtain such lengths for the same file is very close. As for breaking the code, the process is very complex and difficult for the codebreaker. For example, if the output length of the hash value is 160, it is the same as the length of the value produced by the SHA1 algorithm, so they have the same complexity in breaking the code.

VII. EXPERIMENTAL RESULTS
The results of the experiment show that even if the time taken for the proposed algorithm is relatively more in relation to the required level of safety, it will exclude any of the techniques used in the hybridization algorithm, such as the key creation method and use of the coding method that used RNA or the use of chaos theory, such as Brute force and other Attacks. One of the major advantages is that the MD5's improved algorithm can be expanded to any size greater than 64-bit key block length so that the output is safer against any attack. The proposed improvement and development of the algorithm has been tested through several experiments: The first stage: The first stage was to test the algorithm for collision. The experiment was applied to 1000 text files of different sizes and the result was returned to no collusion.
For the second stage: Several tests were performed on the algorithm by examining the algorithm's resistance to penetration and code breaking attacks. Among these tests, a test was conducted for each of the five methods to novel improve the hash algorithm used in this search to, using online penetration sites where all the sites used to test the strength of the improvement that were performed on the hash algorithm to break the hashtags were failed as among these sites like (Crackstation.net, MD5 decryption.com, md5.webmax.ca/, md5online.org and Hashkiller.co.uk) Where the hybridization of the encryption algorithm was made using various coding techniques and steps, where the complexity was greatly increased with a relative preservation over the time required for implementation as the hybridization methods used in this paper varied, and this diversity had a great impact in obtaining high dynamics by obtaining hash values. Sub-tests were performed, in which the number of bits extracted from the four registers was changed in order to serve as an introduction to Ren Kota's laws as a chaotic map. This method achieved great success by keeping time relatively, regardless of size of fragmentation. The speed fluctuates near the speed that appears with an unchanged algorithm. Figure 1 shows a comparison of multiple methods used to improve the actual MD5 algorithm. The use of this method had high flexibility in outputting the desired length with different values, as we can obtain the length of 128, 254, 384, 512, 1024 . . . etc. from the hash values. If (8 digit) feed to rung kutta chaotic. and we can obtain the length  144,272,400,528,1040,2064) hash length if (9 digit) feed to rung kutta chaotic and 160,288,416,544,1056,2080 hash length if (10 digit) feed to rung kutta chaotic and do on more detail can be seen in table1. Samples of different file size used in experiments of all methods illustration in figure8. This is to prevent the hacker from knowing the algorithm used and trying to break it. And increase the complexity of it by increasing the length MD5 hash value.
The technique proposed in MATLAB R2018b has been implemented and implemented several times on a system containing: - The processor used in this sheet is the Intel Pentium i76500U processor that runs at 2.5GHz 2.59GHz • 12 GB RAM. 64-bit • It was the operating system (Microsoft Window 10).

VIII. EXPERIMENTALA STATISTICAL ANALYSIS OF EXPERMENTAL RESULTS
In order to prevent all malicious and unauthorized access to the secret digital data that data is exchanged and transmitted over the Internet or any internal network, this is done through preventive measures that are achieved to reach the highest degree of confidentiality and security This paper was introduced in order to share and protect the transmitted information that is sent through the computer and telecommunication network. Therefore, consideration should be given to security as the most important and serious challenges of sharing information through the network.
Security and confidence are a very significant issue that should be available in the case of communication and sharing of data resources between computers.
Consequently, Encryption techniques have been adopted as an important and effective data encryption function as well as authenticated by other users.
The encryption techniques used are the main tool to maintain the security and integrity of information through its methodology, the encrypted messages will be unreadable.
It can be noted that in these days the encryption has become the main savior of the security problem of Internet communications, as it provides important points and features such as (data integrity, non-repudiation in addition to confidentiality and data authentication).in this section a statistical analysis of all our proposed method in this paper are doing.   Writing a test hypothesis for Pearson Correlation: H0: There is no linear relationship between Time and Method 2 for results 1 The results of T test and Correlation obtained through applying the SPSS statistical analysis program for the data are as follows: Write the hypothesis for T test: H0 = Time≤ Method 3    The results of T test and Correlation obtained through applying the SPSS data analysis program are as follows:        The results of T test and Correlation obtained through applying the SPSS statistical analysis program for the data are as follows: Which includes the results of the statistical tests of the five methods, by setting the tabular value (t) at a significant level (0.05) and since the calculated (t) is greater than the tabular (t) (1.686) and since its value is negative, the H0 hypothesis cannot be rejected, that is, there is no difference Significant between the time taken to implement the original MD5 function and the time taken to implement the MD5 developed function, where the Pearson Correlation values for the five methods were as follows: The first method recorded the values of the subtests for this method, which represent the hash length  It has been observed that the value of Sig. (2-tailed) is (0.000) for all values, which leads to rejecting the null hypothesis (H0), meaning that the time of implementation of all the methods proposed in this research is strongly correlated with the values of the original time. This confirms that the correlation coefficient value can be adopted. Accordingly, we can conclude from the above that any of the methods used in this research can be adopted.
More details of the statistical operations can be found with the tables of all the tests for the proposed methods in the attached file, where all the hashtags generated for all the methods have been attached with the time required to implement each method and the details of the statistical relationships associated with it.

IX. CONCLUSION
MD5 is one of the functions or techniques of one-way segmentation that is used in many fields and in different applications to maintain data integrity by converting plain text or data into encrypted text that is generated in the form of unique hash data. This helps prevent any manipulation of it, even if the level of change is just one bit. The development of the MD5 algorithm is conducted through dynamic behavior, and the extraction of the MD5 algorithm is developed by varying the length of its output (128, 160, 256, 384, 512, 1024, and 2048) and other lengths, as can be clearly observed in Table 1. This is done because the length of the output of the MD5 algorithm is often considered a weak point of the algorithm. Through this dynamic method, the algorithm is made robust against all types of attacks because the algorithm simulates the long lengths of multiple algorithms without affecting the speed of the output of the algorithm. All the length types of the Hash are approximate in a similar way, despite occupying different spaces in the treasury of outputs, such as MD4, SHA-2-256, FSB-256, SHA-2-384, FSB-384, ECOH-384, SHA-2-512, FSB-512, or VSDL-2048, as shown in Table 1. It also has the key technology, which was created to give strength and resilience against attempts at penetration and manipulation. Due to these properties, there have been many modifications to the algorithm to address its preexisting security issues. Indeed, the MD5 algorithm suffers from the above attacks because of the smaller values of the hash digest. The improvement in the proposed MD5 algorithm results in an improved collision resistance and access to the highest levels of security by providing the distribution and creation of bits such that it is difficult for attackers and hackers to predict and change individual data.