WO2021184246A1 - Data packaging method - Google Patents

Data packaging method Download PDF

Info

Publication number
WO2021184246A1
WO2021184246A1 PCT/CN2020/079936 CN2020079936W WO2021184246A1 WO 2021184246 A1 WO2021184246 A1 WO 2021184246A1 CN 2020079936 W CN2020079936 W CN 2020079936W WO 2021184246 A1 WO2021184246 A1 WO 2021184246A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
data string
short
string
verification
Prior art date
Application number
PCT/CN2020/079936
Other languages
French (fr)
Chinese (zh)
Inventor
黄策
Original Assignee
黄策
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 黄策 filed Critical 黄策
Priority to PCT/CN2020/079936 priority Critical patent/WO2021184246A1/en
Publication of WO2021184246A1 publication Critical patent/WO2021184246A1/en

Links

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/40—Network security protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
    • H04L63/0227—Filtering policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
    • H04L63/1408—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic by monitoring network traffic

Definitions

  • the invention relates to a data packaging method.
  • data packaging is a basic technology that is often used during data transmission. Encryption (transmitting data from plain code to cipher code) and verification (data receiver verifying whether the received data is correct) are the two basic technical categories of data packaging. Generally speaking, the receiver of the data performs verification after receiving all the data to determine whether the received data is correct. At the moment when viruses are flying all over the sky, virus-checking and killing the received data has basically become a routine action necessary for the data receiving end.
  • Virus checking and killing are based on known virus characteristic values. Therefore, any virus checking and killing software can only check and kill known viruses, and cannot do anything about new viruses or viruses that have not been entered into the virus signature database.
  • the present invention designs a brand new data packaging method.
  • the technical scheme of the data packaging method is as follows:
  • Short data string verification features include but are not limited to the following two short data string verification features.
  • Short data string verification feature 1 Each (N+K) bit length short data string has the same parity check feature;
  • short data string verification feature 2 In each (N+K) bit length In the short data string, at least one bit with the same data length position has the same value.
  • the short data string verification feature is used for the data receiving end to verify the received short data string in real time in the process of receiving data. If an error is found, all the data that has been received is discarded in time, and the data is received from the beginning. This feature can effectively prevent the incorporation of Trojan viruses.
  • the long data string verification feature is used for the data receiving end to verify the uniqueness of the received data after receiving the data block corresponding to the long data string verification feature to ensure that the received data block is the data sent by the sender .
  • the data receiving end is sensitive to Trojan horse-style virus attacks, and can effectively prevent the Trojan horse virus disguised as transmitting data from entering the data receiving end.
  • Embodiment 1 An embodiment in which 1 bit of packed data is inserted in every 7 bits of data to be transmitted.
  • Step 1 In the original data string, insert 1 bit of packing data in every 7 bits of data.
  • the packaged data is placed on the D7 bit of each byte, and D6-D0 are the original data.
  • the value of the packaged data is such that each byte has an odd parity value, thereby forming a short data string verification feature in which every byte is odd parity.
  • Step 2 Complete the data string inserted into all the packaged data, and pack the entire data string with a CRC check operation to obtain the CRC value of this data string—the long data string check feature.
  • Verification 1 Short data string verification.
  • the data receiving end receives a byte of data, it performs odd parity verification on the received data. If the verification is passed, the data will be put into the receiving buffer. If the verification fails, all received data is discarded, and the data sender is notified to send the data from the beginning.
  • Verification 2 Long data string verification.
  • the data receiving end performs a CRC check on the data in the receiving buffer, and if the verification is passed, the received data is unpacked; if the verification fails, the received data is discarded, and the data sender is notified to send the data from the beginning.
  • the data receiving end removes the D7 bit in each byte of the received data to obtain the original data.
  • Embodiment 2 An embodiment in which 2 bits of packing data are inserted in every 6 bits of data to be transmitted.
  • Step 1 In the original data string, insert 2 bits of packing data for every 6 bits of data.
  • One of the packaged data is inserted in the D7 bit of each byte, and the inserted value is always "0";
  • D6-D1 is the original data;
  • the other packaged data is inserted in the D0 bit of each byte, and the inserted value is such that each byte Both have an even parity value.
  • This constitutes the short data string verification feature of each byte "D7 0; even parity".
  • Step 2 Use the D7-D4 bits of each byte to form the high nibble data string, and use the D3-D0 bits of each byte to form the low nibble data string.
  • Use hash operation to pack the high nibble data string and obtain the hash value of the high nibble data string; combine the hash value of the obtained high nibble data string with the low nibble data string Perform CRC calculation and obtain the CRC value of "low nibble data string + hash value". In this way, the long data string verification feature of "hash value + CRC value" is obtained.
  • Verification 1 Short data string verification.
  • Verification 2 Long data string verification.
  • the data receiving end performs the hash verification of the high nibble data string on the data in the receiving buffer. If the verification is passed, the hash value and the low nibble data string will be CRC checked. If the verification is passed, the received data will be checked. Perform unpacking; as long as one of the hash verification or CRC verification fails, the received data is discarded and the data sender is notified to send the data again.
  • the data receiving end removes the D7 bit and D0 bit in each byte of the received data to obtain the original data.

