CN111465006A - Beidou short message encryption and decryption method based on ancestor algorithm and communication system - Google Patents

Beidou short message encryption and decryption method based on ancestor algorithm and communication system Download PDF

Info

Publication number
CN111465006A
CN111465006A CN202010270026.3A CN202010270026A CN111465006A CN 111465006 A CN111465006 A CN 111465006A CN 202010270026 A CN202010270026 A CN 202010270026A CN 111465006 A CN111465006 A CN 111465006A
Authority
CN
China
Prior art keywords
integer
character
short message
key
encryption
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.)
Granted
Application number
CN202010270026.3A
Other languages
Chinese (zh)
Other versions
CN111465006B (en
Inventor
杨先伟
吴伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuxi Institute of Technology
Original Assignee
Wuxi Institute of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wuxi Institute of Technology filed Critical Wuxi Institute of Technology
Priority to CN202010270026.3A priority Critical patent/CN111465006B/en
Publication of CN111465006A publication Critical patent/CN111465006A/en
Application granted granted Critical
Publication of CN111465006B publication Critical patent/CN111465006B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/03—Protecting confidentiality, e.g. by encryption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/06—Airborne or Satellite Networks
    • 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
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Storage Device Security (AREA)

Abstract

The invention discloses a big Dipper short message encryption and decryption method based on ZUchong algorithm and a communication system, and relates to the technical field of communication. During encryption, the Beidou short message is mapped into a plaintext integer message string by utilizing the one-to-one mapping relation between an effective character set and an integer character set of a Beidou short message protocol, the plaintext integer message string is encrypted to form an encrypted integer message string based on an encryption key generated by an ancestor algorithm, each bit of character in the encrypted integer message string is contained in the integer character set, and the encrypted integer message string is mapped to obtain a Beidou short message ciphertext; the decryption process is the reverse of encryption. The method is used for encrypting and decrypting the Beidou short message based on the grandma algorithm, the characters in a plaintext and a ciphertext can be guaranteed to be valid characters, the correctness of encryption, decryption and communication is guaranteed, the length of the encrypted Beidou short message ciphertext is the same as that of the original Beidou short message plaintext, the data length is not increased, the method is simple and easy to implement, and the reliability and the execution efficiency are high.

Description

Beidou short message encryption and decryption method based on ancestor algorithm and communication system
Technical Field
The invention relates to the technical field of communication, in particular to a big Dipper short message encryption and decryption method and a communication system based on ZUchong algorithm.
Background
The Beidou satellite navigation system (hereinafter referred to as Beidou system) is a national important space infrastructure for providing all-weather, all-time, high-precision positioning, navigation and time service for global users, is widely applied to the fields of traffic transportation, marine fishery, hydrological monitoring, meteorological forecasting, mapping geographic information, forest fire prevention, communication time system, power dispatching, disaster relief and reduction, emergency search and rescue and the like, gradually permeates the aspects of human social production and human life, and injects new vitality for global economy and social development.
The Beidou system provides RDSS bidirectional short message information service, namely the function of satellite communication, is the first global satellite navigation system integrating message communication in addition to positioning and time service, which is not possessed by other three satellite navigation systems (GPS in the United states, Galileo in Europe and G L ONASS in Russia), and is the core advantage of the Beidou system.
The protocol 2.1 of the beidou short message is "beidou satellite navigation system user terminal general data interface (pre)" issued in 2014-8, the version number is 2.1, the protocol is in a text format, and reserved characters, valid characters and undefined characters exist: (1) the reserved characters, 9 in total, of the Beidou 2.1 protocol have special meanings, and therefore cannot be used in the data section. (2) The valid characters, i.e. the valid characters of the beidou 2.1 protocol, refer to the characters except the reserved characters from the printable ASCII characters 0X20 to 0X7F, and are 88 characters in total, see the standard JTT 1159.2. (3) Undefined characters, which refer to ASCII characters that are neither "reserved characters" nor "valid characters", should not be transmitted at any time.
Because the effective characters of the Beidou short message 2.1 protocol are only 88, if the data are directly encrypted by adopting the traditional data scrambling scheme, the probability that ciphertext data corresponding to each character is 65.6% is not the effective character, so that the short message sending equipment can consider that the short message scrambling is abnormal, and the short message receiver can also perform abnormal processing on the received short message, such as format analysis failure or direct short message discarding. Therefore, the traditional data scrambling scheme is not suitable for processing the Beidou short message.
Disclosure of Invention
The invention provides a Beidou short message encryption and decryption method and a communication system based on the grand rush algorithm aiming at the problems and the technical requirements, and the technical scheme of the invention is as follows:
a big Dipper short message encryption method based on ZUchong algorithm comprises the following steps:
obtaining Beidou short message plaintext to be encrypted, wherein the Beidou short message plaintext comprises n plaintext characters, and each plaintext character is contained in an effective character set of a Beidou short message protocol;
mapping the Beidou short message plain text into a plain text integer message string by utilizing a one-to-one mapping relation between each character in the effective character set and each character in a preset integer character set, wherein the plain text integer message string comprises n bits of plain text integer characters, each bit of plain text integer character is contained in the integer character set, the ith bit of plain text integer character in the plain text integer message string is obtained by mapping the ith bit of plain text character in the Beidou short message plain text, and i is more than or equal to 1 and less than or equal to n;
initializing an ancestor algorithm, acquiring an encryption key generated by the ancestor algorithm for any ith plaintext integer character in a plaintext integer message string, and generating an encrypted alternative character by using the encryption key and the ith plaintext integer character, wherein if the encrypted alternative character is contained in an integer character set, the encrypted alternative character is determined to be an encrypted integer character corresponding to the ith plaintext integer character; if the encrypted alternative character is not contained in the integer character set, acquiring a new encryption key, and executing the step of generating the encrypted alternative character by using the encryption key and the ith plaintext integer character by using the new encryption key;
obtaining an encrypted integer message string formed by n encrypted integer characters after determining the encrypted integer character corresponding to each plaintext integer character, mapping the encrypted integer message string into a Beidou short message ciphertext by utilizing a one-to-one mapping relation between an effective character set and an integer character set, wherein the Beidou short message ciphertext comprises the n encrypted integer characters, and the ith encrypted integer character in the Beidou short message ciphertext is obtained by mapping the ith encrypted integer character in the encrypted integer message string.
The further technical scheme is that the encryption key generated based on the grandma algorithm is obtained, and the method comprises the following steps:
taking out a byte of sub-key from the sub-key buffer area as a first target sub-key, wherein the sub-key buffer area comprises a plurality of bytes of sub-keys generated by using the ZUZW algorithm, and the number of bytes is reduced by one byte after the first target sub-key is taken out;
choose low of first target subkey
Figure BDA0002442819190000021
Using bits as encryption key, where r is the number and sign of characters in effective character set of Beidou short message protocol
Figure BDA0002442819190000022
Indicating rounding up.
The further technical scheme is that when initializing the grand dashing algorithm, initializing the sub-key buffer area to be empty, selecting a byte of sub-key from the sub-key buffer area as a first target sub-key, and the method comprises the following steps:
detecting whether at least one sub-key exists in the sub-key buffer area;
if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as a first target sub-key;
if the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the ancestry algorithm, and one byte of the subkeys is taken out to be used as the first target subkey.
The method further comprises the following steps that for any ith plaintext integer character in the plaintext integer message string, the failure times of key initialization are 0; the steps of retrieving the encryption key generated based on the grandpa algorithm and generating an encrypted alternative character using the encryption key and the ith plaintext integer character are re-performed, including:
if the encrypted alternative characters are not contained in the integer character set, detecting whether the failure times of the key reach a failure time threshold value;
if the failure times of the secret key do not reach the failure time threshold value, accumulating the failure times of the secret key once, abandoning the encryption secret key, re-executing the steps of obtaining the encryption secret key generated based on the ancestor algorithm and generating the encrypted alternative character by utilizing the encryption secret key and the ith plaintext integer character;
and if the failure times of the key reach the failure time threshold value, returning an encryption error.
A big Dipper short message decryption method based on ZUchong algorithm comprises the following steps:
obtaining a Beidou short message ciphertext, wherein the Beidou short message ciphertext comprises n-bit ciphertext characters, and each ciphertext character is contained in an effective character set of a Beidou short message protocol;
mapping the Beidou short message ciphertext into an encrypted integer message string by utilizing a one-to-one mapping relation between each character in the effective character set and each character in a preset integer character set, wherein the encrypted integer message string comprises n encrypted integer characters, each encrypted integer character is contained in the integer character set, the ith encrypted integer character in the encrypted integer message string is obtained by mapping the ith ciphertext character in the Beidou short message ciphertext, and i is more than or equal to 1 and less than or equal to n;
initializing grandpa's algorithm, for any ith encrypted integer character in the encrypted integer message string, obtaining a decryption key generated based on the grandpa's algorithm and generating a decrypted alternative character by using the decryption key and the ith encrypted integer character, and if the decrypted alternative character is contained in the integer character set, determining the decrypted alternative character as a plaintext integer character corresponding to the ith encrypted integer character; if the decrypted optional character is not contained in the integer character set, acquiring a new decryption key, and executing the step of generating the decrypted optional character by using the decryption key and the ith encrypted integer character by using the new decryption key;
the method comprises the steps of obtaining a plaintext integer message string formed by n plaintext integer characters after determining the plaintext integer characters corresponding to each encrypted integer character, and mapping the plaintext integer message string into Beidou short message plaintext by utilizing a one-to-one mapping relation between an effective character set and an integer character set, wherein the Beidou short message plaintext comprises the n plaintext characters, and the ith plaintext character in the Beidou short message plaintext is obtained by mapping the ith plaintext integer character in the plaintext integer message string.
The further technical scheme is that the method for obtaining the decryption key generated based on the grandma algorithm comprises the following steps:
taking out a byte of sub-key from the sub-key buffer area as a second target sub-key, wherein the sub-key buffer area comprises a plurality of bytes of sub-keys generated by using the ZUZW algorithm, and the number of bytes is reduced by one byte after the second target sub-key is taken out;
choose low of second target subkey
Figure BDA0002442819190000041
Using the bit as a decryption key, wherein r is the number and symbol of characters in the effective character set of the Beidou short message protocol
Figure BDA0002442819190000042
Indicating rounding up.
The further technical scheme is that when initializing the grand dashing algorithm, initializing the sub-key buffer area to be empty, and taking out a sub-key of one byte from the sub-key buffer area as a second target sub-key, the method comprises the following steps:
detecting whether at least one sub-key exists in the sub-key buffer area;
if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as a second target sub-key;
if the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the ancestry algorithm, and one byte of the subkeys is taken out to be used as a second target subkey.
The further technical scheme is that for any ith bit encrypted integer character in the encrypted integer message string, the method also comprises the step of initializing the key for 0 failure times; the step of retrieving the decryption key generated based on the grandpa algorithm and generating a decrypted alternative character using the decryption key and the ith encrypted integer character is re-performed, comprising:
if the decryption alternative characters are not contained in the integer character set, detecting whether the failure times of the key reach a failure time threshold value;
if the key failure times do not reach the failure time threshold value, accumulating the key failure times once, abandoning the decryption key, and re-executing the steps of obtaining the decryption key generated based on the ancestor algorithm and generating a decryption alternative character by using the decryption key and the ith encrypted integer character;
and if the failure times of the key reach the failure time threshold value, returning a decryption error.
A big Dipper short message encryption and decryption communication system based on ZUchong's algorithm comprises a scheduling module, an encryption and decryption module and a transmitting and receiving module, wherein the scheduling module is respectively connected with the encryption and decryption module and the transmitting and receiving module;
when the Beidou short message encryption and decryption communication system sends signals, the scheduling module sends Beidou short message plaintext to the encryption and decryption module, the encryption and decryption module executes the Beidou short message encryption method disclosed by the application to encrypt the Beidou short message plaintext to generate corresponding Beidou short message ciphertext, and the scheduling module sends the Beidou short message ciphertext through the receiving and sending module;
when the Beidou short message encryption and decryption communication system receives signals, the scheduling module receives Beidou short message ciphertexts through the receiving and sending module and sends the Beidou short message ciphertexts to the encryption and decryption module, and the encryption and decryption module executes the Beidou short message decryption method disclosed by the application to decrypt the Beidou short message ciphertexts to obtain corresponding Beidou short message plaintexts.
The further technical scheme is that the Beidou short message encryption and decryption communication system further comprises an IO module and an encoding and decoding module which are respectively connected with the scheduling module, and then:
when the Beidou short message encryption and decryption communication system sends signals, the scheduling module acquires short message information to be sent through the IO module and sends the short message information to the coding and decoding module to be coded to generate corresponding Beidou short message plaintext, and then the Beidou short message plaintext is sent to the encryption and decryption module;
when the Beidou short message encryption and decryption communication system receives signals, the scheduling module decrypts through the encryption and decryption module to obtain Beidou short message plaintext, and then the Beidou short message plaintext is decoded through the encoding and decoding module to generate corresponding short message information and the short message information is sent to the IO module for display.
The beneficial technical effects of the invention are as follows:
the application discloses a big Dipper short message encryption and decryption method based on ZUchong's algorithm and an encryption and decryption communication system using the encryption and decryption method.
Drawings
Fig. 1 is a flowchart of a method for encrypting a beidou short message disclosed in the present application.
Fig. 2 is a flowchart of a method for decrypting a beidou short message disclosed in the present application.
Fig. 3 is a system structure diagram of the big dipper short message encryption and decryption communication system disclosed in the present application.
Detailed Description
The following further describes the embodiments of the present invention with reference to the drawings.
The application discloses a big dipper short message encryption and decryption method based on ZUchong's algorithm and a communication system for encrypting and decrypting the big dipper short message by using the encryption and decryption method in communication, and the application introduces the following respectively:
a big Dipper short message encryption method based on the ancestor algorithm is disclosed. The encryption method mainly includes the following steps, please refer to the flowchart shown in fig. 1:
1. obtaining a Beidou short message plaintext to be encrypted, wherein the Beidou short message plaintext is a character string, the work comprises n-bit plaintext characters, and the Beidou short message plaintext can be expressed as XM (XM ═ X)1||X2||X3……||XnWherein X isiThe ith plaintext character of the character string representing the Beidou short message plaintext is represented, i is a parameter, i is more than or equal to 1 and less than or equal to n, and the symbol | | represents the serial connection of all the plaintext characters.
It should be noted that, in the present application, the definition of the ith character in the character string is uniform, that is, the position of the character represented by the ith character in the various character strings appearing in the present application is the same in the character string. However, the ith bit specifically indicates which position can be defined by a user, for example, the ith bit from the left can be defined, the ith bit from the right can also be defined, and other defining manners can be implemented.
Each plaintext character is contained in an effective character set of the Beidou short message protocol, the effective character set comprises r characters, and the effective character set is represented as C ═ C0,c1,c2……cr-1In which c isjRepresents the jth character in the effective character set C, j is a parameter and is more than or equal to 0 and less than or equal to r-1, namely any Xi∈ C, when the implementation is realized, the specific content of the effective character set can be determined by inquiring the latest Beidou short message protocol, 88 effective characters are totally contained in the Beidou short message 2.1 protocol at the present stage, therefore r is 88, the specific character content in the effective character set C is also specified in the Beidou short message 2.1 protocol, and the application is not introduced in detail.
2. And establishing a one-to-one mapping relation between the effective character set C and the integer character set Z. The integer character set comprises r characters, each character is an integer character, and the integer character set is represented as Z ═ { Z ═0,z1,z2……zr-1In which z isjRepresents the jth character in the integer character set Z, j is a parameter, and j is more than or equal to 0 and less than or equal to r-1. Establishing a one-to-one mapping relationship between the valid character set C and the integer character set Z, i.e. representing, that one character in the valid character set C corresponds to one character in the integer character set Z one to one, for example, in the present application, the same subscript is used to represent two charactersThe mapping relation of each character set, namely: character C in valid character set CjWith a character Z in the integer character set ZjAnd mapping in a one-to-one correspondence manner.
3. Mapping the Beidou short message plaintext XM into a plaintext integer message string AM by using a one-to-one mapping relation between each character in the effective character set C and each character in a preset integer character set Z, specifically, mapping the ith plaintext character X in the Beidou short message plaintext XM into a plaintext integer message string AMiMapped as the i-th plaintext integer character A in the plaintext integer message string AMiTherefore, the mapped plaintext integer message string AM includes n-bit plaintext integer characters, and the plaintext integer message string may be represented as AM ═ a1||A2||A3……||AnWherein A isiFrom XiAnd (6) mapping. Each plaintext integer character of the plaintext integer message string AM is contained in an integer character set Z, i.e. any Ai∈Z。
The present application is illustrated by the following simple example, and it is assumed that the character correspondence relationship between the valid character set C and the integer character set Z is as shown in the following table:
cj a b …… x y ……
zj 0 1 24 25
then, when the plaintext of the beidou short message is XM | | | b | | | y, the mapped AM | | 00| |01| |25 is obtained.
4. The algorithm of grand dashes is initialized with an initialization vector IV of 128 bits and an initial KEY of 128 bits, and the subkey buffer is initialized to be empty, as required by GMT 0001-2012 sequence cipher algorithm of grand dashes.
The ZUC is a sequence cipher algorithm with a word-oriented design, which has been adopted by 3GPP L TE in 2011 and 9 months as an international encryption standard with a standard number of TS 35.221, namely the 4 th generation mobile communication encryption standard, and is released in 2012 and 3 months as a national cipher industry standard with a standard number of GM/T0001-2012, and is released in 2016 and 10 months as a national standard with a standard number of GB/T33133-2016.
5. Encrypting each plaintext integer character in the plaintext integer message string AM by utilizing the ancestry rush algorithm, and for any ith plaintext integer character A in the plaintext integer message string AMiPair A is cycled through encryption as followsiThe specific process of encryption is as follows:
(1) the number of times of initialization key failure ctr is 0.
(2) Obtaining an encryption key generated based on grandfather's algorithm, specifically:
for the first encryption cycle, since the subkey buffer is initialized to empty, there are no subkeys in the subkey buffer in the first encryption cycle. But starting from the second encryption cycle, the subkeys may not exist in the subkey buffer, and the subkeys left over in the previous encryption cycle may also exist. Therefore, it is first detected whether at least one subkey exists in the subkey buffer.
And if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as a first target sub-key.
If the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the ancestry algorithm, and one byte of the subkeys is taken out to be used as the first target subkey. In any case, when one sub-key is taken out from the sub-key buffer as the first target sub-key, the sub-key may be randomly selected or selected according to a predetermined sequence, and the present application is not limited thereto.
After a byte of the first target subkey is fetched, the subkey buffer is decremented by one byte. Choose low of first target subkey
Figure BDA0002442819190000071
Bits as encryption key ks1, where symbols
Figure BDA0002442819190000072
Indicating rounding up.
(3) Using the obtained encryption key ks1 and the ith plaintext integer character AiGenerating an encrypted candidate character giThe generation method can be customized, and the encryption key ks1 and the ith plaintext integer character A are encryptediCarrying out bitwise XOR to obtain an encrypted alternative character giThat is to say
Figure BDA0002442819190000073
(4) Judging encrypted alternative character giWhether it is contained in the integer character set Z, i.e. whether g is satisfiedi∈Z。
(5) If the alternative character g is encryptediContained in the integer character set Z, i.e. satisfying gi∈ Z, the encrypted alternative character g is determinediI.e. the ith plaintext integer character AiCorresponding encrypted integer character Bi。
(6) If the alternative character g is encryptediNot provided for in the integer character set Z, i.e.
Figure BDA0002442819190000083
It is detected whether the key failure time ctr reaches the failure time threshold T at this time. If the key failure times ctr do not reach the failure time threshold T, accumulating the key failure times, that is, making ctr equal to ctr +1, discarding the current encryption key, then returning to the step (2) to obtain a new encryption key, and repeating the above cycle for a by using the new encryption keyiEncryption is performed. And if the key failure times ctr reach the failure time threshold T, directly returning an encryption error. The failure time threshold T is a preset value, and is usually not less than 20.
During the above cycle, no matter giWhether in the integer character set Z, each encryption key ks1 can only be used once, and the subkeys cannot be replaced after being removed from the subkey buffer. For the current Beidou short message 2.1 protocol, each character needs to be encrypted by 27The encryption key of 1.455 bytes is approximately matched with 88, and the probability of failure in T times of execution is (1-88/2)7)TIf T is 20, the probability of failure is less than 10-10。
Obtaining the ith plaintext integer character A by using the steps (1) to (6)iCorresponding encrypted integer character BiAnd then, the circulation steps can be continuously utilized to encrypt the plaintext integer characters of other bits to obtain corresponding encrypted integer characters. In actual operation, each plaintext integer in the plaintext integer message string AM may be encrypted in bit-wise order, that is, after the ith plaintext integer character is encrypted, the (i + 1) th plaintext integer character is continuously encrypted. But the encryption order may be determined not in this order but in another customized order, or randomly.
If each plaintext integer character is successfully encrypted, the encrypted integer character corresponding to each plaintext integer character can be obtained after n encryption cycles, and n encrypted integer characters are recorded in total. This application is to pair A in turn1、A2……AnThe sequence of encryption is taken as an example, and the round robin encryption process is described as the following example:
in pair A1When encryption is performed, it is detected that the sub-key buffer is empty, and four bytes of sub-keys are generated in the sub-key buffer by using the ancestry algorithm and are respectively marked as a sub-key 1, a sub-key 2, a sub-key 3 and a sub-key 4. And taking the sub-key 1 as the first target sub-key, wherein three sub-keys are left in the sub-key buffer. Get subkey 1 low
Figure BDA0002442819190000081
Bit as encryption key pair A1Encrypted to obtain A1Corresponding encrypted integer character B1。
Continue to pair A2Encrypting, detecting that a sub-key 2, a sub-key 3 and a sub-key 4 are left in the sub-key buffer at the moment, taking the sub-key 2 out of the sub-key buffer as a first target sub-key, taking two sub-keys left in the sub-key buffer at the moment, and taking the lower part of the sub-key 2
Figure BDA0002442819190000082
Bit as encryption key pair A2And if the encrypted alternative character obtained by encryption is not contained in the integer character set Z, discarding the sub-key 2, selecting a new sub-key 3 from the sub-key buffer area as a first target sub-key, and leaving a sub-key 4 in the sub-key buffer area. Get subkey 3 low
Figure BDA0002442819190000091
Bit as encryption key to re-pair A2Encrypted to obtain A2Corresponding encrypted integer character B2. The rest are analogized in turn to carry out encryption, and finally B is obtained1、B2……Bn。
6. Obtaining an encrypted integer message string BM ═ B consisting of n-bit encrypted integer characters after obtaining the n-bit encrypted integer characters1||B2||B3……||BnWherein the ith bit encrypts an integer character BiFrom the second in the plaintext integer message string AMi-bit plaintext integer character AiThe encryption is obtained, and each encrypted integer character in the encrypted integer message string BM is contained in the integer character set Z, i.e. any Bi∈Z。
Mapping the encrypted integer message string BM to a Beidou short message ciphertext YM by using a one-to-one mapping relation between the effective character set C and the integer character set Z, and specifically, mapping the ith encrypted integer character B in the encrypted integer message string BMiMapped as the ith ciphertext character Y in the Beidou short message ciphertext YMi. Therefore, the mapped Beidou short message ciphertext comprises n-bit ciphertext characters, and the Beidou short message ciphertext can be expressed as YM (YM ═ Y)1||Y2||Y3……||YnWherein Y isiFrom BiAnd (6) mapping. Each bit of ciphertext character in the Beidou short message ciphertext YM is contained in the effective character set C, namely any Yi∈C。
Second, the big dipper short message decryption method based on grand dashing's algorithm, this decryption method is the reverse processing procedure of the encryption method of the above-mentioned first part, the meaning of the same parameter is the same, the concrete processing method is similar to while encrypting too, therefore this application does not describe the technical details therein in detail again, please refer to the flow chart shown in fig. 2, the decryption method mainly includes the following steps:
1. obtaining Beidou short message ciphertext YM ═ Y1||Y2||Y3……||YnThe Beidou short message ciphertext YM comprises n-bit ciphertext characters, and each bit ciphertext character is contained in an effective character set C of the Beidou short message protocol, namely any Yi∈C。
2. Mapping the Beidou short message ciphertext to an encrypted integer message string BM by using a one-to-one mapping relation between each character in the effective character set C and each character in a preset integer character set Z, and specifically, mapping an ith ciphertext character Y in the Beidou short message ciphertext YM to obtain an encrypted integer message string BMiMapped as the ith encrypted integer character B in the encrypted integer message string BMiTherefore, the mapped encrypted integer message string BM includes n-bit encrypted integer characters, and the encrypted integer message string BM may be represented as BM ═ B1||B2||B3……||BnIn which B isiFrom YiAnd (6) mapping. Each encrypted integer character in the encrypted integer message string BM is contained in an integer character set Z, i.e. optionally Bi∈Z。
3. According to the requirements of GMT 0001 + 2012 ' Suchong ' sequence cipher algorithm '. The grand-rush algorithm is initialized with a 128-bit initialization vector IV and a 128-bit initial KEY, and the subkey buffer is initialized to empty. In the same communication system, the initialization vector IV and the initial KEY used in the encryption process and the decryption process are the same.
4. Decrypting each encrypted integer character in the encrypted integer message string BM by using the ancestry algorithm, and for any ith encrypted integer character B in the encrypted integer message string BMiPair B is decrypted byiThe specific process of decryption is as follows:
(1) the number of times of initialization key failure ctr is 0.
(2) Acquiring a decryption key generated based on grandfather's algorithm, specifically: it is first detected whether at least one subkey is present in the subkey buffer. And if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as a second target sub-key. If the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the ancestry algorithm, and one byte of the subkeys is taken out to be used as a second target subkey. The selection is performed in the same manner as described above for the first target sub-key.
After a byte of the second target subkey is fetched, the subkey buffer is decremented by one byte. Choose low of second target subkey
Figure BDA0002442819190000101
The bits serve as the decryption key ks 2.
(3) Encrypting the integer character B using the obtained decryption key ks2 and the ith bitiGenerating a decrypted candidate character hi. The method also adopts a bitwise exclusive-OR mode to obtain the decrypted alternative wordSymbol hiThat is to say
Figure BDA0002442819190000102
(4) Judging and decrypting alternative character hiWhether it is contained in the integer character set Z, i.e. whether h is satisfiedi∈Z。
(5) If decrypt the alternative character hiContained in the integer character set Z, i.e. satisfying hi∈ Z, determining the decrypted alternative character hiI.e. the ith bit encrypted integer character BiCorresponding plaintext integer character Ai。
(6) If decrypt the alternative character hiNot provided for in the integer character set Z, i.e.
Figure BDA0002442819190000103
It is detected whether the key failure time ctr reaches the failure time threshold T at this time. If the key failure times ctr do not reach the failure time threshold T, accumulating the key failure times, that is, making ctr equal to ctr +1, discarding the current decryption key, returning to step (2) to obtain a new decryption key, and repeating the above-mentioned cycle for B by using the new decryption keyiDecryption is performed. And if the key failure times ctr reach the failure time threshold T, directly returning a decryption error.
5. Obtaining plaintext integer characters corresponding to each encrypted integer character to obtain plaintext integer message string AM (A) formed by n plaintext integer characters1||A2||A3……||AnWherein the ith plaintext integer character AiEncrypting the integer character B by the ith bitiDecrypted and each plaintext integer character in the plaintext integer message string AM is contained in the integer character set Z, namely any Ai∈Z。
Mapping the plaintext integer message string AM into the Beidou short message plaintext XM by using a one-to-one mapping relation between the effective character set C and the integer character set Z, and specifically, mapping the ith plaintext integer character A in the plaintext integer message string AM into the Beidou short message plaintext XMiMapped as ith plaintext character X in Beidou short message plaintext XMi. Thus mappingThe obtained Beidou short message plaintext XM comprises n-bit plaintext characters and can be expressed as XM ═ X1||X2||X3……||XnWherein X isiFrom AiAnd (6) mapping. Each plaintext character in Beidou short message plaintext XM is contained in an effective character set C, namely any Xi∈C。
Thirdly, the Beidou short message encryption and decryption communication system based on grand dashing algorithm uses the encryption method of the first part and the decryption method of the second part, please refer to the system structure diagram shown in fig. 3. The system comprises a scheduling module, an encryption and decryption module and a transceiver module, wherein the scheduling module is respectively connected with the encryption and decryption module and the transceiver module. The system also comprises an IO module and a coding and decoding module which are connected with the scheduling module. The working process of the system is as follows:
when the system sends signals: the scheduling module acquires short message information to be sent input by a user through the IO module and sends the short message information to the coding and decoding module to be coded to generate a corresponding Beidou short message plaintext XM. The scheduling module sends the Beidou short message plaintext XM to the encryption and decryption module, and the encryption and decryption module encrypts the Beidou short message plaintext XM by adopting the encryption method of the first part to obtain a corresponding Beidou short message ciphertext YM and then returns the Beidou short message ciphertext YM to the scheduling module. And the scheduling module sends the Beidou short message ciphertext YM to the outside through the transceiver module.
The system, upon receiving a signal: the scheduling module receives the Beidou short message ciphertext YM through the transceiver module and sends the Beidou short message ciphertext YM to the encryption and decryption module, and the encryption and decryption module executes the decryption method of the second part to decrypt the Beidou short message ciphertext YM to obtain a corresponding Beidou short message plaintext XM and then returns the corresponding Beidou short message plaintext XM to the scheduling module. The Beidou short message plain text XM decrypted by the scheduling module is sent to the coding and decoding module, the coding and decoding module decodes the Beidou short message plain text XM to generate corresponding short message information and then returns the short message information to the scheduling module, and the scheduling module displays the short message information through the IO module.
The present application further provides an encryption and decryption module, where the encryption and decryption module includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the encryption method of the first part and/or the steps of the decryption method of the second part when executing the computer program.
The application further provides a computer-readable storage medium, wherein at least one instruction is stored in the computer-readable storage medium, and the at least one instruction is loaded by at least one processor and executed to implement the Beidou short message encryption method of the first part and/or the Beidou short message decryption method of the second part. The computer-readable storage medium may be implemented as Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
What has been described above is only a preferred embodiment of the present application, and the present invention is not limited to the above embodiment. It is to be understood that other modifications and variations directly derivable or suggested by those skilled in the art without departing from the spirit and concept of the present invention are to be considered as included within the scope of the present invention.

Claims (10)

1. A big Dipper short message encryption method based on ZUchong algorithm is characterized by comprising the following steps:
obtaining Beidou short message plaintext to be encrypted, wherein the Beidou short message plaintext comprises n plaintext characters, and each plaintext character is contained in an effective character set of a Beidou short message protocol;
mapping the Beidou short message plain text into a plain text integer message string by utilizing a one-to-one mapping relation between each character in the effective character set and each character in a preset integer character set, wherein the plain text integer message string comprises n bits of plain text integer characters, each bit of plain text integer character is contained in the integer character set, the ith bit of plain text integer character in the plain text integer message string is obtained by mapping the ith bit of plain text character in the Beidou short message plain text, and i is more than or equal to 1 and less than or equal to n;
initializing grandpa's algorithm, acquiring an encryption key generated based on grandpa's algorithm for any ith plaintext integer character in the plaintext integer message string, and generating an encrypted alternative character by using the encryption key and the ith plaintext integer character, wherein if the encrypted alternative character is contained in the integer character set, the encrypted alternative character is determined to be an encrypted integer character corresponding to the ith plaintext integer character; if the encrypted alternative character is not contained in the integer character set, acquiring a new encryption key, and executing the step of generating the encrypted alternative character by using the encryption key and the ith plaintext integer character by using the new encryption key;
obtaining an encrypted integer message string consisting of n encrypted integer characters after determining the encrypted integer character corresponding to each plaintext integer character, and mapping the encrypted integer message string into a Beidou short message ciphertext by using a one-to-one mapping relation between the effective character set and the integer character set, wherein the Beidou short message ciphertext comprises the n encrypted integer characters, and the ith encrypted integer character in the Beidou short message ciphertext is obtained by mapping the ith encrypted integer character in the encrypted integer message string.
2. The Beidou short message encryption method according to claim 1, wherein the obtaining of the encryption key generated based on grand rush algorithm comprises:
taking out a sub-key of one byte from a sub-key buffer area as a first target sub-key, wherein the sub-key buffer area comprises a plurality of bytes of sub-keys generated by using a ZUZW algorithm, and one byte is reduced after the first target sub-key is taken out;
choose low of the first target subkey
Figure FDA0002442819180000011
Using bits as the encryption key, wherein r is the number of characters and symbols in the effective character set of the Beidou short message protocol
Figure FDA0002442819180000012
Indicating rounding up.
3. The beidou short message encryption method of claim 2, wherein when initializing the subkey buffer to be empty when initializing grand dashing algorithm, the selecting a byte subkey from the subkey buffer as the first target subkey comprises:
detecting whether at least one sub-key exists in the sub-key buffer area;
if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as the first target sub-key;
if the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the grandfather algorithm, and one byte of the subkeys is taken out to be used as the first target subkey.
4. The Beidou short message encryption method according to any one of claims 1 to 3, characterized in that for any ith plaintext integer character in the plaintext integer message string, the method further comprises initializing a key for 0 times of failure; said step of re-executing said step of obtaining an encryption key generated based on grandpa's algorithm and generating an encrypted alternative character using said encryption key and the ith plaintext integer character comprises:
if the encrypted alternative characters are not contained in the integer character set, detecting whether the failure times of the key reach a failure time threshold value;
if the failure times of the secret key do not reach the failure time threshold value, accumulating the failure times of the secret key once, abandoning the steps of using the encryption secret key, re-executing the steps of obtaining the encryption secret key generated based on the ancestor algorithm and generating an encryption alternative character by using the encryption secret key and the ith plaintext integer character;
and if the failure times of the key reach the failure time threshold value, returning an encryption error.
5. A big Dipper short message decryption method based on ZUchong's algorithm is characterized by comprising the following steps:
obtaining a Beidou short message ciphertext, wherein the Beidou short message ciphertext comprises n-bit ciphertext characters, and each ciphertext character is contained in an effective character set of a Beidou short message protocol;
mapping the Beidou short message ciphertext into an encrypted integer message string by utilizing a one-to-one mapping relation between each character in the effective character set and each character in a preset integer character set, wherein the encrypted integer message string comprises n encrypted integer characters, each encrypted integer character is contained in the integer character set, the ith encrypted integer character in the encrypted integer message string is obtained by mapping the ith ciphertext character in the Beidou short message ciphertext, and i is more than or equal to 1 and less than or equal to n;
initializing grandpa's algorithm, acquiring a decryption key generated based on grandpa's algorithm for any ith encrypted integer character in the encrypted integer message string, and generating a decrypted alternative character by using the decryption key and the ith encrypted integer character, wherein if the decrypted alternative character is contained in the integer character set, the decrypted alternative character is determined to be a plaintext integer character corresponding to the ith encrypted integer character; if the decrypted optional character is not contained in the integer character set, acquiring a new decryption key, and executing the step of generating the decrypted optional character by using the decryption key and the ith bit encrypted integer character by using the new decryption key;
obtaining a plaintext integer message string formed by n plaintext integer characters after determining a plaintext integer character corresponding to each encrypted integer character, and mapping the plaintext integer message string into Beidou short message plaintext by using a one-to-one mapping relation between the effective character set and the integer character set, wherein the Beidou short message plaintext comprises the n plaintext characters, and the ith plaintext character in the Beidou short message is obtained by mapping the ith plaintext integer character in the plaintext integer message string.
6. The Beidou short message decryption method of claim 5, wherein the obtaining of the decryption key generated based on grandpa's algorithm comprises:
taking out a sub-key of one byte from a sub-key buffer area as a second target sub-key, wherein the sub-key buffer area comprises a plurality of bytes of sub-keys generated by using a ZUZW algorithm, and one byte is reduced after the second target sub-key is taken out;
choose low of the second target subkey
Figure FDA0002442819180000031
Using bits as the decryption key, wherein r is the number of characters and symbols in the effective character set of the Beidou short message protocol
Figure FDA0002442819180000032
Indicating rounding up.
7. The beidou short message decryption method of claim 6, wherein when initializing the subkey buffer to be empty when initializing grand dashing algorithm, the method of taking out a byte subkey from the subkey buffer as a second target subkey comprises:
detecting whether at least one sub-key exists in the sub-key buffer area;
if at least one sub-key exists in the sub-key buffer area, directly taking out a sub-key of one byte from the sub-key buffer area as the second target sub-key;
if the subkey does not exist in the subkey buffer, four bytes of subkeys are generated in the subkey buffer by using the grandfather algorithm, and one byte of the subkeys is taken out to be used as the second target subkey.
8. The Beidou short message decryption method according to any one of claims 5 to 7, wherein for any ith bit encrypted integer character in the encrypted integer message string, the method further comprises initializing a key with a failure frequency of 0; said step of re-executing said step of obtaining a decryption key generated based on grandchild's algorithm and generating a decrypted alternative character using said decryption key and the ith encrypted integer character comprises:
if the decryption alternative characters are not contained in the integer character set, detecting whether the failure times of the key reach a failure time threshold value;
if the key failure times do not reach the failure time threshold value, accumulating the key failure times once, abandoning the decryption key, re-executing the steps of obtaining the decryption key generated based on the grandfather algorithm and generating a decryption alternative character by utilizing the decryption key and the ith encrypted integer character;
and if the failure times of the key reach the failure time threshold value, returning a decryption error.
9. A big Dipper short message encryption and decryption communication system based on ZUchong's algorithm is characterized in that the big Dipper short message encryption and decryption system comprises a scheduling module, an encryption and decryption module and a receiving and sending module, wherein the scheduling module is respectively connected with the encryption and decryption module and the receiving and sending module;
when the Beidou short message encryption and decryption communication system sends a signal, the scheduling module sends Beidou short message plaintext to the encryption and decryption module, the encryption and decryption module executes the Beidou short message encryption method according to any one of claims 1 to 4 to encrypt the Beidou short message plaintext to generate corresponding Beidou short message ciphertext, and the scheduling module sends the Beidou short message ciphertext through the transceiving module;
when the Beidou short message encryption and decryption communication system receives signals, the scheduling module receives Beidou short message ciphertexts through the transceiving module and sends the Beidou short message ciphertexts to the encryption and decryption module, and the encryption and decryption module executes the Beidou short message decryption method according to any one of claims 5 to 8 to decrypt the Beidou short message ciphertexts to obtain corresponding Beidou short message plaintexts.
10. The beidou short message encryption and decryption communication system of claim 9, further comprising an IO module and an encoding and decoding module respectively connected to the scheduling module, so that:
when the Beidou short message encryption and decryption communication system sends a signal, the scheduling module acquires short message information to be sent through the IO module and sends the short message information to the coding and decoding module to be coded to generate a corresponding Beidou short message plaintext, and then the Beidou short message plaintext is sent to the encryption and decryption module;
when the Beidou short message encryption and decryption communication system receives signals, the scheduling module decrypts through the encryption and decryption module to obtain Beidou short message plaintext, and then the Beidou short message plaintext generated is decoded through the encoding and decoding module to generate corresponding short message information and sent to the IO module for display.
CN202010270026.3A 2020-04-08 2020-04-08 Beidou short message encryption and decryption method based on ancestor algorithm and communication system Active CN111465006B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010270026.3A CN111465006B (en) 2020-04-08 2020-04-08 Beidou short message encryption and decryption method based on ancestor algorithm and communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010270026.3A CN111465006B (en) 2020-04-08 2020-04-08 Beidou short message encryption and decryption method based on ancestor algorithm and communication system

Publications (2)

Publication Number Publication Date
CN111465006A true CN111465006A (en) 2020-07-28
CN111465006B CN111465006B (en) 2022-08-30

Family

ID=71681411

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010270026.3A Active CN111465006B (en) 2020-04-08 2020-04-08 Beidou short message encryption and decryption method based on ancestor algorithm and communication system

Country Status (1)

Country Link
CN (1) CN111465006B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112003859A (en) * 2020-08-21 2020-11-27 江苏徐工工程机械研究院有限公司 Data encryption method and device and data decryption method and device
CN114189854A (en) * 2021-04-13 2022-03-15 贵阳永青仪电科技有限公司 Tower footing safety monitoring terminal based on Beidou communication and 4G communication and data transmission method
CN114339632A (en) * 2021-12-15 2022-04-12 贵州航天计量测试技术研究所 SM4 packet encryption algorithm-based Beidou short message encryption and decryption method
CN116192365A (en) * 2023-01-18 2023-05-30 无锡航天江南数据系统科技有限公司 PPP-B2B signal transmission method and system based on text service system

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105873033A (en) * 2016-05-16 2016-08-17 北京鼎合信安科技有限公司 Encryption and decryption method for short message communication
CN109995531A (en) * 2018-12-18 2019-07-09 中国民航大学 The anti-deception measures of Beidou II system protected based on domestic password and spread spectrum information
CN110445601A (en) * 2019-07-19 2019-11-12 北京三未信安科技发展有限公司 Zu Chongzhi's Encryption Algorithm accelerating method, system, storage medium and computer equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105873033A (en) * 2016-05-16 2016-08-17 北京鼎合信安科技有限公司 Encryption and decryption method for short message communication
CN109995531A (en) * 2018-12-18 2019-07-09 中国民航大学 The anti-deception measures of Beidou II system protected based on domestic password and spread spectrum information
CN110445601A (en) * 2019-07-19 2019-11-12 北京三未信安科技发展有限公司 Zu Chongzhi's Encryption Algorithm accelerating method, system, storage medium and computer equipment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
周一廷: "北斗卫星导航系统短报文加密技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
张舒黎等: "北斗短报文通信安全研究", 《通信技术》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112003859A (en) * 2020-08-21 2020-11-27 江苏徐工工程机械研究院有限公司 Data encryption method and device and data decryption method and device
CN114189854A (en) * 2021-04-13 2022-03-15 贵阳永青仪电科技有限公司 Tower footing safety monitoring terminal based on Beidou communication and 4G communication and data transmission method
CN114189854B (en) * 2021-04-13 2024-04-02 贵阳永青智控科技股份有限公司 Tower foundation safety monitoring terminal based on Beidou communication and 4G communication and data transmission method
CN114339632A (en) * 2021-12-15 2022-04-12 贵州航天计量测试技术研究所 SM4 packet encryption algorithm-based Beidou short message encryption and decryption method
CN114339632B (en) * 2021-12-15 2023-07-07 贵州航天计量测试技术研究所 Beidou short message encryption and decryption method based on SM4 packet encryption algorithm
CN116192365A (en) * 2023-01-18 2023-05-30 无锡航天江南数据系统科技有限公司 PPP-B2B signal transmission method and system based on text service system
CN116192365B (en) * 2023-01-18 2024-03-22 无锡航天江南数据系统科技有限公司 PPP-B2B signal transmission method and system based on text service system

Also Published As

Publication number Publication date
CN111465006B (en) 2022-08-30

Similar Documents

Publication Publication Date Title
CN111465006B (en) Beidou short message encryption and decryption method based on ancestor algorithm and communication system
US8254570B2 (en) Method and system for encryption of data
KR101600016B1 (en) method of encrypting data using Homomorphic Encryption and Computing device performing the method
US20160154970A1 (en) Method and Apparatus for Secure Communication
CN101309483B (en) Short message encoding and decoding method and terminal
CN111431716B (en) Data transmission method and device, computer equipment and storage medium
CN114339632B (en) Beidou short message encryption and decryption method based on SM4 packet encryption algorithm
CN105208028A (en) Data transmission method and related device and equipment
US8891760B2 (en) System for checking acceptance of string by automaton
ES2422868T3 (en) Procedure of converting a first encryption to a second encryption
CN113014580A (en) File transmission method and device, electronic equipment and storage medium
CN114244507A (en) Quantum direct communication method, device, equipment and system based on single-path transmission
CN116707771A (en) Communication method based on data encryption
CN101478733B (en) Method, network device and network system for short message transmission
CN117134914B (en) One-time-pad random key stream encryption algorithm and system based on hardware characteristics
CN114124359A (en) Method and device for preserving format encrypted data, electronic equipment and storage medium
CN115843360A (en) Symmetric encryption and decryption method based on exponential complexity
US20040203962A1 (en) Wireless human interface and other attached device data encryption through bi-directional RF link
KR20180081469A (en) Information security system through encrypting and decrypting personal data and contents in smart device based on Lightweight Encryption Algorithm, method thereof and computer recordable medium storing program to perform the method
CN117439744A (en) Service data transmission method and device based on service security level
KR101632651B1 (en) Method, server and computer program for transmitting binary data
CN111064560B (en) Data encryption transmission method and device, terminal and data encryption transmission system
CN111654362A (en) Improved method of WEP encryption algorithm
KR101739039B1 (en) Method, server and computer program for transmitting binary data
CN114785484B (en) Big data safety transmission method and system

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