94 results about "Block size" patented technology

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 2 / 3, a second parity check matrix corresponding to a first exponent matrix comprising 768 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

The invention relates to the technical field of data security, can be applied to business scenes of financial science and technology, medical health and the like, and discloses an encryption processing method, device, equipment and medium based on chaos parameter adjusting.The encryption processing method comprises the steps that a composite chaos signal is generated based on a chaos module, and feedback information is dynamically extracted in combination with a hash function; an error vector is constructed, chaotic module parameters are adjusted, an updated composite chaotic signal is generated, a key stream is generated through quantization, the data block size is determined according to the amplitude of the error vector, block encryption target data is driven through the key stream, and dynamic cooperation of the key stream and the data encryption process is achieved. According to the method, a chaos module, a hash function and a dynamic adjustment mechanism are closely combined, real-time hash value feedback control over dynamic evolution of chaos parameters is achieved, error driving adjustment is introduced in the key stream generation process, the continuity and randomness of key stream entropy values are improved, and the key stream generation efficiency is improved. The problem of low efficiency of hash static application and encryption processing in the prior art is effectively solved.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 1 / 2, a second parity check matrix corresponding to a first exponent matrix comprising 1152 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

Embodiments of this disclosure provide methods, systems and apparatus for adaptive transport block size determination and code block segmentation. In the methods, segmenting the plurality of information bits to a plurality of code blocks may be based on a maximum code length and / or a maximum information block size. And then the plurality of code blocks may be encoded to a plurality of code words. The methods for adaptive transport block size determination and code block segmentation may be used in the scenarios that require a flexible code length or multiple code lengths. The methods may decrease the complexity of encoding and decoding and increase the performance.

The application discloses an operation method and device based on an artificial intelligence model, equipment, a medium and a product, and relates to the technical field of computers.The method comprises the following steps: acquiring source data of target operation; wherein the source data comprises a first matrix and a second matrix; judging whether the target operation is block calculation; if yes, determining a first block size of the first matrix and a second block size of the second matrix; storing the first matrix as a plurality of first block matrices according to the first block size, and storing the second matrix as a plurality of second block matrices according to the second block size; and in the process of executing the target operation, the plurality of first block matrices and the plurality of second block matrices are read in sequence to realize the target operation and obtain a target operation result.The application improves operation efficiency and saves hardware resources.

The invention discloses a block chain data processing method and system, and the method comprises the steps: carrying out the fragmentation processing of original data into a plurality of small pieces greater than or equal to 1, and enabling the size of each small piece to accord with the size of a block of a block chain; performing homomorphic encryption processing on the fragmented original data; constructing an MH + tree, and improving a block chain storage structure by using the MH + tree; storing the encrypted data in an under-chain server, and storing related data of the encrypted data on a block chain; verifying the encrypted data by using a smart contract and a consensus mechanism; performing block chain dynamic authority management through the block chain storage structure; performing interaction according to the encrypted data of the multiple nodes, and analyzing related data on the block chain to obtain an analysis result; and providing feedback information according to an analysis result. Through the method provided by the invention, the privacy and query efficiency of the data are improved through encrypted storage and secure calculation in the block chain, and the efficiency and transparency are improved through automatic verification and processing of the data.

A plaintext is received. For example, a plaintext may be a text record that is to be encrypted and then stored in a database. A determination is made to see if a size of the plaintext is above a threshold. The threshold is based on an efficiency of a Format Preserving Encryption (FPE) algorithm. In response to the size of the plaintext being above the threshold: the plaintext is divided into a plurality of blocks based on a block size; each of the blocks are individually encrypted using the FPE algorithm; and each of the blocks are stored as a single FPE cyphertext. This makes the FPE encryption process much more effacement than has previously been achieved. For example, the FPE process may be 30% more efficient depending on the size of the plain text.

