Magnetic tape identification encryption method, decryption method, device, equipment, medium and product

Abstract

This application provides a magnetic tape identification encryption method, decryption method, apparatus, device, medium, and product, which can be applied to the field of financial technology. The magnetic tape identification encryption method includes: obtaining the original identification string from the original physical identifier of the magnetic tape, the original identification string being consistent with the inherent header number of the magnetic tape; performing an encryption transformation on the original identification string to generate an encrypted identification string, the encryption transformation being a preset reversible transformation used to convert each original character in the original identification string into at least one corresponding ciphertext character; and generating a target physical identifier based on the encrypted identification string to replace the original physical identifier, the encrypted identification string represented by the target physical identifier being inconsistent with the inherent header number of the magnetic tape, so that when the magnetic tape drive reads the encrypted identification string based on the target physical identifier and matches the encrypted identification string with the header number, it triggers a read / write prohibition mechanism on the magnetic tape.

Description

Technical Field

[0001] This application relates to the field of financial technology, specifically to a magnetic tape identification encryption method, decryption method, device, equipment, medium, and product. Background Technology

[0002] Magnetic tape, as a high-capacity offline backup medium, is widely used in industries such as finance for core data backup and off-site archiving. The side of the magnetic tape has a tape label and barcode. When a tape drive reads a tape, it verifies whether the text on the tape label, the barcode, and the pre-written header number inside the tape match. Reading and writing are only allowed if they match; otherwise, a read / write restriction mechanism is triggered.

[0003] In remote data transfer scenarios, the original physical identifier of the tape is consistent with the header number, meaning anyone who obtains the tape can directly read the data through the tape drive, posing a data leakage risk. Existing protection measures include: software encryption of backup data requires significant computing resources; full encryption of existing tapes is costly; dedicated encryption tape drive hardware deployment is expensive; and physical seals are insufficient to prevent unauthorized use by internal personnel.

[0004] Therefore, there is an urgent need for a tape security solution that does not touch internal data and does not rely on dedicated hardware, so as to utilize the tape drive's own verification mechanism to achieve anti-read protection during remote transmission. Summary of the Invention

[0005] In view of the above problems, embodiments of this application provide a magnetic tape identification encryption method, decryption method, apparatus, device, medium, and product.

[0006] According to a first aspect of this application, a magnetic tape identification encryption method is provided. The method includes: obtaining an original identification string from the original physical identifier of the magnetic tape, the original identification string being consistent with the inherent header number of the magnetic tape; performing an encryption conversion on the original identification string to generate an encrypted identification string, the encryption conversion being a preset reversible transformation used to convert each original character in the original identification string into at least one corresponding ciphertext character; and generating a target physical identifier to replace the original physical identifier based on the encrypted identification string, the encrypted identification string represented by the target physical identifier being inconsistent with the inherent header number of the magnetic tape, so as to trigger a read / write prohibition mechanism of the magnetic tape when the magnetic tape drive reads the encrypted identification string based on the target physical identifier and matches the encrypted identification string with the header number.

[0007] According to an embodiment of this application, the step of encrypting the original identifier string to generate an encrypted identifier string includes: obtaining the numeric code corresponding to each original character in the original identifier string according to a preset character encoding rule; determining the first encrypted character corresponding to the numeric code based on a preset first mapping relationship; determining the second encrypted character corresponding to the numeric code based on a preset second mapping relationship; and generating the encrypted identifier string based on the first encrypted character and the second encrypted character.

[0008] According to an embodiment of this application, determining the first encrypted character corresponding to the digital code based on a preset first mapping relationship includes: performing a first operation on the digital code using a first encryption function to obtain a first operation result; performing a division operation on the first operation result with a first base as the divisor to obtain an integer quotient; searching for a first character corresponding to the integer quotient in a first mapping table, and using the first character as the first encrypted character.

[0009] According to an embodiment of this application, determining the second encrypted character corresponding to the digital code based on a preset second mapping relationship includes: performing a second operation on the digital code using a second encryption function to obtain a second operation result; performing a division operation on the second operation result with a second base as the divisor to obtain a remainder; searching for a second character corresponding to the remainder in a second mapping table, and using the second character as the second encrypted character.

[0010] According to an embodiment of this application, generating the encrypted identifier string based on the first encrypted character and the second encrypted character includes: sequentially concatenating the first encrypted character and the second encrypted character corresponding to each of the original characters in the original identifier string according to the order of each of the original characters in the original identifier string to obtain the encrypted identifier string.

[0011] According to a second aspect of this application, a method for decrypting a magnetic tape identifier is provided. The method includes: obtaining an encrypted identifier string on a target physical identifier of the magnetic tape; decrypting and converting the encrypted identifier string to restore the original identifier string, wherein the decryption and conversion is the inverse of a preset reversible transformation; and generating a compliant physical identifier based on the original identifier string to replace the target physical identifier, wherein the original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the magnetic tape, so as to remove the read / write restriction mechanism on the magnetic tape.

[0012] According to a third aspect of this application, a magnetic tape identification encryption device is provided, the device comprising: a first information reading module, configured to acquire an original identification string on the original physical identifier of the magnetic tape, the original identification string being consistent with the inherent header number of the magnetic tape; an encryption conversion module, configured to perform an encryption conversion on the original identification string to generate an encrypted identification string, the encryption conversion being a preset reversible transformation, configured to convert each original character in the original identification string into at least one corresponding ciphertext character; and a first identification replacement module, configured to generate a target physical identifier to replace the original physical identifier based on the encrypted identification string, the encrypted identification string represented by the target physical identifier being inconsistent with the inherent header number of the magnetic tape, so as to trigger a read / write prohibition mechanism of the magnetic tape drive when the magnetic tape drive reads the encrypted identification string based on the target physical identifier and matches the encrypted identification string with the header number.

