SYSTEM AND METHOD FOR TEXT-BASED ENCRYPTION

Cross-Reference to Related Applications

[Para 1 ] This Application claims priority to pending Provisional U.S. Application Ser. No. 60/896,709, filed on March 23, 2007, which application is incorporated herein by reference in its entirety.

Technical Field

[Para 2] The presently preferred embodiment of the innovations described herein relate generally to software applications. More specifically, the presently preferred embodiment relates to a system and method for text-based encryption scheme for source code protection.

Background

[Para 3] Computer software applications written in programming languages, e.g., C or C++, are delivered in the form of compiled binary executable files, so that the source code of the program are well protected from view. Conversely, software systems written in interpretive or scripting languages, e.g., TcI or Perl, are commonly delivered in the form of readable source code or scripts in text- readable format. Often, compiled software applications are also delivered with certain supporting data files that can be in the form of readable text of any formats, such as scripts in TcI or Perl. The textual form of delivery for software applications provides the advantages of being platform independent and easy for customization; nevertheless it leaves the source code of the script file viewable with any text reader, and conversely any intellectual property contained within the scripts is easily viewable and thus unprotected. Critical and/or sensitive source scripts or supporting data files in textual form are not protected against

inadvertent or improper alterations. Software elements in textual form are also inadequate to be protected against unauthorized uses. [Para 4] To solve these problems, commercial software applications will sometimes compile the deliverable source code or supporting data files into binary images. Although this approach provides good protection, it requires the deliverable files be prepared individually for each computer platform because compiling object code from source code is typically platform dependant. [Para 5] What is needed is a system and method for text-based source code encryption that is platform independent.

Summary

[Para 6] To achieve the foregoing, and in accordance with the purpose of the presently preferred embodiment as described herein, the present application provides a method for text-based encryption, comprising accessing a text file with a plurality of lines of text characters; re-sequencing each of said text characters; translating a base representation for each of said text character by an offset of a base value so that a resulting translated character is printable; inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; inserting a plurality of random numbers of random characters before and after said random character string to output to a resultant file; and including a translated seed with said resultant file. The method, wherein said resultant file contains a seed number at a known location. The method, wherein said seed number is calculated from a clock. The method, wherein said text file contains a plurality of commands that are readable by a scripted language. The method, wherein translated character

is within a set of printable ASCII codes. The method, wherein said set of printable of ASCII codes is between a decimal value of 32 and a decimal value of 126. The method, wherein said base value is a decimal value of 158. The method, wherein said plurality of random numbers is determined from a random number generator. The method, wherein said base representation is an octal representation. The method, wherein said octal representation for each of said text character by an offset of an octal value so that a resulting translated character is printable.

[Para 7] An advantage of the presently preferred embodiment is to provide a computer-program product tangibly embodied in a machine readable medium to perform a method for text-based encryption, comprising instructions operable to cause a computer to access a text file with a plurality of lines of text characters; re-sequence each of said text characters; translate a base representation for each of said text character by an offset of a base value so that a resulting translated character is printable; insert a plurality of characters between each of said translated text characters on each of said line to form a random character string; insert a plurality of random numbers of random characters before and after said random character string to output to a resultant file; and include a translated seed with said resultant file. The computer- program product, wherein said resultant file contains a seed number at a known location. The computer-program product, wherein said seed number is calculated from a clock. The computer-program product, wherein said text file contains a plurality of commands that are readable by a scripted language. The computer-program product, wherein translated character is within a set of

printable ASCII codes. The computer-program product, wherein said set of printable of ASCII codes is between a decimal value of 32 and a decimal value of 126. The computer-program product, wherein said base value is a decimal value of 158. The computer-program product, wherein said plurality of random numbers is determined from a random number generator. The computer- program product, wherein said base representation is an octal representation. The computer-program product, wherein said octal representation for each of said text character by an offset of an octal value so that a resulting translated character is printable.

