Text encryption calculation method supporting ciphertext search

Abstract

The invention relates to the technical field of text retrieval, in particular to a text encryption calculation method supporting ciphertext search. According to the technical scheme, the text encryption calculation method supporting ciphertext search comprises a text encryption method; compared with traditional text encryption calculation methods which are mostly optimized for queries of specific types, support for full-text search is relatively limited, the problem of low retrieval efficiency often exists, and complex protocols and high communication overhead are needed. Although a searchable encryption technology provides a search capability for encrypted data, the security and the search efficiency often need to be balanced, the text encryption calculation method achieves the goals of protecting data privacy and keeping efficient retrieval performance by optimizing an encryption algorithm and a search strategy, and the search efficiency is improved by an improved shift encryption technology. The confidentiality of the data can be protected even in the full-text retrieval process, and unauthorized access and data leakage are prevented.

Description

Technical Field

[0001] The present invention relates to the technical field of text retrieval, and in particular to a text encryption calculation method supporting ciphertext search. Background Art

[0002] With the rapid development of information technology and the explosive growth of data volume, how to efficiently and securely retrieve specific information from massive text data has become an urgent problem to be solved.

[0003] Most existing text encryption calculation methods are optimized for specific types of queries, have relatively limited support for full-text search, often have low retrieval efficiency, and require complex protocols and high communication overhead. Although searchable encryption technology provides the ability to search encrypted data, it often requires a trade-off between security and search efficiency.

[0004] In view of the fact that existing text encryption calculation methods have relatively limited support for full-text search, often have problems with low retrieval efficiency, and require complex protocols and high communication overhead, this text encryption calculation method achieves the goal of protecting data privacy while maintaining efficient retrieval performance by optimizing encryption algorithms and search strategies. Through improved shift encryption technology, it ensures that the confidentiality of data can be protected even during full-text retrieval to prevent unauthorized access and data leakage. Summary of the invention

[0005] In order to overcome the problems that most existing text encryption calculation methods are optimized for specific types of queries, have relatively limited support for full-text search, often have low retrieval efficiency, and require complex protocols and high communication overhead, searchable encryption technology provides the ability to search encrypted data, but often requires a trade-off between security and search efficiency.

[0006] The technical solution of the present invention is: a text encryption calculation method supporting ciphertext search, comprising the following steps:

[0007] S11: Process the text data to be encrypted and divide the separated data into pages;

[0008] S12: Generate a JUMP value according to the conversion model;

[0009] S13: Generate a key sequence of required length using the JUMP value;

[0010] S14: Perform displacement encryption on each data bit in each page according to the corresponding displacement value in the key;

[0011] S15: Storing the encrypted ciphertext data by page;

[0012] S16: The system receives the search content submitted by the user, processes it, and prepares for subsequent search operations;

[0013] S17: Generate an initial trapdoor and use the first key segment in the key to encrypt the search content;

[0014] S18: Repeat the search process until all possible key alignments have been tried;

[0015] S19: When the number of remaining digits in the key sequence is less than the length of the search content, a cross-page search process is performed.

[0016] Preferably, when performing a text encryption algorithm for ciphertext search, the following steps are included:

[0017] S21: Divide the text into pages, and perform corresponding shift encryption on each page of data using the key;

[0018] S22: The n-bit key key is obtained by jumping the position in the irrational number sequence according to the value of each JUMP position as the position jump number;

[0019] S23: The JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the sum of the matrix columns.

[0020] Preferably, the extending according to S21 further comprises the following steps:

[0021] S31: The key key performs corresponding shift encryption on each page of data, including paging the data, with n bits per page, and a total of p pages;

[0022] S32: Use the key key to perform corresponding shift encryption on the n data bits of each page. The shift operation uses Unicode encoding to generate encrypted data.

[0023] Preferably, the extension is performed according to S21. The following steps are also included:

[0024] S41: The n-bit key key is jumped according to the value of each JUMP bit as the position;

[0025] S42: Performing jump value selection in the irrational number sequence, including randomly selecting a position in the irrational number sequence as the starting point of P0 value selection, using each position of the JUMP value as the jump number, skipping corresponding positions in sequence from P0 and extracting numbers to form an n-bit key.