[0013] According to a fourth aspect of this application, a magnetic tape identifier decryption device is provided, the method comprising: a second information reading module for acquiring an encrypted identifier string on a target physical identifier of the magnetic tape; a decryption conversion module for decrypting and converting the encrypted identifier string to restore the original identifier string, wherein the decryption conversion is the inverse of the preset reversible transformation; and a second identifier replacement module for generating a compliant physical identifier for replacing the target physical identifier based on the original identifier string, wherein the original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the magnetic tape, so as to remove the read / write prohibition mechanism of the magnetic tape.

[0014] According to a fifth aspect of this application, an electronic device is provided, comprising: one or more processors; and a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the method described above.

[0015] According to a sixth aspect of this application, a computer-readable storage medium is also provided, on which a computer program or instructions are stored, wherein the computer program or instructions, when executed by a processor, implement the steps of the above-described method.

[0016] According to a seventh aspect of this application, a computer program product is also provided, including a computer program or instructions that, when executed by a processor, implement the steps of the above-described method. Attached Figure Description

[0017] The above-mentioned contents, other objects, features and advantages of this application will become clearer from the following description of embodiments with reference to the accompanying drawings, in which:

[0018] Figure 1This illustration schematically depicts an application scenario of the magnetic tape identification encryption and decryption method according to embodiments of this application;

[0019] Figure 2 A flowchart illustrating a magnetic tape identifier encryption method according to an embodiment of this application is shown schematically;

[0020] Figure 3 A flowchart illustrating a magnetic tape identifier decryption method according to an embodiment of this application is shown schematically.

[0021] Figure 4 This schematically illustrates a structural block diagram of a magnetic tape identification encryption device according to an embodiment of this application;

[0022] Figure 5 This schematic diagram illustrates a structural block diagram of a magnetic tape identifier decryption device according to an embodiment of this application;

[0023] Figure 6 A block diagram schematically illustrates an electronic device suitable for implementing a magnetic tape identification encryption method and / or a magnetic tape identification decryption method according to embodiments of this application. Detailed Implementation

[0024] The embodiments of this application will now be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of this application. In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the embodiments of this application for ease of explanation. However, it will be apparent that one or more embodiments may be implemented without these specific details. Furthermore, descriptions of well-known structures and technologies are omitted in the following description to avoid unnecessarily obscuring the concepts of this application.

[0025] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the scope of this application. The terms “comprising,” “including,” etc., as used herein indicate the presence of the stated features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

[0026] All terms used herein (including technical and scientific terms) have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein are to be interpreted in a manner consistent with the context of this specification, and not in an idealized or overly rigid way.

[0027] When using expressions such as "at least one of A, B and C", they should generally be interpreted in accordance with the meaning that is commonly understood by those skilled in the art (e.g., "a system having at least one of A, B and C" should include, but is not limited to, a system having A alone, a system having B alone, a system having C alone, a system having A and B, a system having A and C, a system having B and C, and / or a system having A, B and C, etc.).

[0028] It should be noted that the magnetic tape identification encryption method, decryption method, and device provided in this application can be used in application scenarios in the financial technology field where magnetic tape is used for data backup, and can also be used in application scenarios in any field other than the financial technology field where magnetic tape is used for data backup. The application fields of the magnetic tape identification encryption method, decryption method, and device provided in this application are not limited.

[0029] Figure 1 The illustration shows an application scenario of the magnetic tape identification encryption and decryption method according to embodiments of this application.

[0030] like Figure 1 As shown, application scenario 100 according to an embodiment of this application may include a first terminal device 101, a second terminal device 102, a network 103, and a server 104. The network 103 serves as a medium for providing a communication link between the first terminal device 101, the second terminal device 102, and the server 104. The network 103 may include various connection types, such as wired or wireless communication links or fiber optic cables.

[0031] For example, a user at the sending end can use the first terminal device 101 to encrypt the original identification string of the magnetic tape, generate an encrypted identification string, and generate a target physical identifier based on the encrypted identification string to replace the original physical identifier on the magnetic tape. After the encrypted magnetic tape is delivered to the receiving end via logistics or internal delivery channels, a user at the receiving end can use the second terminal device 102 to decrypt the encrypted identification string, restore the original identification string, and generate a compliant physical identifier to restore normal magnetic tape reading and writing. The server 104 can be used to store and distribute the cipher lookup table and / or encryption function parameters on which the encryption conversion depends, and to securely communicate with the first terminal device 101 and the second terminal device 102 via the network 103 to achieve secure key transfer.

[0032] The first terminal device 101 and the second terminal device 102 can be electronic devices such as personal computers, label printing devices, barcode scanning devices, and tape drive management terminals. Clients for the target application can be installed and run on the first terminal device 101 and the second terminal device 102. The target application can include, but is not limited to, tape management applications, data backup and recovery applications, and financial data archiving applications (only examples). Furthermore, this application embodiment does not limit the form of the target application, and it includes, but is not limited to, applications installed on the terminal devices, applets, etc., and can also be in the form of web pages.

[0033] Server 104 can be a server that provides key management and distribution services, such as a backend management server that provides key support for encryption and decryption operations performed by the sender and receiver using the first terminal device 101 and the second terminal device 102 (this is just an example). The server can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides cloud computing services.

