METHOD FOR DATA COMPRESSION AND ENCRYPTION FIELD [0001] This disclosure is related generally to a method of data compression and data encryption. BACKGROUND [0002] For many years, multiple theories have been set forth to compress and/or encrypt data. With respect to compression, the prior art has focused on the mathematical manipulation of a database. For example, “lossy compression” reduces the amount of data by removing unnecessary information or information deemed less important. “Lossless compression” reduces bits by identifying and eliminating statistical redundancy without losing information. With respect to encryption, the prior art falls generally into two types. Asymmetric encryption works with public and private keys. Symmetric encryption works by the transfer of a secret key. The secret key is sent by way of a separate channel, e.g. an email sent prior to a conference. [0003] It is known that conventional compression and encryption methods can operate separately to transfer compressed and/or encrypted data on the internet. The present application is directed to a method for both compression and encryption wherein the method may be used for any type of database. SUMMARY [0004] The compression and simultaneous or contemporaneous encryption method described herein is usable for any database having bytes, characters, digits, hexadecimals, or any other type of unit used to represent a thought, image or sound. The database may include any data and may be of any size. Further, the database may contain picture, video, text, voice, or any other type of information. [0005] The method includes grouping the data by use and then organizing the data into a block or blocks of data. Prime numbers are organized into a block or blocks of non-contiguous prime numbers. The organization of prime numbers is saved. The block or blocks of data are aligned with the block or blocks of prime numbers. The method includes mapping the positional redundancy of the block or blocks of data to the block or blocks of prime numbers. [0006] One or more encrypted compression key(s) are derived or created after the mapping of the positional redundancy of the block(s) of data to the block(s) of prime numbers. The saved organization of prime numbers is used in the derivation of an encrypted compression key D and/or an encrypted organization key O. A double encrypted master key M may be formed by merging the encrypted compression key D to the encrypted organization key O. The method disclosed herein includes the deletion of the original database before the transfer of either the encrypted compression key D, the encrypted organization key O, or the double encrypted master key M. [0007] The present invention does not transform the database, or irrevocably delete any of its parts before transport. Instead, the mapping of the positional redundancy of data to prime numbers, and the saving of the organization of the prime numbers, allows for the creation or derivation of an encrypted compression key, or an encrypted organization key, or a master key. The methodology maps the database to prime numbers and then uses the properties of the prime numbers to create one or more keys that can be reversed mathematically. The methodology also provides a mechanism for simultaneously or contemporaneously compressing and encrypting the database. [0008] The disclosed method, in essence, adds a layer of encryption to the compression, and a layer of compression to the encryption. Encryption and compression occurs from mapping the data to prime numbers and saving the organization of prime numbers. Double encryption and compression occurs with the use of a trap door, or a one-way function, in both the compression and encryption parts of the method. Because of the uniqueness of the disclosed method, the trap door functionality provides a protected pathway for the creation of one or more keys. That is, a trap door function protects the creation of either an encrypted compression key, an encrypted compression organization key, or a double encrypted compressed master key. [0009] The method disclosed herein, including the steps of organizing original data into block(s) of data; organizing prime numbers into block(s) of non-contiguous prime numbers; aligning the block(s) of data with the block(s) of prime numbers; saving the organization of the prime numbers; and mapping the positional redundancy of the block(s) of data to the block(s) of prime numbers, are believed to provide an improvement over the prior art and are foundational to other method steps which are disclosed in this application. Similarly, adding encryption to the compression process; adding compression to the encryption process; and adding trap door functions, all of which incorporate the mapping and organization steps, are also believed to distinguish over the prior art. [0010] The functional keys described herein, including the encrypted compression key and the double encrypted compression master key, have functional parts. Large blocks of a database require more time to process. As will be described in more detail, part 1 of the functional parts may be used for smaller databases, and parts 2 and 3 of the functional parts may be used for larger databases to check for accuracy and to speed up the process when necessary. [0011] These and other aspects of the present invention will be understood from the following detailed description of the embodiments and the appended claims with the drawings. BRIEF DESCRIPTION OF THE DRAWINGS [0012] FIG.1 illustrates in block diagram form, the method of the present invention for encrypting, compressing, decompressing, and unencrypting a database; [0013] FIG.2 illustrates in block diagram form, the grouping of databases by use; [0014] FIG.3 illustrates in block diagram form, the organization of a database into a plurality of blocks that are grouped by use; [0015] FIG.4 illustrates in block diagram form, the organization of prime numbers, mapping of positional redundancies, and the saving of the organization of prime numbers; [0016] FIG.5 illustrates in block diagram form, an embodiment of the method used to generate Part 1 of an encrypted compressed key D; [0017] FIG.6 illustrates in block diagram form, an embodiment of the method used to generate Part 2 of an encrypted compressed key D; [0018] FIG.7 illustrates in block diagram form, an embodiment of the method used to generate Part 3 of an encrypted compressed key D; [0019] FIG.8 illustrates in block diagram form, an embodiment of the method used to generate Part 1 of the final compressed key D and the double encrypted master key M; [0020] FIG.9 illustrates in block diagram form, an embodiment of the method used to generate Part 2 of the final keys D and M; [0021] FIG.10 illustrates in block diagram form, an embodiment of the method used to generate Part 3 of the final keys D and M; [0022] FIG.11 illustrates in block diagram form, an embodiment of the method used to reverse the final key(s), including keys M and D, and the organization key O; [0023] FIG.12 illustrates in block diagram form, an embodiment of the method used to reverse Parts 2 and 3 of the final key(s) M and D; [0024] FIG.13 illustrates in block diagram form, an embodiment of the method used to reverse part 1 of the first key(s) relating to keys M, D, and O; [0025] FIG.14 illustrates in block diagram form, an embodiment of the method used to reverse Parts 2 and 3 of the first key(s) relating to keys D and M to recreate the database; and [0026] FIG.15 illustrates in block diagram form, a communications system in accordance with the present invention. [0026-1] FIG.16 illustrates an example of a sine wave applied to the data discussed in paragraphs [0058] and [0060]. DETAILED DESCRIPTION [0027] Reference will now be made to the drawings where embodiments of the method of the present invention are illustrated. It will be apparent to one of ordinary skill in the art that various modifications and variations can be made in the present invention without departing from the scope of the present invention. It is intended that the present invention covers such modifications and variations as exist within the scope of the appended claims and their equivalents. [0028] FIG.1 shows a schematic overview 10 of the present invention in block diagram form. The method described herein can be generally summarized as follows: a. The method of the present invention is directed to the simultaneous or contemporaneous encryption and compression of a selected database. A database, as used herein, refers to bits, bytes, characters, digits, hexadecimals, or any other type of unit used to represent a thought, image or sound. The database may include any data and may be of any size. Databases may contain picture, video, text, voice, or any other type of information. As illustrated at 100 in FIGS.1 and 2, the method starts by grouping the data by use and then organizing the data into a block or blocks of data as illustrated in FIG.3. b. As shown at 200 in FIGS.1 and 4, prime numbers are organized into a matrix of block(s) of non-contiguous prime numbers. The organization of prime numbers may be saved. The block or blocks of data are aligned with the block or blocks of prime numbers. The next step in the method includes mapping the positional redundancy of the block or blocks of data to the block or blocks of prime numbers. c. The present invention does not transform the database, or irrevocably delete any of its parts before transmission. Instead, as shown in FIG.1, keys (300-800) are created; the original database is deleted prior to transmission (900); the prime numbers associated with mapping are recreated after transmission (1000-1200); and the database is recreated (1300). d. One or more encrypted compressed key(s) are derived or created after the mapping of the positional redundancy of the block(s) of data to the block(s) of prime numbers. Further, the saved organization of prime numbers is used in the deriving of an encrypted compression key D and an encrypted organization key O. A double encrypted master key M is formed by merging the encrypted compression key D to the encrypted organization key O. The present invention provides simultaneous or contemporaneous compression and encryption of any database. [0029] FIG.2 and FIG.3 are block diagrams (100) illustrating a database that is grouped by use of data and organized into blocks. This method step may be illustrated using a common database associated with a picture frame. The frame is a JPEG file and is a picture of the inside of a home, and thus is named the “Home pic”. [0030] The Home pic is already a compressed file. The methodology described herein works regardless of raw data or any redundancy. Therefore, it does not matter whether the data is numerical, contained in an original picture, a compressed picture, or any other type of database. [0031] Generally, a color image file includes four sets of pixel values—one for red, one for green, one for blue, and one labeled “A”. Pixel values are commonly referred to as “RGB” numbers. The parameter “A” stands for alpha, which is the transparency channel. For a 24-bit color image, each color set includes pixel (RGB) values that range from 0 to 255. [0032] Given that the file contains three channels, each of the RGB numbers ranging from 0-255, the database is grouped to maintain its natural structure. Each channel is split and placed into its own column – thus creating a sub-database with three columns. An index is added to the structure. The first 10 RGB numbers are shown explicitly. I _{ndex Red} ^{Green Blue} I _{ndex Red} ^{Green Blue 90} _{217 193 145 3 2 4 4 0 1 5 6 6} [0033] FIG.3 further illustrates step 100 of method 10. Since the Home pic file is grouped naturally into RGB numbers ranging from 0-255, FIG.3 illustrates how the database can be further organized. In this example, each color is separated into a separate database and then organized into blocks of data, such as ten (10) blocks or columns of 10 numbers. The table below displays the data of the red column (100 RGB numbers) organized into blocks of 10 numbers each. Pattern: Red Block 1 Block 2 Block 3 Block 4 Block 5 Block 6 Block 7 Block 8 Block 9 Block 10 202 205 207 209 215 211 213 212 219 217 red component of the top left pixel of the image. The number below the top left number (205) is the pixel value for the red component of the adjacent pixel (adjacent in the same row). Thus, in the example above, the 100 numbers illustrated are the pixel values for the red component of the first 100 pixels in the first row of the image. The next block would be the next 100 pixels. The rest of the data of the image is organized in a similar fashion. [0035] FIG.4 illustrates step grouping 200 of the method 10. The method organizes original data into a block or blocks of data, as previously described; organizes prime numbers into a block or blocks of non-contiguous prime numbers (204); saves the organization of prime numbers (206); and maps the positional redundancy of the blocks of data to the blocks of prime numbers (208). As illustrated, the organization of prime numbers is used in the creation of mapped prime number blocks and in the creation of an organization key(s) O. [0036] The first encryption of the original data occurs at this point in the method. Mapping the positional redundancy of the original database to a database of prime numbers associates an individual prime number with each position. Reversal of the protocol occurs by finding the Prime Product of each group, all groups, or combinations, and dividing this number by each prime number in the associated block, group, or combination. Since prime factorization is difficult, the inclusion of scrambling of the organization in the present method provides encryption to the original data. [0037] By way of example, the table below presents a database of prime numbers organized in a zig-zag pattern. The organization of the prime numbers differs from the organization of the data, and flows as follows:

Pattern: Prime Numbers: Block 1 Block 2 Block 3 Block 4 Block 5 Block 6 Block 7 Block 8 Block 9 Block 10 2 3 5 7 11 13 17 19 23 29 map positional redundancies. An illustration of the mapping of positional redundancy of block 1 of the original database to block 1 of the prime database is shown below. The following is only one example of the mapping of positional redundancy. Red RGB numbers: Prime Numbers Block 1 Block 1 202 2 205 31 204 73 [0039] At this point in the methodology, the saved organization of prime numbers (the “data”) is encrypted and can now be compressed. The “data” can be compressed and turned into a key such as key D. The key (D), that is created by the present method, is automatically encrypted. Further, the key, that is created, has an automatic trap door or one-way functionality which is part of the formation of the encrypted compression key D. A second related trap door functionality is used in the creation of an encrypted organization key O. Further, trap door functionality is used in the joining of keys D and O to form a double encrypted compressed master key M. The two keys D and O may be merged to form a double encrypted compressed master key M. Because of the flexibility provided by the method of the present invention, other embodiments of the invention are possible. [0040] Referring again to FIG.4, 206 illustrates saving the organization of prime numbers and creation of an organization key (O). The embodiment uses a small set of prime numbers and equates the set of prime numbers to factors identified below, which factors will be defined. Organization Key (O) =Sum of Factors = ^^^^^^^௧^^^ ^^ ^^^^^^^௧^ ^^^^^ ^^^ௗ௨^௧^ ௌ _{^௧ ^^^^^ ^^^ௗ௨^௧כௌ௨^ ^^ ொ௨^௧^^^௧^} [0041] Step grouping 300 of FIG.5 illustrates the method steps related to forming part one of the encrypted compressed key D. Figure 5 illustrates how the encrypted data can be compressed using a trap door (one-way) function. It illustrates how a plurality of part one (1) or "first keys" are generated using the trap door direct derivation methodology. The general methodology equates the grouped prime numbers to factors as follows: Part 1 Key =Sum of Factors = ^{^^^^^^^௧^^^ ^^ ^^^^^^^௧^ ^^^^^ ^^^ௗ௨^௧^} ௌ _{^௧ ^^^^^ ^^^ௗ௨^௧כௌ௨^ ^^ ொ௨^௧^^^௧^} [0042] Part two (2) and part three (3) of the encrypted compressed key D add further data, if needed, to accurately derive the prime numbers of the database. Each part can be used alone or together to compress the data. Parts 2 and 3 of the encrypted compressed key D assist in the speed of finding the correct prime numbers, as will be described further. [0043] The method described herein begins with grouping data by use and then organizing the data into a bock or blocks of data. Prime numbers are organized into a block or blocks of non-contiguous prime numbers. The block or blocks of data are aligned with the block or blocks of prime numbers. Then, mapping of the positional redundancy of the block(s) of data to the block(s) of prime numbers occurs, and a saving of the organization of prime numbers occurs before or after the mapping step. After the foregoing steps, an encrypted compressed key D is created based upon the mapping of the positional redundancy of the bock(s) of data to prime numbers. In addition, the present method is also directed to the formation of an encrypted organization key O and a double encrypted master key M, which is formed by merging, simultaneous or contemporaneously, the encrypted compressed key D with/to the encrypted organization key O. [0044] The creation or generation of the part one (1) version of the encrypted compression key is illustrated in step grouping 300 including steps 302, 304, 306, 308, 310, 312, 314, 316, 318, and 320 of FIG.5. For purposes of explanation and definition with respect to FIG.5, the mapping of a block of organized data to a block of organized prime numbers results in a Prime Product. Dividing the Prime Product by Prime Numbers results in the Prime Quotient. [0045] FIG.6 describes the creation or generation of the part two (2) version of the encrypted compressed key D in steps 402, 404, 406, 408, and 410 of step grouping 400. The general methodology will be described further as will the method for generating the lookup tables to make the process proceed smoothly and efficiently. [0046] An example of the method described herein is presented as follows. A table is made consisting of ten columns (each named Block 1, Block 2, etc.). Each block consists of 799,027 prime numbers. The table was used to compress 71,912,439 digits. For illustrative purposes, the data from Red RGB 237 is presented, which was compressed from Block 1 of the table. [0047] The total Prime Product for Block 1 equaled 2.49 E^6,142,993. The data for Red 237 in Block 1 included only five (5) RGB numbers, or fifteen digits. Given the small amount of data, this RGB would normally be compressed using only part 1. This example simplifies the numbers and illustrates the process used for potentially larger blocks. [0048] The data for the Red RGB 237 block 1 is presented below as follows:

