41 results about "N-Hash" patented technology

Described embodiments provide a hash processor for a system having multiple processing modules and a shared memory. The hash processor includes a descriptor table with N entries, each entry corresponding to a hash table of the hash processor. A direct mapped table in the shared memory includes at least one memory block including N hash buckets. The direct mapped table includes a predetermined number of hash buckets for each hash table. Each hash bucket includes one or more hash key and value pairs, and a link value. Memory blocks in the shared memory include dynamic hash buckets available for allocation to a hash table. A dynamic hash bucket is allocated to a hash table when the hash buckets in the direct mapped table are filled beyond a threshold. The link value in the hash bucket is set to the address of the dynamic hash bucket allocated to the hash table.

The invention discloses a data storage method for mass unstructured data. The method comprises the steps that firstly, a time interval T is set, a data storage cluster is divided into a plurality of zones, records obtained at the same time interval T are stored in the same zone, and meanwhile each zone is divided into n hash zones; secondly, for each unstructured record, the generated time t of the unstructured record and one or more key information key solely expressing the unstructured record are extracted; thirdly, according to the time t of each record, the zone where the records are stored is determined, and the corresponding hash zone values of the records in the zones are calculated according to the key information of the record; fourthly, the records which are in the same time interval and are the same in hash zone value are written in the same file F according to the calculation result in the step three, the number of the records in the file F is counted, and if the number of the records is larger than the set threshold value K, another file is established in a current hash zone for storage. According to the storage method, the data retrieval efficiency can be greatly improved.

The invention provides a PE traffic scheduling method and device which are applied to PE equipment of a VCF system. The method comprises the following steps that a Trunk a and a Trunk b are established for a first exchange chip, wherein the Trunk a comprises N Hash positions, and the N Hash positions are allocated to a port of G1 and a port of G2 respectively; the Trunk b comprises N Hash positions, and the N Hash positions are respectively allocated to the port of G2; the Trunk in the port of the G1 is marked as a, and the Trunk in the port of G2 is marked as b; a second exchange chip is processed in the same way; local forwarding items of uplink traffic on PE are issued to the first exchange chip and the second exchange chip, wherein outlets of the local forwarding items are uplink ports of the exchange chips; at least one Hash position in the corresponding Trunk is allocated again according to variation of the uplink state of an uplink port correspondingly. Compared with the prior art, uplink traffic can be more evenly distributed to all the uplinks of the two exchange chips.

A method and apparatus are provided for simply and securely limiting a number of times that contents can be accessed using a hash chain. The apparatus limiting a number of times contents are accessed by a user terminal includes a hash chain generator receiving information indicating selected contents by the user terminal and information indicating how many times (n) the user terminal has authority to access the selected contents and generating a hash chain including n hash values derived from a seed value, and a contents access manager deleting the hash values one by one from the hash chain whenever the user terminal accesses the selected contents such that the number of times the contents can be accessed by the user terminal is decreased by the number of deleted hash values.

The invention provides a determination method and device for media access control (MAC) address Hash collision. The method comprises performing N-order Hash on key values, obtaining N Hash values, enabling N to be an integer larger than 2; respectively using M Hash values to search M Hash tables in a one-to-one correspondence mode, obtaining M Hash table items, and enabling M to be smaller than N; using (N-M) Hash values in the N Hash values except the M Hash values to undergo ergodic comparison with the Hash values in the M Hash table items, and searching and/or studying MAC addresses where Hash collision exists. According to an embodiment, by performing multiple-order Hash on the key values, the probability of the Hash collision is effectively reduced, and accordingly occupation of a ternary content addressable memory (TCAM) space is greatly reduced.

The invention provides a task scheduling mechanism and system based on a consistent hash algorithm. The method comprises the steps of obtaining a hash value of an available execution unit and a hash value of a task to be executed; distributing the hash value of the execution unit and the hash value of the task to a consistent hash ring; obtaining the execution times of the task; choosing a search direction; searching for n hash values of corresponding execution units closest to the position of the hash value of the task on the consistent hash ring according the search direction; enabling the value of the n is equal to the value of the execution times; obtaining n execution units corresponding to the hash values of the n corresponding execution units; establishing a mapping relation between the task and the n execution units; establishing a mapping table from the execution units to the task according to the mapping relation. According to the task scheduling mechanism, the consistent hash algorithm is applied to a task scheduling technology, the task and the execution units can be flexibly matched, and the scheduling requirement of periodical tasks can be met.

The invention discloses a video stream address authentication method. The method comprises the following steps: if a live video viewing instruction of a target room on a live broadcast platform is received, obtaining M authentication elements, wherein the authentication elements are related to the current state of a client or the target room; determining a target hash function matched with a first authentication element in the M authentication elements from N hash functions through a multi-state hash function interface; calling the target hash function to calculate hash values of the M authentication elements; determining a target encryption function matched with a second authentication element in the M authentication elements from K encryption functions through a multi-state encryption function interface; calling the target encryption function to encrypt the hash values of the M authentication elements based on a random key released by a video stream server so as to obtain a video stream address authentication value; and sending a request carrying the address authentication value to the video stream server. By adoption of the video stream address authentication method disclosed by the invention, the technical problem of relatively low security of video stream address authentication is solved.