Abstract

To effectively counter possible attacks by Trojan horse viruses during a data transmission process, and to detect attacking nodes in real time, the present invention designs a brand-new data packaging method. The data packaging method is characterized by: regularly inserting packaging data in an original data string, so that a packaged data string has both short data string verification features and long data string verification features, the short data string verification features being used for verifying received short data strings in real time by a data receiving end during data reception; and if an error is found, immediately discarding all the data that has been received, and receiving data from the beginning. This characteristic can effectively prevent the infiltrating of Trojan horse viruses and greatly increase the difficulty of making Trojan horse viruses. The long data string verification features are used for verifying the uniqueness of received data to ensure that a received data block is the data sent by a sending end.

Description

一种数据包装方法A data packaging method 技术领域Technical field
本发明涉及一种数据包装方法。The invention relates to a data packaging method.
背景技术Background technique
在网络世界中，数据打包是进行数据传输时，经常使用的基础技术。而加密(将传输的数据由明码变暗码)和校验(数据接收方验证收到的数据是否正确)则是数据打包的两个基本技术类别。一般而言，数据的接收方都是在收到全部的数据后，再进行校验，以判断收到的数据是否正确。在病毒漫天飞的当下，对收到的数据进行病毒查杀，基本上成为了数据接收端必备的常规动作。In the network world, data packaging is a basic technology that is often used during data transmission. Encryption (transmitting data from plain code to cipher code) and verification (data receiver verifying whether the received data is correct) are the two basic technical categories of data packaging. Generally speaking, the receiver of the data performs verification after receiving all the data to determine whether the received data is correct. At the moment when viruses are flying all over the sky, virus-checking and killing the received data has basically become a routine action necessary for the data receiving end.
“先接收，后校验，再查杀”这个接收数据的处理过程，基本上已经成为今天所有网络终端的处理接收数据的标准业务过程。而这个标准的业务过程，却存在着两个致命的安全隐患。"Receive first, verify, and then check and kill" this process of receiving data has basically become a standard business process for all network terminals today to process and receive data. However, this standard business process has two fatal security risks.
安全隐患1：查杀病毒软件对新病毒的无知性。Security risk 1: Antivirus software's ignorance of new viruses.
病毒查杀都是以已知病毒特征值为基础的，故任何的病毒查杀软件只能查杀已知病毒，对于新病毒或未录入病毒特征库的病毒皆无能为力。Virus checking and killing are based on known virus characteristic values. Therefore, any virus checking and killing software can only check and kill known viruses, and cannot do anything about new viruses or viruses that have not been entered into the virus signature database.
安全隐患2：病毒查杀的有限性Security risk 2: Limitation of virus scanning
据多家知名防病毒专业公司的网络安全报告报道，已经发现的病毒多达上百万个，每天新增病毒则成千上万。如果一次病毒查杀，真的比对这上百万的已知病毒特征值，则查杀病毒所产生的延时，是令人无法接受的。故一般而言，绝大多数的病毒查杀软件每次只能检查当时最活跃且危害最大的那些数量有限的病毒。According to the network security reports of many well-known antivirus companies, millions of viruses have been discovered, and thousands of new viruses are added every day. If a virus check and kill really compares these millions of known virus characteristic values, the delay caused by the check and kill of the virus is unacceptable. Therefore, generally speaking, most virus-checking and killing software can only check the most active and most harmful viruses at that time.
如何有效对抗在数据传输过程中，特洛伊木马式的病毒攻击，始终是网络世界的一大痛点。而无法实时发现实施特洛伊木马式病毒攻击的节点，亦是网络世界的另外一个痛点。How to effectively fight against Trojan horse-style virus attacks during data transmission has always been a major pain point in the online world. The inability to discover the nodes carrying out Trojan horse attacks in real time is another pain point in the online world.
发明内容Summary of the invention
为有效应对抗网络世界数据传输过程中，特洛伊木马式的病毒攻击并实时发现正在实施特洛伊木马式病毒攻击的节点，本发明设计了一种全新的数据包装方法。所述的数据包装方法的技术方案如下：In order to effectively combat the Trojan horse-style virus attack during the data transmission process of the network world and discover the nodes that are carrying out the Trojan horse-style virus attack in real time, the present invention designs a brand new data packaging method. The technical scheme of the data packaging method is as follows:
1)在原始数据串中，每N比特的数据中，插入K比特的包装数据，使得每(N+K)比特的数串，都具有最少一种且相同的短数据串校验特征。所述的短数据串校验特征包括但不限于以下两个短数据串校验特征。短数据串校验特征1：每个(N+K)比特长度的短数据串，都具有相同的奇偶校验特征；短数据串校验特征2：在每个(N+K)比特长度的短数据串中，最少一个相同数据长度位置的比特位，都具有相同的值。1) In the original data string, for every N bits of data, K bits of packaged data are inserted, so that every (N+K) bit string has at least one and the same short data string check feature. The short data string verification features include but are not limited to the following two short data string verification features. Short data string verification feature 1: Each (N+K) bit length short data string has the same parity check feature; short data string verification feature 2: In each (N+K) bit length In the short data string, at least one bit with the same data length position has the same value.
2)将插入全部包装数据的数据串，或作为一个整体或分割为若干个数据串，用最少一种数据校验算法进行数据打包，并获得与之相对应的长数据串校验特征。2) The data string inserted into all the packaged data, either as a whole or divided into several data strings, is packaged with at least one data verification algorithm, and the corresponding long data string verification characteristics are obtained.
长/短数据串校验特征的作用分别如下：The functions of the long/short data string verification feature are as follows:
短数据串校验特征用于数据接收端在接收数据的过程中，实时对所收到的短数据串进行校验。发现错误就及时抛弃已经收到的所有数据，并从头开始接收数据。此特性可以有效的防止木马病毒的混入。The short data string verification feature is used for the data receiving end to verify the received short data string in real time in the process of receiving data. If an error is found, all the data that has been received is discarded in time, and the data is received from the beginning. This feature can effectively prevent the incorporation of Trojan viruses.
长数据串校验特征用于数据接收端在收到长数据串校验特征所对应数据块后，进行所收到数据的唯一性进行验证，以确保收到的数据块是发送端发送的数据。The long data string verification feature is used for the data receiving end to verify the uniqueness of the received data after receiving the data block corresponding to the long data string verification feature to ensure that the received data block is the data sent by the sender .
本发明方案的优点是：The advantages of the solution of the present invention are:
1)数据接收端对特洛伊木马式的病毒攻击反应灵敏，并可有效阻止伪装为传输数据的木马病毒进入数据接收端。1) The data receiving end is sensitive to Trojan horse-style virus attacks, and can effectively prevent the Trojan horse virus disguised as transmitting data from entering the data receiving end.
2)长/短数据串校验特征的引入，大大压缩了制造木马病毒的空间，大大提高了制造出能同时躲过长/短数据串校验特征木马病毒的技术难度。2) The introduction of long/short data string verification features greatly reduces the space for creating Trojan horse viruses, and greatly increases the technical difficulty of creating Trojan horse viruses that can simultaneously avoid long/short data string verification features.
3)灵敏的短数据串校验特征的引入，使得数据接收端在接收数据的过程中，能及时发现正在实施的特洛伊木马式的病毒攻击，并锁定发动攻击的节点。3) The introduction of the sensitive short data string verification feature enables the data receiving end to detect the ongoing Trojan horse-style virus attack in time during the process of receiving the data, and to lock the attacking node.
具体实施方式Detailed ways
下面结合具体实施例对本发明内容进行详细说明：The content of the present invention will be described in detail below in conjunction with specific embodiments:
实施例1：每7比特要传输的数据位中，插入1比特的包装数据的实施例。Embodiment 1: An embodiment in which 1 bit of packed data is inserted in every 7 bits of data to be transmitted.
1)数据发送端的数据打包：1) Data packaging at the data sending end:
设N＝7，K＝1。Let N=7 and K=1.
步骤1：在原始数据串中，每7个比特数据中，插入1比特的包装数据。包装数据放在在每个字节的D7位上，D6-D0为原始数据。包装数据的值为使得每字节都具有奇校验的值，由此构成了每字节皆为奇校验的短数据串校验特征。Step 1: In the original data string, insert 1 bit of packing data in every 7 bits of data. The packaged data is placed on the D7 bit of each byte, and D6-D0 are the original data. The value of the packaged data is such that each byte has an odd parity value, thereby forming a short data string verification feature in which every byte is odd parity.
步骤2：将完成插入全部包装数据的数据串，用CRC校验运算进行整个数据串的打包，以获得这个数据串的CRC值——长数据串校验特征。Step 2: Complete the data string inserted into all the packaged data, and pack the entire data string with a CRC check operation to obtain the CRC value of this data string—the long data string check feature.
2)数据接收端的校验和解包2) Checksum unpacking at the data receiving end
验证1：短数据串验证。Verification 1: Short data string verification.
数据接收端每收一个字节的数据，就对所收到的数据进行奇校验验证。验证通过则将该数据放入接收缓存。验证不通过，则丢弃所有已经收到的数据，并通知数据发送端从头发送数据。Each time the data receiving end receives a byte of data, it performs odd parity verification on the received data. If the verification is passed, the data will be put into the receiving buffer. If the verification fails, all received data is discarded, and the data sender is notified to send the data from the beginning.
验证2：长数据串验证。Verification 2: Long data string verification.
数据接收端对接收缓存中的数据进行CRC校验，验证通过则对收到的数据进行解包；验证不通过则抛弃已经接收的数据，并通知数据发送端从头发送数据。The data receiving end performs a CRC check on the data in the receiving buffer, and if the verification is passed, the received data is unpacked; if the verification fails, the received data is discarded, and the data sender is notified to send the data from the beginning.
解包：Unpack:
数据接收端将接收到的数据每个字节中的D7位移除，从而获得原始数据。The data receiving end removes the D7 bit in each byte of the received data to obtain the original data.
实施例2：每6比特要传输的数据位中，插入2比特的包装数据的实施例。Embodiment 2: An embodiment in which 2 bits of packing data are inserted in every 6 bits of data to be transmitted.
1)数据发送端的数据打包：1) Data packaging at the data sending end:
设N＝6，K＝2。Let N=6 and K=2.
步骤1：在原始数据串中，每6个比特数据插入2比特的包装数据。其中一个包装数据插入在每字节的D7位，且插入值恒为“0”；D6-D1为原始数据；另外一个包装数据插入在每字节的D0位，插入的值为使得每字节都具有偶校验的值。由此构成了每字节“D7＝0；偶校验”的短数据串校验特征。Step 1: In the original data string, insert 2 bits of packing data for every 6 bits of data. One of the packaged data is inserted in the D7 bit of each byte, and the inserted value is always "0"; D6-D1 is the original data; the other packaged data is inserted in the D0 bit of each byte, and the inserted value is such that each byte Both have an even parity value. This constitutes the short data string verification feature of each byte "D7=0; even parity".
步骤2：将完成插入全部包装数据的数据串，用每字节的D7-D4位构成高半字节数据串，用每字节的D3-D0位构成低半字节数据串。用哈希运行对高半字节数据串进行数据打包，并获得高半字节数据串的哈希值；将所获得高半字节数据串的哈希值，同低半字节数据串一起进行CRC运算，并获得“低半字节数据串+哈希值”的CRC值。从而获得“哈希值+CRC值”的长数据串校验特征。Step 2: Use the D7-D4 bits of each byte to form the high nibble data string, and use the D3-D0 bits of each byte to form the low nibble data string. Use hash operation to pack the high nibble data string and obtain the hash value of the high nibble data string; combine the hash value of the obtained high nibble data string with the low nibble data string Perform CRC calculation and obtain the CRC value of "low nibble data string + hash value". In this way, the long data string verification feature of "hash value + CRC value" is obtained.
2)数据接收端的校验和解包2) Checksum unpacking at the data receiving end
验证1：短数据串验证。Verification 1: Short data string verification.
数据接收端收到一个字节数据，就对所收到的数据进行“D7＝0，偶校验”验证。验证通过则将该数据放入接收缓存。验证不通过，则丢弃所有已经收到的数据，并通知数据发送端从新发送数据。When the data receiving end receives a byte of data, it performs "D7=0, even parity" verification on the received data. If the verification is passed, the data will be put into the receiving buffer. If the verification fails, all the data that has been received is discarded, and the data sender is notified to send the data again.
验证2：长数据串验证。Verification 2: Long data string verification.
数据接收端对接收缓存中的数据进行高半字节数据串的哈希验证，验证通过则将此哈希值同低半字节数据串一起进行CRC校验，验证通过则对收到的数据进行解包；哈希验证或CRC验证只要有一个验证不通过，则抛弃已经接收的数据，并通知数据发送端从新发送数据。The data receiving end performs the hash verification of the high nibble data string on the data in the receiving buffer. If the verification is passed, the hash value and the low nibble data string will be CRC checked. If the verification is passed, the received data will be checked. Perform unpacking; as long as one of the hash verification or CRC verification fails, the received data is discarded and the data sender is notified to send the data again.
解包：Unpack:
数据接收端将接收到的数据每个字节中的D7位、D0位移除，从而获得原始数据。The data receiving end removes the D7 bit and D0 bit in each byte of the received data to obtain the original data.

