CN116170557B - Data processing method for realizing synchronous display of multiple terminals on same screen - Google Patents
Data processing method for realizing synchronous display of multiple terminals on same screen Download PDFInfo
- Publication number
- CN116170557B CN116170557B CN202310430176.XA CN202310430176A CN116170557B CN 116170557 B CN116170557 B CN 116170557B CN 202310430176 A CN202310430176 A CN 202310430176A CN 116170557 B CN116170557 B CN 116170557B
- Authority
- CN
- China
- Prior art keywords
- layers
- space
- binary data
- interval
- layer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/14—Systems for two-way working
- H04N7/15—Conference systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0625—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation with splitting of the data block into left and right halves, e.g. Feistel based algorithms, DES, FEAL, IDEA or KASUMI
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
- H04L9/0631—Substitution permutation network [SPN], i.e. cipher composed of a number of stages or rounds each involving linear and nonlinear transformations, e.g. AES algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/321—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving a third party or a trusted authority
- H04L9/3213—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving a third party or a trusted authority using tickets or tokens, e.g. Kerberos
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/34—Encoding or coding, e.g. Huffman coding or error correction
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Multimedia (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention relates to the technical field of data encryption transmission, and provides a data processing method for realizing synchronous display of multiple terminals on the same screen, which comprises the following steps: the data server generates a secret key and distributes the secret key to the operation terminal and the display terminal, the operation terminal acquires a conference token from the data server, converts the conference token into binary data and performs initial replacement to obtain an initial code; constructing a 12-layer circular encryption space, dividing the space into 8 sections, sequentially filling initial codes into 8 layers in the circular encryption space, and randomly filling the outer 4 layers; performing layer-by-layer rotary encryption on 1-8 layers, performing repeated rotary scrambling on 9-11 layers according to keys, and combining initial replacement to obtain a final encryption space; and outputting binary data of the final encryption space in sequence to obtain a final code, and transmitting the final code of each section of conference code to the display terminal to finish verification of the conference token. The invention aims to ensure confidentiality and reliability of synchronous display of multiple terminals on the same screen through conference tokens and encryption verification.
Description
Technical Field
The invention relates to the technical field of data encryption transmission, in particular to a data processing method for realizing synchronous display of multiple terminals on the same screen.
Background
With the development of the times, forms such as online office work, online teaching and the like are developed all over the country, various video conference APP are widely applied to the Internet, and various conferences, business communication and teaching are started to be carried out by using the video conference form; the traditional teleconference tool realizes the effect of one person speaking and watching by multiple persons through video sharing, namely the effect of simultaneous explanation and display of multiple terminals cannot be achieved; meanwhile, the existing teleconference tool is based on screen sharing, and cannot perform various operations in the display tool, so that a method capable of realizing multi-terminal on-screen display and simultaneously receiving multi-terminal synchronous operation is needed.
Video conferences generally have certain confidentiality, and meanwhile, the synchronous operation of multiple terminals on the screen also requires a video conference tool to verify the terminals, so that a conference token is required, and the multiple terminals are permitted to display and operate through the conference token; in order to avoid leakage of the conference token, namely, the confidentiality is further improved on the basis of the conference token, the conference token needs to be encrypted, so that the confidentiality and the reliability of synchronous display of multiple terminals on the same screen are ensured.
Disclosure of Invention
The invention provides a data processing method for realizing synchronous display of multiple terminals on the same screen, which aims to solve the problems that the existing synchronous display of multiple terminals on the same screen can not be operated synchronously and is not interfered by the outside, and the adopted technical scheme is as follows:
the embodiment of the invention provides a data processing method for realizing synchronous display of multiple terminals on the same screen, which comprises the following steps:
the data server generates a 64-bit binary coded key, distributes the key to the display terminal and a plurality of corresponding operation terminals, the operation terminals acquire conference tokens of the corresponding display terminals from the data server, convert the conference tokens into binary and supplement 0 to split to obtain conference codes, and performs initial replacement on the conference codes to obtain initial codes;
constructing 12 layers of circular encryption space from inside to outside, dividing the circular encryption space into 8 sections from vertical upwards clockwise, taking a first section on the vertical upwards right side as a first section, sequentially filling initial codes into 8 layers in the circular encryption space from the sequence to an eighth section, and randomly filling the outer 4 layers;
performing rotary encryption on the first layer according to binary data of the first interval 9 to 11 layers to obtain a first encryption space; acquiring a first rotating and transposing messy code according to the first encryption space and the secret key, and performing first rotating and transposing messy on 9 to 11 layers to obtain a first scrambling space; layer-by-layer rotary encryption and scrambling are carried out until a fourth scrambling space is obtained, and binary data of 4 layers in the fourth scrambling space and binary data of 4 layers outside the fourth scrambling space are initially replaced to obtain a fourth replacement space;
performing layer-by-layer rotary encryption on the fourth scrambling space 5 to 8 layers and scrambling until an eighth scrambling space is obtained, and performing initial replacement on binary data of 8 layers outside the eighth scrambling space to obtain a final encryption space;
and sequentially outputting binary data of the final encryption space, converting to obtain a final code of a 12-bit character string, transmitting the final code and the complementary 0 number of the conference code to a display terminal, and completing verification of the conference token by the display terminal according to the final code and the secret key.
Optionally, the method for converting the conference token into binary and supplementing 0 to split to obtain the conference code includes the following specific steps:
each character of the conference token is respectively converted into 8-bit binary codes according to ASCII codes, and the 8-bit binary codes of all the characters in the conference token are arranged in sequence to obtain conference codes; if the conference code length is less than 64 bits, the conference code is supplemented with 0 at the subsequent position until the conference code length reaches 64 bits, and if the conference code length exceeds 64 bits, each 64 bits is used as a conference code, and the conference code with less than 64 bits is supplemented with 0.
Optionally, the initial codes are sequentially filled into 8 layers in the circular encryption space, and the outer 4 layers are randomly filled, which comprises the following specific methods:
filling the first 8-bit binary data of the initial coding layer by layer from 1 layer to 8 layers from the first interval; filling binary data of 9 to 16 bits from 8 layers to 1 layer in the second interval from the 9 th bit, and filling the binary data in an S-shaped filling rule until filling the binary data of 64 bits in the 1 layer in the eighth interval is finished;
and (3) randomly filling 32 vacancies of the eight sections of the outer 4 layers, namely 9 to 12 layers, generating random numbers by adopting a random function, filling the vacancies with the results obtained by rounding and rounding the absolute values of the sine functions of the random numbers, and filling all the vacancies of the eight sections of the outer 4 layers with corresponding results.
Optionally, the rotating encryption is performed on the first layer according to the binary data of the first layer 9 to 11 layers in the first interval to obtain a first encryption space, which includes the following specific methods:
obtaining 3 binary data of a first interval from 9 layers to 11 layers, arranging according to the sequence of the 9 layers to 11 layers to obtain three-bit binary codes, converting the three-bit binary codes into decimal data, recording the decimal data as the rotation times of 1 layer, rotating 8 binary data of the 1 layer clockwise according to the rotation times, performing exclusive-or operation on the binary data of each interval of the 1 layer and the binary data of each interval of the 2 layers after rotation, and replacing the operation result with the binary data of the 1 layer after rotation;
performing exclusive OR operation on the 3 binary data of the first interval 9 to 11 layers and the 3 binary data of the second interval 9 to 11 layers respectively, replacing the binary data of the first interval 9 to 11 layers with an operation result, and recording the round encryption space and 96 binary data therein as a first encryption space.
Optionally, the first rotating and transposing and scrambling code is obtained according to the first encryption space and the key, and the first rotating and transposing and scrambling are performed on the 9 to 11 layers to obtain the first scrambling space, which comprises the following specific methods:
8 binary data of the first encryption space 1 layer from the first interval to the eighth interval are extracted, and 8-bit binary codes are obtained according to the sequence from the first interval to the eighth interval; splitting the 64-bit binary code of the key into 8-bit binary codes in sequence; 8-bit binary codes and 1-layer 8-bit binary codes are marked as query codes of a first interval; converting 9 query codes into decimal data, respectively adding digits of each decimal data, converting the addition result of each decimal data into binary data again, obtaining 9 binary data, extracting last digits of the 9 binary data, and arranging the 9 last digits according to the sequence of 9 8-bit binary codes to obtain a first rotary transposition random code;
the first rotation transposition disorder code is 9-bit binary coding, 1 to 3 bits are used as a 9-layer first rotation code, 4 to 6 bits are used as a 10-layer first rotation code, 7 to 9 bits are used as an 11-layer first rotation code, the first rotation code is converted into decimal data, the decimal data are respectively recorded as first rotation times of 9, 10 and 11 layers, 8 binary data of each layer of 9 to 11 layers are rotated clockwise according to the first rotation times, and the first encryption space and 96 binary data are recorded as first scrambling spaces.
Optionally, the performing initial permutation on the binary data of the inner layer 4 and the outer layer 4 of the fourth scrambling space to obtain a fourth permutation space includes the following specific methods:
extracting 64 binary data of 1 to 4 layers and 9 to 12 layers in the fourth scrambling space, wherein the extraction sequence is 1 to 4 layers in a first interval, 9 to 12 layers in the first interval, 12 to 9 layers in the second interval, 4 to 1 layers in the second interval, 1 to 4 layers in the third interval and 4 layers in the … … eighth interval, and 4 to 1 layers in the eighth interval;
the extracted 64 binary data in sequence are initially replaced through a DES replacement table, the replaced 64 binary data are sequentially filled into corresponding positions again according to the extraction sequence, and a fourth scrambling space and 96 binary data in the fourth scrambling space are recorded as a fourth replacement space.
The beneficial effects of the invention are as follows: filling an initial code obtained by a conference token and randomly filling and complementing the initial code by constructing a circular encryption space, controlling the initial code to perform rotary encryption layer by layer according to positions by random filling data, and performing rotary scrambling on the randomly filled data according to the rotary encrypted initial code and a secret key; meanwhile, the original data relation of the conference token is destroyed to a great extent by adopting the DES substitution table and the S-shaped filling, so that the finally obtained final code has stronger anti-riot cracking capability and has a small similar relation with the original conference token; and the verification of the display terminal and the operation terminal is carried out according to the conference token, so that the synchronous display of multiple terminals of each display terminal on the same screen is realized, and the reliability and confidentiality of the display content are ensured.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
Fig. 1 is a schematic flow chart of a data processing method for implementing synchronous display of multiple terminals on the same screen according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a first layer encryption of a circular encryption space.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, a flowchart of a data processing method for implementing synchronous display of multiple terminals on the same screen according to an embodiment of the present invention is shown, where the method includes the following steps:
step S001, the data server generates a secret key and distributes the secret key to the operation terminal and the display terminal, the operation terminal obtains a conference token from the data server, converts the conference token into binary data and performs initial replacement to obtain initial codes.
The aim of the embodiment is to ensure the reliability and confidentiality of the synchronous display of the multi-terminal and the same screen through the encryption verification of the conference token in the synchronous display process of the multi-terminal and the same screen, so that the conference token needs to be acquired for an operation terminal; the multi-terminal same-screen synchronous display of the embodiment consists of a data server, an operation terminal and a display terminal; the data server is responsible for constructing display terminals and generating a key for encryption verification of the conference token, wherein the key and each display terminal are in one-to-one correspondence, and the key is a randomly generated 64-bit binary code; and issuing a conference token and a secret key to a plurality of operation terminals corresponding to each display terminal, and completing the synchronous display of the display terminals on the same screen of the plurality of operation terminals through the corresponding relation between the conference token and the display terminals.
Further, for the operation terminal, acquiring a conference token and a secret key of the corresponding display terminal through the data server, wherein the conference token is a character string; after the conference token is obtained, each character of the conference token is respectively converted into 8-bit binary codes according to ASCII codes, and the 8-bit binary codes of all the characters in the conference token are arranged in sequence to obtain conference codes; if the conference code length is less than 64 bits, supplementing 0 to the subsequent position of the conference code until the conference code length reaches 64 bits, and if the conference code length exceeds 64 bits, taking each 64 bits as a conference code section and supplementing 0 to the conference code with less than 64 bits; and (3) carrying out initial replacement on each section of the supplemented conference code through a DES (data encryption standard) replacement table, and marking each section of the obtained 64-bit code as the initial code, wherein the DES replacement table is a known technology and is not repeated in the embodiment.
The operation terminal obtains the conference token, and obtains the initial code through code system conversion and initial replacement.
Step S002, constructing a round encryption space with 12 layers from inside to outside, dividing the round encryption space into 8 sections according to angles, sequentially filling initial codes into 8 layers in the round encryption space, randomly filling outer 4 layers, carrying out rotary encryption on a first layer according to binary data of 9 to 11 layers in a first section to obtain a first encryption space, obtaining a first rotary transposition scrambling code according to the first encryption space and a secret key, carrying out first rotary transposition scrambling on 9 to 11 layers to obtain a first scrambling space, carrying out layer-by-layer rotary encryption and scrambling until obtaining a fourth scrambling space, and carrying out initial replacement on the binary data of 4 layers in the fourth scrambling space and the binary data of 4 layers outside the fourth scrambling space to obtain a fourth replacement space.
It should be noted that, in this embodiment, a circular encryption space of 12 layers of 8 intervals is set, and by placing the initial code into the inner 8 layers, the 8 layers of 8 intervals are filled with 64-bit binary data, which is just the same as the number of positions in the DES substitution table; the outer 4 layers are randomly filled, and the binary data of each layer of the inner 8 layers can be controlled to rotate just by converting the binary data into decimal representation of 0 to 7 through three-bit binary codes of 9 to 11 layers of each interval; and the 12 layers are combined with the inner 8 layers to obtain nine binary codes finally through multiple calculation, three binary codes are obtained through splitting, and the binary data of 9 to 11 layers are respectively subjected to rotation control; therefore, through 96 binary data of 12 layers of 8 intervals, rotation control is performed, and initial replacement after filling with 0 and random filling are combined, so that the arrangement relation between plaintext data is greatly destroyed, and the encryption reliability of the data is further ensured.
Specifically, firstly, a circular encryption space is constructed, wherein the circular encryption space is formed by 12 layers from inside to outside, namely, the circular encryption space is formed by 12 concentric circles, and 1 layer, 2 layers and up to 12 layers are sequentially arranged from inside to outside; the circular encryption space is divided into 8 sections from the vertical upwards clockwise, the first section on the vertical upwards right side is the first section, and the sequence is up to the eighth section; filling the first 8-bit binary data of the initial coding layer by layer from 1 layer to 8 layers from the first interval; filling binary data of 9 to 16 bits from 8 layers to 1 layer in the second interval from the 9 th bit, and filling the binary data in an S-shaped filling rule until filling the binary data of 64 bits in the 1 layer in the eighth interval is finished; and (3) randomly filling 32 vacancies of the eight sections of the outer 4 layers, namely 9 to 12 layers, generating random numbers by adopting random, filling the results obtained by rounding and rounding the absolute value of the sine function of the random numbers into the vacancies, and filling all vacancies of the eight sections of the outer 4 layers with corresponding results, thereby completing the construction of the circular encryption space and the filling of binary data.
Further, firstly, 3 binary data of a first interval from 9 layers to 11 layers are obtained, three binary codes are obtained according to the sequence of the 9 layers to 11 layers, the three binary codes are converted into decimal data and recorded as the rotation times of 1 layer, 8 binary data of the 1 layer are rotated clockwise according to the rotation times, after rotation, exclusive OR operation is carried out on the binary data of each interval of the 1 layer and the binary data of each interval of the 2 layers respectively, and the operation result is replaced by the binary data of the 1 layer after rotation; meanwhile, carrying out exclusive OR operation on 3 binary data of the first interval 9 to 11 layers and 3 binary data of the second interval 9 to 11 layers respectively, replacing the binary data of the first interval 9 to 11 layers with an operation result, and recording a circular encryption space and 96 binary data therein as a first encryption space; referring to fig. 2, which shows a schematic diagram of encryption of the first layer of the circular encryption space, in fig. 2, the 8 binary data of the first layer at the left side is 01010010, at this time, the binary data of the first layer 9 to 11 layers in the first interval is 011, the rotation number of the first layer is 3, the 8 binary data of the first layer in the middle of fig. 2 is 01001010, that is, the result obtained by rotating 01010010 three times clockwise, the result of the operation is 00100111, that is, the 8 binary data of the first layer at the right side of fig. 2 is obtained by performing exclusive-or operation on 01001010 and the 8 binary data 01101101 of the second layer.
Further, 8 binary data of the first encryption space 1 layer from the first interval to the eighth interval are extracted, and 8-bit binary codes are obtained according to the sequence from the first interval to the eighth interval; splitting the 64-bit binary code of the key into 8-bit binary codes in sequence; 8-bit binary codes and 1-layer 8-bit binary codes are marked as query codes of a first interval; 9 query codes are converted into decimal data, digits of each decimal data are respectively added, the addition result of each decimal data is converted into binary data, 9 binary data are obtained, the last digits of the 9 binary data are extracted, the 9 last digits are arranged according to the sequence of 9 8-bit binary codes to obtain a first rotation transposition disorder code, the first rotation transposition disorder code is 9-bit binary codes, 1 to 3 bits are used as a 9-layer first rotation code, 4 to 6 bits are used as a 10-layer first rotation code, 7 to 9 bits are used as an 11-layer first rotation code, the first rotation code is converted into decimal data, the first rotation times of 9, 10 and 11 layers are recorded respectively, 8 binary data of each 9 to 11 layers are clockwise rotated according to the first rotation times, and the first encryption space and 96 binary data are recorded as a first scrambling space.
For example, the 9 8-bit query codes obtained by the first encryption space are respectively: 10001010 10101010, 10001110, 11000111, 10001101, 10101110, 01000110, 10111010, 00100111;
the conversion into decimal data is as follows: 138 170, 142, 199, 141, 174, 70, 186, 39;
the decimal digit addition result is: 12,8,7, 19,6, 12,7, 15, 12;
the conversion of the addition result into binary data is respectively: 1100 1000, 0111, 10011, 0110, 1100, 0111, 1111, 1100;
the first rotation transposition messy code is as follows: the first rotation code of 001100110,9 layers is 001, the first rotation code of 10 layers is 100, and the first rotation code of 11 layers is 110; the first scrambling space is obtained by rotating 9 layers clockwise 1 time, 10 layers clockwise 4 times, and 11 layers clockwise 6 times.
Further, three-bit binary codes are obtained according to 3 binary data of 9 to 11 layers of a second interval in a first scrambling space, the three-bit binary codes are converted into decimal data to be used as the rotation times of 2 layers in the first scrambling space, 8 binary data of 2 layers are rotated clockwise according to the rotation times, after rotation, exclusive OR operation is carried out on the binary data of each interval of 2 layers and the binary data of 3 layers respectively, and the operation result is used for replacing the binary data of 2 layers after rotation; meanwhile, carrying out exclusive OR operation on 3 binary data of the second interval 9-11 layers and 3 binary data of the third interval 9-11 layers respectively, replacing the binary data of the second interval 9-11 layers with an operation result, and recording the first scrambling space and 96 binary data therein at the moment as a second encryption space; and the second rotary transposition scrambling code and 9 to 11 layers of second rotary codes are obtained through the secret key and 8 binary data of the second encryption space layer 2 according to the first encryption space, the binary data of the 9 to 11 layers are rotated clockwise according to the second rotary codes, and the second encryption space and 96 binary data are recorded as a second scrambling space.
Further, a third encryption space, a third scrambling space and a fourth encryption space are obtained according to the method based on the second scrambling space until the fourth scrambling space, rotation of each of 1 to 4 layers is controlled by binary data of 9 to 11 layers in a section with the same value, 8 binary data of each of 1 to 4 layers in the fourth scrambling space are rotated, and four rotations of 8 binary data of each of 9 to 11 layers are completed; extracting 64 binary data of 1 to 4 layers and 9 to 12 layers in the fourth scrambling space, wherein the extraction sequence is a first interval of 1 to 4 layers, a first interval of 9 to 12 layers, a second interval of 12 to 9 layers, a second interval of 4 to 1 layers, a third interval of 1 to 4 layers … …, and an eighth interval of 4 to 1 layers, namely, the S-shaped sequence is still adopted, and 5 to 8 layers are ignored for extraction; the extracted 64 binary data in sequence are initially replaced through a DES replacement table, the replaced 64 binary data are sequentially filled into corresponding positions again according to the extraction sequence, and a fourth scrambling space and 96 binary data in the fourth scrambling space are recorded as a fourth replacement space.
The rotation of the inner 4 layers is completed and exclusive-or operation is performed with the next layer, exclusive-or operation is performed on the first four sections 9 to 11 layers, and four rotations of the 9 to 11 layers are performed, and a fourth replacement space is obtained by performing initial replacement on the fourth scrambling space.
And step S003, carrying out layer-by-layer rotary encryption on the fourth scrambling space 5 to 8 layers and scrambling until an eighth scrambling space is obtained, and carrying out initial replacement on binary data of 8 layers outside the eighth scrambling space to obtain a final encryption space.
Rotating 8 binary data of 5 layers based on 3 binary data of 9 to 11 layers of a fifth interval in a fourth replacement space, performing exclusive-or operation and replacement with the binary data of 6 layers of the interval, and simultaneously performing exclusive-or operation and replacement on 3 binary data of 9 to 11 layers of the fifth interval and 3 binary data of 9 to 11 layers of a sixth interval respectively to obtain a fifth encryption space; obtaining a fifth scrambling space, a sixth encryption space, a sixth scrambling space, a seventh encryption space, a seventh scrambling space, an eighth encryption space and an eighth scrambling space based on the fifth encryption space according to the acquisition method of the rotating and transposed scrambling code and the rotation and exclusive-or operation of the inner 8-layer binary data; in the eighth encryption space, 8 layers of rotated binary data are respectively exclusive-ored with 9 layers of intermediate binary data and replaced on the basis of the seventh scrambling space, and 3 binary data of the eighth interval 9 to 11 layers are respectively exclusive-ored with 3 binary data of the first interval 9 to 11 layers and replaced.
Further, extracting 64 binary data of 5 to 12 layers in the eighth scrambling space, wherein the extraction sequence is that the first interval is 5 to 12 layers, the second interval is 12 to 5 layers, the third interval is 5 to 12 layers … …, the eighth interval is 12 to 5 layers, namely, the S-shaped sequence is still adopted, and 1 to 4 layers are ignored for extraction; the extracted 64 binary data in sequence are initially replaced through a DES replacement table, the replaced 64 binary data are sequentially filled into corresponding positions again according to the extraction sequence, and the eighth scrambling space and 96 binary data in the eighth scrambling space are recorded as a final encryption space.
Thus, the rotary encryption of the inner 8-layer data is completed, and meanwhile, the reduction of the inner 8-layer data according to the 9-11-layer data and the reduction of the relation between ciphertext and plaintext are avoided to a great extent through the repeated rotation and exclusive-or operation of the 9-11-layer data.
Step S004, outputting binary data of the final encryption space in sequence, converting according to ASCII codes to obtain a final code of a 12-bit character string, and transmitting the final code of each section of conference code to a display terminal to finish verification of the conference token.
The final encryption space is provided with 96 binary data, 96 binary codes are obtained by sequential output, a character string composed of 12-bit characters is formed by ASCII code conversion, each section of conference code is provided with an initial code, a final encryption space is obtained in a round encryption space, the final encryption space is output and converted to obtain the final code of each section of conference code, the final codes of all conference codes are transmitted, and the display terminal decrypts each section of final codes according to a secret key, restores to obtain a conference token and further completes verification.
Specifically, 96 binary data in the final encryption space are extracted, the extraction sequence is 1-12 layers in the first interval, 12-1 layers in the second interval, the extraction is completed from 12-1 layers in the third interval, 1-12 layers to 12-1 layers in the eighth interval, 96-bit binary codes are formed according to the extraction sequence, each 8-bit binary code is split to obtain 12 8-bit binary codes, the 8-bit binary codes are converted into corresponding characters according to an ASCII code table, and the 12 characters are arranged to obtain the final codes of a 12-bit character string; and carrying out circular encryption space operation on the initial codes obtained by each section of conference codes according to the method, finally outputting final codes, transmitting all the final codes according to the sequence of the conference codes, and simultaneously transmitting the number of the conference codes with 0 complement to the display terminal.
Further, any section of final code is decrypted, and the specific decryption process is as follows:
(1) Converting the final code into 96-bit ciphertext code through ASCII codes, and filling the ciphertext code into an eighth interval 1 layer one by one from the first interval 1 layer of the circular encryption space according to an S-shaped sequence;
(2) Extracting binary data of 5-12 layers of a circular encryption space according to an S-type extraction sequence, performing initial replacement according to a DES replacement table, and refilling the replaced binary data into 5-12 layers;
(3) Obtaining an eighth rotation transposition messy code according to the secret key and 8 binary data of 8 layers, rotating the binary data of 9-11 layers anticlockwise, performing exclusive-or operation on the binary data of 9-11 layers of the rotated eighth interval and the binary data of 9-11 layers of the first interval, and refilling the exclusive-or operation;
(4) Performing exclusive OR operation on the binary data of the 8 layers and the binary data of the 9 layers in the interval, and refilling the exclusive OR operation, acquiring the rotation times of the 8 layers according to the binary data of the 9-11 layers in the eighth interval, and rotating the binary data of the 8 layers anticlockwise;
(5) Repeating the steps (3) and (4), respectively obtaining a seventh rotation transposition messy code, carrying out exclusive or on binary data of 9-11 layers and a next interval, carrying out exclusive or on 7 layers and 8 layers, obtaining 7 layers of rotation times, and recovering to obtain binary data of 7 layers; gradually reducing to obtain binary data of 5 layers;
(6) Extracting binary data of 1-4 layers and 9-12 layers at the moment according to an S-type extraction sequence, wherein the extraction sequence is the same as that of the fourth replacement space extraction sequence obtained in the step S002, and performing initial replacement according to DES replacement and refilling; continuously repeating the steps (3) and (4), recovering to obtain 1-layer binary data, and outputting 96 binary data according to the S-shaped sequence, namely, 96-bit plaintext coding;
(7) Removing the last 32 bits of the 96-bit plaintext codes, obtaining initial codes, carrying out initial replacement again to obtain a plurality of sections of conference codes, carrying out last-bit 0 removing operation on the conference codes with 0 being supplemented according to the number of 0 supplementing, converting the processed plurality of sections of conference codes into character strings according to ASCII codes, and obtaining conference tokens according to sequence arrangement, namely finishing decryption operation.
According to the conference token, the display terminal verifies the operation terminals, and gives operation rights to the operation terminals with successful verification, and the same display terminal gives operation rights to a plurality of operation terminals, so that synchronous display of multiple terminals on the same screen can be realized.
So far, the synchronous display of the multiple terminals on the same screen is realized through the key generation and the distribution verification of the conference token.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (6)
1. The data processing method for realizing synchronous display of multiple terminals on the same screen is characterized by comprising the following steps:
the data server generates a 64-bit binary coded key, distributes the key to the display terminal and a plurality of corresponding operation terminals, the operation terminals acquire conference tokens of the corresponding display terminals from the data server, convert the conference tokens into binary and supplement 0 to split to obtain conference codes, and performs initial replacement on the conference codes to obtain initial codes;
constructing 12 layers of circular encryption space from inside to outside, dividing the circular encryption space into 8 sections from vertical upwards clockwise, taking a first section on the vertical upwards right side as a first section, sequentially filling initial codes into 8 layers in the circular encryption space from the sequence to an eighth section, and randomly filling the outer 4 layers;
performing rotary encryption on the first layer according to binary data of the first interval 9 to 11 layers to obtain a first encryption space; acquiring a first rotating and transposing messy code according to the first encryption space and the secret key, and performing first rotating and transposing messy on 9 to 11 layers to obtain a first scrambling space; layer-by-layer rotary encryption and scrambling are carried out until a fourth scrambling space is obtained, and binary data of 4 layers in the fourth scrambling space and binary data of 4 layers outside the fourth scrambling space are initially replaced to obtain a fourth replacement space;
performing layer-by-layer rotary encryption on the fourth scrambling space 5 to 8 layers and scrambling until an eighth scrambling space is obtained, and performing initial replacement on binary data of 8 layers outside the eighth scrambling space to obtain a final encryption space;
and sequentially outputting binary data of the final encryption space, converting to obtain a final code of a 12-bit character string, transmitting the final code and the complementary 0 number of the conference code to a display terminal, and completing verification of the conference token by the display terminal according to the final code and the secret key.
2. The data processing method for implementing synchronous display of multiple terminals on the same screen according to claim 1, wherein the method for converting the conference token into binary and supplementing 0 to split to obtain conference codes comprises the following specific steps:
each character of the conference token is respectively converted into 8-bit binary codes according to ASCII codes, and the 8-bit binary codes of all the characters in the conference token are arranged in sequence to obtain conference codes; if the conference code length is less than 64 bits, the conference code is supplemented with 0 at the subsequent position until the conference code length reaches 64 bits, and if the conference code length exceeds 64 bits, each 64 bits is used as a conference code, and the conference code with less than 64 bits is supplemented with 0.
3. The data processing method for implementing synchronous display of multiple terminals on the same screen according to claim 1, wherein the method for filling initial codes into 8 layers in a circular encryption space in sequence and randomly filling the outer 4 layers comprises the following specific steps:
filling the first 8-bit binary data of the initial coding layer by layer from 1 layer to 8 layers from the first interval; filling binary data of 9 to 16 bits from 8 layers to 1 layer in the second interval from the 9 th bit, and filling the binary data in an S-shaped filling rule until filling the binary data of 64 bits in the 1 layer in the eighth interval is finished;
and (3) randomly filling 32 vacancies of the eight sections of the outer 4 layers, namely 9 to 12 layers, generating random numbers by adopting a random function, filling the vacancies with the results obtained by rounding and rounding the absolute values of the sine functions of the random numbers, and filling all the vacancies of the eight sections of the outer 4 layers with corresponding results.
4. The data processing method for implementing multi-terminal on-screen synchronous display according to claim 1, wherein the method is characterized in that the first layer is rotationally encrypted according to binary data of the first interval 9 to 11 layers to obtain a first encryption space, and comprises the following specific steps:
obtaining 3 binary data of a first interval from 9 layers to 11 layers, arranging according to the sequence of the 9 layers to 11 layers to obtain three-bit binary codes, converting the three-bit binary codes into decimal data, recording the decimal data as the rotation times of 1 layer, rotating 8 binary data of the 1 layer clockwise according to the rotation times, performing exclusive-or operation on the binary data of each interval of the 1 layer and the binary data of each interval of the 2 layers after rotation, and replacing the operation result with the binary data of the 1 layer after rotation;
performing exclusive OR operation on the 3 binary data of the first interval 9 to 11 layers and the 3 binary data of the second interval 9 to 11 layers respectively, replacing the binary data of the first interval 9 to 11 layers with an operation result, and recording the round encryption space and 96 binary data therein as a first encryption space.
5. The data processing method for implementing synchronous display of multiple terminals on the same screen according to claim 1, wherein the steps of obtaining a first rotation and transposition scrambling code according to a first encryption space and a key, performing first rotation and transposition on 9 to 11 layers to obtain a first scrambling space, and include the specific steps of:
8 binary data of the first encryption space 1 layer from the first interval to the eighth interval are extracted, and 8-bit binary codes are obtained according to the sequence from the first interval to the eighth interval; splitting the 64-bit binary code of the key into 8-bit binary codes in sequence; 8-bit binary codes and 1-layer 8-bit binary codes are marked as query codes of a first interval; converting 9 query codes into decimal data, respectively adding digits of each decimal data, converting the addition result of each decimal data into binary data again, obtaining 9 binary data, extracting last digits of the 9 binary data, and arranging the 9 last digits according to the sequence of 9 8-bit binary codes to obtain a first rotary transposition random code;
the first rotation transposition disorder code is 9-bit binary coding, 1 to 3 bits are used as a 9-layer first rotation code, 4 to 6 bits are used as a 10-layer first rotation code, 7 to 9 bits are used as an 11-layer first rotation code, the first rotation code is converted into decimal data, the decimal data are respectively recorded as first rotation times of 9, 10 and 11 layers, 8 binary data of each layer of 9 to 11 layers are rotated clockwise according to the first rotation times, and the first encryption space and 96 binary data are recorded as first scrambling spaces.
6. The method for implementing multi-terminal on-screen synchronous display according to claim 1, wherein the method for initially replacing binary data of the inner 4 layers and the outer 4 layers of the fourth scrambling space to obtain a fourth replacement space comprises the following specific steps:
extracting 64 binary data of 1 to 4 layers and 9 to 12 layers in the fourth scrambling space, wherein the extraction sequence is 1 to 4 layers in a first interval, 9 to 12 layers in the first interval, 12 to 9 layers in the second interval, 4 to 1 layers in the second interval, 1 to 4 layers in the third interval and 4 layers in the … … eighth interval, and 4 to 1 layers in the eighth interval;
the extracted 64 binary data in sequence are initially replaced through a DES replacement table, the replaced 64 binary data are sequentially filled into corresponding positions again according to the extraction sequence, and a fourth scrambling space and 96 binary data in the fourth scrambling space are recorded as a fourth replacement space.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310430176.XA CN116170557B (en) | 2023-04-21 | 2023-04-21 | Data processing method for realizing synchronous display of multiple terminals on same screen |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310430176.XA CN116170557B (en) | 2023-04-21 | 2023-04-21 | Data processing method for realizing synchronous display of multiple terminals on same screen |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116170557A CN116170557A (en) | 2023-05-26 |
| CN116170557B true CN116170557B (en) | 2023-06-20 |
Family
ID=86418548
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310430176.XA Active CN116170557B (en) | 2023-04-21 | 2023-04-21 | Data processing method for realizing synchronous display of multiple terminals on same screen |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116170557B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1617584A (en) * | 2004-12-06 | 2005-05-18 | 武汉大学 | Dynamic random mess correction and enciphering-deenciphering method for video frequency information |
| GB0722241D0 (en) * | 2007-11-13 | 2007-12-27 | Fletcher David C | biometric based identity confirmation |
| CN109743170A (en) * | 2018-11-30 | 2019-05-10 | 视联动力信息技术股份有限公司 | A kind of Streaming Media logs in and the method and apparatus of data transmission encryption |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8325994B2 (en) * | 1999-04-30 | 2012-12-04 | Davida George I | System and method for authenticated and privacy preserving biometric identification systems |
| KR20020077838A (en) * | 2002-08-09 | 2002-10-14 | 박승배 | Password system solving the controversial point of the password-exposure by the observation of other people |
| US20120082306A1 (en) * | 2010-10-05 | 2012-04-05 | Andrew William Hulse | Data Encryption and Input System |
-
2023
- 2023-04-21 CN CN202310430176.XA patent/CN116170557B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1617584A (en) * | 2004-12-06 | 2005-05-18 | 武汉大学 | Dynamic random mess correction and enciphering-deenciphering method for video frequency information |
| GB0722241D0 (en) * | 2007-11-13 | 2007-12-27 | Fletcher David C | biometric based identity confirmation |
| CN109743170A (en) * | 2018-11-30 | 2019-05-10 | 视联动力信息技术股份有限公司 | A kind of Streaming Media logs in and the method and apparatus of data transmission encryption |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116170557A (en) | 2023-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TW382872B (en) | Encryption/decryption method and its device | |
| Alqad et al. | A new approach for data cryptography | |
| CN115277978B (en) | Image information security management method based on state coding table | |
| Saraswat et al. | An extended hybridization of vigenére and caesar cipher techniques for secure communication | |
| CN115865523B (en) | Data encryption transmission method for information analysis system | |
| CN115694784A (en) | Data safety storage method | |
| US20070189518A1 (en) | 3-D quaternion quantum fractal encryption | |
| CN110535624B (en) | Medical image privacy protection method applied to DICOM format | |
| CN113067696B (en) | Multi-round symmetrical digital image encryption method and system based on bit grouping | |
| CN104598801B (en) | A kind of Dynamic Two-dimensional code generating method based on algorithm reconstruct | |
| CN115941153B (en) | Safe storage method for drug synthesis data | |
| CN115695675A (en) | Video encryption method for network data secure exchange | |
| CN101344960A (en) | Chaos digital image encryption method | |
| CN116170557B (en) | Data processing method for realizing synchronous display of multiple terminals on same screen | |
| US6301361B1 (en) | Encoding and decoding information using randomization with an alphabet of high dimensionality | |
| CN115883841B (en) | Huffman coding-based computer information storage system | |
| CN115664639B (en) | Financial asset transaction data transmission encryption method | |
| CN107493164B (en) | DES encryption method and system based on chaotic system | |
| US6035042A (en) | High speed and method of providing high speed table generation for block encryption | |
| CN105704499B (en) | A kind of selective satellite image compression encryption method based on ChaCha20 and CCSDS | |
| CN115134471A (en) | Image encryption and decryption method and related equipment | |
| CN111159721A (en) | Code control type data encryption method of variable secret key | |
| CN117057804B (en) | Financial transaction data secure storage method and system based on hash sequence | |
| EP4088270A1 (en) | A method for symmetric asynchronous generative encryption | |
| CN115296799B (en) | Quick face recognition method for micro-service user identity authentication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |