61 results about "Hash function" patented technology

The application relates to a data sharing method and device of a vehicle, electronic equipment and a storage medium, wherein the method comprises the following steps: in response to a data sharing instruction, a preset sharing random number of the vehicle is acquired, and a first random number of the vehicle is generated; a preset sharing random number is calculated by using a hash function to obtain a temporary key, and the first random number is encrypted by using the temporary key to obtain a first encrypted random number; a corresponding sharing ciphertext is generated by combining the first encrypted random number, a current time, a data integrity check value of the vehicle and a registration identification mark of the vehicle, and the sharing ciphertext is sent to a sharing end; after the sharing ciphertext is verified at the sharing end, an encrypted session generated by a second random number of the sharing end is received; the encrypted session is verified, and in the case that the encrypted session is verified to be qualified, the to-be-transmitted data of the vehicle is shared to the sharing end. Therefore, the technical problem that in the related art, it is difficult to avoid illegal means, the user's privacy information is called without user authorization, and there is a great security risk is solved.

This invention discloses an attack tracing method and system for end-to-end data transmission in optical communication, belonging to the field of optical fiber communication technology. The method includes: processing an initial key value using a hash function and DNA encoding to generate a DNA sequence; concatenating the DNA sequence to generate a session key and calculating its hash value; calculating a single-byte XOR checksum of the original data to generate extended data, generating ciphertext based on the extended data, and calculating a digest of the ciphertext; decrypting the ciphertext and performing XOR checksum consistency verification to obtain an event digest; calculating a root hash based on the key digest, parameter digest, ciphertext digest, and event digest, storing the root hash in the block header, and performing attack tracing on the block header to obtain the attack tracing result. This invention introduces four-dimensional chaos and DNA encoding to generate a high-entropy key, dynamically storing and updating the key through blockchain, while simultaneously achieving single-root verifiable attack tracing and quickly locating problematic nodes.

This invention relates to a method for updating a TESLA keychain, an electronic device, and a storage medium, belonging to the field of information security technology, and solves the technical problem of how to reduce the cost of TESLA keychain reset. The TESLA keychain update method includes: an authentication device generating a TESLA keychain; the authentication device generating a chameleon hash function and using the chameleon hash function to calculate the chameleon hash value of the TESLA keychain root; in response to entering a keychain replacement cycle, the authentication device broadcasting, or broadcasting through a broadcast node, the TESLA keychain root and a first random number generated to obtain the chameleon hash value; a terminal receiver using the first random number to verify whether the received chameleon hash value is correct, and determining whether to update the TESLA keychain based on the verification result.

The application relates to the field of Bluetooth data transmission security technology and discloses a Bluetooth data transmission encryption method based on an intelligent terminal. After the intelligent terminal and a receiving device establish a Bluetooth connection, a temporary session key is generated. A built-in hardware security module of the terminal is accessed to obtain a pre-stored root key. The root key and the temporary session key are used as inputs to generate a session encryption key with higher strength through a key derivation function. The session encryption key is used to encrypt data to be transmitted by using a symmetric encryption algorithm. The hash value of the original transmission data is independently calculated based on a hash function and used as an integrity check code of the data. The encrypted data and the integrity check code are encapsulated and sent to the receiving device through a Bluetooth protocol stack. The application strengthens the security of the key by combining hardware security and dynamic negotiation, and improves the anti-attack ability and reliability of Bluetooth data transmission by adopting an independent integrity check mechanism.

A semantically secure identification and communication method based on classical quantum channels comprises the following steps: constructing a classical quantum channel, selecting the input signal distribution and dividing the codeword, constructing an encoder, joint decoding, verification and identification, reliability analysis, and information leakage analysis. This invention divides the communication codeword into a main block and an auxiliary block. The main block uses an output statistical approximation of the transmission codebook, making it impossible for eavesdroppers to distinguish the communication signal from background noise. The auxiliary block uses a hash function for random mapping, preventing eavesdroppers from extracting valid information, thus achieving semantic security. Mapping the identification message to a combination of seed and hash value reduces the probability of confusion between different identification messages, improves identification accuracy, and provides a coding basis for analyzing false alarms, missed alarms, and information leakage. This invention has advantages such as strong confidentiality, strong concealment, high identification accuracy, and the ability to achieve identification communication while satisfying semantically secure requirements. It can be used for classical quantum secure communication.

