36 results about "Brute force" patented technology

The invention provides a molecular identity authentication system and method based on DNA origami framework layered assembly. The molecular identity authentication system comprises a disclosed skeleton chain and a plurality of shared staple chains, the shared staple chain comprises staple chains shared by three groups of single bodies and staple chains shared in pairs, and the staple chains are used as secret keys to be distributed to three participants so as to prepare the three groups of single bodies respectively, and then the three groups of single bodies are combined and spliced into a tripolymer with a dot matrix pattern, so that multi-user collaborative layered chain type assembly is realized. According to the molecular identity authentication system based on DNA origami framework layered assembly, the system combination complexity is improved to the information theory security level, so that the biological information security protection capability is improved, and brute force cracking is prevented.

The invention discloses an identity verification method and system, and the method comprises the steps: generating a verification result through a verification algorithm after an identity verification server receives an identity verification request; when the verification result is successful, generating a legal identity certificate; and when the verification result is failure, generating a counterfeit identity certificate, and generating at least one of counterfeit reasonable data, counterfeit reasonable authority and counterfeit reasonable abnormity. The method has the core advantages that fake reasonable information is returned when verification fails, so that illegal visitors cannot deduce correct identity information by using failure feedback and cannot distinguish the authenticity of acquired data, authority or abnormal prompts, illegal behaviors such as library collision attacks and brute force cracking are effectively avoided, and the safety of the visitors is improved. The defect that key information is leaked due to failure feedback in the traditional identity verification technology is overcome, and the security of system data and functions is remarkably improved.

The application discloses a kind of mobile terminal operating system information protection methods based on hardware certificate, comprising the following steps: one, in boot partition and recovery partition using asymmetric encryption algorithm write mutual certificate system of confirmation;Two, whether through boot partition or recovery partition start is needed to ensure the integrity of another partition.Current mobile terminal operating system can be read by the system partition file in the way of writing the third party system that can be started in recovery partition, there are mobile terminal operating system files directly read, brute force cracking user password authentication and other security problems, all the startable partitions of the system are introduced into the certificate using asymmetric encryption algorithm in the application, only the certificate and the partition are complete, the system can normally run, thereby preventing the system from being maliciously tampered with, ensuring that the user cannot obtain system root permissions and cannot modify system files, with higher security and convenience.

This technology is applied in the field of network security. This invention provides a method and apparatus for defending against SSH brute-force attacks through log analysis. The purpose of this invention is to solve the problem of inefficiency in existing security defense measures when they cannot cope with brute-force attacks. The main solution includes: acquiring security logs and system logs from monitoring devices and providing them to the perception module; acquiring the attacker's source IP address, username, and time; the perception module recording the attack source IP address, username, and time information in memory and performing statistics within a set time period; querying third-party professional threat intelligence to return the attack source IP address attribution information and threat score; the log threat analysis module defining the danger level of the brute-force threat based on the attack source IP address and threat score; and implementing different corresponding response measures based on the risk identification results of the threat analysis module.

The application provides a DFA algorithm-based card bin matching method and system, and relates to the technical field of Internet. The method comprises the following steps: constructing a card bin library, and locally caching database card bin information; storing the information into the local cache; when a service is started and initialized, first querying the database card bin information data to obtain a list set; traversing the set to take the card bin therein as a key and the entity data as a value; taking the first 6 bits of the card bin with 6 bits or more as the key, and directly taking the card bin with less than 6 bits as the key; first judging whether there is a key; when there is no key, taking a newly created list set as a value, and putting the card bin into the card bin library in a reverse order according to the length of the card bin; when there is a key, putting the card bin data into the list set, and storing the card bin into the card bin library in a reverse order according to the length of the card bin. The method can realize accurate and efficient matching of the card bin, and avoids the problem of removing the database brute force query.