[0026] Preferably, the extending according to S21 further comprises the following steps:

[0027] S51: JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the matrix column sum;

[0028] S52: convert the m integers into n-bit binary form, and use the m n-bit numbers as rows to form an m×n matrix;

[0029] S53: Sum each column of the matrix to obtain a digital string JUMP with a length of n bits.

[0030] Preferably, when matching the encrypted data in the ciphertext storage, the following steps are included:

[0031] S61: receiving the search content F submitted by the user, continuously sliding the key sequence key to align with the search content F, generating multiple trapdoors T, matching them with the encrypted data in the ciphertext storage, and adding the successfully matched ones to the result list;

[0032] S62: For searching the content across pages, the content is divided into two parts, the first half is encrypted with the remaining key sequence after sliding, and the second half is filled in with corresponding encryption starting from the first key k1.

[0033] Preferably, the extending according to S61 further includes the following steps:

[0034] S71: The user inputs the search content F, the length of which is q;

[0035] S72: Use the first q bits of the key Key to encrypt F to generate a trapdoor T1, and use T1 to match the ciphertext on bits 1 to q of each page at the same time, and record the successful position;

[0036] S73: Repeat process (2) (n+1)-q times, each time sliding the key forward to align with the search content to generate a new trapdoor, perform a match, and record the successful position.

[0037] Preferably, the extending according to S62 further includes the following steps:

[0038] S81: When the number of remaining bits in the key sequence is less than q, the search content F cannot be completely encrypted, and the search content F is divided into two parts. The first part is encrypted using the remaining part of the key sequence, and the second part is encrypted starting from k1. The combination of the two parts constitutes a trapdoor;

[0039] S82: After the front part is encrypted, it is matched with the corresponding position of each page, and the back part is also matched with the first few bits of each page. The first position is recorded only when both parts are matched successfully.

[0040] Preferably, when performing the repeated search process, the following steps are included:

[0041] S91: slide the sequence in the key forward by one position;

[0042] S92: Encrypt the unchanged search content using the new alignment key sequence to generate a new trapdoor;

[0043] S93: Use the newly generated trapdoor to perform a matching operation with the ciphertext on each page of the ciphertext storage;

[0044] S94: Repeat the above process until all possible key alignments have been tried.

[0045] Preferably, when performing cross-page search processing, the following steps are included:

[0046] S1001: When the number of remaining digits in the key sequence is less than the length of the search content, the search content will span multiple pages;

[0047] S1002: Divide the search content into two sections: the first section is encrypted using the remaining part of the key sequence, and the second section is encrypted sequentially from the beginning;

[0048] S1003: The two encrypted contents are combined into a trapdoor and matched in the ciphertext storage;

[0049] S1004: Only when both the current segment and the subsequent segment are matched successfully, the matching position is recorded in the successful search list.

[0050] Preferably, by increasing the complexity of key generation and using the key to perform improved shift encryption processing on the search content, the security and privacy of data during encrypted storage and search can be ensured, unauthorized access and data leakage can be prevented, and the encryption and search process can be simplified, making implementation and maintenance easier, reducing the complexity and cost of technical implementation, and being compatible with existing encryption systems and data storage solutions, making it easy to integrate and deploy.

[0051] Beneficial effects of the present invention:

[0052] 1. Compared with traditional text encryption calculation methods, most of them are optimized for specific types of queries, and the support for full-text search is relatively limited. There are often problems with low retrieval efficiency, and complex protocols and high communication overhead are required. Although searchable encryption technology provides the ability to search encrypted data, it often requires a trade-off between security and search efficiency. This text encryption calculation method achieves the goal of protecting data privacy while maintaining efficient retrieval performance by optimizing encryption algorithms and search strategies. Through improved shift encryption technology, it ensures that even during full-text retrieval, the confidentiality of data can be protected to prevent unauthorized access and data leakage;