A quantum security method, including: determining a session key; utilizing a hash function to process the session key to obtain a first string; combining the first string, a second string and a third string into a combined string; transmitting the combined string through at least one basis to generate a first single photon sequence, and transmitting the first single photon sequence to the receiver through a quantum channel; receiving the first single photon sequence and measuring the first string and the second string through the at least one basis to obtain a first return string and a second return string respectively, and transmitting a second single photon sequence; verifying the first return string, the second return string and a third return string sequentially to obtain a first verification result; and utilizing the hash function to verify the session key to obtain a second verification result.

A computer-implemented method for recovering a plaintext is disclosed. The plaintext (300) comprises a variable string (320). The method comprises constructing (S2) a tensor network (500) representing the variable string (320), optimizing (270) the tensor network (500), generating (S3), in a hash function generator (350), a candidate hash (370) based on the output of the tensor network (330), determining (S4) an overlap (390) between the candidate hash (370) and a reference ciphertext (380); and on reaching a zero-overlap value, determining the variable string (320), otherwise optimising the tensor network (500).

The application discloses a model construction method, device, equipment, medium and product. The model construction method comprises: acquiring feature data of a plurality of users; wherein each user has a plurality of feature data; each feature data is data corresponding to a service complained by the user; obtaining a hash function family based on the feature data of each user and a distance hash function; constructing a hash tree based on the hash function family; constructing a distance hash forest based on a plurality of hash trees; and predicting whether a to-be-detected user is a to-be-complained user based on the distance hash forest. According to the embodiment of the application, it is not necessary to determine whether the user is a complained user, so that it is not necessary to add a label to the complained user, unsupervised learning is realized, a model for predicting a to-be-complained user is obtained, and the accuracy of the prediction of the complained user is improved.

Provided are an information processing method, an information processing device, and a computer program that make it possible to achieve a hash function having strong one-wayness that is difficult to decode even by a quantum computer having advanced calculation capability.　This information processing method comprises: acquiring target input data; acquiring a first parameter, a second parameter, and a third parameter; converting the acquired input data into an irrational number using the first parameter; specifying a numerical value from the number of digits represented by the second parameter to the number of digits obtained by adding the width of number of digits represented by the third parameter in a decimal part of the irrational number obtained by the conversion; and defining the specified numerical value as a hash value generated by a hash function for the input data.

The application discloses a kind of support full staff decision and auditing post quantum editable block chain method and related equipment, this scheme gives the security efficient chameleon hash function based on lattice, and designs a kind of full staff decision and auditing post quantum editable block chain architecture based on the function, only one member has complete editing trap in the architecture, every time editing history block, all staff need to vote;Editor can only edit history block after obtaining a certain number of votes;Other members can verify the edited block.The scheme can solve the problem of centralized editing authority and quantum security vulnerability in editable block chain, so that all participants can jointly decide whether to modify a certain history block, and can verify the modified block, to realize full staff decision and auditing post quantum editable block chain.

This application relates to a matrix multiplication approximation calculation method based on a multi-hash voting mechanism. The method includes: a source computing node in the inference system obtains the token activation value matrix of the data to be inferred, which is to be sent to the target computing node where the target expert resides; the source and target computing nodes perform hash compression and voting operations on the token activation value matrix and the expert weight matrix respectively based on multiple preset hash functions to generate corresponding sketch sets; during the All-to-All communication process at the MoE layer, the source computing node sends the sketch set of the token activation value matrix to the target computing node; the target computing node performs approximate calculations based on the rows selected from the intersection of the two sketch sets to obtain the inference result. This method improves the inference efficiency of the inference system by introducing multiple independent hash functions for collaborative sampling and voting, thereby reducing computation, memory usage, network load, and GPU idle waiting time.

The application discloses an RIS-CSK index modulation method based on Hash mapping and belongs to the technical field of visible light communication and intelligent reflecting surface. The method realizes data transmission by constructing a communication system composed of an LED transmitting end, a Hash mapping module, an RIS reflecting array and a PD receiving array. The transmitting end divides input data bits into CSK modulation data and RIS index data, wherein the CSK data generates an RGB optical signal through M-order color shift keying modulation, and the index data generates an RIS activation mode through a Hash function mapping to control RIS group reflection. The receiving end uses a maximum likelihood detection algorithm to jointly detect CSK modulation symbols and RIS index information, and uses a maximum minimum Euclidean distance optimization strategy to improve the distinguishability between received signals. The application can realize efficient and stable data transmission in a visible light communication scene where a line-of-sight link is blocked, and reduce the system bit error rate.