Red RGB 237, Block 1: [0049] The purpose of Part 2 of the encrypted compressed key is to provide a mechanism for finding the exact Prime Product. This can be accomplished by method steps including rounding the scientific notation format of the Prime Product. For example, if the rounded Prime Product for RGB 237 is 9.0 E 38, this number can be stepped to the actual Prime Product by adding the following to the rounded Prime Product: Total Count Addition No of times Delta Remaining Prime 72 E+38 [0050] Thus, only seventy-two (72) numbers would have to be searched to find the exact Prime Product. In this example, the basic process is simplified by dividing the Prime Product for each group by the total Prime Product of all groups and converting the result to scientific notation. [0051] In the example, the methodology would divide the Prime Product of Red 237 by the Prime Product of the block of prime numbers used. In this case, the Prime Product for this block was 2.4 E + 6142993. The result of the calculation is as follows: Prime Product Red 237/Prime Product of block = 9.72 E+38/ 2.4 E + 6142993 = 3.90588915 E – 6142955. [0052] At step 406 in FIG.6, the rounded guess would be 3.0 E – 6142955. The Prime Product of the block is given. The exponent of the rounded guess need only be the difference between the exponent of the block prime and the result of the calculation above. Thus, the rounded guess would be modified to 3.0 E -24 (6142979-6142955). [0053] At step 408 in FIG.6, the amount of error and error percentage are calculated. The result of the calculation above would be subtracted from the rounded guess as follows: Amount of Error: (3.90588915 E ^– 6142955) – (3.0 E^ – 6142955) = 0.90588915 Error Percentage: % Error = Amount of Error/Key = .90588915/3.0 = 30.196305% [0054] At this point, Part 2 would be 32430196305. Reversal provides a Prime Product that can then be iterated to find the correct and final solution. The protocol would have to search through 30,159 possibilities to find the correct Prime Product. To find the correct number, each possibility must be checked against Part 1 of the code. Any one of the prime numbers in the RGB 237 set will return a whole number when divided into a Prime Product that includes one of the prime numbers in the set. Therefore, a tag is added to the error code that identifies the lowest prime number in the set. In this case the index number would be 350004. The protocol would first divide each of the above 30,159 possibilities by the Prime Number associated with index 350004 (58886741). If a match is found, the protocol divides the match against the entire set and checks the results against Part 1 until the correct Prime Product is found. As will be described, Part 3 further limits the search. [0055] At step 410 in FIG.6, Part 2 of the key would be set at 32430196305 plus the index of 350004 (32430196305350004). For the example, this process results in no more than 30 digits for Parts 1 and 2 of the key. Therefore, the method described in this example, could be used to compress duplicate data of more than three hundred (300) digits and still achieve high compression rates. For a large database, which, for example, only holds one frame of data, Parts 1 and 2 of the key can hold up to approximately 940 digits without reducing the compression rate lower than 10%. In the example, the block size was 799,027. If three RGB numbers are assumed, then the amount of data compressed by each block would be 2,397,081 digits (799027 * 3). A compression rate of 10% would leave room for 239,708 digits. If a key for each RGB number is obtained, then the code for each key could range up to 940 (239,708/255). [0056] FIG.7 discloses the grouping 500 of method steps 502, 504, 506, and 508 for creating or generating Part three (3) of the encrypted compression key D. Step grouping 500 illustrates how a Part three (3) key is generated using a direct derivation methodology. Part 3 of the encrypted compression key can be used to derive the Prime Product needed for reversal, or to speed up reversal of Parts 1 and Part 2. [0057] As disclosed in FIG.7, the method steps map the actual energy, or quantum mechanisms, that the position of each prime number and each duplicate digit, holds along the number line. [0058] A simple example is presented below by referring again to the example of RGB 204. Step 502 of FIG.7 lays out the data of each block along a number line using the following methodology. The table below presents only the index, RGB number, and associated Prime Numbers in a block of ten (10) prime numbers. Index RGB Prime [0059] If the data above is presented along a number line, the data would appear as follows: Index 204 RGB Prime 73 127 283 353 [0060] At step 504 of FIG.7, the method applies a wave function to the data of the block. A wave is applied to each duplicate set of numbers, in this example RGB numbers. The wave gives definition to the pattern of the RGB numbers producing the Prime Product for each subgroup or duplicate. The wave pattern used in the example was a sine wave, but any type of wave pattern or like function can be used to describe the energy caused by the position of the numbers. The following is an example of a sine wave applied to the above data.

