CN112332977B - Encryption transmission method under multi-channel transmission scene - Google Patents

Encryption transmission method under multi-channel transmission scene Download PDF

Info

Publication number
CN112332977B
CN112332977B CN202011223377.5A CN202011223377A CN112332977B CN 112332977 B CN112332977 B CN 112332977B CN 202011223377 A CN202011223377 A CN 202011223377A CN 112332977 B CN112332977 B CN 112332977B
Authority
CN
China
Prior art keywords
data
channel
transmission
sequence
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.)
Active
Application number
CN202011223377.5A
Other languages
Chinese (zh)
Other versions
CN112332977A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202011223377.5A priority Critical patent/CN112332977B/en
Publication of CN112332977A publication Critical patent/CN112332977A/en
Application granted granted Critical
Publication of CN112332977B publication Critical patent/CN112332977B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • 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)
  • Communication Control (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to an encryption transmission method under a multi-channel transmission scene, and belongs to the technical field of communication transmission. The method comprises the following steps: s1: establishing connection: a sender sends an initialization data packet from any channel to establish connection; s2: data transmission: the method comprises the steps of data transmission and data reception; the data transmission comprises data blocking and encryption; the data blocking includes: partitioning the encrypted data by using a random sequence, and adjusting the partitioned data according to the difference of channel quality; s3: the transmission is ended. In the data packet transmission process, the preamble data comprises the key of the next sequence data, so the decryption process must be carried out in sequence from the beginning of data transmission, and the difficulty of decryption after data monitoring is increased.

Description

Encryption transmission method under multi-channel transmission scene
Technical Field
The invention belongs to the technical field of communication transmission, and relates to an encryption transmission method in a multi-channel transmission scene.
Background
Most of the current common encryption methods are directed to single channel transmission, and in some special communication scenarios, there are multiple independent physical channels available between the transceiving ends of data communication. The independent characteristics of the channels are utilized to transmit the sending data in a block transmission mode, and the data transmitted by a single channel does not contain complete original information. Therefore, the multi-channel transmission method can ensure that the original data cannot be recovered under the condition that the single channel is monitored, thereby improving the data security. No disclosure is made about a channel encryption scheme in multi-channel transmission.
Disclosure of Invention
In view of this, an object of the present invention is to provide an encryption transmission method in a multi-channel transmission scenario, which improves the confidentiality of multi-channel transmission data and increases the difficulty of cracking after data monitoring.
In order to achieve the purpose, the invention provides the following technical scheme:
an encryption transmission method under a multi-channel transmission scene specifically comprises the following steps:
s1: and a connection establishment stage: a sender sends an initialization data packet from any channel to establish connection;
s2: and (3) a data transmission stage: the method comprises the steps of data transmission and data reception; the data transmission comprises data blocking and encryption;
s3: the transmission is ended.
Further, in step S1, the initializing packet includes:
(1) protocol header: an identifier for identifying the transport protocol, and the connection;
(2) ID: the sequence number of the transmission packet of the connection is an initialization packet, so that the ID is 0;
(3) primitive polynomial: generating an octal coefficient of a primitive polynomial of the m sequence used for the transmission; the transmitting side and the receiving side generate m sequences for data blocking and data merging through the primitive polynomial;
(4) ka1, Kb 1: the next packet key to be sent from the A channel is Ka1, and the next packet key to be sent from the B channel is Kb 1;
(5) a sending mode: the ratio of the data traffic of channel a and channel B;
(6) whether double-layer encryption is performed: whether the transmission data field standard uses double-layer encryption transmission or not, if so, the original data of each packet in the data transmission process needs to be encrypted by using an initial key K0.
Further, the step proportion of the flow of different sending modes comprises:
the sending mode is 0, and the flow of the channel A and the flow of the channel B are 1: 1;
the sending mode is 1, and the flow of the channel A and the flow of the channel B are 3: 1;
the sending mode is 2, and the flow of the channel A and the flow of the channel B are 5: 1;
the sending mode is n, and the flow of the channel A is equal to the flow of the channel B (2 n) 2 +3n+1)∶(n+1)。
Further, in step S2, the data blocking specifically includes: suppose the original plaintext data sequence to be grouped is D i (p), where i is a sequence ID and p represents byte bits of data; sequence D i (p) with the initialThe sequence m (q) generated by the transformed primitive polynomial is subjected to blocking operation, and the specific operation steps comprise:
if the sending mode is 0, the flow distribution of the channel A and the channel B is equal, whether m (q) is equal to 1 or not is judged, and if yes, the block bytes are distributed to the channel A; otherwise, allocating to channel B;
if the transmission mode is n, i.e. each interval is n 0, and 1 plaintext byte is allocated to channel B, the transmission ratio of channel A and channel B is (2 n) 2 +3n +1 to (n +1), judging whether m (q) is 1, if so, allocating the block bytes to the channel A; if 0, a count is made, d equals mod (d +1, n), if d equals 1, the block bytes are allocated to channel B, otherwise to channel a.
Further, in step S2, the data blocking specifically includes: the blocking operation of each sequence does not need to zero the m-sequence offset q, and the next sequence can directly continue to operate from the q +1 bit until the q is zero after the whole m-sequence is traversed.
Further, in step S2, the data encryption specifically includes: the blocked data is followed by the key of the next transmission sequence of another channel, namely the ID +1 sequence; such as data Ai followed by Kbi + 1. The key is randomly generated by the system. Since each sequence is keyed, a shorter number of bits may be used for this key, taking into account transmission efficiency considerations. The channel pointer of the next sequence is arranged behind the logic channel, when the number of the actual transmission physical channels is more than two, the actual physical channels adopted by the next sequence to be transmitted by the logic channel can be changed through the channel pointer, so that only any two physical channels are adopted in each group of sequence transmission period, and the change is generated constantly, thereby increasing the difficulty of monitoring and cracking; if only two physical channels exist, pointer information does not need to be configured;
after the data combination is finished, generating Kai and Kbi by using preamble sequences, and respectively comparing the data A 'generated at this time' i And B' i And encrypting, and adding a protocol header and an ID in front of the sequence to realize the transmission of the sequence.
Further, in step S2, the data receiving and data sending processes are reversed; the receiving end passes through A and B channelsAll data containing the protocol header are received, if double-layer encryption is used, the subsequent data are decrypted by using a K0 secret key to obtain encrypted data A 'of each channel' i And B' i Pair A 'from keys Kai and Kbi of last received data acquisition' i And B' i Decrypting to obtain A i And B i Plaintext data;
then according to the m-sequence, to A i And B i i, merging the data, and recording the offset q of the m sequence after merging of the forward sequence because the m sequence does not start from 0 in each blocking;
and receiving the data cached and received according to the ID until the ID data is decrypted and all the data smaller than the ID are decrypted, and releasing the cache.
Further, in step S3, the transmission end flag is: transmitting, by the transmitter, the end field on an arbitrary channel, including: protocol header, ID and K' 0 Of which K' 0 Indicating the initial encryption key used the next time a connection is established.
The invention has the beneficial effects that: the method of the invention uses the random sequence to block the encrypted data, the block data proportion can be adjusted according to the difference of the channel quality, the single channel transmission data does not contain the complete information of the original data, and the data security is ensured under the condition that the single channel is monitored. In the data packet transmission process, the preamble data contains the key of the next sequence data, so the decryption process must be performed in sequence from the beginning of data transmission, and the difficulty of decryption after data monitoring is increased.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the means of the instrumentalities and combinations particularly pointed out hereinafter.
Drawings
For the purposes of promoting a better understanding of the objects, aspects and advantages of the invention, reference will now be made to the following detailed description taken in conjunction with the accompanying drawings in which:
FIG. 1 is a set-up connection protocol format;
FIG. 2 is a flow chart of a data chunking operation;
FIG. 3 is a block flow diagram of the send mode 0 data;
FIG. 4 is a block flow diagram of transmission mode n data;
FIG. 5 is a flow chart of a block-wise data encryption operation;
FIG. 6 is a flow chart of a receive end data merge operation in Send mode 0;
FIG. 7 is a flow chart of a receive-end data merge operation in send mode n;
fig. 8 protocol end format.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention in a schematic way, and the features in the following embodiments and examples may be combined with each other without conflict.
Wherein the showings are for the purpose of illustrating the invention only and not for the purpose of limiting the same, and in which there is shown by way of illustration only and not in the drawings in which there is no intention to limit the invention thereto; to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of an actual product; it will be understood by those skilled in the art that certain well-known structures in the drawings and descriptions thereof may be omitted.
The same or similar reference numerals in the drawings of the embodiments of the present invention correspond to the same or similar components; in the description of the present invention, it should be understood that if there is an orientation or positional relationship indicated by terms such as "upper", "lower", "left", "right", "front", "rear", etc., based on the orientation or positional relationship shown in the drawings, it is only for convenience of description and simplification of description, but it is not an indication or suggestion that the referred device or element must have a specific orientation, be constructed in a specific orientation, and be operated, and therefore, the terms describing the positional relationship in the drawings are only used for illustrative purposes, and are not to be construed as limiting the present invention, and the specific meaning of the terms may be understood by those skilled in the art according to specific situations.
Referring to fig. 1 to 8, the present invention preferably discloses an information encryption transmission method, which mainly includes three processes: 1) establishing connection; 2) data transmission; 3) the transmission is ended. Before starting to establish data transmission, the data sender and receiver stipulate two physical transmission channels as A, B logical channels, and some initial encryption method, either symmetric encryption or asymmetric encryption, is available. For the sake of illustration, it is assumed that symmetric encryption is used, and the key of both parties is K0. During data transmission, data can be transmitted through two (or more) physical channels.
1) Establishing a connection
The connection establishment phase sends data as shown in fig. 1. The sender can firstly send initialization data from any channel to establish connection, and the initialization data comprises the following parts:
protocol header: for identifying the present transport protocol, and an identifier for the connection.
II, ID: the sequence number of the transmission packet of the connection is an initialization packet, so that the ID is 0;
③ primitive polynomial: generating an octal coefficient of a primitive polynomial of the m sequence used for the transmission; and the transmitting side and the receiving side generate m sequences for data partitioning and data merging through the primitive polynomial.
Ka1, Kb 1: the next packet key to be sent from the A channel is Ka1, and the next packet key to be sent from the B channel is Kb 1;
sending mode: specific ratio of data traffic of channel A and channel B, for example, as shown in Table 1
Whether double-layer encryption is performed: whether this field standard uses two-layer encryption transmission or not, if so, the original data of each packet in the data transmission process needs to be encrypted by using an initial key K0.
2) Data transmission
(1) Data transmission: when the initialization transmission is established, the data transmission process can begin. The data transmission stage is mainly divided into two steps of data blocking and encryption. Data blocking operation As shown in FIG. 2, the original plain data sequence of the packet is D i (p), where i is the sequence ID and p represents the byte bits of the data. The sequence and an m (q) sequence generated according to the initialized primitive polynomial are subjected to blocking operation, and the specific operation steps comprise:
if the sending mode is 0, the traffic distribution of the channel a and the channel B is equal, and data is distributed according to the flow as shown in fig. 3: judging whether m (q) is equal to 1, if yes, allocating the block bytes to a channel A; otherwise, allocating to channel B; .
If the transmission mode is n, the data is distributed according to the flow shown in FIG. 4,
since the distribution of m-sequences 0, 1 has an equalization characteristic, and the number of 1 s per cycle is 1 more than the number of 0 s, the ratio of 0 s to 1 s can be regarded as 1:1 approximately as long as the transmission data is not particularly short. When the transmission mode is 0, that is, 1 of each m-sequence corresponds to the allocation of the plaintext bytes to the a channel, and 0 of each m-sequence corresponds to the allocation of the plaintext bytes to the B channel, the amount of data allocated to the AB channel is equal finally. When the transmission mode is n, i.e. each interval of n 0, corresponding to 1 plaintext byte allocated to the B channel, the actual transmission ratio of the AB channel is (2 n) 2 +3n + 1): (n + 1). The appropriate transmission mode is selected based on the channel characteristics of the AB channel, such as transmission rate, transmission delay, channel usage cost, etc.
The blocking operation of each sequence does not need to zero the offset q of the m sequence, and the next sequence can directly continue to operate from the position q +1 until the q is zeroed after the whole m sequence is traversed.
Data encryption operation as shown in fig. 5, the chunked data is immediately followed by the key of the next transmission sequence of another channel, i.e., the ID +1 sequence. Such as data Ai followed by Kbi + 1. The key is randomly generated by the system. Since each sequence is keyed, a shorter number of bits may be used for this key, taking into account transmission efficiency considerations. The channel pointer of the next sequence is arranged behind, when the number of the actual transmission physical channels is more than two, the actual physical channels adopted by the next sequence to be transmitted by the logic channel can be changed through the pointer, so that only any two physical channels are adopted in each group of sequence transmission period, and the change occurs constantly, thereby increasing the difficulty of being monitored and cracked. If there are only two physical channels, there is no need to configure the pointer information.
After the data combination is finished, generating Kai and Kbi by using preamble sequences, and respectively comparing the data A 'generated at this time' i And B' i And encrypting, and adding a protocol header and an ID in front of the sequence to realize the transmission of the sequence. If the connection establishment stage uses double-layer encryption, the fields behind the protocol header need to be encrypted by adopting an initialized K0 key, so as to realize the ID hiding function. At this time, the sequence can be randomly sent out in a front-back out-of-order mode at the sending end, and the difficulty of monitoring and cracking is further improved.
(2) Data reception
The operation process and the sending process of the data receiving module are reciprocal. The receiving end receives all the data containing the protocol header through the channels A and B, if the double-layer encryption is used, the subsequent data is decrypted by using a K0 secret key to obtain encrypted data A 'of each channel' i And B' i Pair A 'from keys Kai and Kbi of last received data acquisition' i And B' i And decrypting to obtain Ai and Bi plaintext data.
Then according to the m-sequence, to A i And B i Since the m-sequence does not start from 0 every time the data is partitioned, it is necessary to record the offset q of the m-sequence after the merging of the forward-moving sequences is completed. The merging process and the blocking process are the inverse, and the specific processes are shown in fig. 6 and fig. 7.
Because the receiver may receive out-of-order data and the transmission delay of the data is different due to different channel characteristics, the receiving module needs to buffer and receive the data according to the ID until the ID data is decrypted and all the data smaller than the ID is decrypted, and the buffer can be released.
And finishing the data receiving and sending process.
3) End of transmission
The transmission end flow indicates that this data transmission is ended, and the following end fields are transmitted by the transmitting side on an arbitrary channel, as shown in fig. 8. Wherein K' 0 Indicating the initial encryption key used the next time a connection is established. And the segment of key needs to be encrypted using the key carried by another channel last time.
When the encryption transmission method is used in combination with a transmission protocol such as a TCP protocol having a data retransmission function, it is not necessary to consider a data retransmission flow. Otherwise, the receiving side is required to transmit back the acknowledgement and retransmission indication on any channel. The return indication may not be encrypted since it does not carry any message. The acknowledgement message data includes a protocol header, an ID number and an acknowledgement identifier. Wherein the ID field indicates that both the ID and data smaller than the ID were successfully received. The backhaul interval for the acknowledgment message may be increased based on the channel quality.
The retransmission message data includes a protocol header, an ID number and a retransmission identifier. Wherein the ID field represents that the ID data is received over time or fails to be retransmitted.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.

Claims (5)

1. An encryption transmission method under a multi-channel transmission scene is characterized by specifically comprising the following steps:
s1: establishing connection: a sender sends an initialization data packet from any channel to establish connection;
s2: data transmission: the method comprises the steps of data transmission and data reception; the data transmission comprises data blocking and encryption; the data blocking includes: partitioning the encrypted data by using a random sequence, and adjusting the partitioned data according to the difference of channel quality;
the data blocking specifically includes: suppose the original plaintext data sequence to be grouped is D i (p), where i is a sequence ID and p represents byte bits of data; sequence D i (p) performing a blocking operation with the initialized sequence m (q) generated by the primitive polynomial, wherein the specific operation steps comprise: if the sending mode is 0, the flow distribution of the channel A and the channel B is equal, whether m (q) is equal to 1 or not is judged, and if yes, the block bytes are distributed to the channel A; otherwise, allocating to channel B; if the transmission mode is n, the transmission ratio of the channel A and the channel B is (2 n) 2 +3n + 1): (n +1) determining whether m (q) is equal to 1, and if so, allocating the block bytes to channel a; otherwise, allocating to channel B; each sequence starts partitioning operation without setting the offset q of the m sequence to zero, and the next sequence directly starts to continue operation from the position q +1 until the whole m sequence is traversed and then the q is set to zero;
the data encryption specifically comprises: the blocked data is followed by the key of the next transmission sequence of another channel, namely the ID +1 sequence; the channel pointer of the next sequence is arranged behind the logic channel, and when the number of the actual transmission physical channels is more than two, the actual physical channels adopted by the next sequence to be transmitted by the logic channel are changed through the channel pointer; if only two physical channels exist, pointer information does not need to be configured; after the data combination is finished, generating Kai and Kbi by adopting a preamble sequence, and respectively comparing the data A 'generated this time' i And B' i Encrypting, and adding a protocol header and an ID in front of the sequence to realize the transmission of the sequence;
s3: the transmission is ended.
2. The encryption transmission method under the multi-channel transmission scenario of claim 1, wherein in step S1, initializing the data packet includes:
(1) a protocol header;
(2) ID: the serial number of the transmission packet of the connection, ID ═ 0;
(3) primitive polynomial: generating an octal coefficient of a primitive polynomial of the m sequence used for the transmission; the transmitting side and the receiving side generate m sequences for data blocking and data merging through the primitive polynomial;
(4) ka1, Kb 1: the next packet key to be sent from the A channel is Ka1, and the next packet key to be sent from the B channel is Kb 1;
(5) a sending mode: the ratio of the data traffic of channel a and channel B;
(6) whether double-layer encryption is performed: whether the transmission data field standard uses double-layer encryption transmission or not, if so, the original data of each packet in the data transmission process needs to be encrypted by using an initial key K0.
3. The encryption transmission method under the multi-channel transmission scenario as claimed in claim 2, wherein the step-by-step ratio of the traffic of different sending modes includes:
transmission mode is 0, channel a traffic: channel B traffic is 1: 1;
transmission mode is 1, channel a traffic: channel B traffic is 3: 1;
transmission mode is 2, channel a traffic: channel B traffic is 5: 1;
the sending mode is n, the channel A flow is: channel B traffic ═ 2n 2 +3n+1)：(n+1)。
4. The encryption transmission method under the multi-channel transmission scenario as claimed in claim 1, wherein in step S2, the data receiving and data sending processes are reciprocal; the receiving end receives all the data containing the protocol header through the channels A and B, if the double-layer encryption is used, the subsequent data is decrypted by using a K0 secret key to obtain encrypted data A 'of each channel' i And B' i Pair A 'from keys Kai and Kbi of last received data acquisition' i And B' i Decrypting to obtain A i And B i Plaintext data;
then according to the m-sequence, to A i And B i i, merging the data, and recording the offset q of the m sequence after merging of the forward sequence because the m sequence does not start from 0 in each blocking;
and receiving the data cached according to the ID until the ID data is decrypted and all the data smaller than the ID is decrypted, and releasing the cache.
5. The encryption transmission method under the multi-channel transmission scenario as claimed in claim 1, wherein in step S3, the transmission end flag is: transmitting, by the transmitter, an end field on an arbitrary channel, including: protocol header, ID and K' 0 Of which K' 0 Indicating the initial encryption key to be used the next time a connection is established.
CN202011223377.5A 2020-11-05 2020-11-05 Encryption transmission method under multi-channel transmission scene Active CN112332977B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011223377.5A CN112332977B (en) 2020-11-05 2020-11-05 Encryption transmission method under multi-channel transmission scene

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011223377.5A CN112332977B (en) 2020-11-05 2020-11-05 Encryption transmission method under multi-channel transmission scene

Publications (2)

Publication Number Publication Date
CN112332977A CN112332977A (en) 2021-02-05
CN112332977B true CN112332977B (en) 2022-09-20

Family

ID=74315739

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011223377.5A Active CN112332977B (en) 2020-11-05 2020-11-05 Encryption transmission method under multi-channel transmission scene

Country Status (1)

Country Link
CN (1) CN112332977B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113225180A (en) * 2021-04-29 2021-08-06 北京连山科技股份有限公司 Method and system for protecting communication key
CN115967469A (en) * 2022-11-18 2023-04-14 中国电子科技集团公司第三十研究所 Data auto-negotiation transmission method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101394273A (en) * 2008-10-17 2009-03-25 电子科技大学 Multichannel ciphered information transmission method
USRE42236E1 (en) * 1995-02-06 2011-03-22 Adc Telecommunications, Inc. Multiuse subcarriers in multipoint-to-point communication using orthogonal frequency division multiplexing
WO2012037669A1 (en) * 2010-09-23 2012-03-29 Research In Motion Limited System and method for dynamic coordination of radio resources usage in a wireless network environment

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8532293B2 (en) * 2007-09-27 2013-09-10 The Directv Group, Inc. Method and system for securely providing and storing content in a multiple dwelling unit system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE42236E1 (en) * 1995-02-06 2011-03-22 Adc Telecommunications, Inc. Multiuse subcarriers in multipoint-to-point communication using orthogonal frequency division multiplexing
CN101394273A (en) * 2008-10-17 2009-03-25 电子科技大学 Multichannel ciphered information transmission method
WO2012037669A1 (en) * 2010-09-23 2012-03-29 Research In Motion Limited System and method for dynamic coordination of radio resources usage in a wireless network environment

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
C-RAN平台下信道编码与网络编码的联合算法设计;余翔等;《广东通信技术》;20160430;全文 *
MIMO信道下密钥生成技术和协议研究;宋淑男;《中国优秀硕士论文电子期刊网》;20181114;全文 *
Multi-Attribute Missing Data Reconstruction Based on Adaptive Weighted Nuclear Norm Minimization in IoT;Xiang Yu等;《IEEE Access》;20181018;全文 *

Also Published As

Publication number Publication date
CN112332977A (en) 2021-02-05

Similar Documents

Publication Publication Date Title
CN110972103B (en) Communication method and device
CN100401792C (en) Method for building-up radio carrier in mobile communication system
Luk et al. MiniSec: a secure sensor network communication architecture
CN112332977B (en) Encryption transmission method under multi-channel transmission scene
US7684568B2 (en) Encrypting data in a communication network
US7257706B1 (en) Method of securing a document in a system and controlling access to the document and a seal for use in the method
CN101103586B (en) Apparatus and method for ciphering/deciphering a signal in a communication system
US20060126847A1 (en) System and method for establishing secure communications between devices in distributed wireless networks
JP2006262531A (en) Method for encryption of information and data communication system
CN101366226A (en) Method and apparatus for data security and automatic repeat request implementation in a wireless communication system
CN101258706B (en) Methods for secure and bandwidth efficient cryptographic synchronization
KR20080094526A (en) Method of communication in mobile communication system
JP2007529967A (en) Efficient transmission of cryptographic information in a secure real-time protocol
CN103402198B (en) A kind of method that radio communication terminal encryption parameter transmits
CN101675611A (en) Method of transmitting data in awireless communication system
KR20110056507A (en) Cryptographic secret key distribution
CN116471587B (en) Method for generating and updating intra-train communication key under V2V communication
CN115225331B (en) Data encryption communication method
CN112019331A (en) Encryption and decryption method and system for quantum secret communication
CN110098937B (en) Data block associated encryption algorithm based on timestamp
CN112910891B (en) Network security interconnection system based on FPGA high-speed encryption and decryption
CN109462480A (en) Satellite communication system encryption method based on RSA and AES
CN110380848B (en) Method for safely communicating fixed sensor node and mobile sink node in underwater acoustic communication
US20150222427A1 (en) Two-way key switching method and implementation device
JP4981802B2 (en) Data encryption in communication networks

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