Method for encrypting a plaintext with a block cipher E of block size L E using a symmetric key K, characterized in that a fingerprint function (FP u ) is used, which satisfies the two requirements that from two unequal bit sequences (BF1 ≠ BF2) with a sufficiently high probability for the application, it follows that the results of the application of the fingerprint function (FP u ) on these bit sequences are unequal (FP u (BF1) ≠ FP u (BF2)), and that to the fingerprint function (FP u ) a fingerprint reversal function (FP u -1 ) exists, so that the following always applies: FP u -1 (FP u (BF) || BF[u+1..L(BF)]) = BF[1..u], where u and L Edo not necessarily have to be equal, and a general cipher EGen is used by applying the fingerprint function to the concatenation of the complete first u bits PB u 1 of the plaintext and selected or all bits FPlnput of the remaining plaintext, and then the first block of the ciphertext CB 1 by EGen encryption of the u-bit long result FP u (PB u 1 || FPInput), i.e. CB 1 := EGen(FP u (PB u 1 || FPlnput)), and the resulting encryption of the first u bits of the plaintext CB 1 as initialization vector IV := CB 1 for the encryption of parts of the or of the remaining plaintext with the block cipher E, using any operating mode requiring an initialization vector (IV).

Several methods are described to jointly use the ABT (Asymmetric Binary Tree) partitioning mode and Matrix-based Intra Prediction (MIP). In a first embodiment, we propose to forbid the use of the MIP intra prediction mode, for block sizes that are resulted from ABT partitioning. In a second embodiment, we propose to allow the MIP intra prediction for block sizes not equal to a power of two in width or height, by extending the block before MIP and crop the predicted block to the original size after MIP. In a third embodiment, we propose to adapt the down-sampling of the boundary reference samples and the up-sampling of the reduced predicted blocks, to the block sizes introduced by ABT partitioning. In a further embodiment, we set the reduced predicted block to size 8×8 in any case the initial block size is 8 and larger than 8 in a direction.

An apparatus may include a transmitter (120) and one or more processors (2010). The one or more processors (2010) may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check, QC-LDPC, code according to a code rate of 1 / 2, a second parity check matrix corresponding to a first exponent matrix comprising 1152 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors (2010) may encode data using the second parity check matrix. The transmitter (120) may be configured to transmit the encoded data.

To provide an image encoding and image decoding method of efficiently compressing information necessary for quantization parameter determination.SOLUTION: An image decoding method includes the stages of: determining a predicted quantization parameter of a current quantization group determined according to at least one of block split information and block size information; determining a difference quantization parameter of the current quantization group; determining a quantization parameter of the current quantization group, based on the predicted quantization parameter and the difference quantization parameter of the current quantization group; and inverse quantizing a current block included in the current quantization group, according to the quantization parameter of the current quantization group.SELECTED DRAWING: Figure 20

An encoding method and apparatus thereof and a decoding method and apparatus thereof are provided. A method for decoding an image includes the steps of determining a prediction quantization parameter of a current quantization group determined according to at least one of block partition information and block size information, determining a differential quantization parameter of the current quantization group, determining a quantization parameter of the current quantization group based on the prediction quantization parameter and the differential quantization parameter of the current quantization group, and dequantizing a current block included in the current quantization group according to the quantization parameter of the current quantization group.

The invention discloses a data encryption method and device in a file transmission process, equipment and a medium, and relates to the technical field of computer security, and the method comprises the steps: obtaining to-be-transmitted data in a UEFI file, and carrying out the block processing of the to-be-transmitted data according to a preset block size, so as to obtain a plurality of plaintext blocks; performing an AES encryption process on each plaintext block, and performing column mixing operation on each plaintext block to obtain a process matrix; carrying out expansion processing on each process matrix based on the confusion vector so as to obtain a target matrix with two newly added columns; and re-splicing each target matrix to obtain an encrypted ciphertext result. The problem that the same plaintext generates the same ciphertext is avoided through a mode of obtaining the target matrix by performing extension processing on the process matrix, and the security of the file transmission process is enhanced.

The invention particularly relates to a teaching method of a micro encryption algorithm. According to the teaching method and system for the miniature encryption algorithm, in teaching activities, the miniature encryption algorithm Mini-Encrypt is adopted as an entry-level teaching tool, and replacement operation, self-password generation, expansion, exclusive-or operation and S-box replacement operation in the encryption algorithm are displayed for students to carry out modification and experiment and simulate password analysis attack of a user-defined type. According to the teaching method of the micro encryption algorithm, the network structure is simplified, the scale and the cycle number of data blocks are reduced, simplified S box replacement is introduced, the confusion degree and the encryption effect of the algorithm are ensured, the core idea of the encryption algorithm can be displayed more clearly, and the teaching method is suitable for teaching demonstration and lightweight application scenes.