[Para 8] Another advantage of the presently preferred embodiment is to provide a data processing system having at least a processor and accessible memory to implement a method for text-based encryption, comprising means for accessing a text file with a plurality of lines of text characters; means for re- sequencing each of said text characters; means for translating a base representation for each of said text character by an offset of a base value so that a resulting translated character is printable; means for inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; means for inserting a plurality of random numbers of random characters before and after said random character string to output to a resultant file; and means for including a translated seed with said resultant file.

[Para 9] And another advantage of the presently preferred embodiment is to provide a method for text-based encryption, comprising accessing a text file with a plurality of lines of text characters; re-sequencing each of said text

characters; translating a decimal representation for each of said text character by an offset of a decimal value of 158 so that a resulting translated character is printable; creating a seed for a random number calculation, that is determined from a clock; generating a random number according to the following random number calculation RN _t = | (cl * RN _t -i + c2) MOD c3 |, for t = {l,...,n} where, RN = random number, and cl, c2, and c3 are coefficients that produce random numbers with sufficient fluctuation; inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; inserting said random number of random characters before and after said random character string to output to a resultant file; and including said seed with said resultant file.

[Para 10] And yet another advantage of the presently preferred embodiment is to provide a method for text-based encryption, comprising accessing a text file with a plurality of lines of text characters; re-sequencing each of said text characters; translating a decimal representation for each of said text character by an offset of a decimal value of 158 so that a resulting translated character is printable; creating a seed for a random number calculation, that is determined from a clock; generating a random number according to the following random number calculation: RN _t = | (cl * RN _t- i + c2) MOD c3 |, for t = {l,-.,n} where, RN = random number, and cl, c2, and c3 are coefficients that produce random numbers with sufficient fluctuation; inserting a plurality of characters between each of said translated text characters on each of said line to form a random character string; inserting said random number of random characters before and after said random character string to output to a resultant file; and including said

seed with said resultant file.

[Para 1 1 ] Other advantages of the presently preferred embodiment will be set forth in part in the description and in the drawings that follow, and, in part will be learned by practice of the presently preferred embodiment. The presently preferred embodiment will now be described with reference made to the following Figures that form a part hereof. It is understood that other embodiments may be utilized and changes may be made without departing from the scope of the presently preferred embodiment.

Brief Description of the Drawings

[Para 1 2] A presently preferred embodiment will hereinafter be described in conjunction with the appended drawings, wherein like designations denote like elements, and:

[Para 1 3] Figure 1 is a logic flow diagram of the method employed by the presently preferred embodiment; and

[Para 14] Figure 2 is a block diagram of a computer environment in which the presently preferred embodiment may be practiced.

Detailed Description of the Preferred Embodiments

[Para 1 5] The numerous innovative teachings of the present application will be described with particular reference to the presently preferred embodiments. It should be understood, however, that this class of embodiments provides only a few examples of the many advantageous uses of the innovative teachings herein. The presently preferred embodiment provides, among other things, a system and method for text-based encryption using a random number generator and character offsets that is platform independent. Now therefore, in

accordance with the presently preferred embodiment, an operating system executes on a computer, such as a general-purpose personal computer. Figure 2 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the presently preferred embodiment may be implemented. Although not required, the presently preferred embodiment will be described in the general context of computer- executable instructions, such as program modules, being executed by a personal computer. Generally program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implementation particular abstract data types. The presently preferred embodiment may be performed in any of a variety of known computing environments.

[Para 1 6] Referring to Figure 2, an exemplary system for implementing the presently preferred embodiment includes a general-purpose computing device in the form of a computer 200, such as a desktop or laptop computer, including a plurality of related peripheral devices (not depicted). The computer 200 includes a microprocessor 205 and a bus 210 employed to connect and enable communication between the microprocessor 205 and a plurality of components of the computer 200 in accordance with known techniques. The bus 210 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The computer 200 typically includes a user interface adapter 215, which connects the microprocessor 205 via the bus 210 to one or more interface devices, such as a keyboard 220, mouse 225, and/or other interface devices