Claims (4)

  1. 一种数据包装方法，其特征在于：所述的数据包装方法，由以下两个步骤完成；步骤1：在原始数据串中，插入包装数据；步骤2：将插入包装数据的数据串进行数据打包；通过以上两个步骤，使得包装完毕的数据串，同时具备短数据串校验特征和长数据串校验特征。A data packaging method, characterized in that: the data packaging method is completed by the following two steps; Step 1: Insert packaging data in the original data string; Step 2: Data packaging the data string inserted into the packaging data ; Through the above two steps, the packaged data string has both the short data string verification feature and the long data string verification feature.
  2. 根据权利要求1所述的插入包装数据，其特征在于：在每N比特的数据串中，插入K比特的包装数据，使得每个(N+K)比特的数据串都具有相同的、最少一种的短数据串校验特征。The inserting packaged data according to claim 1, characterized in that: in every N-bit data string, K-bit packaged data is inserted, so that each (N+K)-bit data string has the same and at least one data string. Kind of short data string verification feature.
  3. 根据权利要求1、2所述的短数据串校验特征，其特征在于：所述的短数据串校验特征包括但不限于以下两个短数据串校验特征；短数据串校验特征1：每个(N+K)比特长度的短数据串，都具有相同的奇偶校验特征；短数据串校验特征2：在每个(N+K)比特长度的短数据串中，最少一个相同数据长度位置的比特位，都具有相同的值。The short data string verification feature according to claims 1 and 2, characterized in that: the short data string verification feature includes but not limited to the following two short data string verification features; short data string verification feature 1 : Each (N+K) bit length short data string has the same parity check feature; short data string check feature 2: In each (N+K) bit length short data string, at least one The bits at the same data length position all have the same value.
  4. 根据权利要求1所述的数据打包，其特征在于：将插入全部包装数据的数据串，或作为一个整体或分割为若干个数据串，用最少一种数据校验算法进行数据打包，并获得相应的长数据串校验特征。The data package according to claim 1, wherein the data string inserted into all the packaged data, either as a whole or divided into several data strings, is packaged with at least one data verification algorithm, and the corresponding data is obtained. The long data string verification feature.