[0034] It should be noted that the tape identification encryption and decryption methods provided in this application embodiment can generally be executed by the first terminal device 101 and / or the second terminal device 102. Accordingly, the tape identification encryption and decryption devices provided in this application embodiment can generally be disposed in the first terminal device 101 and / or the second terminal device 102.

[0035] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0036] Figure 2 A flowchart illustrating a magnetic tape identification encryption method according to an embodiment of this application is shown.

[0037] like Figure 2 As shown, the magnetic tape identification encryption method 200 according to the embodiments of this application may include steps S210 to S230.

[0038] In step S210, the original identifier string on the original physical identifier of the magnetic tape is obtained.

[0039] The original physical identifier refers to the physical label that was affixed to the side of the magnetic tape before the encryption operation. This includes the original tape label with text and the original barcode. The original tape label displays the tape number and model directly, and the original barcode encodes the same information in a machine-readable manner. The original identifier string is the identifier information composed of characters represented by the original physical identifier, such as "Test01" or "L4". This original identifier string is consistent with the inherent header number of the magnetic tape. This header number is written into the internal storage area when the tape leaves the factory or is initialized and cannot be tampered with.

[0040] In step S220, the original identifier string is encrypted to generate an encrypted identifier string.

[0041] Encryption conversion is a pre-defined reversible transformation used to convert each original character in the original identifier string into at least one corresponding ciphertext character through a specific mapping method.

[0042] The original identification string is encrypted and converted into an encrypted identification string that cannot be directly recognized or used by unauthorized parties, thus hiding the true identity information of the tape. This conversion fundamentally alters the content of the original identification string; even if unauthorized personnel see the encrypted identification string, they cannot determine the tape's true serial number or model. Furthermore, reversibility ensures that the legitimate recipient can fully restore the original identification when possessing the key.

[0043] In step S230, a target physical identifier is generated to replace the original physical identifier based on the encrypted identifier string.

[0044] The target physical identifier is a newly created physical tag based on the encrypted identifier string. It includes an encrypted tape label and an encrypted barcode. Its appearance and form are similar to the original physical identifier, but the information it carries has been replaced with the encrypted identifier string. At this time, the encrypted identifier string represented by the target physical identifier is inconsistent with the inherent header number of the tape. When the tape drive loads the tape, it automatically scans the target physical identifier, reads the encrypted identifier string, and compares it with the internally pre-written header number. When the encrypted identifier string matches the header number, the inconsistency triggers the tape drive's read / write restriction mechanism, refusing to perform any read / write operations and locking the tape.

[0045] This method deliberately creates inconsistencies between physical identifiers by generating and replacing them. It uses the tape drive's own hardware verification rules to block access to the tape. The entire process does not touch the internal backup data of the tape. Hardware-level security protection is achieved solely through the tampering of external identifiers. Only after the receiving party decrypts and restores the original identifier and regenerates a compliant physical identifier can the lock be released and normal use be restored.

[0046] The magnetic tape identification encryption method provided in this application will be described in detail below through specific embodiments.

[0047] According to S210, obtain the original identifier string on the original physical identifier of the magnetic tape.

[0048] In this embodiment, the magnetic tape is an LTO (Linear Tape-Open) type magnetic tape used in the financial industry for backing up core business data. The original physical identification, including the original tape label and original barcode, is affixed to the side of the tape. The original tape label is printed with the tape number and model number in text form, for example, the tape number is "Test01" and the tape model is "L4". The original barcode records the same information in a Code 128 encoding format for the tape drive to scan and read. An immutable header number is pre-written into the internal storage area of ​​the tape, and the content of this header number is consistent with the original identification string represented by the original physical identification. Before performing the encryption operation, the sender obtains the original identification strings "Test01" and "L4" by scanning the original barcode or manually reading the original tape label, which serve as the input for the encryption conversion.

[0049] According to S220, the original identifier string is encrypted to generate an encrypted identifier string.

[0050] In this embodiment, the encryption conversion is a reversible transformation pre-agreed upon by the sender and receiver. The following, using sub-steps S221 to S224 and taking the character "T" in the original identifier string as an example, details the specific process of the encryption conversion. It should be noted that each character in the original identifier string is encrypted one by one according to the same rules.

[0051] In step S221, the numeric codes corresponding to each original character in the original identifier string are obtained according to the preset character encoding rules.

[0052] In this embodiment, the preset character encoding rule is a password lookup table (as shown in Table 1), which defines a one-to-one mapping between 61 uppercase and lowercase English letters and numbers and numerical codes from 0 to 60. Table 1 is agreed upon in advance by the sender and receiver before the encryption operation and serves as part of the key.

[0053] Table 1

[0054]

[0055] Taking the original character "T" as an example, the sender looks up the character "T" in Table 1 and obtains its corresponding numeric code as 19. The other characters in the original identifier string (such as "e", "s", "t", "0", "1", "L", and "4") obtain their corresponding numeric codes in the same way.

[0056] In step S222, based on a preset first mapping relationship, the first encrypted character corresponding to the digital code is determined.

[0057] In this embodiment, the first mapping relationship refers to the transformation rule from the digital code to the first encrypted character. Its implementation can be a combination of various mapping transformations, and this application does not specifically limit this. For example, the digital code is first transformed into a first intermediate value through a first function, then the first intermediate value is transformed into a second intermediate value through a second function, and finally the character corresponding to the second intermediate value is found in the mapping table. Multi-level cascading increases the complexity of the transformation and improves its resistance to analysis. Another example is combining the digital code with its position number in the original identifier string as input to the transformation. For instance, when transforming the digital code corresponding to the i-th original character, a position factor i is introduced into the calculation, so that the same digital code appears in different positions, generating different first encrypted characters, enhancing the unpredictability of the ciphertext. Yet another example is combining the digital codes corresponding to multiple original characters into a numerical group, performing a comprehensive transformation on a group basis, and then extracting the first encrypted characters corresponding to each original character from the transformation result. This method breaks the independent correspondence between characters, further improving the encryption strength.