The invention relates to the technical field of data transmission and network security, and discloses a multi-tenant data isolation and sharing method and system in an SaaS mode, and the method comprises the steps that a data owner client executes data isolation hierarchical encryption and blind storage, and deploys a sharing strategy to a block chain; the SaaS platform responds to the access request, calculates a risk score in combination with context features and historical audit data, and executes blind state key conversion after risk assessment and strategy contract verification are passed; and the receiver client verifies the signature, decrypts to obtain the plaintext data and returns the audit log. According to the invention, through a blind storage and blind calculation mechanism, isolation of data ownership and platform management right is realized, and the risk of plaintext data leakage caused by unauthorized access of a platform administrator and key leakage of a server side is effectively prevented; and meanwhile, a dynamic risk assessment mechanism is utilized to identify account embezzlement and brute force cracking risks, and safe sharing of data is guaranteed.

The invention discloses an anti-quantum cryptography data security protection system and method for juveniles. Aiming at the problem that an existing education APP and intelligent equipment only adopt a traditional encryption algorithm (such as RSA and AES) and cannot resist quantum computing attacks, the invention provides a four-layer protection architecture of a terminal layer, a transmission layer, a storage layer and a supervision layer. The terminal layer is provided with a PQC chip in advance and encrypts the biological characteristic data by using a lattice password; the transmission layer establishes a quantum security VPN channel and deploys a forward security protocol; the storage layer adopts an anti-quantum block chain evidence storage technology; the supervision layer introduces a PQC auditing and threat intelligence sharing mechanism. Through experimental verification, the blocking rate of the system to quantum brute force attack reaches 100%, and the man-in-the-middle attack breakthrough rate is reduced to 0%. The method is suitable for education platforms, child intelligent equipment and other scenes, and the long-term safety risk of juvenile data in the quantum era is effectively solved.

An identity authentication method is disclosed in embodiments of the present application. When a requester and an authentication access controller perform identity authentication using an authentication mechanism of a pre-shared key, the identity information of entities is transmitted in the form of ciphertext, thereby preventing the identity information of the entities from being exposed during the transmission, so that attackers cannot obtain private or sensitive information. The mutual or unilateral identity authentication between the authentication access controller and the requester is achieved while ensuring the confidentiality of the entity identity and related information, thereby laying a foundation for ensuring that the user accessing the network is legitimate and / or the network accessed by the user is legitimate. Meanwhile, in connection with key exchange calculations and by an ingenious and detailed design, the ability of the authentication process to resist dictionary brute force attacks or quantum computing attacks is enhanced. Further disclosed in embodiments of the present application are an identity authentication apparatus, a storage medium, a program, and a program product.

The invention relates to a Unity AssetBundle resource encryption method and a system thereof, and belongs to the technical field of computer software security. According to the method, transparent encryption, client local dynamic key generation and automatic decryption full-process collaboration are realized through an encryption tool. A multi-round symmetric encryption algorithm driven by a dynamic key is adopted, block encryption and streaming key diffusion characteristics are fused, and aiming at AssetBundle structure optimization, differential attack resistance, brute force cracking resistance and tampering resistance are achieved. And the key is only generated in real time in the memory of the client without landing and server circulation, so that the leakage risk is completely eradicated from the source. Unified loading of encrypted or unencrypted resources is supported, and smooth transition of the game to an encrypted version is achieved without forcing a player to update the whole package. In the aspect of performance, the time consumption for batch decryption of 500 resources is less than or equal to 3ms, and the performance loss is lt; 1%. The method is compatible with Android, iOS, Windows, swan, macOS and small game multi-terminal environments, zero codes are accessed, and the industrial problems that the key management risk is high, the decryption performance is poor, and the switching wastage rate is high are effectively solved.