PCT/CN2020/079936 2020-03-18 2020-03-18 Data packaging method WO2021184246A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/079936 WO2021184246A1 (en) 2020-03-18 2020-03-18 Data packaging method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/079936 WO2021184246A1 (en) 2020-03-18 2020-03-18 Data packaging method

Publications (1)

Publication Number Publication Date
WO2021184246A1 true WO2021184246A1 (en) 2021-09-23

Family

ID=77768380

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/079936 WO2021184246A1 (en) 2020-03-18 2020-03-18 Data packaging method

Country Status (1)

Country Link
WO (1) WO2021184246A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101094206A (en) * 2007-08-02 2007-12-26 中兴通讯股份有限公司 Data transmission device
US20130055050A1 (en) * 2011-08-24 2013-02-28 Kabushiki Kaisha Toshiba Error correction encoding apparatus, error correction decoding apparatus, nonvolatile semiconductor memory system, and parity check matrix generation method
CN103095407A (en) * 2012-12-28 2013-05-08 广州中大微电子有限公司 Digital coding device of reader-writer chip and coding method applying the same
CN104935527A (en) * 2015-06-12 2015-09-23 福建新大陆电脑股份有限公司 Data packing method of audio communication
CN109729105A (en) * 2019-03-26 2019-05-07 黄策 A kind of data packing method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101094206A (en) * 2007-08-02 2007-12-26 中兴通讯股份有限公司 Data transmission device
US20130055050A1 (en) * 2011-08-24 2013-02-28 Kabushiki Kaisha Toshiba Error correction encoding apparatus, error correction decoding apparatus, nonvolatile semiconductor memory system, and parity check matrix generation method
CN103095407A (en) * 2012-12-28 2013-05-08 广州中大微电子有限公司 Digital coding device of reader-writer chip and coding method applying the same
CN104935527A (en) * 2015-06-12 2015-09-23 福建新大陆电脑股份有限公司 Data packing method of audio communication
CN109729105A (en) * 2019-03-26 2019-05-07 黄策 A kind of data packing method