[0058] It should be noted that, regardless of the type or combination of transformations used, the first mapping relationship must meet the reversibility requirement. That is, when the receiver has the corresponding key information, it can uniquely restore the original digital code from the encryption result through the preset inverse transformation, thereby ensuring the reversibility of the entire encryption conversion process.

[0059] In step S223, based on the preset second mapping relationship, the second encrypted character corresponding to the digital code is determined.

[0060] The second mapping relationship refers to the transformation rule from the digital code to the second encrypted character. Its implementation can also be a combination of various mapping transformations, which this application does not specifically limit. The second mapping relationship is independent of the first mapping relationship; they can use the same type of transformation or different types of transformation; they can share the same parameters (such as the mapping table, radix, and encryption function) or use different parameters. For the specific implementation of the above-mentioned transformations, please refer to the relevant description in step S222, which will not be repeated here.

[0061] The second mapping relationship can be designed and configured independently of the first mapping relationship. For example, the first and second mapping relationships can use different types of function transformations, or they can use the same type of transformation but with different parameters, such as different encryption function coefficients, different bases, or different mapping tables. This independence makes the two mapping relationships independent of each other. Even if an attacker cracks one mapping relationship, they still cannot deduce the other mapping relationship, and therefore cannot restore the complete encrypted character pair, significantly improving encryption strength.

[0062] In some embodiments, the first mapping relationship and the second mapping relationship can be implemented based on the quotient and remainder of the same operation result, respectively. Wherein, S222 includes S2221~S2223, and S223 includes S2231~S2233.

[0063] In step S2221, the first encryption function is used to perform a first operation on the digital code to obtain the first operation result.

[0064] The first encryption function can be a linear function, a nonlinear function, or other reversible mathematical function; this application does not specifically limit its type. For example, the first encryption function can take the form of a linear function y1 = a1·x + b1, where x is the input numeric code, a1 and b1 are preset integer parameters, and y1 is the output first operation result. Taking the numeric code 19, parameters a1=3, and b1=20 as an example, substituting them into the function yields the first operation result: 3 × 19 + 20 = 77. The function of the first encryption function is to perform a numerical transformation on the original numeric code, breaking the direct correspondence between the numeric code and the final encrypted character, thus increasing the difficulty of reverse derivation.

[0065] In step S2222, the first base is used as the divisor to perform a division operation on the first operation result to obtain an integer quotient.

[0066] In this embodiment, the first base is a preset positive integer, and its value is related to the total number of characters contained in the first mapping table. Taking the first operation result 77 and the first base 61 as an example, a division operation is performed on the first operation result: 77 ÷ 61 = 1 (integer quotient) remainder 16. The integer quotient 1 is taken as the index value for subsequent table lookup. Through the division operation, the first operation result is mapped to a finite numerical range, which is consistent with the index range of the first mapping table, ensuring that the integer quotient can effectively correspond to a certain character in the mapping table.

[0067] In step S2223, the first character corresponding to the integer quotient is found in the first mapping table, and the first character is used as the first encryption character.

[0068] In this embodiment, the first mapping table is a preset mapping table between characters and numerical codes, which defines the correspondence between integer quotients and characters. The character set of the first mapping table can consist of displayable characters such as uppercase and lowercase English letters and numbers. Taking the integer quotient 1 as an example, the character corresponding to the code 1 (such as the character "1" in the example table) is searched in the first mapping table, and this character is determined as the first encrypted character. Thus, the complete transformation process from numerical code to the first encrypted character is completed.

[0069] In step S2231, the second encryption function is used to perform a second operation on the digital code to obtain the second operation result.

[0070] In this embodiment, the second encryption function is independent of the first encryption function and can be designed and configured separately. The type of the second encryption function can be the same as or different from the first encryption function; its parameters can be shared with the first encryption function or set independently. For example, the second encryption function can adopt the linear function form y2 = a2·x + b2, where the parameters a2 and b2 can be the same as or different from the parameters a1 and b1 of the first encryption function. The function of the second encryption function is similar to that of the first encryption function: it performs numerical transformation on the original numerical code, providing the computational basis for the subsequent generation of the second encrypted character.

[0071] In step S2232, the second base is used as the divisor to perform a division operation on the result of the second operation to obtain the remainder.

[0072] In this embodiment, the second base is also a preset positive integer, and its value is related to the total number of characters contained in the second mapping table. The second base and the first base can be the same value, or they can be set independently according to the capacity of the second mapping table. A division operation is performed with the second operation result as the dividend and the second base as the divisor. The remainder of this operation is used as the index value for subsequent table lookups. Through the division and remainder operation, the second operation result is also mapped to a finite numerical range, which is consistent with the index range of the second mapping table.

[0073] In step S2233, the second character corresponding to the remainder is found in the second mapping table, and the second character is used as the second encryption character.

[0074] In this embodiment, the second mapping table is a preset mapping table between characters and numerical codes, which defines the correspondence between remainders and characters. The second mapping table and the first mapping table can be the same mapping table or different mapping tables. The corresponding character is found in the second mapping table using the remainder, and that character is identified as the second encrypted character. This completes the entire transformation process from numerical code to the second encrypted character.

