Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/60—Protecting data
  • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
  • G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/60—Protecting data
  • G06F21/602—Providing cryptographic facilities or services
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F2221/2107—File encryption

Definitions

• the present disclosure relates to the technical field of information operating, particularly to a method and device for operating encrypted files.
• a computer file (which may also be called a file) may be a data flow segment stored on a long-term storage device.
• long-term storage devices may include magnetic disks, optical disks, and magnetic tapes.
• a characteristic of computer files is that stored information may be repeatedly used over a long period of time without being lost when power failure occurs. Though represented as a single flow, a file may often also be stored as multiple data fragments in different locations of a disk (or even multiple disks, such as RAIDs). The operating system may then organize these fragments of information into a file system, then placing each file in a specific folder or directory.
• certain computer files may be encrypted; and such files may be called encrypted files.
• the basic process of file encryption is that a specific algorithm may be performed on a plaintext file or data to convert the file or data into a segment of unreadable codes, which generally may be called ciphertext.
• the contents of the ciphertext may be displayed only after a corresponding key may be input.
• the inverse process of the above-mentioned process is called decryption, namely, the process of restoring encoded information back to the original data.
• a current method used in the art to run an encrypted file may require that the encrypted file be first decrypted before being run.
• a temporary decrypted file may meanwhile be generated for running an already decrypted file. Since a file needs to be first decrypted before being run in the memory and also a temporary file may be stored in a storage device, the decrypted file may be read using a memory reading tool. A decrypted file operating in the memory may be read by using a memory reading tool, or directly exported from the temporary file. Therefore, the current method in operating encrypted files has the drawback of being weak in security.
• the present disclosure discloses a method for operating encrypted files.
• the method may include at least the following operations: calculating according to a pre-defined method, a respective file partitioning value corresponding to a particular position of a string sequence order within an encryption key of an encrypted file; calculating a sum, N, of the respective file partitioning values on all positions of the string sequence order within the encryption key, afterwards, partitioning the encrypted file into N sub-files; scrambling the N sub-files according to a pre-defined scrambling method; and operating the encrypted files, wherein the operating may include: unscrambling the N sub-files by reversing the pre-defined scrambling method to restore the string sequence order of the encryption key; successively reading the respective file partitioning value corresponding to the particular position within the string sequence order within the encryption key; and successively operating corresponding sub-files according to the respective file partitioning value at the particular position, and according to the restored string sequence order of the encryption key.
• a device for operating encrypted files may include at least a processor with circuitry operating in conjunction with at least a memory which stores instruction codes operable as plurality of units, wherein the plurality of units may include at least: a file partitioning unit, a file scrambling unit, and a file reading unit, wherein: the file partitioning unit is utilized to: calculate according to a pre-defined method, a respective file partitioning value corresponding to a particular position of a string sequence order within an encryption key of an encrypted file, calculate a sum, N, of the respective file partitioning values on all positions of the string sequence order within the encryption key, and afterwards partition the encrypted file into N sub-files; the file scrambling unit is utilized to: scrambles the N sub-files according to a pre-defined scrambling method; and the file reading unit is utilized to: successively read the respective file partitioning value corresponding to sub-files which have been unscrambled within the particular position to restore the string sequence order of the encryption key
• a non-transitory computer-readable storage medium stores a program which includes codes or instructions to cause a processor circuitry to execute operations for operating encrypted files.
• the operations may include: calculating according to a pre-defined method, a respective file partitioning value corresponding to a particular position of a string sequence order within an encryption key of an encrypted file; calculating a sum, N, of the respective file partitioning values on all positions of the string sequence order within the encryption key, afterwards, partitioning the encrypted file into N sub-files; scrambling the N sub-files according to a pre-defined scrambling method; and operating the encrypted files, wherein the operating may include: unscrambling the N sub-files by reversing the pre-defined scrambling method to restore the string sequence order of the encryption key; successively reading the respective file partitioning value corresponding to the particular position within the string sequence order within the encryption key; and successively operating corresponding sub-files according to the respective file partitioning value at
• Implementing the embodiments of the disclosure may enable the information which is being read and operated on to be still under encryption protection. Thus even if the file may be read or accidentally exported, the information may not be usable without being re-assembled through knowledge on a descrambling scheme and knowledge of the string sequence order of the encryption key.
• Figure 1 depicts a flowchart illustrating an exemplary method for operating encrypted files, according to an embodiment of the present disclosure.
• Figure 2 illustrates an exemplary scheme to partition an encrypted file into sub-files, according to an embodiment of the present disclosure.
• Figure 3 depicts exemplary sub-files distribution utilizing a string sequence order within the encryption key before scrambling, according to an embodiment of the present disclosure.
• Figure 4 depicts exemplary sub-files distribution after scrambling, according to an embodiment of the present disclosure.
• Figure 5 depicts an exemplary structural diagram of a device for operating encrypted files, according to an embodiment of the present disclosure.
• Figure 1 depicts a flowchart illustrating an exemplary method for operating encrypted files, according to an embodiment of the present disclosure.
• the method may include at least the following exemplary operations:
• Step 101 calculating according to a pre-defined method, a respective file partitioning value (e.g., a numerical value) corresponding to a particular position of a string sequence order within an encryption key of an encrypted file, calculating a sum, N, of the respective file partitioning values on all positions of the string sequence order within the encryption key, and afterwards, partitioning the encrypted file into N sub-files.
• An encrypted file (see Fig. 2, encrypted file (A)) may be a file generated after encryption operations which may be further utilized for running various applications as computer files. More specifically, the encrypted file (A) files may be further subdivided into binary files and ASCII files. Graphic files and computer programs, such as a word operating program, may be binary files. These binary files may have special formats and contain computer codes.
• An ASCII file is a plain-text file that may be read by using any word operating program.
• the encryption key "54312” is an encryption key of an encrypted file.
• the encryption key "54312” is formed by a string sequence of numerical values, having "5" being the numerical value at the first position (i.e., the head in the string sequence order) in the string sequence order, followed by the numerical value "4" at the second position, the numerical value "3" at the third position, the numerical value 1 " at the fourth position and the numerical value "2" at the last position (i.e., the tail in the string sequence order).
• the numerical values "5", "4", “3", “1 ' and “2" constitute the respective partitioning values to the corresponding positions (i.e., 1 st , 2 nd , 3 rd , 4 th and 5 th ) of the string sequence order within the encryption key "54312".
• the encrypted file (A) may be equally subdivided into 15 sub-files.
• the obtained respective numerical partitioning value from the corresponding particular position of the encryption key may be squared to obtain a sum of squares total value (N).
• the encryption key of the encrypted file may be "54312".
• Step 102 Scrambling the N sub-files according to a pre-defined scrambling method.
• the N sub-files may be scrambled according to a pre-defined scrambling method.
• Fig. 3 may illustrate how a calculated sum of N sub-files may be scrambled using a head-to-tail swap scrambling method.
• N sub-files may be scrambled by using methods such as equal-interval swap scrambling.
• the disclosure is not limited to those described in the embodiments of the present disclosure.
• Step 103 operating the encrypted files, by performing: unscrambling the N sub-files by reversing the pre-defined scrambling method to restore the string sequence order of the encryption key; and successively reading the respective file partitioning value corresponding to the particular position within the string sequence order within the encryption key.
• step 101 when the numerical value of each particular position of the string sequence in the encryption key is used as the file partitioning value, the numerical value number of sub-files of each corresponding particular position may also be read successively according to the encryption key string sequence.
• the squared numerical value number of sub-files of each particular position of the string sequence order may be read successively.
• step 101 assuming that a cubic numerical value is used on the file partitioning value to each particular position on the string order, the cubic numerical value number of sub-files of each particular position of the string sequence order may be read successively.
• the disclosed embodiments mainly include two parts, namely, the scrambling of an encrypted file and operating of a scrambled file.
• the scrambling of an encrypted file may include the operation of generating encryption rules according to a key.
• the obtained coded length of a file may be 1 ,000,000 lines, thus the sequence may be 1 to 1 ,000,000.
• a user-defined key may utilize the simple password 54321 , which may be converted into the key rules for scrambling.
• the five corresponding positions (i.e., 1 st to 5 th positions of the five numerical digits) in the password or encryption key file 54321 may be used as the number of partition lines.
• the 1 ,000, 000-line codes may be divided into five portions.
• the scrambling may utilize a head to tail swap, such as swapping the first portion (i.e., head) of the original file to the fifth position (i.e., tail end) (or changed from 1 to 5), likewise, swapping the second portion of the original file to the fourth portion (changed from 2 to 4), and so on.
• a head to tail swap such as swapping the first portion (i.e., head) of the original file to the fifth position (i.e., tail end) (or changed from 1 to 5), likewise, swapping the second portion of the original file to the fourth portion (changed from 2 to 4), and so on.
• Operating a scrambled file mainly includes loading the encryption key file (54321 ) when the scrambled file is run or being operated on.
• the content of the corresponding partition may be loaded and sorted according to the sequence of the encryption key file. For example, if the encryption key is 54321 , the fifth partition of the content may be loaded first, then the fourth, and so on. In this case, the file may be loaded by segment. Therefore, even if the file may be read from the memory, no content leakage should occur because the file has been scrambled.
• Figure 3 depicts exemplary sub-files distribution utilizing a string sequence order within the encryption key before scrambling, according to an embodiment of the present disclosure.
• the encrypted computer file (A) may use a seven digit encryption key "4941678", with seven corresponding positions which form the numerical string sequence order "4941678".
• each of the seven positions may be used as the file partitioning value of that particular position.
• the numerical value of the first position in the sequence is 4; the numerical value of the second position in the sequence is 9; the numerical value of the third position in the sequence is 4; the numerical value of the fourth position in the sequence is 1 ; the numerical value of the fifth position in the sequence is 6; the numerical value of the sixth position in the sequence is 7; the numerical value of the seventh position in the sequence is 8.
• 39 is the sum of the file partitioning values, and the encrypted file may be evenly partitioned into 39 sub-files, which may be sub-files 1 to 39 according to the original code sequence (for example, see Fig. 2). If assuming that the encrypted file is a 780,000-line binary code, then the file may be evenly partitioned into 39 sub-files, each of which has a 20,000-line binary code. Since the key "4941678" is a seven digits key, all the sub-files may be distributed as seven portions.
• Figure 3 shows the schematic diagram for the distribution of sub-files according to the embodiments of the present disclosure.
• there may be seven portions of storage space from left to right. More specifically, in the first portion of storage space, four sub-files, namely, sub-files 1 to 4, may be stored; in the second portion of storage space, nine sub-files, namely, sub-files 5 to 13, may be stored; in the third portion of storage space, four sub-files, namely, sub-files 14 to 17, may be stored; in the fourth portion of storage space, one sub-file, namely, sub-file 18, is stored; in the fifth portion of storage space, six sub-files, namely, sub-files 19 to 24, may be stored; in the sixth portion of storage space, seven sub-files, namely, sub-files 25 to 31 , may be stored; in the seventh portion of storage space, eight sub-files, namely, sub-files 32 to 39, may be stored.
• the sub-files namely, sub-files 1 to 4
• a head-to-tail swap may be performed on the sub-files for scrambling, such as the one as shown in Figure 4, which the scramble result may show that there may be seven portions of storage space from left to right.
• the first portion of storage space may store eight sub-files, namely, sub-files 32 to 39.
• the second portion of storage space may store seven sub-files, namely, sub-files 25 to 31 .
• the third portion of storage space may store six sub-files, namely, sub-files 19 to 24.
• the fourth portion of storage space may store one sub-file, namely, sub-file 18.
• the fifth portion of storage space may store four sub-files, namely, sub-files 14 to 17.
• the sixth portion of storage space may store nine sub-files, namely, sub-files 5 to 13.
• the seventh portion of storage space may store four sub-files, namely, sub-files 1 to 4.
• the sub-files may be stored from left to right.
• sub-files 32 to 39 may actually be stored in the first portion of storage space.
• the file may not be read in the natural sequence. If the file needs to be read in sequence, the file may need to be parsed according to the encryption key.
• the encryption key is a seven digits string sequence with seven corresponding positions, it may be determined that there may be seven portions of storage space, with each respective portion correspond to a position in the string sequence following an order.
• the sum of the file partitioning values has been calculated as 39 according to the values in all the positions of the encryption key. Accordingly, seven portions of storage space may be read in sequence from the 39 sub-files.
• sub-files 1 to 4 should be read in sequence.
• the second digit of the key since the second digit of the key is 9, nine sub-files may be then read from the sixth storage space; that is, sub-files 5 to 13 may be read in sequence.
• the third digit of the key is 4, four sub-files may then be read from the fifth storage space; that is, sub-files 14 to 17 may be read in sequence.
• the fourth digit of the key is 1 , one sub-file is then read from the fourth storage space; that is, sub-file 18 is read. Since the fifth digit of the key is 6, six sub-files may be then read from the third storage space; that is, sub-files 19 to 24 may be read in sequence. Since the sixth digit of the key is 7, seven sub-files may be then read from the second storage space; that is, sub-files 25 to 31 may be read in sequence. Since the seventh digit of the key is 8, eight sub-files may be then read from the first storage space; that is, sub-files 32 to 39 may be read in sequence. Accordingly, the entire encrypted file (A) is read according to the correct sequence.
• the embodiments of the present disclosure may further disclose a device for operating encrypted files.
• Figure 5 depicts an exemplary structural diagram of a device (500) for operating encrypted files (A), according to an embodiment of the present disclosure.
• the device (500) may include at least a processor (507) with circuitry operating in conjunction with at least a memory (506) which stores instruction codes operable as plurality of units, wherein the plurality of units may include at least: a file partitioning unit (501 ), a file scrambling unit (502), and a file reading unit (503).
• the file partitioning unit 501 may be utilized to: calculate according to a pre-defined method, a respective file partitioning value corresponding to a particular position of a string sequence order within an encryption key of an encrypted file, calculate a sum, N, of the respective file partitioning values on all positions of the string sequence order within the encryption key, and afterwards partition the encrypted file (A) into N sub-files.
• the file scrambling unit (502) may be utilized to: scrambles the N sub-files according to a pre-defined scrambling method.
• the file reading unit (503) may be utilized to: successively read the respective file partitioning value corresponding to sub-files which have been unscrambled within the particular position to restore the string sequence order of the encryption key, in order that the sub-files may be further being operated on successively, wherein the unscrambling is performed by reversing the pre-defined scrambling method.
• the file partitioning unit (501 ) may be utilized to obtain a respective numerical value corresponding to the particular position of the string sequence order within the encryption key, and squaring the respective numerical value; calculate the sum, N, by summing the squared respective numerical values on all positions of the string sequence order within the encryption key.
• the file reading unit (503) may be utilized to successively read the squared respective numerical value corresponding to the particular position within the string sequence order within the encryption key.
• the file partitioning unit (501 ) may be utilized to obtain a respective numerical value corresponding to the particular position of the string sequence order within the encryption key, raising to a cubic order the respective numerical value; calculate the sum, N, by summing the cubic respective numerical values on all positions of the string sequence order within the encryption key.
• the file reading unit (503) may be utilized to successively read the cubic respective numerical value corresponding to the particular position within the string sequence order within the encryption key.
• the file scrambling unit (502) may be utilized to scramble the N sub-files according to the pre-defined scrambling method.
• the scrambling method may include scrambling of the N sub-files according to a head-to-tail swap scrambling method.
• the encrypted files may be run on a variety of terminals, including, but not limited to, function mobile phones, smartphones, handheld computers, PCs, tablet computers, and personal digital assistants (PDAs). Specific embodiments of terminals may be listed above. However, those of ordinary skill in the present art may understand that such listing is intended only for elaboration, but not intended to limit the protection scope of the embodiments of the present disclosure.
• the method and device disclosed by the embodiments of the present disclosure for operating encrypted files may be implemented in multiple modes.
• the method for operating encrypted files may be compiled as a plugin that may be installed on a PC or mobile terminal.
• the method may be encapsulated as an application program that a user may download for use.
• the method may be compiled as a plugin in one of several formats, such as * .ocx, * .dll, and * .cab.
• the method disclosed by the embodiments of the present disclosure for operating encrypted files may be implemented by using techniques such as Flash plugins, RealPlayer plugins, MMS plugins, Musical Instrument Digital Interface (MIDI) plugins, and ActiveX plugins.
• MIDI Musical Instrument Digital Interface
• the method disclosed by the embodiments of the present disclosure for operating encrypted files may be stored on a variety of storage media by means of instruction storage or instruction set storage.
• Such storage media include, but may be not limited to, floppy disks, optical disks, Digital Video Disks (DVDs), hard disks, flash memory, USB disks, Compact Flash (CF) memory cards , microSD cards, multimedia cards (MMCs), SM cards, memory sticks, and xD-Picture cards.
• the method disclosed by the embodiments of the present disclosure for operating encrypted files may be applied to storage media based on Nand flash, such as USB disks, CF cards, microSD cards, SanDisk 4 GB Secure Digital High Capacity (SDHC) cards, MMC cards, SM cards, memory sticks, and xD cards.
• Nand flash such as USB disks, CF cards, microSD cards, SanDisk 4 GB Secure Digital High Capacity (SDHC) cards, MMC cards, SM cards, memory sticks, and xD cards.
• the file partitioning value of each position of the numerical key string sequence order of an encrypted file may be calculated according to a pre-defined method, the sum, N, of the file partitioning values of all positions may be calculated, and the encrypted file may be partitioned into N sub-files; the N sub-files may be scrambled according to a pre-defined scrambling method; the file partitioning value number of sub-files of each position in the key string sequence order may be successively read according to the unscrambling method corresponding to the scrambling method and the position of the key string sequence.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Computer Security & Cryptography (AREA)
• Software Systems (AREA)
• Computer Hardware Design (AREA)
• General Health & Medical Sciences (AREA)
• Health & Medical Sciences (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Bioethics (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Storage Device Security (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=52318649

Family Applications (1)

Country Status (2)

Cited By (3)

Families Citing this family (5)

Citations (4)

Family Cites Families (8)

• 2013
  • 2013-07-19 CN CN201310305978.4A patent/CN104298926B/zh active Active
• 2014
  • 2014-07-18 WO PCT/CN2014/082471 patent/WO2015007234A1/en active Application Filing

Patent Citations (4)

Also Published As

Similar Documents

Legal Events