The invention discloses a special computing circuit for realizing Hash operation. The special computing circuit comprises at least one Hash computing module, The device specifically comprises a variable, a constant input unit, a Hash input unit, a Hash output unit and a Hash calculation unit. Wherein the number of times of iterative operation of the Hash operation is N, and each calculation modulecompletes N times of iterative operation by using N Hash calculation units; Wherein the N hash calculation units are connected through a hardware connecting line, a group of new input data is initially input to the hash calculation unit through the hash input unit in the clock period A of each calculation, and the hash input value of the next hash calculation unit is the hash output value of theprevious hash calculation unit; The number of the N variable input units and the number of the constant input units are correspondingly connected with the N Hash calculation units respectively and used for inputting corresponding variable values and constant values. And a result is output by the Hash output unit after the primary Hash operation is finished. By utilizing the special computing circuit, the power consumption and the cost of the computing circuit can be reduced during Hash operation.

The invention relates to a method for realizing data fusion and data privacy protection based on a Hash algorithm and the session control. The method comprises the following steps that a demand module sends a query request after Hash calculation to a mapping data providing module; the mapping data providing module inquires whether the data exists or not; a demand module queries the provider data from the portrait data providing module; a portrait data providing module inquires the previous n hash value lists; the mapping data providing module returns the hit information to the portrait data providing module; and the portrait data providing module queries the data. By the adoption of the method for realizing data fusion and data privacy protection based on the Hash algorithm and the session control, the leakage of the high-sensitivity information caused by query of low-sensitivity information is avoided, and the data derogatory caused by the data diffusion is also avoided. According to the implementation scheme, the user privacy information of three parties cannot be leaked except the user portrait information, so that the data privacy and the data security of the individual users and the enterprise users are guaranteed.

The invention discloses an FPGA-based Hash algorithm hardware realization device. At present, the HASH algorithm in the industry is basically based on pure software implementation, resulting in low Hash performance, especially in the case of long table entries, high-speed table lookup with large table entries or large data volumes that require encryption, relying on pure software implementation Hardly realistic. The present invention comprises a task distribution module, a Hash one-way function module and a result merging module, and is characterized in that: the input DATA data is disassembled into n small pieces by the task distribution module, which are respectively X1, X2...Xn, and then the Hash single Compute to the n Hash one-way functions in the function module to obtain n KEY values, and then perform the result merging calculation by the result merging module, and finally obtain the KEY value of the DATA data. The invention is mainly based on the FPGA to realize the Hash algorithm, and executes operations concurrently in slices, and the speed is dozens of times faster than that of pure software.

The invention provides a parallel Hash lookup table structure and method. The architecture comprises: a lookup Hash key value KEY determining a bit width according to requirements; n Hash functions, each choosing a different expression; n rams, independent of each other, corresponding to the Hash functions one by one; a Compare module, completing the comparison of n ram lookup results and the lookup key value KEY, and getting the correct look-up table content according to the comparison result, wherein each Hash function corresponds to a ram of different depths. The invention can effectively solve the problem of poor searching performance in the prior art and no longer needs multiple cyclic comparisons and hash calculations, and there is no need to read RAM space for multiple times, thereby greatly compressing the time of looking up table, and improving the efficiency of hash searching.

The invention discloses an image data set construction method and system and a computer readable storage medium. The method comprises the steps of dividing a first target hash value set which is obtained in advance to obtain corresponding hash value subsets having m hash values, with m being an integer larger than or equal to 1; extracting N hash values from any hash value subset respectively, andgenerating a first target hash value subset, wherein n is a positive integer smaller than or equal to m; calculating a union set of all the first target hash value subsets to obtain a second target hash value set, using a second target hash value set, and obtaining a corresponding image in the original image so as to construct a target image data set. The process of obtaining the first target hash value set includes obtaining an original image data set to obtain a corresponding original image, calculating a hash value of the original image, removing the repeated hash value according to the hash value obtained through calculation to obtain the first target hash value set. An image data set which is differentiated is constructed.

The invention discloses a method and a device for sending digital television signal data based on alternative text combination. The method comprises the steps: acquiring preset digital television signal data, and calling a preset key pair; performing encryption processing to obtain encrypted data, and sending the encrypted data; if signal receiving ends are all authorized terminals, acquiring n feature data sets; respectively carrying out Hash calculation to obtain n Hash values; performing discovery processing on coincident character fields to obtain n coincident character fields corresponding to the n hash values respectively; performing n-batch splitting processing on the private key to correspondingly obtain n private key section combinations; performing alternative text combination generation processing to generate n alternative text combinations corresponding to the n private key section combinations; and sending the ith splitting method, the ith alternative text combination and the ith interception method to the ith digital television signal receiving end, thereby improving the security of the secret key and the information security and realizing the fine control of the authority.