[0075] In a preferred embodiment, the first encryption function and the second encryption function are the same encryption function, the first base and the second base are the same base, and the first mapping table and the second mapping table are the same mapping table. In this case, the results of the first operation and the second operation are the same; only the quotient and remainder are used for table lookup. Taking the number code 19, the encryption function y = 3x + 20, the base 61, and the shared cipher table as an example: the operation result is 77. 77 ÷ 61 yields an integer quotient of 1 and a remainder of 16. Looking up code 1 in the first mapping table (i.e., the cipher table) yields the first encrypted character "1", and looking up code 16 in the second mapping table (i.e., the same cipher table) yields the second encrypted character "G". The ciphertext character group corresponding to this original character is "1G".

[0076] Through the above steps, the first and second encrypted characters are generated independently. The independence of the two mapping relationships significantly increases the difficulty of cracking, while the optional parameter sharing design reduces the complexity of key management, balancing security and practicality. Furthermore, all the above steps are reversible transformations; the receiver, possessing the corresponding key information, can completely restore the original digital encoding through the reverse process.

[0077] In step S224, an encrypted identifier string is generated based on the first encrypted character and the second encrypted character.

[0078] In this embodiment, the first encrypted character obtained in step S222 and the second encrypted character obtained in step S223 are concatenated sequentially according to the order of each original character in the original identifier string, to obtain the encrypted identifier string.

[0079] Each original character in the original identifier string corresponds to a ciphertext character group after encryption. This ciphertext character group consists of a first encrypted character and a second encrypted character. For example, after processing the original character "T" through steps S221 to S223, we obtain a first encrypted character (such as "1") and a second encrypted character (such as "G"). The ciphertext character group corresponding to this original character is then "1G". Following the order of the characters in the original identifier string, the ciphertext character groups corresponding to each original character are arranged sequentially and concatenated to obtain the complete encrypted identifier string. For example, the original identifier string "Test01" may be converted into an unreadable string such as "1GRt7k9mP2xAq" after encryption.

[0080] The concatenation rule in this step clearly defines the strict correspondence between the order of the ciphertext characters and the order of the original characters. Specifically, the ciphertext character group corresponding to the i-th original character is located at the (2i-1)th and 2ith character positions of the encrypted identifier string. This deterministic rule allows the receiver to accurately divide the ciphertext character groups into fixed groups (e.g., two characters per group) during decryption, thereby restoring each original character one by one, ensuring the reversibility of the encryption conversion process and the accuracy of decryption. Furthermore, the concatenation rule is simple and clear, introducing no additional obfuscation or substitution operations, reducing the computational complexity of decryption for the receiver and improving the operability of the scheme in practical applications.

[0081] According to step S230, a target physical identifier is generated to replace the original physical identifier based on the encrypted identifier string.

[0082] In financial data backup and off-site archiving scenarios, after the sender (such as a bank data center) completes the encryption conversion of the magnetic tape and generates an encrypted identifier string, it needs to carry this encrypted identifier string on the physical medium to replace the original physical identifier of the magnetic tape, thus putting the magnetic tape into an encrypted protection state. The sender creates a new tape label and barcode (the target physical identifier) ​​based on the encrypted identifier string, removes or overwrites the original tape label and barcode, and affixes the target physical identifier to the corresponding position on the side of the magnetic tape. The content displayed on the target physical identifier is the encrypted identifier string, while the pre-written header number inside the magnetic tape still uses the original identifier string, resulting in an inconsistency between the two.

[0083] After replacement, the tape can be transported from the sender to the recipient (such as an off-site disaster recovery center) via logistics or internal delivery channels. During transportation and storage, if the tape is lost, stolen, or improperly obtained by internal personnel, and an unauthorized person inserts the tape into a compatible tape drive, the tape drive will automatically scan the target physical identifier on the side of the tape according to the standard verification process, read the encrypted identifier string represented therein, and compare it with the pre-written header number inside the tape. Since the encrypted identifier string does not match the header number, the verification fails, and the tape drive triggers a hardware-level read / write prohibition mechanism, refusing to perform any read or write operations. At this time, although the tape is physically obtained, the data cannot be read, thus achieving data security protection during off-site transmission.

[0084] Once the tape arrives safely at the recipient, the legitimate recipient, holding a key (such as a password lookup table and encryption function parameters) obtained in advance through a secure channel, can decrypt and convert the encrypted identifier string on the target physical identifier to restore the original identifier string. Based on this, a compliant physical identifier matching the header number is remade to replace the target physical identifier, and the tape resumes normal read and write functionality, ready for normal backup and recovery or data usage processes.

[0085] Through the above process, the method of this application utilizes the tape drive's own verification rules to achieve hardware-level security protection for the entire link of tape transmission in different locations by simply replacing the external identifier. The entire process does not touch the internal backup data of the tape, is simple to operate, low in cost, and is suitable for the rapid and secure processing of massive amounts of existing tapes in the financial industry.

[0086] Figure 3 A flowchart illustrating a magnetic tape identifier decryption method according to an embodiment of this application is shown.

[0087] like Figure 3 As shown, the magnetic tape identifier decryption method 300 according to an embodiment of this application may include steps S310 to S330.

[0088] In step S310, the encrypted identifier string on the target physical identifier of the magnetic tape is obtained.