[0053] 2. By increasing the complexity of key generation and using keys to perform improved shift encryption processing on search content, the security and privacy of data during encrypted storage and search can be ensured, preventing unauthorized access and data leakage. At the same time, the encryption and search process is simplified, making implementation and maintenance easier, reducing the complexity and cost of technical implementation, and being compatible with existing encryption systems and data storage solutions, making it easy to integrate and deploy. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 What is shown is a flowchart of a text encryption calculation method supporting ciphertext search of the present invention;

[0055] Figure 2 What is shown is a flowchart of the text encryption algorithm of the present invention;

[0056] Figure 3 What is shown is a schematic diagram of key generation of the present invention;

[0057] Figure 4 What is shown is a schematic diagram of the encryption process of the present invention;

[0058] Figure 5 What is shown is a search and matching schematic diagram of the present invention. DETAILED DESCRIPTION

[0059] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0060] See also Figure 1-4 The present invention provides an embodiment: a text encryption calculation method supporting ciphertext search, comprising the following steps:

[0061] S11: Process the text data to be encrypted and divide the separated data into pages;

[0062] S12: Generate a JUMP value according to the conversion model;

[0063] S13: Generate a key sequence of required length using the JUMP value;

[0064] S14: Perform displacement encryption on each data bit in each page according to the corresponding displacement value in the key;

[0065] S15: Storing the encrypted ciphertext data by page;

[0066] S16: The system receives the search content submitted by the user, processes it, and prepares for subsequent search operations;

[0067] S17: Generate an initial trapdoor and use the first key segment in the key to encrypt the search content;

[0068] S18: Repeat the search process until all possible key alignments have been tried;

[0069] S19: When the number of remaining digits in the key sequence is less than the length of the search content, a cross-page search process is performed.

[0070] Preferably, when performing a text encryption algorithm for ciphertext search, the following steps are included:

[0071] S21: Divide the text into pages, and perform corresponding shift encryption on each page of data using the key;

[0072] S22: The n-bit key key is obtained by jumping the position in the irrational number sequence according to the value of each JUMP position as the position jump number;

[0073] S23: The JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the sum of the matrix columns.

[0074] Preferably, the extending according to S21 further comprises the following steps:

[0075] S31: The key key performs corresponding shift encryption on each page of data, including paging the data, with n bits per page, and a total of p pages;

[0076] S32: Use the key key to perform corresponding shift encryption on the n data bits of each page. The shift operation uses Unicode encoding to generate encrypted data.

[0077] Preferably, the extension is performed according to S21. The following steps are also included:

[0078] S41: The n-bit key key is jumped according to the value of each JUMP bit as the position;

[0079] S42: Performing jump value selection in the irrational number sequence, including randomly selecting a position in the irrational number sequence as the starting point of P0 value selection, using each position of the JUMP value as the jump number, skipping corresponding positions in sequence from P0 and extracting numbers to form an n-bit key.

[0080] Preferably, the extending according to S21 further comprises the following steps:

[0081] S51: JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the matrix column sum;

[0082] S52: convert the m integers into n-bit binary form, and use the m n-bit numbers as rows to form an m×n matrix;

[0083] S53: Sum each column of the matrix to obtain a digital string JUMP with a length of n bits.

[0084] Preferably, when matching the encrypted data in the ciphertext storage, the following steps are included:

[0085] S61: receiving the search content F submitted by the user, continuously sliding the key sequence key to align with the search content F, generating multiple trapdoors T, matching them with the encrypted data in the ciphertext storage, and adding the successfully matched ones to the result list;

[0086] S62: For searching the content across pages, the content is divided into two parts, the first half is encrypted with the remaining key sequence after sliding, and the second half is filled in with corresponding encryption starting from the first key k1.

[0087] Preferably, the extending according to S61 further includes the following steps:

[0088] S71: The user inputs the search content F, the length of which is q;

[0089] S72: Use the first q bits of the key Key to encrypt F to generate a trapdoor T1, and use T1 to match the ciphertext on bits 1 to q of each page at the same time, and record the successful position;

[0090] S73: Repeat process (2) (n+1)-q times, each time sliding the key forward to align with the search content to generate a new trapdoor, perform a match, and record the successful position.

[0091] Preferably, the extending according to S62 further includes the following steps:

[0092] S81: When the number of remaining bits in the key sequence is less than q, the search content F cannot be completely encrypted, and the search content F is divided into two parts. The first part is encrypted using the remaining part of the key sequence, and the second part is encrypted starting from k1. The combination of the two parts constitutes a trapdoor;

[0093] S82: After the front part is encrypted, it is matched with the corresponding position of each page, and the back part is also matched with the first few bits of each page. The first position is recorded only when both parts are matched successfully.

[0094] Preferably, when performing the repeated search process, the following steps are included:

[0095] S91: slide the sequence in the key forward by one position;

[0096] S92: Encrypt the unchanged search content using the new alignment key sequence to generate a new trapdoor;

[0097] S93: Use the newly generated trapdoor to perform a matching operation with the ciphertext on each page of the ciphertext storage;

[0098] S94: Repeat the above process until all possible key alignments have been tried.

[0099] Preferably, when performing cross-page search processing, the following steps are included:

[0100] S1001: When the number of remaining digits in the key sequence is less than the length of the search content, the search content will span multiple pages;

[0101] S1002: Divide the search content into two sections: the first section is encrypted using the remaining part of the key sequence, and the second section is encrypted sequentially from the beginning;

[0102] S1003: The two encrypted contents are combined into a trapdoor and matched in the ciphertext storage;

[0103] S1004: Only when both the current segment and the subsequent segment are matched successfully, the matching position is recorded in the successful search list.

[0104] Encryption part: When the key is generated, the JUMP value required for key generation is generated: m integers are randomly generated, and the generated integer type is specified to be an unsigned n-bit integer. The generated integers will be between 0 and 2 n -1, convert the generated m n-bit random integers into a matrix in n-bit binary form: each integer is converted into an n-bit binary string as a row to form an mxn matrix, and then the matrix columns are summed. The obtained n-bit number is the JUMP value to be used for the key value later, including the following steps:

[0105] S1101: randomly generate m integers, denoted as I1, I2, I3, ..., I m ;

[0106] S1102: Each integer I i (where i ranges from 1 to m) is converted to an n-bit binary form, denoted by B i ;

[0107] S1103: B1…B m Arrange them in order of rows to form a matrix with m rows and n columns, denoted as M, where M r,c Represents the element in the rth row and cth column, where r and c range from 1 to m and 1 to n respectively;

[0108] S1104: Sum each column of the matrix M, that is, calculate Where c ranges from 1 to n;

[0109] S1105: The obtained n summation results S1, S2, S3, ..., S n An n-bit string will be constructed and defined as the "JUMP" value.

[0110] After randomly selecting a digit from the irrational number sequence as the starting digit, we use the JUMP values ​​generated in the previous step, i.e. S1, S2, S3, ..., S in step (1) n , as the basis for jumping in the irrational number sequence. Specifically, according to each bit in the JUMP value, the corresponding number of bits in the irrational number sequence is jumped in turn, and a number is taken from the current position. This process is repeated n times, and each time the number skipped and taken out is based on the corresponding bit in the JUMP value, including the following steps:

[0111] S1201: Select any digit in the irrational number sequence as the starting digit, denoted as P0;

[0112] S1202: Starting from the first bit S1 of the JUMP value, according to the value of S1, skip S1 numbers starting from P0 in the irrational number sequence to reach the new position P1, and take the number at this position as the first number k1 of the key;

[0113] S1203: Repeat the above process, use the next bit S2 in the JUMP value, jump S2 numbers starting from P1, arrive at the new position P2, and take out the number k2 at this position;

[0114] S1204: Continue this process until all n bits in the JUMP value are used up, each time skipping the corresponding bit according to the bit in the JUMP value, and taking out the number until n numbers k1, k2…k are obtained. n ;

[0115] S1205: Finally, we get n numbers k1, k2…k n The key Key.

[0116] Encrypted data part: To encrypt the data, first paging the data. The specific steps include:

[0117] S1301: Divide the total amount of data into p pages according to n bits per page, where The page numbers are Y1, Y2, ...Y p , each page Y i Contains n data bits, denoted as D1, D2, ... D n (This refers to the current page Y i data);