An apparatus may include a transmitter and one or more processors. The one or more processors may be configured to identify, according to a code rate of 5 / 6 and a code block size of 7776 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code, the first binary parity check matrix corresponding to a first exponent matrix. The one or more processors may be configured to encode data using the first binary parity check matrix. The transmitter may be configured to transmit the encoded data.

Instructions to generate a seed via quantum random number generation for cryptographic synchronization within a federated quantum computing environment comprising a quantum computing system and one or more second quantum computing systems are received by the quantum computing system. Information descriptive of one or more characteristics of (a) the quantum computing system, or (b) some other computing entity of the federated quantum computing environment is obtained. A seed chunk size is determined based at least in part on the one or more characteristics. The seed is generated for cryptographic synchronization, wherein a size of the seed is equivalent to the seed chunk size. The seed is provided to the one or more second quantum computing systems.

A storage array controller may receive a write request comprising data to be stored at one or more solid-state storage devices. A write granularity associated with the write request may be generated that is less than a logical block size associated with the storage array controller. The data associated with the write request may be segmented based on the generated write granularity. The write request may be executed to store the segmented data at the one or more solid-state storage devices.

The invention discloses a terminal information security protection system and method, and relates to the technical field of information security. The encryption round number is dynamically determined through terminal hardware state data and to-be-protected data attributes, and self-adaptive matching of encryption strength and terminal resources is achieved; generating an initial key and a secret parameter according to the key material, and driving key expansion and encryption structure configuration through the secret parameter to obtain a key matched with the size of the data block; and performing multi-round encryption on the data by adopting a preset encryption strategy, and adding the meta-information to a ciphertext header for verification and decryption. The dynamic nature and the unpredictability of the secret key and the encryption structure are enhanced while light weight is guaranteed, the resistance to differential analysis, linear analysis and side channel attacks is effectively improved, and the reliability and the practicability of terminal information security protection are improved.

The present disclosure provides a method and system for determining a cache size and allocating cache. A batch of requests for storing data in cache is received and associated with a set of counters configured to obtain respective estimated counts of unique hashed keys of requests associated therewith. Requests may be associated with respective counters in accordance with respective size of each request and a respective data block size associated with each counter. Estimated count of unique hashed keys of requests may be obtained at each counter for a selected expiry time based on Time to Live indicators of requests. Cache size to be allocated is computed by, for counters in the set, summing over a product of respective estimated count of hashed keys of requests at a counter with the data block size associated with the counter.

An apparatus (105) includes a transmitter (120) and one or more processors (2010). The one or more processors (2010) is configured to identify, according to a code rate of 1 / 2 and a code block size of 7776 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check, QC-LDPC, code, the first binary parity check matrix corresponding to a first exponent matrix. The one or more processors (2010) encode data using the first binary parity check matrix. The transmitter (120) transmits the encoded data.

The invention discloses a coding and decoding method, a code stream, a coder, a decoder and a storage medium. The method comprises the following steps: indicating whether a to-be-coded and decoded unit performs attribute prediction by using an inter-frame nearest neighbor search algorithm based on a spatial relationship through first syntax element identification information; in use, further determining the block size corresponding to the current LOD layer in the to-be-decoded unit; according to the block size corresponding to the current LOD layer, determining a reference block corresponding to the current point in the reference frame and a neighborhood block having spatial correlation with the reference block, performing inter-frame nearest neighbor search, and determining N neighbor points of the current point; and performing attribute prediction on the current point according to the N neighbor points to determine an attribute reconstruction value. Therefore, inter-frame nearest neighbor searching is carried out on the attributes of the point cloud based on the spatial correlation of the attributes of the point cloud, attribute prediction is carried out by using the searched N neighbor points, the correlation of the attributes of the point cloud between adjacent frames can be further removed, and the encoding and decoding efficiency of the attributes of the point cloud is improved.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 1 / 2, a second parity check matrix corresponding to a first exponent matrix comprising 1152 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 2 / 3, a second parity check matrix corresponding to a first exponent matrix comprising 768 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

In some implementations, an apparatus may include a transmitter and one or more processors. The one or more processors may be configured to identify, according to a code rate of 1 / 2 and a code block size of 3888 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check (QC-LDPC) code. The first binary parity check matrix may correspond to a first exponent matrix having 288 values. The one or more processors may be configured to encode data using the first binary parity check matrix. The one or more processors may be configured to transmit the encoded data.