[0089] In this embodiment, after receiving the encrypted magnetic tape delivered by the sender (e.g., a bank's data center) via logistics or internal delivery channels, the receiving party (e.g., an off-site disaster recovery center) first needs to obtain the encrypted identifier string from the target physical identifier on the side of the tape. The target physical identifier is a physical label created by the sender during the encryption phase, carrying the encrypted identifier string, and includes a target tape label and a target barcode. The receiving party can obtain the encrypted identifier string by scanning the target barcode with a barcode scanning device or by manually reading the text content on the target tape label. This encrypted identifier string is an unreadable character sequence generated by encrypting the original identifier string during the encryption phase, such as "1GRt7k9mP2xAq". After obtaining the encrypted identifier string, the receiving party obtains the input data for the decryption operation.

[0090] In step S320, the encrypted identifier string is decrypted and converted to restore the original identifier string. The decryption and conversion is the inverse of the preset reversible transformation.

[0091] In this embodiment, the decryption conversion includes the following process: First, the receiver divides the encrypted identifier string according to the ciphertext grouping rules of the encryption stage. Since the encryption stage converts each original character into a ciphertext character group composed of the first encrypted character and the second encrypted character, during decryption, the receiver splits the encrypted identifier string into groups of two characters to obtain each ciphertext character group. Second, for each ciphertext character group, the receiver looks up the numerical codes corresponding to the first encrypted character and the second encrypted character in the ciphertext lookup table. Taking the ciphertext character group "1G" as an example, the lookup table shows that the code corresponding to the first encrypted character "1" is 1, and the code corresponding to the second encrypted character "G" is 16. Then, the receiver uses these two numerical codes to restore the calculation result of the encryption stage: Calculation result = code corresponding to the first encrypted character × base + code corresponding to the second encrypted character, i.e., 1 × 61 + 16 = 77. Next, the receiver uses the inverse function of the encryption function to deduce the original numerical code from the calculation result. The encryption function is y = 3x + 20, and its inverse function is x = (y - 20) / 3. Substituting the result 77, we get the original numeric code (77 - 20) / 3 = 19. Finally, we look up the character corresponding to the numeric code 19 in the password lookup table, which is the original character "T". The receiver performs the above decryption process on all the ciphertext characters in the encrypted identifier string one by one, and concatenates the restored original characters in order to obtain the original identifier string, such as "Test01" and "L4".

[0092] In step S330, a compliant physical identifier is generated based on the original identifier string to replace the target physical identifier. The original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the tape, so as to remove the read / write restriction mechanism on the tape.

[0093] In this embodiment, after the receiver successfully recovers the original identification string in step S320, it needs to create a compliant physical label based on it to restore the normal functionality of the magnetic tape. The compliant physical label refers to a physical tag that matches the inherent header number of the magnetic tape, including a tape label printed with the original tape number and model, and a barcode carrying the same information. The receiver uses a label printing device to print a compliant tape label containing the original identification string and a compliant barcode, in a format consistent with the original physical label. Subsequently, the receiver removes or covers the target physical label on the magnetic tape and affixes the compliant physical label to the corresponding position on the side of the magnetic tape.

[0094] After replacement, the strings represented by the physical identifiers on the tape (compliant tape label and compliant barcode) are restored to match the pre-written header number inside the tape. When the receiving party inserts the restored tape into the tape drive, the tape drive scans the compliant physical identifiers, reads the original identifier string, and compares it with the internal header number. If all three match, the verification passes, and the tape drive removes the read / write restriction mechanism, allowing normal read and write operations on the tape. At this point, the tape is restored to a normal, usable state and can be used for backup recovery, data verification, and other subsequent business processes.

[0095] Through steps S310 to S330, the legitimate recipient, possessing the key, can completely restore the original identification information of the magnetic tape and reactivate its normal functionality. The entire decryption process is simple to operate and forms a closed loop with the encryption process, jointly achieving secure protection for the entire lifecycle of the magnetic tape during remote transmission.

[0096] Based on the above-described magnetic tape identification encryption method, embodiments of this application also provide a magnetic tape identification encryption device. The following will be combined with... Figure 4 The device is described in detail.

[0097] Figure 4 A schematic block diagram of a magnetic tape identification encryption device according to an embodiment of this application is shown.

[0098] like Figure 4 As shown, the magnetic tape identification encryption device 400 in this embodiment includes a first information reading module 410, an encryption conversion module 420, and a first identification replacement module 430.

[0099] The first information reading module 410 is used to obtain the original identification string on the original physical identifier of the magnetic tape, and the original identification string is consistent with the inherent header number of the magnetic tape. In one embodiment, the first information reading module 410 can be used to perform step S210 described above, which will not be repeated here.

[0100] The encryption conversion module 420 is used to perform encryption conversion on the original identifier string to generate an encrypted identifier string. The encryption conversion is a preset reversible transformation used to convert each original character in the original identifier string into at least one corresponding ciphertext character. In one embodiment, the encryption conversion module 420 can be used to execute step S220 described above, which will not be repeated here.

[0101] The first identifier replacement module 430 is used to generate a target physical identifier to replace the original physical identifier based on the encrypted identifier string. The encrypted identifier string represented by the target physical identifier is inconsistent with the inherent header number of the magnetic tape. This is so that when the tape drive reads the encrypted identifier string based on the target physical identifier and matches the encrypted identifier string with the header number, it triggers the tape drive's read / write prohibition mechanism for the magnetic tape. In one embodiment, the first identifier replacement module 430 can be used to execute step S230 described above, which will not be repeated here.

[0102] According to an embodiment of this application, the encryption conversion module 420 includes an encoding acquisition unit, a first mapping unit, a second mapping unit, and an encryption character generation unit.

[0103] In some embodiments, the encoding acquisition unit is used to acquire the numeric encoding corresponding to each original character in the original identifier string according to a preset character encoding rule; the first mapping unit is used to determine the first encrypted character corresponding to the numeric encoding based on a preset first mapping relationship; the second mapping unit is used to determine the second encrypted character corresponding to the numeric encoding based on a preset second mapping relationship; and the encrypted character generation unit is used to generate an encrypted identifier string based on the first encrypted character and the second encrypted character.

[0104] In some embodiments, the first mapping unit includes a first encoding calculation subunit, a first encoding processing subunit, and a first mapping subunit. The first encoding calculation subunit is used to perform a first operation on the digital encoding using a first encryption function to obtain a first operation result; the first encoding processing subunit is used to perform a division operation on the first operation result with a first base as the divisor to obtain an integer quotient; the first mapping subunit is used to look up a first character corresponding to the integer quotient in a first mapping table and use the first character as a first encryption character.

[0105] In some embodiments, the second mapping unit includes: a second encoding calculation subunit, a second encoding processing subunit, and a second mapping subunit. The second encoding calculation subunit is used to perform a second operation on the digital encoding using a second encryption function to obtain a second operation result; the second encoding processing subunit is used to perform a division operation on the second operation result with a second base as the divisor to obtain a remainder; the second mapping subunit is used to look up a second character corresponding to the remainder in a second mapping table and use the second character as a second encryption character.

[0106] In some embodiments, the encrypted character generation unit concatenates the first encrypted character and the second encrypted character corresponding to each original character in the order of each original character in the original identifier string to obtain the encrypted identifier string.

[0107] According to embodiments of this application, any multiple modules of the first information reading module 410, encryption conversion module 420, and first identifier replacement module 430 can be combined into one module, or any one of these modules can be split into multiple modules. Alternatively, at least some of the functions of one or more of these modules can be combined with at least some of the functions of other modules and implemented in one module. According to embodiments of this application, at least one of the first information reading module 410, encryption conversion module 420, and first identifier replacement module 430 can be at least partially implemented as a hardware circuit, such as a field-programmable gate array, a programmable logic array, a system-on-a-chip, a system-on-a-substrate, a system-on-package, an application-specific integrated circuit, or any other reasonable means of integrating or packaging the circuit, or implemented in software, hardware, or firmware, or in any appropriate combination of any of these three implementation methods. Alternatively, at least one of the first information reading module 410, encryption conversion module 420, and first identifier replacement module 430 can be at least partially implemented as a computer program module, which can perform corresponding functions when the computer program module is run.

[0108] Based on the above-described magnetic tape identification encryption method, embodiments of this application also provide a magnetic tape identification decryption device. The following will be combined with... Figure 5 The device is described in detail.

[0109] Figure 5 A schematic block diagram of a magnetic tape identifier decryption device according to an embodiment of this application is shown.

[0110] like Figure 5 As shown, the magnetic tape identification decryption device 500 of this embodiment includes a second information reading module 510, a decryption conversion module 520, and a second identification replacement module 530.

[0111] The second information reading module 510 is used to obtain the encrypted identifier string on the target physical identifier of the magnetic tape. In one embodiment, the second information reading module 510 can be used to perform step S310 described above, which will not be repeated here.

[0112] The decryption conversion module 520 is used to decrypt and convert the encrypted identifier string to restore the original identifier string. The decryption conversion is the inverse transformation of a preset reversible transformation. In one embodiment, the decryption conversion module 520 can be used to execute step S320 described above, which will not be repeated here.

[0113] The second identifier replacement module 530 is used to generate a compliant physical identifier to replace the target physical identifier based on the original identifier string. The original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the magnetic tape, so as to remove the read / write restriction mechanism on the magnetic tape. In one embodiment, the second identifier replacement module 530 can be used to perform step S330 described above, which will not be repeated here.

[0114] Figure 6 A block diagram schematically illustrates an electronic device suitable for implementing a magnetic tape identifier decryption method and / or a magnetic tape identifier encryption method according to embodiments of this application.

[0115] like Figure 6 As shown, an electronic device 600 according to an embodiment of this application includes a processor 601, which can perform various appropriate actions and processes according to a program stored in a read-only memory 602 or a program loaded from a storage portion 608 into a random access memory 603. The processor 601 may include, for example, a general-purpose microprocessor, an instruction set processor and / or an associated chipset and / or a dedicated microprocessor. The processor 601 may also include onboard memory for caching purposes. The processor 601 may include a single processing unit or multiple processing units for executing different steps of the method flow according to an embodiment of this application.

[0116] Random access memory 603 stores various programs and data required for the operation of electronic device 600. Processor 601, read-only memory 602, and random access memory 603 are interconnected via bus 604. Processor 601 executes various steps of the method flow according to embodiments of this application by executing programs in read-only memory 602 and / or random access memory 603. It should be noted that the programs may also be stored in one or more memories other than read-only memory 602 and random access memory 603. Processor 601 may also execute various steps of the method flow according to embodiments of this application by executing programs stored in said one or more memories.

[0117] According to embodiments of this application, the electronic device 600 may further include an input / output interface 605, which is also connected to a bus 604. The electronic device 600 may also include one or more of the following components connected to the input / output interface 605: an input section 606 including a keyboard, mouse, etc.; an output section 607 including a cathode ray tube, liquid crystal display, etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card, such as a local area network card, modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the input / output interface 605 as needed. A removable medium 611, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 610 as needed so that computer programs read from it can be installed into the storage section 608 as needed.

[0118] Embodiments of this application also provide a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs, which, when executed, implement the method according to the embodiments of this application.

[0119] According to embodiments of this application, the computer-readable storage medium can be a non-volatile computer-readable storage medium, such as including but not limited to: portable computer disks, hard disks, random access memory, read-only memory, erasable programmable read-only memory, portable compact disk read-only memory, optical storage devices, magnetic storage devices, or any suitable combination thereof. In embodiments of this application, the computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of this application, the computer-readable storage medium may include the read-only memory 602 described above, and / or random access memory 603, and / or one or more memories other than read-only memory 602 and random access memory 603.

[0120] Embodiments of this application also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowchart. When the computer program product is run on a computer system, the program code is used to cause the computer system to implement the methods provided in the embodiments of this application.

[0121] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and downloaded and installed via the communication section 609, and / or installed from the removable medium 611. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.

[0122] In embodiments of this application, the computer program can be downloaded and installed from a network via communication section 609, and / or installed from removable medium 611. When the computer program is executed by processor 601, it performs the functions defined in the system of embodiments of this application. According to embodiments of this application, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0123] According to embodiments of this application, program code for executing the computer programs provided in the embodiments of this application can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. The program code can be executed entirely on the user's computing device, partially on the user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0124] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0125] Those skilled in the art will understand that the features described in the various embodiments of this application can be combined and / or combined in various ways, even if such combinations or combinations are not explicitly described in this application. In particular, the features described in the various embodiments of this application can be combined and / or combined in various ways without departing from the spirit and teachings of this application. All such combinations and / or combinations fall within the scope of this application.