The present application relates to a kind of image encryption and decryption methods based on heterojunction memristor PUF, belong to hardware security technical field, the method includes first entropy source extraction: extracting the high resistance state current of each unit in heterojunction memristor, second entropy source extraction: the same heterojunction memristor device is operated multiple times, reads its low resistance state current value and calculates its coefficient of variation, encryption structure dynamic binding: using average value and setting function dynamically determines global structure parameter in encryption algorithm, double binding encryption and decryption process: when encryption, with binary initial key as input, and according to global and local structure parameter, encryption operation is carried out, while recording the topological evolution index in encryption process;When decryption, the global and local topology is reconstructed by topological evolution index reverse, and decryption is completed after matching and obtaining binary initial key;It improves the ability of anti-brute force cracking, while guaranteeing the reversibility and reliability of encryption and decryption, with good scalability and application prospect.

The invention discloses a Galois group permutation representation-based key generation method and device, and the method comprises the steps: carrying out the construction domain expansion, determining a Galois group, and generating an initial key segment through the permutation of the elements of the Galois group on the elements in an expansion domain; and integrating the plurality of initial key segments by adopting a nonlinear fusion algorithm, and introducing a random factor to generate a final key. According to the method, the non-exchangeability and the complex algebraic structure represented by Galois group replacement are fully utilized, the key space is large, the randomness is high, and brute force cracking and cryptographic analysis attack can be effectively resisted. Meanwhile, domain expansion parameters and Galois group types can be dynamically adjusted according to the network state, the data flow and the security threat level, different application scenes can be adapted, the method can be widely applied to the fields of network communication encryption, data storage security, Internet of Things equipment authentication and the like, and an efficient and reliable key generation solution is provided for information security.

The utility model relates to the technical field of motors, in particular to a novel violent fan motor, which comprises a casing, a fan, a rotor assembly and a stator assembly, the fan, the rotor assembly and the stator assembly are positioned in the casing and are sequentially arranged along the axial direction of the casing, two ends of the rotor assembly are respectively inserted in the fan and the stator assembly, and one end of the casing far away from the fan is an air inlet. According to the utility model, the air inlet and the air outlet are arranged at the end where the fan is located, and an inverted air inlet and outlet direction is formed, so that the air blown out by the fan is directly discharged into the atmosphere, the huge eddy noise generated by the air flowing through the PCB in the traditional design is avoided, and meanwhile, the air flowing into the shell and flowing through the PCB does not impact the PCB, so that the air quality is improved, and the service life of the air conditioner is prolonged. In addition, a closed conical cavity is formed by the first baffles, air flow is preliminarily concentrated and guided, the air collecting cover is evenly divided into a plurality of air outlet channels by the second baffles, the air flow is more evenly distributed, the air collecting efficiency is improved, and therefore the noise level is lowered.

The invention discloses a three-dimensional space odd-order constellation design method based on index modulation. The three-dimensional space odd-order constellation design method comprises the following steps: performing exclusive or encryption on an initial signal at a bit level through a scrambling sequence generated by a three-dimensional chaotic system; sub-block grouping is carried out according to the bit number; scrambling the subcarriers and the symbol points after the subblocks are grouped; subcarrier indexing and symbol mode indexing are carried out in sequence to obtain a three-dimensional constellation diagram; the three-dimensional constellation diagram enters an optical fiber channel after passing through an OFDM system to obtain a received signal; demodulation of symbol index bits and carrier index bits is carried out in sequence, scrambling recovery of symbol points and subcarriers is completed in sequence according to a scrambling sequence generated by a chaotic system, and XOR recovery is carried out after subblock recombination is carried out to obtain initial information. According to the method, correct decryption demodulation can be carried out on a legal receiving end on the basis of knowing a constellation modulation format and a coding mode, and an illegal receiving end is difficult to carry out brute force cracking due to the fact that the illegal receiving end does not know the modulation format, so that the safety performance of transmission signals is guaranteed.