The invention belongs to the technical field of artificial intelligence, and relates to a log processing method and device, computer equipment and a storage medium, and the method comprises the steps: obtaining log data generated based on a consultation request of a user; performing format arrangement on the log data to obtain first log data; performing key generation processing on the user identification data to obtain an encryption key; generating a target encryption block size of the target symmetric encryption algorithm based on the data scale of the first log data; based on the encryption key and the size of the target encryption block, encrypting the first log data by using a specified encryption mode of a target symmetric encryption algorithm to obtain second log data; performing digital signature on the second log data based on a target digital signature algorithm to obtain a target digital signature; and storing the second log data and the target digital signature. In addition, the second log data may be stored in the block chain. The log processing method and device can be applied to log processing scenes in the financial field, and the safety and accuracy of log processing are effectively improved.

The invention relates to a system and a method for block Kronecker-based low density parity check (LDPC) codes with a 1 / 2 code rate. An apparatus may include a transmitter and one or more processors. The one or more processors may identify, based on a first parity check matrix of a first quasi-cyclic low density parity check (QC-LDPC) code according to a 1 / 2 code rate, a second parity check matrix corresponding to a first exponential matrix including 1152 values of a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors may encode data using the second parity check matrix. The transmitter may be configured to transmit the encoded data.

This application provides a method for determining a transport block size and a communication apparatus, which may be used in systems such as vehicle-to-everything, V2X, and V2V A receive-end terminal device and a transmit-end terminal device may determine a quantity of encoded symbols based on a symbol length used for sidelink communication in a time unit and an scaling factor, and may further determine a transport block size of a data channel based on the quantity of encoded symbols. Therefore, for all slots used for sidelink communication, a same quantity of encoded symbols can be determined, and a same transport block size can be further determined. In this way, initial transmission or retransmission of a transport block can be performed in each slot used for sidelink communication, to avoid a limitation on selection of a transmission resource and a resulting transmission delay.

The application discloses a kind of electronic archive security storage method and system based on block chain, it is related to security storage technical field;Initial key is generated by key generation algorithm, and sub-key set is obtained by segmenting initial key with preset length;Target block size is determined according to sub-key set;Target sub-key set is obtained by dynamically updating sub-key set according to target block size;Electronic archive data is acquired, and sub-ciphertext data set is obtained by encrypting electronic archive data according to target sub-key set;The hash value of each sub-ciphertext data in sub-ciphertext data set is calculated to obtain sub-hash upload value set;Sub-hash upload value set is stored by block chain by preset algorithm.It is determined that target block size is enhanced by sub-key set, and then sub-key set is dynamically updated according to target block size, and the flexibility and security of encryption are enhanced, and electronic archive security storage efficiency is improved.

The invention relates to the technical field of file processing, and discloses a quick decryption method for an encrypted file, which comprises the following steps of: uploading the encrypted file to a computer, mapping the encrypted file of which the size is modified to a virtual memory space of the computer, and determining a corresponding mapping space; decrypting the encrypted file according to a preset encryption block size sequence, decrypting one encryption block every time, and temporarily storing the decrypted content in a buffer area; when the second encryption block and the subsequent encryption block are decrypted, the decryption content corresponding to the previous encryption block is copied to the position pointed by the current write pointer from the buffer area, and the read pointer and the write pointer are moved until all the encryption blocks are decrypted; after decryption is completed, the virtual memory space, mapped to the computer, of the encrypted file is relieved, a corresponding decrypted file is determined, the decrypted file is synchronized to the computer, and the size of the decrypted file is modified into the actual size of the encrypted file after final decryption. According to the method and the device, the encrypted file can be efficiently decrypted.

An apparatus may include a transmitter (120) and one or more processors (2010). The one or more processors (2010) may identify, based on a first parity check matrix of a first quasi-cyclic-low-density parity-check (QC-LDPC) code according to a code rate of 5 / 6, a second parity check matrix corresponding to a first exponent matrix comprising 384 values for a second QC-LDPC code. The second QC-LDPC code may have a code block size that is twice a code block size of the first QC-LDPC code. The one or more processors (2010) may encode data using the second parity check matrix. The transmitter (120) may be configured to transmit the encoded data.