Claims

1. A magnetic tape identification encryption method, characterized in that, The method includes: Obtain the original identifier string from the original physical identifier of the magnetic tape, wherein the original identifier string is consistent with the inherent header number of the magnetic tape; The original identifier string is encrypted to generate an encrypted identifier string. The encryption conversion is a preset reversible transformation used to convert each original character in the original identifier string into at least one corresponding ciphertext character. Based on the encrypted identifier string, a target physical identifier is generated to replace the original physical identifier. The encrypted identifier string represented by the target physical identifier is inconsistent with the inherent header number of the tape. When the tape drive reads the encrypted identifier string based on the target physical identifier and matches the encrypted identifier string with the header number, the tape drive's read / write prohibition mechanism for the tape is triggered.

2. The method according to claim 1, characterized in that, The step of encrypting the original identifier string to generate an encrypted identifier string includes: According to the preset character encoding rules, obtain the numeric code corresponding to each original character in the original identifier string; Based on a preset first mapping relationship, determine the first encrypted character corresponding to the digital code; Based on a preset second mapping relationship, a second encrypted character corresponding to the digital code is determined; The encrypted identifier string is generated based on the first encrypted character and the second encrypted character.

3. The method according to claim 2, characterized in that, The determination of the first encrypted character corresponding to the digital code based on the preset first mapping relationship includes: The first encryption function is used to perform a first operation on the digital code to obtain a first operation result; Using the first base as the divisor, perform a division operation on the result of the first operation to obtain an integer quotient; The first character corresponding to the integer quotient is found in the first mapping table, and the first character is used as the first encrypted character.