This application provides a database access control method and computer device. The method first receives a privileged access request and generates a request digest and session identifier to determine the session validity period. Then, after the approval node completes valid signing, a threshold authorization token is generated. Next, an alias seed is generated using a key derivation function with an alias root key and multiple authorization information including at least the threshold authorization token and session identifier. Based on this seed, a transient access alias and a role lease identifier are derived using a hash message authentication code and a hash function, respectively. Finally, a zero-resident privileged session is established based on the transient access alias, role lease identifier, and session validity period, valid only in the current session. The transient access alias and role lease identifier are reclaimed when the session ends or a revocation condition is triggered. Through these steps, security risks are reduced, and on-demand, dynamic, and revocable database privileged access control is achieved, significantly improving database access security.

The present disclosure relates to a method and apparatus for electronic signature and, more particularly, to a method and apparatus for performing safe, post-quantum electronic signature using infinite continuity of a hash function and one-time key pairs. A method for electronic signature using a computing device according to one embodiment of the present disclosure comprises obtaining a message to be electronically signed; obtaining a plurality of public keys generated by a key generation algorithm, and based on the plurality of public keys, generating a signature verification value for the message, wherein the signature verification value includes at least one verification factor generated based on the different public keys or a value obtained by merging the different public keys.

The application discloses a kind of secure and efficient joint range query methods for encrypted database, solve the problem of long time consumption, improve the joint range query efficiency of encrypted database.The method includes data owner generates system parameters, including finite field, hash function, pseudo-random function and three-party secret sharing parameters;For the table in database, construct JQR and XQR index, use hash function and shared key, encrypt it into encrypted index by three-party secret sharing, distribute to three cloud servers;Query user generates query token according to request, and sends to cloud server.Cloud server uses the token and key held, based on three-party sharing parameter collaborative calculation and secret welding protocol, executes joint query to encrypted index;Cloud server rearranges the position of encrypted index by secret sharing based on casual permutation, and collaboratively generates new shared key to update index.

The application provides a message signature method applied to a chip, comprising: initializing a T context of a tree hash function T function; the T context comprising: a cache field value, a data size field value, and an iteration field value; dividing the initialized cache field value and a plurality of node hash values according to a predefined data block size to obtain a plurality of data blocks, and updating the initialized cache field value and the initialized data size field value in the dividing process; in the case that the updated cache field value is empty and the updated data size field value is equal to a total data size, performing a hash iteration operation on the plurality of data blocks, and updating the initialized iteration field value in the hash iteration operation process; and determining a first signature value based on the updated iteration field value.

The application relates to a social network repeated event detection method based on repeated subgraph pattern mining. The method comprises the following steps: obtaining a social network snapshot graph of a current timestamp, mapping an m-edge subgraph related to a newly inserted edge e in the social network snapshot graph into a corresponding bucket of a first auxiliary data structure by using a first hash function, and updating the frequency and frequency counter state of a subgraph pattern in the corresponding bucket; obtaining the frequency of the updated subgraph pattern, and if the frequency is equal to a support threshold value sigma, mapping the corresponding four-element information of the subgraph pattern into a corresponding unit of a second auxiliary data structure by using a second hash function, and updating the four-element information in the corresponding unit; and obtaining repeated events in the current social network according to the events corresponding to the subgraph pattern in the updated second auxiliary data structure. The method can efficiently detect repeated events on a social network stream graph.

The application relates to a low-orbit satellite-based Internet of Things terminal random access method, which comprises the following steps: S1. acquiring a downlink synchronization signal and a system information block periodically broadcast by a target low-orbit satellite; S2. calculating a theoretical Doppler frequency offset value between a terminal and a satellite according to satellite ephemeris information and a terminal self-position; S3. selecting a target compensation value closest to the theoretical Doppler frequency offset value from the Doppler pre-compensation parameter group; S4. generating an access time slot selection seed by using a pre-defined hash function according to a current beam coverage area identifier; S5. non-uniformly selecting a target access time slot within a random access time window based on the access time slot selection seed; and S6. pre-compensating a preset random access preamble sequence in an uplink frequency by using the target compensation value in the target access time slot, and sending the compensated preamble sequence to the target low-orbit satellite to initiate random access.