[0061] At step 506, the wave is analyzed and each crest of the wave is reduced to a function or mathematical equation that describes the start and end positions of the duplicate RGB number and their position along the number line. In this example, the code would be reduced to communicate a start of the data at index three (3), a run of two (2) numbers, a break of two (2) index numbers, and a final run of two (2) numbers. [0062] Several mathematical formulations can be used to encode the wave function associated with Part 3. The method step includes any mathematical formulation that places the results in a key and is used to derive or check the Prime Product and then use this number to locate the position of redundancies. Finally, at step 508, the data resulting from the mapping is set as Part 3 of the key. [0063] FIG.8 illustrates step grouping 600 for creating or generating Part one (1) of the final keys D or M. The method steps 602, 604, 606, 608, 610, 612, and 614, set forth in FIG.8, are an iteration of and supplement to the method steps set forth in FIG. 5. FIG.5 relates to the formation of an encrypted compression key D. FIG.4 refers to saving prime numbers and creating an encrypted organization key O. The organization of prime numbers is used in both the deriving of an encrypted compression key D and an encrypted organization key O. A double encrypted master key M, referred to at 614 in FIG.8, is formed by merging the encrypted compression key D to the encrypted organization key O. This provides simultaneous or contemporaneous compression and encryption for any database. [0064] For example purposes with respect to FIG.8, the digits of the first key are in essence iterated through the methodology to reduce the remaining digits to ten (digits 0-9) plus the code required to check the accuracy of the derivation. [0065] Using the example, Step 602 of FIG.8 would include organization of a plurality of first keys into a string of digits ranging from 0-9 with a common bit separating the values. The first keys could also be placed into a standard length for coding. [0066] Again using the example, step 604 maps the digits through the matrix of prime numbers as described previously. At step 606 the methodology separates the data into ten (10) datasets for each duplicate digit. At step 608, a lookup table is utilized to find the factors needed for Part 1 of the final key. At step 610, collisions are resolved and the significant digits of the final number are determined. At Step 612, the encrypted compressed key (D) is derived. Finally, at step 614, Part 1 of the final key is set. [0067] FIG.9 illustrates the step grouping 700 including steps 702, 704, 706, 708, and 710. FIG.9 illustrates how the methodology generates Part two (2) of the final keys D or M. The steps in FIG.9 are, in essence, an iteration of the methodology described with respect to FIG.6. [0068] At step 702, and again using the example, the method derives the Prime Product of each of the final 10 subgroups (digits 0-9). At step 704, the Prime Quotient for each subgroup is derived. At step 706, the result is rounded to significant digits and the error percentage is derived. At steps 708 and 710, Part two (2) of the final keys is set. [0069] FIG.10 illustrates the step grouping 800, including steps 802, 804, 806, and 808. FIG.10 illustrates the creation or generation of Part three (3) of the final key(s) D or M using a direct derivation methodology. At step 802, the subgroup of prime numbers is examined and laid out in number line format as previously described. At step 804, wave functions are applied to the data, and the data is encoded to record the position of the prime numbers within the dataset. At step 806, the crests of the waves are analyzed and gaps in the range are encoded into variables. At step 808, the variables are combined and set as Part 3 of the key. [0070] The encrypted compressed key(s) D and the organization key(s) O can be merged, applied, or combined into a double encrypted master key M. Both keys (D and O) are compressed using the compression derivation methodology described herein. A trap door function, that is automatic with the present method, is used to create the encrypted compressed key(s) D, and a second trap door function is used to create the compressed organization key(s) O. The master key(s) M includes both the encrypted compressed key(s) D, the encrypted compressed organization key(s) O, and the use of the natural trap door functionality that occurs from mapping the data to prime numbers and saving the organization of the prime numbers. [0071] The process of combining key(s) D and O can involve the use of an Asymmetric or Symmetric process. Use of Asymmetric encryption in the present method results in the creation of a public and private master key (M-public and M- private). In essence, the “double encryption” occurs as a result of mapping the data to prime numbers and saving the organization of prime numbers, which, combined with the trap door functionality, allows the simultaneous or contemporaneous joining or merger of the compression methodology to one of the alternative encryption processes. [0072] The compressed encrypted key(s) D and the master key(s) M include one or more parts, e.g., Parts 1, 2, or 3. For smaller databases, the key(s) D and M may only include one part, and for larger databases, an additional part or parts may be included. The usage of the parts provides enhancements for the D and M key(s) with respect to speed and accuracy. [0073] The method disclosed herein compresses by derivation instead of mathematical manipulation, since manipulation may result in a loss of data. Unique to the present method is the fact that the original database is deleted in its entirety prior to transmission and then recreated after transmission with little loss of information. The method uses prime numbers to map or organize a database, even a chaotic or random database, and then uses the properties of prime numbers to recreate or derive the database. Prime numbers are not used to mathematically alter the database. Rather, prime numbers are used to locate the position of redundant elements in the database and they are used to scramble and thus encrypt the database. [0074] The method disclosed herein uses a novel approach to prime factorization. Instead of directly calculating a prime factorization solution, the disclosed method uses a derivation methodology that relies on the three part key(s) previously described. The key parts provide a mechanism for reversing the methodology and recreating the database. Part one (1) of the key(s) mathematically equates prime numbers to factors that are in turn converted to a compressed key(s). Part two (2) uses a rounded guess and error percentage to reverse the method. Part 3 maps the energy or quantum mechanisms of the actual pattern produced by each subgroup of prime numbers and their related Prime Products. Thus, part three (3) maps the energy or pattern of factorization and places the results in a key that is communicated across the process. This accelerates the process and improves accuracy during the compression of large databases. [0075] FIG.11 illustrates step grouping 1000 including steps 1002, 1004, 1006, 1008, 1010, 1012, 1014, and 1016. FIG.11 illustrates how the methodology may begin the process of reversing the M or D or O keys to obtain the original database. The methodology first reverses the final key using a derivation equation. At step 1002, the methodology begins the process of reversing Part 1 of the key and separates out Parts 2 and 3. [0076] The reversal method in this example begins at step 1002 by using the private key decryption function (D = Z^F mod O), and methodology described previously, which uncovers keys D and O. [0077] At step 1004, the organization key O is reversed and the saved organization structure is exposed to derive the encrypted compressed key D. At step 1006, the organization is used to set the block organization needed to reverse key D. [0078] At step 1008, key D is reversed using the following direct derivation formula: Set Prime Product = ^{^^^^^^^௧^^^ ^^ ^^^^^^^௧^ ^^^^^ ^^^ௗ௨^௧^} ^ _{כௌ௨^ ^^ ொ௨^௧^^^௧^} [0079] The process the first key(s) of each block or blocks of data. The first keys are grouped in the same order the database held originally. If the database is large, and the block of prime numbers used is large, then the process utilizes Parts 2 and 3 of the final key(s) to derive the Prime Product of each subgroup. FIG.11 is applicable for the reversal of Part 1 of the M, D, and O keys. [0080] FIG.12 illustrates step grouping 1100 including steps 1102, 1104, 1106, 1108, 1110, and 1114. FIG.12 illustrates reversing Parts 2 and 3 of the final key D or M. At step 1102, the amount of error is derived by multiplying the rounded key by the percent error. At step 1104, a temporary new key is obtained by adding the rounded key plus the amount of error. At step 1106, an estimate of the subgroup Prime Product is derived by multiplying the total Prime Product by the temporary new key. [0081] At step 1108, Part 3 of the key is utilized to define the prime numbers included in the search for a final solution. At step 1110, the estimate of the subgroup Prime Product is divided by the index of the first Prime Product in the set, and then all of the prime numbers identified in the search set, until whole numbers result from the calculation. [0082] FIG.13 is a schematic illustration of the interaction of step groupings 1200, 1300, and 1400 for the purpose of reversing Part one (1) of the keys M, D, or O. Step grouping 1200 includes steps 1202, 1204, 1206, 1208, 1210, 1212, and 1214. Groupings 1200, 1300, and 1400 demonstrate how the methodology reverses the first keys to obtain the original database. FIG.13 is, in essence, an iteration of FIG.11. [0083] At step 1202, Part 1 of the key(s) is separated from Parts 2 and 3. At step 1204, the organization key O is reversed which exposes the organization used to derive the encrypted compressed key D. At step 1206, the organization is used to set the block organization needed to reverse key D. [0084] At step 1208, encrypted compressed key D is reversed using the following ^{direct derivation formula:} S _{et Prime Product = ^^^^^^^௧^^^ ^^ ^^^^^^^௧^ ^^^^^ ^^^ௗ௨^௧^ ^כௌ௨^ ^^ ொ௨^௧^^^௧^} [0085] At steps 1210, 1212, and 1214, the groups and blocks of prime data are reconstituted, and if no Parts 2 or 3 exist, the mapping of the data is reversed and the database is recreated. [0086] FIG.14 is a schematic illustration of the interaction of set groupings 1300 and 1400 for the purpose of reversing Parts (2) and (3) of keys M or D. FIG.14 illustrates reversing Parts 2 and 3 of the first key if these components exist. At step 1302, the amount of error is derived by multiplying the rounded key by the percent error. At step 1304, a temporary new key is obtained by adding the rounded key plus the amount of error. At step 1306, an estimate of the subgroup prime product is derived by multiplying the total Prime Product by the temporary new key. [0087] At step 1308, Part 3 of the key is utilized to define the prime numbers included in the search for a final solution. At step 1310, the estimate of the subgroup Prime Product is divided by the index of the first prime number in the set and then by all the prime numbers identified in the set until whole numbers result from the calculation. The potential Prime Product is compared with Part 1 of the code. If the two sums match, then the subgroup Prime Product is identified. [0088] The database can be recreated by using the index to locate the position of each duplicate within the database. Because neither the numbers of the database, or the duplicates themselves, have been multiplied, the database can be recreated with accuracy. [0089] FIG.15 illustrates an example of a computing system that can be used to compress and encrypt a file, such as an image file, according to the principles described herein. The system can be a computer connected to a network, including a local area network and/or a wide area network. The system can be a client or a server. As shown in FIG.15, the system can be any suitable type of processor-based unit, such as a personal computer, workstation, server, handheld computing device, phone, tablet, or dedicated device. The system can include, for example, one or more of input devices 1420, output devices 1430, one or more processors 1410, storage 1440, software 1450, and communication device 1460. Input device 1420 and output device 1430 can generally correspond to those described above and can either be connectable or integrated with the computer. [0090] Input device 1420 can be any suitable device that provides input, such as a touch screen, keyboard or keypad, mouse, or voice-recognition device. Output device 1430 can include any suitable device that provides output, such as a display, touch screen, haptics device, virtual/augmented reality display, or speaker. [0091] Storage 1440 can be any suitable device that provides storage, such as an electrical, magnetic, or optical memory including a RAM, cache, hard drive, removable storage disk, or other non-transitory computer readable medium. Communication device 1460 can include any suitable device capable of transmitting and receiving signals over a network, such as a network interface chip or device. The components of the computing system can be connected in any suitable manner, such as via a physical bus or wirelessly. [0092] Processor(s) 1410 can be any suitable processor or combination of processors, including a central processing unit (CPU), graphics processing unit (GPU), field programmable gate array (FPGA), and application-specific integrated circuit (ASIC). Software 1450, which can be stored in storage 1440 and executed by one or more processors 1410, can include, for example, the programming that embodies the functionality of the present disclosure (e.g., as embodied in the devices as described above). Software 1450 can include one or more programs for execution by one or more processor(s) 1410 for performing one or more of the steps of the method claimed herein. [0093] As described, the method disclosed herein begins by organizing a selected original database into a block or blocks of data. The disclosed method is usable with any database including those containing pictures, video, text, voice, or any other type of information. As described, the next steps are to organize prime numbers into block(s) of non-contiguous prime numbers and align the block(s) of data with the block(s) of prime numbers. Mapping the positional redundancy of the block(s) of data to the block(s) of prime numbers is an important step in the method. Saving the organization of the prime numbers is also important and this step may occur either before or after the mapping step. In essence, data is mapped to prime numbers based on the positions of redundant data in the dataset. The properties of prime numbers are then used to create unique keys that can be reversed mathematically. Encryption occurs automatically from mapping the data to prime numbers and saving the organization of prime numbers. [0094] The foregoing method steps are foundational for the method because they allow the creation or derivation of the encrypted compression key D as well as the creation or derivation of the encrypted compressed organization key O. The foregoing method steps are also foundational to the method for creating the double encrypted master key M. A trap door functionality results from the basic method steps. The integration or merger of the unique compression formula, which automatically encrypts, to a known encryption formula, creates the master key M. Thus, the present method, simultaneously or contemporaneously, adds encryption to the compression process, adds compression to the encryption process, and uses a trap door functionality to permit the integration or merger of the encrypted compression key D with the encrypted compressed organization key O to form the double encrypted compressed master key M. [0095] The saved organization of prime numbers is uniquely used for many functions. It is used during the formation of the encrypted compression key(s) D, and it is also used during the formation of the encrypted compressed organization key(s) O. Similarly, a trap door function occurs during the creation of the encrypted compressed key D, and a second trap door function occurs and is used in the creation of the encrypted compressed organization key O. By using a trap door functionality in conjunction with the saved organization of prime numbers, the encrypted organization key(s) O is merged or joined simultaneously or contemporaneously with the encrypted compression key(s) D to create the double encrypted compressed master key(s) M. [0096] As described, the master key(s) M can be double encrypted by applying a modification of either known asymmetric or known symmetric encryption. The use of asymmetric encryption results in the creation of a public and private master key (M- public and M-private). The use of asymmetric encryption in the formation of the encrypted compressed organization key(s) O and the master key(s) M eliminates the need for a password. As described previously, the encrypted compressed key D and the master key M also include one or more parts, i.e., Parts 1, 2, and 3, to provide enhancement with respect to speed and accuracy. [0097] The preferred way for organizing original data, grouped by use, is to place the data into a matrix of columns and rows of data of known size without changing the order of placement. Mapping the positional redundancy of the blocks of data to the blocks of prime numbers preferably means mapping the position of each duplicate element in the blocks of data to an element of the organized prime blocks. The organization of prime numbers into a block(s) of non-contiguous prime numbers means organizing the prime numbers as either increasing, decreasing, or non-duplicative. Saving the organization of prime numbers preferably means converting the organization of prime numbers into number(s) from which the organization can be derived. The trap door function discussed herein means a one-way functionality. [0098] The foregoing description, for the purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the techniques and their practical applications. Others skilled in the art are thereby enabled to best utilize the techniques and various embodiments with various modifications as are suited to the particular use contemplated. [0099] Although the disclosure and examples have been fully described with reference to the accompanying drawings, it is to be noted that various changes and modifications will become apparent to those skilled in the art. Such changes and modifications are to be understood as being included within the scope of the disclosure and examples as defined by the claims.