[0118] S1302: Perform a shift encryption operation based on the key Key obtained in the previous step: for each page Y i Each data bit D j (where j ranges from 1 to n), according to the displacement value k in the key j, perform corresponding shift encryption, such as data bit D1 will be shifted according to the value of k1, data bit D2 will be shifted according to the value of k2, and so on. i In the above method, all n data bits will be uniformly encrypted.

[0119] S1303: During the shift encryption process, the data bits are processed according to the Unicode encoding to ensure that each data bit maintains the validity and correctness of its encoding when shifting.

[0120] When storing encrypted data, the encrypted ciphertext data is ultimately stored by page to facilitate subsequent search and decryption.

[0121] Search part: User query reception: The user submits the search content F, which is q characters long and is represented by F1,…F q .

[0122] When generating the initial trapdoor, the following steps are included:

[0123] S1401: The key Key is a sequence of length 32 generated in the key generation step 2 in the encryption part, Key = k1, k2...k n ;

[0124] S1402: Use the first m key segments k1 to k in the key Key m Encrypt the entire search content F. The encryption operation is the same as the previous ciphertext generation method to generate the initial trapdoor T1.

[0125] S1403: Perform a matching operation on each page in the ciphertext storage at the same time. Use trapdoor T1 to match the corresponding 1 to q bits of each page. If the match is successful, record the position in the successful search list.

[0126] When repeating the above search process, the following steps are included:

[0127] S1501: The search content F remains unchanged. The sequence in the key Key is slid forward one position, and the aligned key segment now becomes k2 to k q+1 (If q+1 exceeds n, the part exceeding n will be automatically filled starting from k1);

[0128] S1502: Use the new alignment key sequence to encrypt the unchanged search content F to generate a new trapdoor T2;

[0129] S1503: Use the newly generated trapdoor T2 to perform a matching operation with the ciphertext 2 to m=q+1 bits on each page of the ciphertext storage.

[0130] When continuing to repeat the search process, the following steps are included:

[0131] S1601: Continue the above process, slide the key sequence forward one position each time, and use the new alignment key sequence to encrypt the search content F to generate a new trapdoor T i (the value of i ranges from 1 to n);

[0132] S1602: Whenever a new trapdoor is generated, a matching operation is immediately performed on the corresponding position on all ciphertext pages to find possible matching items, until n trapdoors are generated and the search is completed.

[0133] When recording and returning results: All ciphertext locations that have successfully matched will be recorded and saved in the successful search list.

[0134] Cross-page search: When the remaining number of digits in the key sequence is less than q, the search content will span multiple pages. At this time, the search content is divided into two sections. The first section is encrypted using the remaining part of the key sequence, and the second section is encrypted starting from k1 to generate a trapdoor and matched in the ciphertext storage. For example, when the key sequence slides for the nth time, the user's search content F (length q, respectively F1,...F q ) According to the key segment k in the key Key n ,k1,…k q-1 , the corresponding value is shifted and encrypted to generate the corresponding trapdoor.

[0135] The embodiments of the present invention are described in detail above with reference to the accompanying drawings, but the present invention is not limited to the above embodiments, and various changes can be made within the knowledge scope of those skilled in the art without departing from the spirit of the present invention.

Claims

1. A text encryption calculation method supporting ciphertext search; characterized in that: The following steps are included: S11: Process the text data to be encrypted and divide the separated data into pages; S12: Generate a JUMP value according to the conversion model; S13: Generate a key sequence of required length using the JUMP value; S14: Perform displacement encryption on each data bit in each page according to the corresponding displacement value in the key; S15: Storing the encrypted ciphertext data by page; S16: The system receives the search content submitted by the user, processes it, and prepares for subsequent search operations; S17: Generate an initial trapdoor and use the first key segment in the key to encrypt the search content; S18: Repeat the search process until all possible key alignments have been tried; S19: When the number of remaining digits in the key sequence is less than the length of the search content, a cross-page search process is performed.