A method of generating a blockchain transaction comprising: generating a transaction comprising a locking script comprising a first shared hash value (HV) generated by applying a hash function (HF) to a second shared HV, wherein the second shared HV is generated by applying a HF to a combination of the respective public keys, and wherein the locking script is configured to require an unlocking script to comprise a target public key, a target signature, and an intermediate HV generated based on all but one of the respective public keys, apply the HF to the target public key to generate a target HV, combine the target HV and the intermediate HV to generate a target second shared HV, apply the HF to the target second shared HV to generate a target first shared HV, an verify that the target first HV matches the first shared HV, and verify the target signature.

The application discloses a target point space-time range retrieval method, extracts time and space information in a target point to form a space-time point required by indexing; calculates a hash value of the space-time point through a space-time hash function, the space-time hash function can divide space-time into continuous and non-overlapping space-time units, and gives a unique hash value to represent a corresponding space-time unit; constructs a first-level index according to the hash value of the space-time unit, and stores an address of a high-dimensional tree index of the space-time point in a range of the space-time unit; adopts the high-dimensional tree index to construct a second-level index, and inserts the space-time point into the second-level index indicated by a corresponding index item in the first-level index; finds a first-level index item intersected with a queried space-time range, and further finds the space-time point required to be queried on the second-level index indicated by the found first-level index item. The application improves retrieval efficiency and precision.

The application discloses a multi-functional hash function construction method and circuit device based on a turbo encoder, and proposes a new security strategy and a new overall structure for ICCS new commercial secret hash standard collection.The overall structure is as follows: a master control unit is a turbo encoder, a controlled unit is a nonlinear logic iterator, the controlled unit works in a block cipher mode or a strong permutation mode, and the c.r of the controlled unit is preferably outputted, and the c.r is outputted and updated by the master control unit, and the plaintext block updates the state of the master control unit.The application point is that the c.l of the controlled unit is not directly modified and directly outputted, and the security capacity c.l is used to resist the original image attack and the collision attack.The technical effect is that the maximum code rate + the anti-original image / state capacity is an optimal design, the sponge structure is enabled to increase the code rate, a large state capacity large input large output overall structure is constructed by supporting a plurality of small state capacity overall structures, the controlled units are basically the same, so that one circuit supports a combination mode / decomposition mode, and one set of code covers a family of algorithms.The multi-function is hash / xof, mac or duplex mode.

The application discloses a database data query method and device based on a state dictionary, electronic equipment and a storage medium. Its features include: receiving a data query instruction for a target database, determining target query data corresponding to the data query instruction; performing hash calculation on the target query data according to a hash function group stored in the state dictionary to determine a query hash value of the target query data; if a target hash value identical to the query hash value exists in a hash bit array stored in the state dictionary, the data query instruction is sent to the target database for data query. The application realizes pre-query of data stored in the database, can filter data not existing in the database through the state dictionary, reduces the number of invalid data query to the database, and improves the query efficiency.

A circuit and corresponding method enable bitcoin mining in a blockchain network. The circuit comprises a nonce generator that generates a nonce value, on a cycle-by-cycle basis, and changes only one binary digit of the nonce value per cycle. The circuit further comprises a hash engine that inserts, on the cycle-by-cycle basis, the nonce value into a block header of a block candidate and generates a digest by applying a hash function to the block header. The block header includes a representation of a target value. The circuit further comprises a validator that compares, on the cycle-by-cycle basis, the digest to the target value. In an event the digest satisfies the target value, the validator submits the block candidate to the blockchain network, causing newly minted bitcoin to be mined from the blockchain network. Changing only one binary digit of the nonce value, per cycle, reduces the circuit's power consumption.

The present application relates to the technical field of identification coding, in particular to a potato starch food mapping labeling system and a food coding method, the system comprising: a starch return coding mapping module, configured to read a starch packaging identification barcode and a damp lump return character of a potato starch food according to a storage node input parameter, obtain a return isolation identification code, call a set hash function to perform a hash mapping operation on the return isolation identification code, and obtain a penetration prevention bit array identification code. In the present application, a continuous calculation relationship formed by combining a delivery time stamp, a starch consumption value, an absolute inventory quantity, and a supplier delivery period code can identify a buffer depletion trend before actual supply interruption occurs, so that the replenishment action is changed from passive response to proactive response, and the out-of-stock identification parameter is directly transcribed into pointing information in a pre-allocated replenishment mapping table, thereby enhancing the corresponding accuracy between the purchase target, the replenishment location, and the scheduling order.

