CN113852956A - Encryption type transmission method for digital information transmission based on 5G network - Google Patents
Encryption type transmission method for digital information transmission based on 5G network Download PDFInfo
- Publication number
- CN113852956A CN113852956A CN202111139857.8A CN202111139857A CN113852956A CN 113852956 A CN113852956 A CN 113852956A CN 202111139857 A CN202111139857 A CN 202111139857A CN 113852956 A CN113852956 A CN 113852956A
- Authority
- CN
- China
- Prior art keywords
- key
- stream
- encryption
- digital information
- network
- 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
Links
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]
- H04W12/041—Key generation or derivation
-
- 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)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
Abstract
The invention discloses an encryption type transmission method for digital information transmission based on a 5G network, which aims to solve the technical problems that an information source and a channel are not coded in the prior art, so that error codes are generated in a transmission data stream, a receiving end generates phenomena of image jumping, discontinuity and the like, and the error correction capability and the anti-jamming capability are poor. The method comprises the following steps of S1: source coding the source to reduce or eliminate redundancy of data; s11: the source symbol set a = a1, a2,
a total of N symbols, and aN input signal source symbol sequence of U = (U1, U2,
uL); s12: at the ith step, the encoder is driven from
1 starting with the first symbol after the phrase and searching backwards for the shortest phrase never before appearing
Description
Technical Field
The invention belongs to the technical field of digital information transmission, and particularly relates to an encryption type transmission method for digital information transmission based on a 5G network.
Background
The 5G network communication technology is one of the most advanced network communication technologies in the world at present, the improvement on the transmission speed has great advantages in practical application, and the 5G network communication technology can perform stable transmission in different scenes and can adapt to various complex scenes, so that the condition that the transmission time is too long or the transmission is unstable due to the complex scenes of the working environment is avoided, and the working efficiency of workers is greatly improved.
At present, the invention patent with patent number CN202011494138.3 discloses an industrial network security encryption processing method based on 5G communication technology, which includes the following steps: s1, encoding and decoding the data by adopting an industrial data encoding and decoding chip, and completing data scheduling and multi-mode self-adaptive transmission; s2, encrypting and decrypting the data in real time through an encryption algorithm, and updating the key and the initialization vector of the key stream generator by the key updating module according to the initial key generated by the software; the encryption algorithm adopts a 128-bit key and a 96-bit initialization vector IV, and the internal state is 256 bits; the encryption algorithm is mainly composed of a Linear Feedback Shift Register (LFSR), a Nonlinear Feedback Shift Register (NFSR) and a pre-output function. The method adopts a stream encryption algorithm to ensure the safety of a stream encryption system, but the method does not encode an information source and a channel, so that error codes can be generated in a transmission data stream, the phenomenon of image jump, discontinuity and the like can be generated at a receiving end, and the error correction capability and the anti-jamming capability are poor.
Therefore, in order to solve the problem of poor error correction capability and interference resistance of the transmission method, it is necessary to improve the use scenario of the transmission method.
Disclosure of Invention
(1) Technical problem to be solved
Aiming at the defects of the prior art, the invention aims to provide an encryption type transmission method for transmitting digital information based on a 5G network, which aims to solve the technical problems that in the prior art, an information source and a channel are not coded, so that error codes are generated in a transmission data stream, a receiving end generates phenomena of image jump, discontinuity and the like, and the error correction capability and the anti-jamming capability are poor.
(2) Technical scheme
In order to solve the above technical problem, the present invention provides an encryption type transmission method for transmitting digital information based on a 5G network, comprising the steps of:
s1: source coding the source to reduce or eliminate redundancy of data;
s2: inputting plaintext digital information, and setting a plaintext stream as follows:
=
；
s3: the keystream is generated by a keystream generator f:
=f（K，
) The pre-installed RC4 algorithm in the key stream generator uses an S table to generate the stream key, and the length of the original key K is 1 byte
256 bytes, S Table is an array of size 256, denoted S [0 ]]
S[255]Wherein each S table cell is capable of storing one byte;
s31: generating an S table by using an original key through a key scheduling algorithm;
s32: a pseudo-random number generation algorithm utilizes the S table to generate a stream key sequence;
s4: encryption: the key stream generated by the key stream generator is
=
Plain text stream
=
，
Is encrypted and transformed
=
Obtaining a ciphertext stream C =
；
S5: channel coding: the source outputs a series of binary 0's and 1's, which are divided into fixed-length message blocks, each denoted as M, consisting of k bits of information, and generates an n-dimensional vector according to an approximately bottom-triangular method, which is a codeword of M, the codeword bit C corresponding to the information M, where C = [ C0, C1,
，c（n-1）]then k linearly independent codewords g0, g1,
g (k-1) such that C = m0 g0+ m1 g1+
+ m (k-1) g (k-1), in C, the information bits are unchanged, the check bits are appended after the information bits, and the writing in matrix form is: c = M × G, and n-k n-dimensional linearly independent vectors h0, h1,
h (n-k-1) production of C
Thus for any i, hi CT =0, the form written as a matrix is H CT = 0;
s6: digital modulation: relative phase
Defined as the difference between the initial phase of the present symbol and the initial phase of the previous symbol,
absolute code is encoded by a differential encoding circuit according to a calculation formula
Becomes a relative code
；
S7, modulation and demodulation: calculating the sampling point in each code element stable region according to the formula II =
And the calculation formula three Q =
DFT is carried out, and then phase jump information of front and back code elements is extracted
To make a demodulation decision: computing
And is determined according to the positive and negative conditions of Q and I
The phase of the code element is recorded as
The phase of the previous symbol is noted
Then, then
；
S8: channel decoding: will be provided with
，
Sending the data into a sub-decoding module 1, decoding the data by the sub-decoding module 1 according to the SOVA decoding algorithm, and generating reliability information
，
Obtained after treatment
As soft input of the sub-decoding module 2, the sub-decoding module 2 generates reliability information according to the SOVA decoding algorithm
，
After treatment, obtain
，
And
the soft input of the sub-decoding module 1 is used together, the reliability information is obtained again after the sub-decoding module 1 decodes the soft input and is sent to the sub-decoding module 2, the operation is circulated until the decoding performance is not improved any more, and the output of the sub-decoding module 2 is processed and then is carried outHard decision, the result of which is the final output of the decoder;
s9: output end pair ciphertext stream C =
Through calculation
=
To obtain a plaintext string
=
。
Preferably, the specific steps of S1 are:
s11: the source symbol set a = a1, a2,
a total of N symbols, and aN input signal source symbol sequence of U = (U1, U2,
，uL）；
s12: at the ith step, the encoder is driven from
1 starting with the first symbol after the phrase and searching backwards for the shortest phrase never before appearing
To make a phrase
Added to the ith segment of the dictionary, because
In the dictionary at this timeShortest new phrase, therefore
The prefix obtained after the removal of the last symbol x must have occurred before in the dictionary;
s13: if the prefix is assumed to occur at step j (< i), then the pair
Using j and
the last bit, denoted by symbol x, is the codeword (j, x), for segment number j, at most [ logic ] is needed]bit represents, and the symbol x only needs [ logK]bit, if the total number of phrases in the dictionary of the encoding monkey is M (U), the total length of the code stream output by the encoding monkey with the U sequence is ([ logic)] +[logK]）。
Preferably, in said S3
Is the state of the memory element in the encryptor at time i, f is the sum of the secret keys K and
the resulting function.
Preferably, the specific steps of S3 are:
s311: filling each unit of the S table from 0-255 according to the number, namely S [0 ]]=0，S[1]=1，
，S[255]=255, then establishing a temporary array T, called T-table, whose size is the same as that of S-table, filling the T-table with the original key K, if the length of K is equal to 256, directly assigning K to the T-table, if the length of K is less than 256, then the remaining part of the T-table continues to be circularly filled with the key K until the T-table is filled, assuming that the key K =123 and the length of the T-table is 7, then the T-table = 1231231;
s312: a variable j =0 is initialized for the unit exchange position in the S table, then j = (j + S [ i ] + T [ i ]) mod256 is calculated for the ith unit in the S table, j in brackets is the j value calculated last time, and the positions of S [ i ] and S [ j ] are exchanged after j is calculated each time.
Preferably, the specific steps of S32 are: s321: firstly, initializing two variables i =0, j =0, before generating a key stream of one byte each time, i is increased by 1, i = (i + 1) mod256, j is added with S [ i ] by itself, j = (j + S [ i ]) mod256, the values of S [ i ] and S [ j ] are added and exchanged, the S table is disordered, and the key stream of one byte is output, wherein the key stream is taken from the S [ i ] + S [ j ] th unit of the S table;
s322: s221 is repeated to generate a key stream sequence of a plurality of bytes.
Preferably, in said S4
、
、
Is a function of the encryption that is to be performed,
、
、
is its inverse transformation.
Preferably, M = [ M0, M1 in S5,
，m（k-1）]g is a matrix of k rows and n columns, and H is a matrix of (n-k) rows and n columns.
Preferably, the first calculation formula in S6 is
。
Preferably, N in S7 represents the number of sampling points in each carrier period, N represents the number of sampling points in the stable region used in DFT,
is the phase added when the bit synchronization point adjustment is performed.
Preferably, the output processing mode of the neutron decoding module 2 in S8 is reverse interleaving.
(3) Advantageous effects
Compared with the prior art, the invention has the beneficial effects that: the method of the invention adopts the key stream generator to generate stream cipher, carries out XOR processing on the plaintext and the key to obtain the ciphertext, has high encryption speed, can disturb the statistical property of the plaintext, improves the safety of digital information, utilizes the coding of a channel to solve the problems of interference and fading of mobile communication and error in the signal transmission process, enhances the capability of resisting various interferences when data is transmitted in the channel, improves the reliability of a system, compresses data by utilizing information source coding, converts an analog signal of the information source into a digital signal, realizes the digital transmission of the analog signal, reduces or eliminates the redundancy of the information source and improves the communication effectiveness.
Detailed Description
In order to make the technical means, the original characteristics, the achieved purposes and the effects of the invention easily understood and obvious, the technical solutions in the embodiments of the present invention are clearly and completely described below to further illustrate the invention, and obviously, the described embodiments are only a part of the embodiments of the present invention, but not all the embodiments.
The specific implementation mode is an encryption type transmission method for transmitting digital information based on a 5G network, and the method comprises the following steps:
s1: source coding the source to reduce or eliminate redundancy of data;
s2: inputting plaintext digital information, and setting a plaintext stream as follows:
=
；
s3: the keystream is generated by a keystream generator f:
=f（K，
) The pre-installed RC4 algorithm in the key stream generator uses an S table to generate the stream key, and the length of the original key K is 1 byte
256 bytes, S Table is an array of size 256, denoted S [0 ]]
S[255]Wherein each S table cell is capable of storing one byte;
s31: generating an S table by using an original key through a key scheduling algorithm;
s32: a pseudo-random number generation algorithm utilizes the S table to generate a stream key sequence;
s4: encryption: the key stream generated by the key stream generator is
=
Plain text stream
=
，
Is encrypted and transformed
=
Obtaining a ciphertext stream C =
；
S5: channel coding: the source outputs a series of binary 0's and 1's, which are divided into fixed-length message blocks, each denoted as M, consisting of k bits of information, and generates an n-dimensional vector according to an approximately bottom-triangular method, which is a codeword of M, the codeword bit C corresponding to the information M, where C = [ C0, C1,
，c（n-1）]then k linearly independent codewords g0, g1,
g (k-1) such that C = m0 g0+ m1 g1+
+ m (k-1) g (k-1), in C, the information bits are unchanged, the check bits are appended after the information bits, and the writing in matrix form is: c = M × G, and n-k n-dimensional linearly independent vectors h0, h1,
h (n-k-1) production of C
Thus for any i, hi CT =0, the form written as a matrix is H CT = 0;
s6: digital modulation: relative phase
Defined as the difference between the initial phase of the present symbol and the initial phase of the previous symbol,
absolute code is encoded by a differential encoding circuit according to a calculation formula
Becomes a relative code
；
S7, modulation and demodulation: calculating the sampling point in each code element stable region according to the formula II =
And the calculation formula three Q =
DFT is carried out, and then phase jump information of front and back code elements is extracted
To make a demodulation decision: computing
And is determined according to the positive and negative conditions of Q and I
The phase of the code element is recorded as
The phase of the previous symbol is noted
Then, then
；
S8: channel decoding: will be provided with
，
Sent to a sub-decoding module 1, a sub-decoding moduleBlock 1 is decoded according to the SOVA decoding algorithm and generates reliability information
，
Obtained after treatment
As soft input of the sub-decoding module 2, the sub-decoding module 2 generates reliability information according to the SOVA decoding algorithm
，
After treatment, obtain
，
And
the soft input of the sub-decoding module 1 is used together, the reliability information is obtained again after the sub-decoding module 1 decodes and is sent to the sub-decoding module 2, the operation is circulated until the decoding performance is not improved any more, the hard decision is carried out after the output of the sub-decoding module 2 is processed, and the result is the final output of the decoder;
s9: output end pair ciphertext stream C =
Through calculation
=
To obtain a plaintext string
=
。
The specific steps of S1 are as follows: s11: the source symbol set a = a1, a2,
a total of N symbols, and aN input signal source symbol sequence of U = (U1, U2,
uL); s12: at the ith step, the encoder is driven from
1 starting with the first symbol after the phrase and searching backwards for the shortest phrase never before appearing
To make a phrase
Added to the ith segment of the dictionary, because
Is the shortest new phrase in the dictionary at this time, so
The prefix obtained after the removal of the last symbol x must have occurred before in the dictionary; s13: if the prefix is assumed to occur at step j (< i), then the pair
Using j and
the last symbol x isCodeword (j, x), for segment number j, requires at most [ logic]bit represents, and the symbol x only needs [ logK]bit, if the total number of phrases in the dictionary of the encoding monkey is M (U), the total length of the code stream output by the encoding monkey with the U sequence is ([ logic)] +[logK]) (ii) a In S3
Is the state of the memory element in the encryptor at time i, f is the sum of the secret keys K and
the generated function, S31, includes the following steps: s311: filling each unit of the S table from 0-255 according to the number, namely S [0 ]]=0，S[1]=1，
，S[255]=255, then establishing a temporary array T, called T-table, whose size is the same as that of S-table, filling the T-table with the original key K, if the length of K is equal to 256, directly assigning K to the T-table, if the length of K is less than 256, then the remaining part of the T-table continues to be circularly filled with the key K until the T-table is filled, assuming that the key K =123 and the length of the T-table is 7, then the T-table = 1231231; s312: for the cell swap location in the S-table, a variable j =0 is initialized, and then for the ith cell of the S-table, j = (j + S [ i ] is calculated]+ T[i]) mod256, j in brackets is the value of j from the previous calculation, and after each j is calculated, S [ i ] is exchanged]And S [ j ]]The position of (a). The specific steps of S32 are: s321: first, two variables i =0, j =0 are initialized, i is incremented by 1, i = (i + 1) mod256, j is incremented by S [ i ] before each generation of a one-byte keystream]Value of (a), j = (j + S [ i)]) mod256, self-adding exchange Si]And S [ j ]]The value of (1) is to scramble the S table and output a one-byte keystream taken from the Sth [ i ] of the S table]+ S[j]A unit; s322: s221 is repeated to generate a key stream sequence of a plurality of bytes.
Meanwhile, in S4
、
、
Is a function of the encryption that is to be performed,
、
、
is the inverse transformation thereof, M = [ M0, M1 in S5,
，m（k-1）]g is a matrix of k rows and n columns, and H is a matrix of (n-k) rows and n columns.
In addition, the first calculation formula in S6 is
N in S7 represents the number of samples per carrier period, N represents the number of samples in the stable region used in DFT,
is the phase added when the bit synchronization point adjustment is performed.
In addition, the output processing mode of the sub-decoding module 2 in S8 is reverse interleaving.
Having thus described the principal technical features and basic principles of the invention, and the advantages associated therewith, it will be apparent to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, but is capable of other specific forms without departing from the spirit or essential characteristics thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Furthermore, it should be understood that although the present description is described in terms of various embodiments, not every embodiment includes only a single embodiment, and such descriptions are provided for clarity only, and those skilled in the art will recognize that the embodiments described herein can be combined as a whole to form other embodiments as would be understood by those skilled in the art.
Claims (10)
1. An encryption type transmission method for digital information transmission based on a 5G network is characterized by comprising the following steps:
s1: source coding the source to reduce or eliminate redundancy of data;
s2: inputting plaintext digital information, and setting a plaintext stream as follows:
=
；
s3: the keystream is generated by a keystream generator f:
=f（K，
) The pre-installed RC4 algorithm in the key stream generator uses an S table to generate the stream key, and the length of the original key K is 1 byte
256 bytes, S Table is an array of size 256, denoted S [0 ]]
S[255]Wherein each S table cell is capable of storing one byte;
s31: generating an S table by using an original key through a key scheduling algorithm;
s32: a pseudo-random number generation algorithm utilizes the S table to generate a stream key sequence;
s4: encryption: the key stream generated by the key stream generator is
=
Plain text stream
=
，
Is encrypted and transformed
=
Obtaining a ciphertext stream C =
；
S5: channel coding: the source outputs a series of binary 0's and 1's, which are divided into fixed-length message blocks, each denoted as M, consisting of k bits of information, and generates an n-dimensional vector according to an approximately bottom-triangular method, which is a codeword of M, the codeword bit C corresponding to the information M, where C = [ C0, C1,
，c（n-1）]then k linearly independent codewords g0, g1,
g (k-1), reactingC = m0 g0+ m1 g1+
+ m (k-1) g (k-1), in C, the information bits are unchanged, the check bits are appended after the information bits, and the writing in matrix form is: c = M × G, and n-k n-dimensional linearly independent vectors h0, h1,
h (n-k-1) production of C
Thus for any i, hi CT =0, the form written as a matrix is H CT = 0;
s6: digital modulation: relative phase
Defined as the difference between the initial phase of the present symbol and the initial phase of the previous symbol,
absolute code is encoded by a differential encoding circuit according to a calculation formula
Becomes a relative code
；
S7, modulation and demodulation: calculating the sampling point in each code element stable region according to the formula II =
And the calculation formula three Q =
DFT is carried out, and then phase jump information of front and back code elements is extracted
To make a demodulation decision: computing
And is determined according to the positive and negative conditions of Q and I
The phase of the code element is recorded as
The phase of the previous symbol is noted
Then, then
；
S8: channel decoding: will be provided with
，
Sending the data into a sub-decoding module 1, decoding the data by the sub-decoding module 1 according to the SOVA decoding algorithm, and generating reliability information
，
Obtained after treatment
As soft input of the sub-decoding module 2, the sub-decoding module 2 generates reliability information according to the SOVA decoding algorithm
，
After treatment, obtain
，
And
the soft input of the sub-decoding module 1 is used together, the reliability information is obtained again after the sub-decoding module 1 decodes and is sent to the sub-decoding module 2, the operation is circulated until the decoding performance is not improved any more, the hard decision is carried out after the output of the sub-decoding module 2 is processed, and the result is the final output of the decoder;
s9: output end pair ciphertext stream C =
Through calculation
=
To obtain a plaintext string
=
。
2. The encryption-type transmission method for digital information transmission over 5G network according to claim 1, wherein the specific steps of S1 are as follows:
s11: the source symbol set a = a1, a2,
a total of N symbols, and aN input signal source symbol sequence of U = (U1, U2,
，uL）；
s12: at the ith step, the encoder is driven from
1 starting with the first symbol after the phrase and searching backwards for the shortest phrase never before appearing
To make a phrase
Added to the ith segment of the dictionary, because
Is the shortest new phrase in the dictionary at this time, so
The prefix obtained after the removal of the last symbol x must have occurred before in the dictionary;
s13: if the prefix is assumed to occur at step j (< i), then the pair
Using j and
the last bit, denoted by symbol x, is the codeword (j, x), for segment number j, at most [ logic ] is needed]bit represents, and the symbol x only needs [ logK]bit, if the total number of phrases in the dictionary of the encoding monkey is M (U), the total length of the code stream output by the encoding monkey with the U sequence is ([ logic)] +[logK]）。
3. The encryption-type transmission method for digital information transmission over 5G network as claimed in claim 1, wherein in said S3
Is the state of the memory element in the encryptor at time i, f is the sum of the secret keys K and
the resulting function.
4. The encryption-type transmission method for digital information transmission over 5G network according to claim 1, wherein the specific steps of S31 are as follows:
s311: filling each unit of the S table from 0-255 according to the number, namely S [0 ]]=0，S[1]=1，
，S[255]=255, then establishing a temporary array T, called T-table, whose size is the same as that of S-table, filling the T-table with the original key K, if the length of K is equal to 256, directly assigning K to the T-table, if the length of K is less than 256, then the remaining part of the T-table continues to be circularly filled with the key K until the T-table is filled, assuming that the key K =123 and the length of the T-table is 7, then the T-table = 1231231;
s312: a variable j =0 is initialized for the unit exchange position in the S table, then j = (j + S [ i ] + T [ i ]) mod256 is calculated for the ith unit in the S table, j in brackets is the j value calculated last time, and the positions of S [ i ] and S [ j ] are exchanged after j is calculated each time.
5. The encryption-type transmission method for digital information transmission over 5G network according to claim 1, wherein the specific steps of S32 are as follows:
s321: firstly, initializing two variables i =0, j =0, before generating a key stream of one byte each time, i is increased by 1, i = (i + 1) mod256, j is added with S [ i ] by itself, j = (j + S [ i ]) mod256, the values of S [ i ] and S [ j ] are added and exchanged, the S table is disordered, and the key stream of one byte is output, wherein the key stream is taken from the S [ i ] + S [ j ] th unit of the S table;
s322: s221 is repeated to generate a key stream sequence of a plurality of bytes.
6. The encryption-type transmission method for digital information transmission over 5G network as claimed in claim 1, wherein in said S4
、
、
Is a function of the encryption that is to be performed,
、
、
is its inverse transformation.
7. The encryption-type transmission method for transmission of digital information over a 5G network as claimed in claim 1, wherein M = [ M0, M1 in S5,
，m（k-1）]g is a matrix of k rows and n columns, and H is a matrix of (n-k) rows and n columns.
8. Digital 5G network-based network according to claim 1An encryption type transmission method for information transmission, wherein a first calculation formula in S6 is
。
9. The encryption type transmission method for transmission of digital information based on 5G network as claimed in claim 1, wherein N in S7 represents the number of sampling points per carrier period, N represents the number of sampling points in the stable region used in DFT,
is the phase added when the bit synchronization point adjustment is performed.
10. The encryption-type transmission method for digital information transmission based on 5G network as claimed in claim 1, wherein the output of the sub-decoding module 2 in S8 is processed in an inverse-interleaving manner.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111139857.8A CN113852956B (en) | 2021-09-28 | 2021-09-28 | 5G network-based encryption type transmission method for digital information transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111139857.8A CN113852956B (en) | 2021-09-28 | 2021-09-28 | 5G network-based encryption type transmission method for digital information transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113852956A true CN113852956A (en) | 2021-12-28 |
| CN113852956B CN113852956B (en) | 2023-06-06 |
Family
ID=78980673
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111139857.8A Active CN113852956B (en) | 2021-09-28 | 2021-09-28 | 5G network-based encryption type transmission method for digital information transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113852956B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104066082A (en) * | 2014-07-04 | 2014-09-24 | 电子科技大学 | System and method for realizing MIMO cross-layer secure communication by cooperation of physical layer STTC (space time transmit time) deformable code and upper-layer key stream |
| CN112654037A (en) * | 2020-12-17 | 2021-04-13 | 安徽维德工业自动化有限公司 | Industrial network security encryption processing method based on 5G communication technology |
-
2021
- 2021-09-28 CN CN202111139857.8A patent/CN113852956B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104066082A (en) * | 2014-07-04 | 2014-09-24 | 电子科技大学 | System and method for realizing MIMO cross-layer secure communication by cooperation of physical layer STTC (space time transmit time) deformable code and upper-layer key stream |
| CN112654037A (en) * | 2020-12-17 | 2021-04-13 | 安徽维德工业自动化有限公司 | Industrial network security encryption processing method based on 5G communication technology |
Non-Patent Citations (1)
| Title |
|---|
| 鄢懿;张灿;郭振永;高绍帅;陈德元: "基于混沌密钥控制的联合信源信道与安全算术码编译码算法", vol. 38, no. 10 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113852956B (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100362458B1 (en) | Cryptographic processing apparatus, cryptographic processing method, and recording medium recording cryptographic processing program for realizing high-speed crypographic processing without impairing security | |
| US8983069B2 (en) | System and method for counter mode encrypted communication with reduced bandwidth | |
| US6125182A (en) | Cryptographic engine using logic and base conversions | |
| CN110677237A (en) | File encryption method with chaos-like characteristic | |
| CN108809626A (en) | A kind of whitepack SM4 cryptographic algorithms scheme and system | |
| CN116032474B (en) | Safety protection system based on big data computer network | |
| KR20020016620A (en) | Method for encrypting information and device for realization of the method | |
| CN109981249B (en) | Encryption and decryption method and device based on zipper type dynamic hash and NLFSR | |
| CN113810172B (en) | Low-redundancy encryption method and system for polarization code quantum noise stream physical layer | |
| US6125183A (en) | Cryptosystem for optical storage | |
| Cohen et al. | AES as error correction: Cryptosystems for reliable communication | |
| WO2000070818A1 (en) | Multiple number base encoder/decoder using corresponding xor | |
| Bagheri et al. | A joint encryption, channel coding and modulation scheme using QC-LDPC lattice-codes | |
| CN113852956B (en) | 5G network-based encryption type transmission method for digital information transmission | |
| Mihaljević et al. | A wire-tap approach to enhance security in communication systems using the encoding-encryption paradigm | |
| CN114553393A (en) | Chinese character encryption method based on hierarchical shift | |
| CN101262334A (en) | Encryption method for Bluetooth data transmission | |
| CN110581759A (en) | UOEC-HEX symmetric encryption algorithm | |
| EP3654576A1 (en) | Computer-implemented method for error-correction-encoding and encrypting of a file | |
| EP1193904B1 (en) | Transmission method to assure data confidentiality. | |
| JP3154991B2 (en) | Cryptographic processing device, cryptographic processing method, and storage medium storing cryptographic processing program | |
| CN114244552B (en) | Data encryption transmission method and device based on block chain | |
| Challa et al. | Towards the Construction of Reed-Muller Code Based Symmetric Key FHE. | |
| Bagheri et al. | A Lattice Based Joint Encryption, Encoding and Modulation Scheme | |
| Das et al. | Combined Substitution-Box Based AES Algorithm for Low Power and High Speed Crypto-Coder 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 |