Similar Documents

Publication Publication Date Title
US7934141B2 (en) Data protocol
US7555781B2 (en) Security component for a computing device
JP6277101B2 (en) Data verification method and data verification apparatus
Kaminsky et al. PKI layer cake: New collision attacks against the global X. 509 infrastructure
US20160065595A1 (en) Apparatus and method for performing real-time network antivirus function
CN103595661B (en) Message fragmentation restructuring method and device
TWI382723B (en) Methods and apparatus for improving security while transmitting a data packet
US20090083854A1 (en) Syntax-Based Security Analysis Using Dynamically Generated Test Cases
US9934412B2 (en) Implementing replay protected storage
US8351605B2 (en) Stealth message transmission in a network
Crain et al. Bolt-on security extensions for industrial control system protocols: A case study of dnp3 sav5
US20210089388A1 (en) System, Apparatus And Method For Providing Protection Against Silent Data Corruption In A Link
US20090154361A1 (en) Method and system for using protocol checksums to convey data
CN109729105A (en) A kind of data packing method
WO2021184246A1 (en) Data packaging method
GB2594295A (en) Block propagation with poisoned transactions in a blockchain network
US6968498B1 (en) System and method for verifying validity of transmission data based on a numerical identifier for the data
CN112714070A (en) Communication method, device, system and storage medium
Bratus et al. From shotgun parsers to more secure stacks
CN109327466B (en) Data encryption transmission method, electronic equipment and storage medium
US11791932B2 (en) SD-WAN communication network forward error correction systems and methods
EP4354788A1 (en) Fault countermeasures for digital signatures with aborts
CN111050218A (en) Set top box upgrading and checking method, server, set top box and storage medium
US20230119890A1 (en) Method for securely processing digital information in a secure element
US20230362022A1 (en) Method for improved hash chaining authentication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20925843

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20925843

Country of ref document: EP

Kind code of ref document: A1