This invention discloses a quantum-attack-resistant blockchain-based password authentication key exchange and authentication method. The method involves inputting preset parameters, a trapdoor, a matrix, a noise vector, a password, and a public key into a computer system; executing a parameter generation algorithm to generate public parameters; executing a hash key generation algorithm to generate a hash key and a projected hash key generation algorithm to generate a projected hash key; generating a tag based on the identifiers of both communicating parties and the projected hash key, encrypting it to obtain ciphertext, and transmitting and receiving the projected hash key and ciphertext from the communicating party; verifying the validity of the communicating party's projected hash key, and generating a session key based on relevant parameters; and finally, the computer system processor executes a computer program and outputs the session key. This invention integrates a lattice-based smooth projected hash function with a trapdoor and a blockchain structure, possessing quantum attack resistance, general composable security characteristics, requiring only one round of communication, and is suitable for large-scale blockchain node scenarios.

The application discloses a medical knowledge graph construction method based on big data and belongs to the computer field. The method comprises the following steps: extracting a semantic feature vector of a medical entity in a heterogeneous medical text by using a deep learning model; mapping the vector into a binary hash code by using a hash function and distributing the binary hash code to a semantic hash bucket; calculating a Hamming distance between entities in the bucket, and merging the entities into a same semantic node when the Hamming distance is less than a threshold value; mapping the merged node to a medical standard ontology library to obtain a standard term code; and establishing an associated edge according to a co-occurrence frequency and a context semantic between entities and storing the associated edge in a graph database. By introducing the semantic hash technology, the application converts high-dimensional comparison into bit operation, significantly improves the processing efficiency and semantic alignment accuracy of massive heterogeneous data, ensures the consistency of terms, and forms a rigorous logical closed loop.

Embodiments of the present specification provide a method and device for privacy intersection. In the method, a plurality of hash values of each source identifier corresponding to each data owned by a data source party are obtained by using a plurality of hash functions to hash each source identifier, and a mapped binary array serving as a filter is obtained by mapping the plurality of hash values corresponding to each source identifier to corresponding elements in the binary array. A query party receives the filter from the data source party, hashes a to-be-queried identifier by using the plurality of hash functions to obtain a plurality of to-be-queried hash values, maps the plurality of to-be-queried hash values to the filter to determine values of corresponding elements to which each to-be-queried hash value is mapped, and determines that the data source party does not have data matching the to-be-queried identifier when a first value exists in the corresponding element to which the to-be-queried hash value is mapped.

This application relates to a file query method, apparatus, computer device, storage medium, and program product. The method includes: obtaining a file identifier to be queried; determining a query hash value corresponding to the file to be queried based on the file identifier and at least one preset hash function; and determining a query result for the file to be queried based on preset element values ​​at each bit of a preset bit array and the query hash value. The preset element values ​​include a first element value and a second element value, where the first element value is the element value corresponding to a whitelisted file. This allows for the determination of whether a file to be queried is a whitelisted file using a fixed number of hash calculations and bit array accesses, reducing the time complexity of file queries and improving file query efficiency. Furthermore, using a bit array to store the element values ​​corresponding to whitelisted files also saves storage space.

A method, performed in an environment where data transmission is vulnerable to quantum computers, for comparing a first dataset and a second dataset, in particular with a view for determining whether these two datasets are identical. The method not requiring the presence of these two datasets in the apparatus, and including the following steps of: a) mixing a number, called the mixer number, with the first dataset, using a mixing function, in order to obtain mixed data, b) hashing the mixed data using a hash function, wherein the a length of the mixer number is longer than a length of the hash and c) comparing the hash thus obtained in step b) with a third dataset assumed to be the hash of the second dataset mixed with the same mixer number as that used in step a) and with the same mixing function.

A method and system to increase security in VPN services are provided. The method comprises receiving, at a VPN terminator, a message sent by a first computer device at a first site intended for a second computer device at a second site; encrypting the received message, at the VPN terminator, using a first shared session key, the first shared session key being updated using a first renegotiated session key; and routing, by the VPN terminator, the encrypted message to the second computer device. The method further comprises periodically combining the first renegotiated session key with a first LLB shared secret to generate a first hash function, which is used to create the first shared session key. The first LLB shared secret is computed by hashing a value of at least one selected random seed with another LLB shared secret.