CN114390065A - Block chain network data rapid transmission method - Google Patents
Block chain network data rapid transmission method Download PDFInfo
- Publication number
- CN114390065A CN114390065A CN202210076208.6A CN202210076208A CN114390065A CN 114390065 A CN114390065 A CN 114390065A CN 202210076208 A CN202210076208 A CN 202210076208A CN 114390065 A CN114390065 A CN 114390065A
- Authority
- CN
- China
- Prior art keywords
- binary
- data
- value
- polynomial
- length
- 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
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000005540 biological transmission Effects 0.000 title claims abstract description 27
- 238000004891 communication Methods 0.000 claims abstract description 7
- 238000010276 construction Methods 0.000 claims description 6
- 230000000295 complement effect Effects 0.000 claims description 4
- 230000003247 decreasing effect Effects 0.000 claims description 3
- 230000001172 regenerating effect Effects 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 4
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000012937 correction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- 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/12—Applying verification of the received information
- H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
-
- 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/04—Protocols for data compression, e.g. ROHC
-
- 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/08—Protocols for interworking; Protocol conversion
Abstract
The invention relates to the technical field of block chains, in particular to a block chain network data rapid transmission method; the method comprises the following steps: a binary polynomial f (x, y) is agreed between two block chain nodes for establishing communication; the node for transmitting data converts the data to be transmitted into a binary data stream; intercepting a binary data stream with a preset length L to form a binary D; constructing an equation D = f (x _ t, y _ t) + delta, and sending (x _ t, y _ t, delta) to a node receiving data; substituting the block chain link points of the received data into an agreed binary polynomial to obtain a binary number D; after all the binary numbers D are transmitted, the node receiving the data will obtain a complete binary data stream, i.e. complete the data transmission. The substantial effects of the invention are as follows: the binary data with less occupied bytes is used for representing the binary data with more occupied bytes, so that the data volume needing to be transmitted on the block chain network can be compressed, and the data transmission efficiency of the block chain network is improved.
Description
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain network data rapid transmission method.
Background
The blockchain is a shared ledger based on P2P network technology, encryption technology, time stamping, and the like. The user maintains the block chain in an equivalent and public way, so that the block chain has the characteristics of unforgeable whole-course trace, traceability, public transparency, collective maintenance and the like. Based on the characteristics, the blockchain technology lays a solid trust foundation and creates a reliable cooperation mechanism. In recent years, the application of the blockchain is rapidly developed, more and more information is transmitted and stored in the blockchain network, so that the blockchain network is often blocked, the use of a user is seriously influenced, and the safety of the blockchain is brought with risks. There is a need to develop data transmission schemes that can improve the data exchange efficiency of the blockchain network.
For example, chinese patent CN109559122A, published 2019, 4/2, a method and a system for transmitting block chain data, the method comprising: performing hash operation on transaction data at least twice to obtain first summary information; encrypting the first summary information for multiple times by utilizing at least two private keys to obtain digital signature information of the transaction data; and sending the transaction data, the digital signature information of the transaction data and at least two public keys corresponding to the at least two private keys to the blockchain network node. According to the technical scheme, at least two times of hash algorithm is adopted, the hash internal operation complexity and the hash output length are improved, the capability of resisting attacks is improved, and meanwhile, the load of a block chain network is increased. Improving the data transmission efficiency of the blockchain network has become a technical problem to be solved urgently at present.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the technical problem of low data transmission efficiency of the current block chain network is solved. The block chain network data rapid transmission method is provided, so that the block chain network data transmission efficiency can be improved, and the network blockage problem can be relieved.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows: a method for fast data transmission in a blockchain network comprises the following steps: a binary polynomial f (x, y) is agreed between two block chain nodes for establishing communication; the node for transmitting data converts the data to be transmitted into a binary data stream; intercepting a binary data stream with a preset length L to form a binary D; constructing an equation D = f (x _ t, y _ t) + delta, delta is an offset value, and (x _ t, y _ t, delta) is sent to a node receiving data; substituting (x _ t, y _ t) into the appointed binary polynomial by the block link point of the received data and correcting by using an offset value delta to obtain a binary number D; after all the binary numbers D are transmitted, the node receiving the data will obtain a complete binary data stream, i.e. complete the data transmission.
Preferably, the method of contracting the bivariate polynomial comprises: a node sending data randomly generates a plurality of univariate polynomials f (x); the method comprises the steps of defining the occupied length of an independent variable x, obtaining the value range of the variable x, calculating the value range of a univariate polynomial f (x), wherein the value ranges of a plurality of univariate polynomials f (x) form a total value range; increasing or decreasing the univariate polynomial f (x) until the binary number value range of the total value field coverage length L reaches the preset requirement; the number of the univariate polynomials f (x) is marked as m, and the m univariate polynomials f (x) are numbered in sequence; filling up the monomials with coefficients of 0, recording the highest degree of m univariate polynomials as N, and enabling the univariate polynomials to have N +1 univariate coefficients; taking the serial number as the value of a variable y, taking each monomial coefficient of the unary polynomial with the serial number corresponding to the value of the y as a coefficient function value, and establishing N +1 coefficient polynomial fitting; fitting and replacing the monomial coefficient of any univariate polynomial after filling the monomial with the coefficient of 0 by using a coefficient polynomial, and expanding to obtain a binary polynomial; and generating the binary polynomial to a node receiving data in a conventional encryption mode to complete the convention of the binary polynomial.
Preferably, the method for the node sending data to construct the equation comprises the following steps: the method comprises the steps of specifying the occupied lengths of independent variables x and y to obtain the value ranges of the variables x and y; calculating the value range of a binary polynomial f (x, y) in the value range of the variables x and y; establishing a lookup table, wherein the lookup table records values of variables x and y corresponding to the values in the value domain; after the node for sending data obtains a binary number D to be sent, checking whether the binary number D is recorded in the quick look-up table; if the binary number D is in the quick look-up table, setting the offset value to be 0 according to the values of x and y recorded by the quick look-up table, and completing equation construction; if the binary number D is not in the quick look-up table, selecting a value close to the binary number D from the quick look-up table; and calculating the difference value between the binary number D and the binary polynomial value under the values corresponding to x and y as an offset value delta to complete the equation construction.
Preferably, the method for intercepting binary data of a preset length L includes: the node for transmitting data converts the data to be transmitted into a binary data stream; intercepting binary data of length L from the binary data stream in sequence; when the length L of the residual binary data is less than the length L, bit complementing is carried out to the length L, and the length a of the bit complementing is recorded; after the last binary number D is transmitted, the complementary bit length a is sent to the node receiving the data in a conventional manner.
Preferably, after a node sending data generates a binary polynomial f (x, y), the occupied lengths of independent variables x and y are specified, and the value ranges of the variables x and y are obtained; calculating the value range of a binary polynomial f (x, y) in the value range of the variables x and y; enumerating the values of binary numbers D which do not fall into the value range, and recording as a missing set; obtaining the value of the binary polynomial f (x, y) with the closest value in the missing set, and obtaining the corresponding offset value delta; and if the offset value delta exceeds a preset threshold value, regenerating the binary polynomial f (x, y).
The substantial effects of the invention are as follows: by appointing a data conversion mechanism, binary data with less occupied bytes are used for representing binary data with more occupied bytes, so that the data volume needing to be transmitted on the block chain network can be compressed, and the data transmission efficiency of the block chain network is improved; the binary polynomials appointed among different block chain nodes are different, so that the functions of encrypting data and preventing the disguised node from sending disguised data can be achieved; when establishing communication, only one appointment needs to be performed.
Drawings
Fig. 1 is a schematic diagram of a fast data transmission method according to an embodiment.
FIG. 2 is a diagram illustrating a method for contracting a bivariate polynomial according to an embodiment.
Fig. 3 is a schematic diagram of a method for constructing an equation for a node transmitting data according to the embodiment.
FIG. 4 is a diagram illustrating a method for truncating binary data with a predetermined length L according to an embodiment.
Detailed Description
The following provides a more detailed description of the present invention, with reference to the accompanying drawings.
The first embodiment is as follows:
a method for fast data transmission in a blockchain network, please refer to fig. 1, which includes: step A01) establishing a communication, and appointing a binary polynomial f (x, y) between two blockchain nodes; step A02) the node sending data converts the data to be sent into binary data stream; step A03) intercepting a binary data stream with a preset length L to form a binary D; step a 04) constructing equation D = f (x _ t, y _ t) + Δ, Δ being an offset value, and sending (x _ t, y _ t, Δ) to a node receiving data; step A05) the block chain node point receiving data substitutes (x _ t, y _ t) into the appointed binary polynomial and obtains binary number D after correction by using offset value delta; step A06), after all the binary numbers D are transmitted, the node receiving the data will obtain the complete binary data stream, i.e. complete the data transmission.
The agreed bivariate polynomial form is expressed as:
f(x,y)=(a00+a01*y+a02*y^2+…+a0m*y^m)+(a10+a11*y+a12*y^2+…+a1m*y^m)*x+(a20+a21*y+a22*y^2+…+a2m*y^m)*x^2+…+(an0+an1*y+an2*y^2+…+anm*y^m)*x^n。
the two-element polynomial agreed in this embodiment is:
f(x,y)=(3*y^5+9*y^4-2*y^2+8*y-10)*x^10+(21*y^5-12*y^3+20*y^2)*x^6+(19*y^4-6*y^3+7*y^2-2*y)*x^3。
binary number D is 8 bytes long, and arguments x and y are half bytes long, i.e., x, y ∈ [0x0,0xF ], and offset Δ is unlimited. The equation for constructing the binary number D is shown in table 1, following the agreed upon bivariate polynomial. It can be seen that data of 8 bytes length can be expressed using a length of 3 bytes. Data of 3 bytes length is transmitted to a node receiving the data. The node receiving the data is recovered.
Since the offset value Δ is not constant in length, the present embodiment does not transmit data of 3 bytes in length each time. When the offset value Δ is equal to 0, only 1 byte of data needs to be transmitted. The node receiving the data takes out the upper bits of the 1-byte data as the value of x and the lower 4 bits as the value of y. If more than 1 byte of data is transmitted, the remaining bytes are used to indicate the offset value Δ. As in table 1, the offset value Δ occupies 2 bytes. Due to the uncertainty of the data that needs to be transmitted. The binary number D obtained at each fetch is also indeterminate. The value of the offset value delta is not determined.
Consider an extremely poor case: binary polynomial f (x, y) =0, in which case the offset Δ is exactly equal to the binary number D, and occupies the same length as the binary number D. At this time, the data length to be transmitted is 1 byte more than the original data length because the values of x and y also need to be transmitted.
However, in this case, if the value of x or y is changed so that f (x, y) >0, the offset value Δ can be reduced, and the number of bytes occupied by the offset value Δ can be reduced. The embodiment still has the effect of compressing the data transmission quantity, thereby improving the data transmission efficiency. As described in table 1, the data transfer amount can be reduced by almost 3 times, and the data transfer efficiency can be improved by almost 3 times by considering only the data amount.
TABLE 1 equations for binary D
| (x_t,y_t,△) | Binary value of (x _ t, y _ t, Δ) | Binary number D |
| (15,15,2610) | 1111 1111 0000 1010 0011 0010 | 0001 0101 1110 0000 1000 0010 0011 1111 1011 0101 0101 0011 1111 1101 0001 0100 |
| (15,10,32010) | 1111 1010 0111 1101 0000 1010 | 0000 0011 0001 1110 1100 1101 0000 0100 0010 1110 1001 0010 1110 0101 1010 0010 |
Since the agreed binary function occupies part of the storage space, and the establishment of the equation and the restoration of the binary number D occupy part of the computing resources, the current blockchain network has much more storage space and computational power for the blockchain nodes. In a blockchain network, frequent broadcasting and data synchronization are required, and network congestion occurs. That is, in the current block chain network, the network bandwidth is a more tense resource relative to the storage space and computational power. The method sacrifices partial storage space and computational power, improves data transmission efficiency and has practical benefit.
Referring to FIG. 2, a method for contracting a bivariate polynomial includes: step B01), the node sending data randomly generates a plurality of univariate polynomials f (x); step B02), the occupied length of the independent variable x is specified, the value range of the variable x is obtained, the value range of the univariate polynomial f (x) is calculated, and the value ranges of a plurality of univariate polynomials f (x) form a total value range; step B03), increasing or decreasing the univariate polynomial f (x) until the binary number value range of the total value field coverage length L reaches the preset requirement; in the step B04), the number of the univariate polynomials f (x) at this time is denoted as m, and the m univariate polynomials f (x) are numbered in sequence; step B05) filling up the monomials with the coefficient of 0, recording the highest degree of m univariate polynomials as N, and enabling the univariate polynomials to have N +1 monomial coefficients; step B06), taking the serial number as the value of variable y, taking each monomial coefficient of the unary polynomial with the serial number corresponding to the value of y as a coefficient function value, and establishing N +1 coefficient polynomial fitting; step B07), fitting and replacing the monomial coefficients of any univariate polynomial after filling the monomials with the coefficients of 0 by using coefficient polynomials, and expanding to obtain a binary polynomial; step B08) generating the binary polynomial to the node receiving the data through a conventional encryption mode, and completing the convention of the binary polynomial. Because the polynomial fitting sample data has higher efficiency and accuracy, a basically accurate binary polynomial can be obtained after fitting, and most binary numbers D can be effectively expressed by adding correction of an offset value delta. If the total value field covers the binary number value range of the length L, the binary polynomial is very complex and is difficult to cover 100%. Thus requiring correction by means of the offset value Δ. When the optimal binary polynomial f (x, y) and any binary number D with a preset length can establish an equation, the value of the offset value Δ can be maintained not to exceed a set upper limit, or only occasionally exceeds the upper limit.
Referring to fig. 3, a method for a node transmitting data to construct an equation includes: step C01) the occupied lengths of the independent variables x and y are specified, and the value ranges of the variables x and y are obtained; step C02) calculating the value range of the binary polynomial f (x, y) in the value range of the variables x and y; step C03), establishing a lookup table, wherein the lookup table records the values of variables x and y corresponding to the values in the value domain; step C04), after the node sending data obtains the binary number D to be sent, checking whether the binary number D is recorded in the quick look-up table; step C05), if the binary number D is in the quick look-up table, setting the deviant value as 0 according to the values of x and y recorded by the quick look-up table, and completing equation construction; step C06) if the binary number D is not in the quick look-up table, selecting a value close to the binary number D from the quick look-up table; step C07), calculating the difference value between the binary number D and the binary polynomial value under the values corresponding to x and y as an offset value delta, and completing equation construction. By further sacrificing memory space, the transfer of data can be further accelerated.
Referring to fig. 4, the method for intercepting binary data with a preset length L includes: step D01), the node sending data converts the data to be sent into a binary data stream; step D02) sequentially intercepting binary data of length L from the binary data stream; step D03), when the length L of the remaining binary data is insufficient, the bit is complemented to the length L, and the length a of the complemented bit is recorded; step D04) has transmitted the last binary digit D, the length a of the complement is sent to the node receiving the data in the conventional manner. E.g. the last binary number D only takes 7 bytes in length. The length of the complementary bit is 8 bits. And sending 8 to the node receiving the data by using a conventional encryption communication mode. The node receiving the data removes the last 8 bits of the last recovered binary number D.
After a node sending data generates a binary polynomial f (x, y), the occupied lengths of independent variables x and y are specified, and the value ranges of the variables x and y are obtained; calculating the value range of a binary polynomial f (x, y) in the value range of the variables x and y; enumerating the values of binary numbers D which do not fall into the value range, and recording as a missing set; obtaining the value of the binary polynomial f (x, y) with the closest value in the missing set, and obtaining the corresponding offset value delta; and if the offset value delta exceeds a preset threshold value, regenerating the binary polynomial f (x, y).
The beneficial technical effects of this embodiment are: by appointing a data conversion mechanism, binary data with less occupied bytes are used for representing binary data with more occupied bytes, so that the data volume needing to be transmitted on the block chain network can be compressed, and the data transmission efficiency of the block chain network is improved; the binary polynomials appointed among different block chain nodes are different, so that the functions of encrypting data and preventing the disguised node from sending disguised data can be achieved; when establishing communication, only one appointment needs to be performed.
The above-described embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention in any way, and other variations and modifications may be made without departing from the spirit of the invention as set forth in the claims.
Claims (5)
1. A method for fast transmission of block chain network data is disclosed,
the method comprises the following steps:
a binary polynomial f (x, y) is agreed between two block chain nodes for establishing communication;
the node for transmitting data converts the data to be transmitted into a binary data stream;
intercepting a binary data stream with a preset length L to form a binary D;
constructing an equation D = f (x _ t, y _ t) + delta, delta is an offset value, and (x _ t, y _ t, delta) is sent to a node receiving data;
substituting (x _ t, y _ t) into the appointed binary polynomial by the block link point of the received data and correcting by using an offset value delta to obtain a binary number D;
after all the binary numbers D are transmitted, the node receiving the data will obtain a complete binary data stream, i.e. complete the data transmission.
2. The method of claim 1, wherein the data transmission in the blockchain network is performed in a fast manner,
the method for appointing the bivariate polynomial comprises the following steps:
a node sending data randomly generates a plurality of univariate polynomials f (x);
the method comprises the steps of defining the occupied length of an independent variable x, obtaining the value range of the variable x, calculating the value range of a univariate polynomial f (x), wherein the value ranges of a plurality of univariate polynomials f (x) form a total value range;
increasing or decreasing the univariate polynomial f (x) until the binary number value range of the total value field coverage length L reaches the preset requirement;
the number of the univariate polynomials f (x) is marked as m, and the m univariate polynomials f (x) are numbered in sequence;
filling up the monomials with coefficients of 0, recording the highest degree of m univariate polynomials as N, and enabling the univariate polynomials to have N +1 univariate coefficients;
taking the serial number as the value of a variable y, taking each monomial coefficient of the unary polynomial with the serial number corresponding to the value of the y as a coefficient function value, and establishing N +1 coefficient polynomial fitting;
fitting and replacing the monomial coefficient of any univariate polynomial after filling the monomial with the coefficient of 0 by using a coefficient polynomial, and expanding to obtain a binary polynomial;
and generating the binary polynomial to a node receiving data in a conventional encryption mode to complete the convention of the binary polynomial.
3. A method for fast data transmission in a blockchain network according to claim 1 or 2,
the method for the node sending the data to construct the equation comprises the following steps:
the method comprises the steps of specifying the occupied lengths of independent variables x and y to obtain the value ranges of the variables x and y;
calculating the value range of a binary polynomial f (x, y) in the value range of the variables x and y;
establishing a lookup table, wherein the lookup table records values of variables x and y corresponding to the values in the value domain;
after the node for sending data obtains a binary number D to be sent, checking whether the binary number D is recorded in the quick look-up table;
if the binary number D is in the quick look-up table, setting the offset value to be 0 according to the values of x and y recorded by the quick look-up table, and completing equation construction;
if the binary number D is not in the quick look-up table, selecting a value close to the binary number D from the quick look-up table;
and calculating the difference value between the binary number D and the binary polynomial value under the values corresponding to x and y as an offset value delta to complete the equation construction.
4. A method for fast data transmission in a blockchain network according to claim 1 or 2,
the method for intercepting binary data with preset length L comprises the following steps:
the node for transmitting data converts the data to be transmitted into a binary data stream;
intercepting binary data of length L from the binary data stream in sequence;
when the length L of the residual binary data is less than the length L, bit complementing is carried out to the length L, and the length a of the bit complementing is recorded;
after the last binary number D is transmitted, the complementary bit length a is sent to the node receiving the data in a conventional manner.
5. A method for fast data transmission in a blockchain network according to claim 1 or 2,
after a node sending data generates a binary polynomial f (x, y), the occupied lengths of independent variables x and y are specified, and the value ranges of the variables x and y are obtained;
calculating the value range of a binary polynomial f (x, y) in the value range of the variables x and y;
enumerating the values of binary numbers D which do not fall into the value range, and recording as a missing set;
obtaining the value of the binary polynomial f (x, y) with the closest value in the missing set, and obtaining the corresponding offset value delta;
and if the offset value delta exceeds a preset threshold value, regenerating the binary polynomial f (x, y).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210076208.6A CN114390065B (en) | 2022-01-24 | 2022-01-24 | Block chain network data rapid transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210076208.6A CN114390065B (en) | 2022-01-24 | 2022-01-24 | Block chain network data rapid transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114390065A true CN114390065A (en) | 2022-04-22 |
| CN114390065B CN114390065B (en) | 2024-03-19 |
Family
ID=81203421
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210076208.6A Active CN114390065B (en) | 2022-01-24 | 2022-01-24 | Block chain network data rapid transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114390065B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103580857A (en) * | 2012-08-06 | 2014-02-12 | 重庆电子工程职业学院 | Compression method for Chinese character message data based on knapsack encryption |
| CN104011781A (en) * | 2011-08-29 | 2014-08-27 | 索尼公司 | Information processing device, information processing method, and program |
| CN104303451A (en) * | 2012-05-21 | 2015-01-21 | 皇家飞利浦有限公司 | Key sharing device and system for configuration thereof |
| CN109559122A (en) * | 2018-12-07 | 2019-04-02 | 北京瑞卓喜投科技发展有限公司 | Block chain data transmission method and block chain data transmission system |
| US20200228317A1 (en) * | 2018-11-27 | 2020-07-16 | Alibaba Group Holding Limited | System and method for information protection |
| CN112188198A (en) * | 2020-09-24 | 2021-01-05 | 湖南遥昇通信技术有限公司 | Image data compression and decompression method and system |
-
2022
- 2022-01-24 CN CN202210076208.6A patent/CN114390065B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104011781A (en) * | 2011-08-29 | 2014-08-27 | 索尼公司 | Information processing device, information processing method, and program |
| CN104303451A (en) * | 2012-05-21 | 2015-01-21 | 皇家飞利浦有限公司 | Key sharing device and system for configuration thereof |
| CN103580857A (en) * | 2012-08-06 | 2014-02-12 | 重庆电子工程职业学院 | Compression method for Chinese character message data based on knapsack encryption |
| US20200228317A1 (en) * | 2018-11-27 | 2020-07-16 | Alibaba Group Holding Limited | System and method for information protection |
| CN109559122A (en) * | 2018-12-07 | 2019-04-02 | 北京瑞卓喜投科技发展有限公司 | Block chain data transmission method and block chain data transmission system |
| CN112188198A (en) * | 2020-09-24 | 2021-01-05 | 湖南遥昇通信技术有限公司 | Image data compression and decompression method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114390065B (en) | 2024-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP3739093B2 (en) | CDMA communication system in which bit rate is dynamically allocated | |
| US8091139B2 (en) | System and method for masking arbitrary Boolean functions | |
| JP2000138668A (en) | Encipherment system for packet exchange circuit network based on digital chaos model | |
| KR101594553B1 (en) | Method of generating a cryptographic key, network and computer program therefor | |
| KR20160106722A (en) | Encryption method and encryption device | |
| Awad et al. | Efficient image chaotic encryption algorithm with no propagation error | |
| US11082739B2 (en) | Data flow control method and apparatus | |
| CN113078997A (en) | Terminal protection method based on lightweight cryptographic algorithm | |
| CN114662147A (en) | Private information retrieval method and system suitable for large-scale database | |
| JP4228613B2 (en) | Serial digital signal transmission system | |
| JP5789054B2 (en) | Data encoding apparatus and method based on difference of complex amplitude | |
| Fehér et al. | Side channel security of smart meter data compression techniques | |
| CN114390065B (en) | Block chain network data rapid transmission method | |
| CN114866224A (en) | Text lightweight encryption method based on improved Feistel structure | |
| US10797859B2 (en) | Low area optimization for NB-IoT applications | |
| CN114564676A (en) | Method for improving data transmission efficiency of block chain network | |
| CN116614266A (en) | Data transmission method, device, equipment and storage medium | |
| CN111277605A (en) | Data sharing method and device, computer equipment and storage medium | |
| CN114553887B (en) | Block chain network point-to-point data transmission method | |
| KR101807259B1 (en) | Apparatus and methdo for encoding | |
| RU2188513C2 (en) | Method for cryptographic conversion of l-bit digital-data input blocks into l-bit output blocks | |
| Shkel et al. | Secure lossless compression | |
| Sunny et al. | Strengthening Security of Images Using Dynamic S-Boxes for Cryptographic Applications | |
| CN117353926B (en) | SM2 algorithm password processing method, device and equipment based on chip | |
| KR20190066691A (en) | Method for transmitting and receiving compressed data and apparatus using the same |
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 |