The artificial intelligence enabled bid adjudication system uses graph neural networks (GNNs) to infer / approximate courses of action (COAs). The COA winner decision process (WDP) is modeled as a bi-partite graph. A GNN model is trained using previously generated data (e.g., achieved from a previous brute force calculation). The trained GNN model is then used to solve the COA WDP. From the solution, the top n COAs and associate WDP solution scores are calculated. The top n inferred solution scores are then ranked to determine the solution of the COA WDP. The AI enabled bid adjudication system may be utilized with any battle management system (BMS) with a mathematical or heuristic COA scoring decision process.

The present application is directed to the problem that static DNA encoding and calculation rules are single, encryption process is separated from plaintext, and plaintext is vulnerable to attack, and proposes a color image encryption method based on new 4-dimensional hyperchaos and DNA random encoding calculation. The method first designs a new 4-dimensional hyperchaotic system, iterates the system to generate multiple pseudo-random sequences, generates new pseudo-random sequences and matrices by calculation and modification, decomposes the color image into R, G and B channel components, and then fuses them into a matrix, then encodes and calculates the image and the pseudo-random matrix according to the newly generated pseudo-random sequence, and then performs DNA random decoding, decomposes the matrix into channel components, and fuses to generate the final ciphertext image, wherein the initial value of the chaotic system is calculated by the SHA-512 algorithm. The encryption method proposed by the present application not only has large key space and strong sensitivity to plaintext, but also can effectively resist statistical, brute force and differential attacks.

The application provides a black list confusion method and device based on a secret sharing network and a judgment system. The method comprises the following steps: a confusion node receives secret shares sent by N bank nodes; wherein, the black list data of each bank node is regarded as a secret, the secret is split into N secret shares, and the N secret shares are sent to N confusion nodes respectively, N is a natural number greater than or equal to 3; the confusion node sums and encrypts the received secret shares to obtain confusion data; and the confusion node sends the confusion data to a judgment node; wherein, the confusion data is used by the judgment node to judge whether the secret is a black list. Based on the secret sharing network, the secret splitting algorithm and the secret confusion, the application can prevent brute force cracking, so that the black list customer data of the shared banks can be shared under the premise of ensuring data security and confidentiality, and the interference of the random value of the local differential privacy algorithm is avoided, and the judgment result is more accurate.

The invention provides a BKZ reduction method and device based on an adaptive Grover algorithm and a medium, and relates to the technical field of quantum computing. The method comprises the following steps: firstly, obtaining a lattice base to be reduced and a preset block size, determining a projection sub-lattice of the lattice base, and converting an SVP problem on the projection sub-lattice into a QUBO problem by adopting a binary variable coding method; then, constructing a quantum circuit containing a quantum dictionary and Grover search, and carrying out evolution on a quantum system; performing physical measurement on the evolved quantum register, and adaptively updating a search threshold value or adjusting a search parameter according to a measurement result until the shortest vector of the current projection sub-lattice is obtained; and finally, updating the lattice basis by using the shortest vector of the projection sub-lattice obtained by solving to generate a BKZ reduced basis. Compared with a classical violent enumeration method, square acceleration is realized by utilizing the parallel advantage of quantum calculation, and lattice base reduction efficiency is improved.

A system and method for extracting content from electronic documents, addressing limitations of rigid, template-based approaches and overfitting issues of machine learning approaches are disclosed. The method begins by identifying and ranking content features by Shannon entropy. The highest-ranked feature(s) are used to identify and match “Landmarks”—content that serves as distinct global anchor points for establishing global alignment between documents. With these Landmarks as a foundation, an adaptive, stepwise global alignment process matches the remaining content. This process uses a two-stage technique: deterministic features first identify a set of potential candidate matches, and then non-deterministic spatial features select the single best match from the candidates based on its geometric coherence with already-aligned items. In the final stage, LLMs are selectively employed to generalize the discovered features and relationships into reusable, abstracted prompts. This allows the system to adapt to unseen document formats with higher accuracy than brute force prompting.