4. The method according to claim 2, characterized in that, The determination of the second encrypted character corresponding to the digital code based on the preset second mapping relationship includes: The digital code is subjected to a second operation using a second encryption function to obtain the second operation result; Using the second base as the divisor, perform a division operation on the result of the second operation to obtain the remainder; The second character corresponding to the remainder is found in the second mapping table, and the second character is used as the second encryption character.

5. The method according to claim 2, characterized in that, The step of generating the encrypted identifier string based on the first encrypted character and the second encrypted character includes: According to the order of each original character in the original identifier string, the first encrypted character and the second encrypted character corresponding to each original character are concatenated in sequence to obtain the encrypted identifier string.

6. A method for decrypting magnetic tape identifiers, characterized in that, The method includes: Retrieve the encrypted identifier string from the target physical identifier of the magnetic tape; The encrypted identifier string is decrypted and converted to restore the original identifier string. The decryption and conversion is the inverse transformation of a preset reversible transformation. Based on the original identifier string, a compliant physical identifier is generated to replace the target physical identifier. The original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the tape, so as to remove the read / write restriction mechanism of the tape.

7. A magnetic tape identification encryption device, characterized in that, The device includes: The first information reading module is used to obtain the original identification string on the original physical identifier of the magnetic tape, wherein the original identification string is consistent with the inherent header number of the magnetic tape; The encryption conversion module is used to perform encryption conversion on the original identifier string to generate an encrypted identifier string. The encryption conversion is a preset reversible transformation, which is used to convert each original character in the original identifier string into at least one corresponding ciphertext character. The first identifier replacement module is used to generate a target physical identifier to replace the original physical identifier based on the encrypted identifier string. The encrypted identifier string represented by the target physical identifier is inconsistent with the inherent header number of the magnetic tape. When the tape drive reads the encrypted identifier string based on the target physical identifier and matches the encrypted identifier string with the header number, the tape drive's read / write prohibition mechanism for the magnetic tape is triggered.

8. A magnetic tape identification and decryption device, characterized in that, The device includes: The second information reading module is used to obtain the encrypted identifier string on the target physical identifier of the magnetic tape; The decryption and conversion module is used to decrypt and convert the encrypted identifier string to restore the original identifier string. The decryption and conversion is the inverse transformation of a preset reversible transformation. The second identifier replacement module is used to generate a compliant physical identifier to replace the target physical identifier based on the original identifier string. The original identifier string represented by the compliant physical identifier is consistent with the inherent header number of the magnetic tape, so as to remove the read / write prohibition mechanism of the magnetic tape.

9. An electronic device, comprising: One or more processors; Memory, used to store one or more computer programs. The characteristic feature is that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 5 and / or 6.

10. A computer-readable storage medium having a computer program or instructions stored thereon, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 5 and / or 6.

11. A computer program product, comprising a computer program or instructions, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 5 and / or 6.

Images