230, which can be any user interface device, such as a touch sensitive screen, digitized pen entry pad, etc. The bus 210 also connects a display device 235, such as an LCD screen or monitor, to the microprocessor 205 via a display adapter 240. The bus 210 also connects the microprocessor 205 to a memory 245, which can include ROM, RAM, etc.

[Para 1 7] The computer 200 further includes a drive interface 250 that couples at least one storage device 255 and/or at least one optical drive 260 to the bus. The storage device 255 can include a hard disk drive, not shown, for reading and writing to a disk, a magnetic disk drive, not shown, for reading from or writing to a removable magnetic disk drive. Likewise the optical drive 260 can include an optical disk drive, not shown, for reading from or writing to a removable optical disk such as a CD ROM or other optical media. The aforementioned drives and associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules, and other data for the computer 200.

[Para 1 8] The computer 200 can communicate via a communications channel 265 with other computers or networks of computers. The computer 200 may be associated with such other computers in a local area network (LAN) or a wide area network (WAN), or it can be a client in a client/server arrangement with another computer, etc. Furthermore, the presently preferred embodiment may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices. All

of these configurations, as well as the appropriate communications hardware and software, are known in the art.

[Para 1 9] Software programming code that embodies the presently preferred embodiment is typically stored in the memory 245 of the computer 200. In the client/server arrangement, such software programming code may be stored with memory associated with a server. The software programming code may also be embodied on any of a variety of non-volatile data storage device, such as a hard- drive, a diskette or a CD-ROM. The code may be distributed on such media, or may be distributed to users from the memory of one computer system over a network of some type to other computer systems for use by users of such other systems. The techniques and methods for embodying software program code on physical media and/or distributing software code via networks are well known and will not be further discussed herein. System

[Para 20] Figure 1 is a logic flow diagram of the method employed by the presently preferred embodiment. Referring to Figure 1, the presently preferred embodiment discloses a method for text-based encryption 100 by beginning with accessing a text file with a plurality of lines of code (Step 105). Next, resequence each of the text characters (Step 110). Translate the base representation for each of the text characters by an ASCII offset of a ASCII value so that the resulting translated character is printable (Step 115). Insert a random number of random characters between each of the translated text characters to form a random character string (Step 120). Next, insert a random number of random characters before and after the random character

string for output to a resultant file (Step 125). Lastly, include a translated seed with the resultant file (Step 130). Text-based Encryption

[Para 21 ] The computer implemented methods for text-based encryption using a random number generator and character offsets that is platform independent in accordance with the presently preferred embodiment are set forth in more detail in the steps below. Step l

[Para 22] A text file titled sample.td contains a single line command, "puts HelloWorld" (without quotes). This single line command will print HelloWorld to the display when executed by the interpreter of TcI scripting language. The user desires to encrypt sample.td so that an unintended viewer (or person) does not ascertain the contents of the text file with the help of any common text editor or other method to obtain information from a text file. To begin the encryption process described in the presently preferred embodiment, the single line command is re-sequenced to look like, "dlroWolleH stup" (without the quotes). Step 2

[Para 23] Next, each character of the re-sequenced line is converted to its base representation of an ASCII decimal (or octal) equivalent and offset by subtracting it from the decimal 158 (or octal 236). It is understood that any base number system can be used, such as binary. For example, in dlroWolleH, d is decimal 100, which is subtracted from decimal 158 to result in decimal 58 that is the colon character, ":". When considering the example command line, the resulting decimal equivalent is: 100 108 114 111 87 111 108 108 101 72 115

116 117 112, which is then offset to decimal 58 50 44 47 71 47 50 50 57 86 43

4241 46. The ASCII equivalent of this offset decimal string, without the quotes, creates a translated string as ":2,/G/229V +*)." in this example.

Step 3

[Para 24] A pseudo random number generator is used to determine a random number of characters, described in more detail below, according to the following formula:

RN _t = |(cl * RN( _M ) + c2) MOD c3 | where t = {1, 2,...,n}, cl, c2, and c3 are integer coefficients to produce random numbers with sufficient randomness. Through experimentation, any set of coefficients can be employed; provided a sufficient fluctuation can be produced. For example, preferably 3, 11, and 17, can be used in place of cl, c2, and c3, respectively. RN ₀ , a seed number, is determined by a clock click number fetched from the system clock, at the time of encryption. The clock click number can vary in precision from seconds to nanoseconds. For example, utilizing NT Time Epoch, the time-date of December 8, 2004 at 21:56:03.9843750 GMT will produce 127470165639843750, which is then used to calculate RN ₀ . Utilizing Eq. 1: RN ₀ = I 127470165639843750 MOD 17 |

= 11 RNi = |(3 * RN ₀ + 11) MOD 17 |

= |(3 * 127470165639843750 + 11) MOD 17

= 1382,410,496,919,531,261 MOD 17 |

RNi = 10

The ASCII decimal code for a random character is determined by adding decimal value to the random number generated by the formula above. Any number greater than 126 will be decremented by 126 and a number less than 32 will be incremented by 32; then it is translated into an ASCII character. Each digit of the seed RN ₀ , a printable numeral of the ASCII character set, is offset by subtracting its ASCII code from the decimal 158 then converted to an equivalent ASCII character, e.g., RN ₀ => mm. A fixed number of random characters (also generated with the pseudo random number generator and the above mentioned rule) are then padded before and after the translated seed number (key). This is to further disguise the key. The string containing the encrypted seed number is then outputted to the beginning of a resultant file that will contain the encrypted text, for example, titled sample_tcl.txt. Step 4

[Para 25] Having created the seed, RN ₀ , a random number of random characters are inserted after each character in the translated string, ":2,/G /229V +*).", from above. For example, knowing that RNl is 10, 10 random characters are inserted, where ^λ is used in place of a random character in this example for simplicity, to produce:

^• λλλλλλλλλλ2 /G/229V +*}

The pseudo-random number generator is run again for RN ₂ with Eq. 1, where RN ₂ = |(3 * RNi + 11) MOD 17| = |(3 * 10 + 11) MOD 17| = | 41 MOD 17| = 7. Now 7 random characters are inserted after the next character in the translated string to produce:

^■ λλλλλλλλλλ2λλλλλλλ /G/229V +*)

The process of inserting random characters is iterative to form a new line. A random number of random characters calculated in the same manner discussed is then padded to the start and the end of the new line and is then outputted to the resultant file. Step 5

[Para 26] The resultant file is now encrypted with the embedded seed and is viewable by use of any method to view a text file, however the details are not discemable without knowledge of the seed, which is in this case also referred to as the key. At runtime, the application will search for the sample_tcl.txt file to decrypt utilizing the seed to produce the original line of "puts HelloWorld" to display "HelloWorld" in the application. Conclusion

[Para 27] From Step 1 through Step 5, the presently preferred embodiment has disclosed complete solution for text-based encryption using a random number generator and character offsets that is platform independent. [Para 28] The presently preferred embodiment may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations thereof. An apparatus of the presently preferred embodiment may be implemented in a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor; and method steps of the presently preferred embodiment may be performed by a programmable processor executing a program of instructions to perform functions of the presently preferred embodiment by operating on input data and

generating output.

[Para 29] The presently preferred embodiment may advantageously be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. The application program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language may be a compiled or interpreted language.

[Para 30] Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of nonvolatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD- ROM disks. Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (applicationZ-specifϊc integrated circuits). [Para 31 ] A number of embodiments have been described. It will be understood that various modifications may be made without departing from the spirit and scope of the presently preferred embodiment, such as the use of other character encoding methodologies or the use other random number generators, including pseudo-random number generators, computed or not. Therefore, other implementations are within the scope of the following claims.