A voicemail server device receives a voice call from an originating device attempting to access a voicemail account associated with a subscriber of a network service provider. Accessing the voicemail account can require providing by the originating device a personal identification number (PIN) predefined for the voicemail account. The voicemail server device can determine whether the originating device is associated with the subscriber. Responsive to determining that the originating device is not associated with the subscriber, the voicemail server device can activate an attempt limit for the voicemail account. The attempt limit can correspond to a predefined number of failed attempts to access the voicemail account by providing an incorrect PIN. The voicemail server device can receive attempts to access the voicemail account by incorrect PINs. Responsive to determining that a number of the attempts has reached the attempt limit, the voicemail server device can redefine the PIN.

The invention relates to a key leakage detection method for a Romulus-N authentication encryption algorithm, and the method comprises the steps: firstly randomly generating a plaintext to be processed, taking the plaintext as the input of the Romulus-N algorithm, and injecting a random fault; according to the fault injection position and the correspondence between each candidate round key and the intermediate state value, the collected fault labels are combined, the candidate round key values are searched violently, statistical analysis is carried out, and all the intermediate state values are deduced. The range of candidate round key values is narrowed through an intermediate state matching relationship, and then the Hamming weight of an intermediate state value is calculated by using a statistical method, and the candidate round key value corresponding to the minimum Hamming weight is found out. And the fault import and analysis process is repeated to obtain a correct candidate round key. And finally, determining a master key through a key arrangement scheme. The method provided by the invention is easy to implement, high in speed and high in accuracy, and an important analysis basis is provided for the security research of the Romulus-N cryptographic algorithm.

According to the unstructured data security processing system provided by the invention, through a dual security mechanism of dynamic key fragmentation and biological feature binding, physical clone resistance and brute force cracking resistance of a key in a full life cycle are realized; a fragmented storage architecture based on a trusted execution environment significantly improves the data availability of cross-border multi-node collaboration on the premise of ensuring the compliance of data sovereignty; a linkage defense mechanism of a three-dimensional behavior auditing model and self-healing key migration effectively identifies internal unauthorized and external penetration attacks; according to the semantic access control strategy, through a lightweight authentication gateway, the authentication operation burden of a legal user is greatly reduced while the differentiated authority requirements of different service scenes are met; hardware-level environment verification is combined with block chain evidence storage, and a full-link credible proof system from data generation, transmission, storage to destruction is constructed. The defects of key management single-point failure, access control stiffness and cross-border storage compliance risk in a traditional scheme are overcome.

The invention discloses an anti-quantum short key dynamic encryption method and system based on a modulo 30 structured prime number, and belongs to the technical field of information security. The method comprises the following steps: loading a structured prime number library generated based on a modulo 30 theory; screening a target prime number according to the security level; generating an anti-quantum short key pair based on the target prime number; generating a shared session key through lightweight negotiation; and the prime number and the secret key are dynamically updated through a dual-drive mechanism. According to the method, on-demand great expansibility and certainty of the modulo 30 structured prime number space are utilized, an anti-quantum algorithm and dynamic key updating are combined, the quantum brute force cracking resistance of the short key is remarkably improved, key management is extremely simplified, resource overhead is minimized, and the method has the advantages of being high in practicability and easy to popularize. The method is suitable for lightweight high-dynamic security communication scenes such as the Internet of Things and the Internet of Vehicles.

The invention provides a global repositioning method and device, electronic equipment and a storage medium. The method comprises the following steps: generating first descriptor information for a global point cloud frame and first pose information corresponding to each piece of first descriptor information; determining target descriptor information of the current point cloud frame under the condition that a relocation event is triggered; determining matching descriptor information matched with the target descriptor information from the global first descriptor information, and determining pose information relative to the matching descriptor information; and determining prior initial pose information according to the relative pose information and first pose information corresponding to the matching description sub-information, and determining target pose information corresponding to the current point cloud frame according to the prior initial pose information. Through the method and the device, the load of system calculation can be greatly reduced, and the problem of matching failure easily caused by direct point cloud violent matching can be avoided.