2. The text encryption calculation method supporting ciphertext search according to claim 1, characterized in that: When performing a text encryption algorithm for ciphertext search, the following steps are included: S21: Divide the text into pages, and perform corresponding shift encryption on each page of data using the key; S22: The n-bit key key is obtained by jumping the position in the irrational number sequence according to the value of each JUMP position as the position jump number; S23: The JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the sum of the matrix columns.

3. The text encryption calculation method supporting ciphertext search according to claim 2, characterized in that: The extension according to S21 further comprises the following steps: S31: The key key performs corresponding shift encryption on each page of data, including paging the data, with n bits per page, and a total of p pages; S32: Use the key key to perform corresponding shift encryption on the n data bits of each page. The shift operation uses Unicode encoding to generate encrypted data.

4. The text encryption calculation method supporting ciphertext search according to claim 3 is characterized in that: Extend according to S21. Also includes the following steps: S41: The n-bit key key is jumped according to the value of each JUMP bit as the position; S42: Performing jump value selection in the irrational number sequence, including randomly selecting a position in the irrational number sequence as the starting point of P0 value selection, using each position of the JUMP value as the jump number, skipping corresponding positions in sequence from P0 and extracting numbers to form an n-bit key.

5. The text encryption calculation method supporting ciphertext search according to claim 4, characterized in that: The extension according to S21 further comprises the following steps: S51: JUMP value is obtained by randomly generating m integers to form a matrix M and calculating the matrix column sum; S52: convert the m integers into n-bit binary form, and use the m n-bit numbers as rows to form an m×n matrix; S53: Sum each column of the matrix to obtain a digital string JUMP with a length of n bits.

6. The text encryption calculation method supporting ciphertext search according to claim 5, characterized in that: When matching the encrypted data in the ciphertext storage, the following steps are included: S61: receiving the search content F submitted by the user, continuously sliding the key sequence key to align with the search content F, generating multiple trapdoors T, matching them with the encrypted data in the ciphertext storage, and adding the successfully matched ones to the result list; S62: For searching cross-page content, the content is divided into two parts. The first half is encrypted with the remaining key sequence after sliding, and the second half is filled in with corresponding encryption starting from the first key k1.

7. The text encryption calculation method supporting ciphertext search according to claim 6, characterized in that: The extension according to S61 also includes the following steps: S71: The user inputs the search content F, the length of which is q; S72: Use the first q bits of the key Key to encrypt F to generate a trapdoor T1, and use T1 to match the ciphertext on bits 1 to q of each page at the same time, and record the successful position; S73: Repeat process (2) (n+1)-q times, each time sliding the key forward to align with the search content to generate a new trapdoor, perform a match, and record the successful position.

8. The text encryption calculation method supporting ciphertext search according to claim 7, characterized in that: The extension according to S62 also includes the following steps: S81: When the number of remaining bits in the key sequence is less than q, the search content F cannot be completely encrypted, and the search content F is divided into two parts. The first part is encrypted using the remaining part of the key sequence, and the second part is encrypted starting from k1. The combination of the two parts constitutes a trapdoor; S82: After the front part is encrypted, it is matched with the corresponding position of each page, and the back part is also matched with the first few bits of each page. The first position is recorded only when both parts are matched successfully.

9. A text encryption calculation method supporting ciphertext search according to claim 8, characterized in that: When conducting a repeat search process, the following steps are included: S91: slide the sequence in the key forward by one position; S92: Encrypt the unchanged search content using the new alignment key sequence to generate a new trapdoor; S93: Use the newly generated trapdoor to perform a matching operation with the ciphertext on each page of the ciphertext storage; S94: Repeat the above process until all possible key alignments have been tried.

10. The text encryption calculation method supporting ciphertext search according to claim 9, characterized in that: When performing cross-page search processing, the following steps are included: S1001: When the number of remaining digits in the key sequence is less than the length of the search content, the search content will span multiple pages; S1002: Divide the search content into two sections: the first section is encrypted using the remaining part of the key sequence, and the second section is encrypted sequentially from the beginning; S1003: The two encrypted contents are combined into a trapdoor and matched in the ciphertext storage; S1004: Only when both the current segment and the subsequent segment are matched successfully, the matching position is recorded in the successful search list.

Images