13 results about "Cryptanalysis" patented technology

The invention discloses a cryptanalysis task breakpoint continuation type fault-tolerant scheduling method, which relates to the technical field of distributed computing scheduling, and is characterized by comprising the following steps of: acquiring task attribute information, historical scheduling data and distributed node running state data of a cryptanalysis task; performing feature recognition on the task attribute information to obtain a task feature result, and matching the task feature result with tasks and nodes in the node operation state data to determine fault-tolerant scheduling core parameters; the method has the advantages that accurate breakpoint positioning and continuous calculation state recovery are achieved in combination with the breakpoint continuous calculation model, repeated calculation after task interruption is avoided, time and resource consumption is greatly reduced, the execution continuity of a cryptographic analysis task is improved, the method is convenient to adapt to a large-scale distributed resource scene of an E-level super-calculation cluster, and the method is suitable for large-scale distributed resource scenes of the E-level super-calculation cluster. The parallel computing power advantage of the E-level super computing cluster can be fully exerted, and the execution continuity of the cryptographic analysis task is improved.

The application discloses a kind of data storage integrity verification system and method based on polynomial ring, it is related to data security technical field.The system includes data encoding module, base generating module, standard value library and measurement module;Data encoding module is used to convert the data to be verified into polynomial with the format of binary, base generating module is used to select base space and generate base using random selection method, measurement module completes the integrity verification of data by calling base generating module and standard value library, and the standard value library is used to store the standard integrity verification value of input data.The application is different from the conventional password based on mathematical problem design, and it is difficult to resist the password analysis based on artificial intelligence and quantum computing.The application only relies on mathematical principle to design integrity verification mechanism, and the data integrity verification is carried out based on the random selection of base of polynomial ring to resist various password attacks based on artificial intelligence and quantum computing, and does not depend on any mathematical problem, with unconditional security.

A system is provided robustly protects important information from high-level cyberattacks and physical destruction, including cryptographic analysis using quantum computers and electromagnetic pulse attacks, while enabling restoration without theft by a third party. The system encrypts and partitions file data using predetermined encryption and division algorithms based on a customer specified parameter, allots each file data to multiple sets of distributed file management groups comprising node groups at multiple bases in different regions of the world, distributes and records the file data to be saved in the nodes located at each base that belong to corresponding distributed file management groups, generates and encrypts index information of each distributed and recorded corresponding file data, and records the index information in node groups of a specified base in the consortium chain.

The invention discloses a cryptographic algorithm-mode classification method and system based on a BCAM-LGST model, and belongs to the technical field of information security and cryptographic analysis. Comprising the following steps: converting an original ciphertext into a fixed-length sequence and a grayscale image in parallel, and constructing complementary bimodal data representation; the method comprises the following steps: extracting high-level probability features of a sequence by adopting a LightGBM model as semantic priori, and carrying out cross-modal depth fusion on a priori-guided hierarchical dual-channel gating modulation mechanism and image structure features extracted by Swin Transform; and introducing spatial position association of a spatial perception enhancement matrix enhancement feature, and carrying out multi-scale feature modeling on a fusion feature under prior guidance by using layered window attention, so as to finally realize end-to-end joint classification. The block cipher algorithm-mode joint identification method can quickly, accurately and robustly realize block cipher algorithm-mode joint identification, and is suitable for practical engineering scenes such as network security level protection, cipher application security evaluation, digital forensics, encrypted traffic analysis and compliance auditing.

The invention relates to the technical field of cryptographic analysis, and discloses an automatic linear path analysis method and system for an ARX type cryptographic algorithm, and the method comprises the following steps: constructing a round function, configuring a linear analysis target, and selecting a search strategy; performing linear mask initialization on the round function, and establishing an association relationship between inter-round mask variables; generating local linear mask propagation expressions based on the linear approximation characteristic of each basic operation unit, combining the local linear mask propagation expressions into a global linear approximation model, and calculating a correlation expression of a linear path; executing a search strategy on the global linear approximation model; converting the global linear approximation model and the search strategy into constraint description and solving the constraint description; according to the method, the modeling complexity of linear analysis is reduced through visual modeling and selection of the path search strategy, and automation of the linear path search process is achieved.

This invention discloses a data storage integrity verification system and method based on an integral ring, relating to the field of data security technology. It includes a data encoding module, a base generation module, a standard value library, and a measurement module. The data encoding module converts binary data to be verified into integers. The base generation module selects a base space and generates bases using a random selection method. The measurement module completes data integrity verification by calling the base generation module and the standard value library. The standard value library stores the standard integrity verification values ​​of the input data. This invention differs from conventional cryptography, which is based on mathematical problems and is vulnerable to cryptanalysis based on artificial intelligence and quantum computing. It relies solely on mathematical principles to design the integrity verification mechanism, performing data integrity verification based on the random selection of bases within an integral ring. This resists various cryptographic attacks based on artificial intelligence and quantum computing. Its security depends solely on mathematical principles and not on any mathematical problems, possessing unconditional security.

The invention relates to the technical field of cryptography, and discloses a stream cipher algorithm and device based on a multilayer filter, and the device comprises an initialization algorithm and a key stream generation algorithm. The initialization algorithm fully fuses a seed key and an initial vector through a multiplexing key stream generation algorithm. According to the key stream generation algorithm, the unpredictability of the key stream is increased through an extension-diffusion confusion-compression structure, so that the generated password sequence has an excellent pseudo-random statistical characteristic, and known cryptographic analysis methods such as algebraic attacks and related attacks can be effectively resisted. The algorithm does not depend on special hardware and has the advantage of low use cost; and high-speed encryption and decryption operation can be realized in a lightweight environment, and the requirements of 5G and even 6G times on encryption and decryption speeds can be met.

The invention belongs to the technical field of satellite communication and information security, and relates to an encryption method applied to low-orbit constellation anti-intelligent cryptographic analysis, which comprises the following steps of: configuring symmetrical keys at a transmitting end and a receiving end, and deriving an initial weight matrix and an initial chaotic state; the method comprises the following steps of: receiving upper-layer service bit streams by a sending end, grouping the upper-layer service bit streams to obtain a plurality of plaintext blocks, and respectively loading the plaintext blocks into corresponding state byte arrays; the sending end sequentially performs multi-round transformation on the state byte matrix of each plaintext block based on the initial weight matrix and the initial chaotic state to obtain a final state byte matrix of each plaintext block, namely encrypted data; the sending end sends the encrypted data to a receiving end; the receiving end receives the data sent by the sending end and decrypts the received data; according to the method, the dynamic chaotic S-Box and the round key are constructed according to the weight matrix and the chaotic state, so that the core nonlinearity of the AES and the round key are changed from a static state to a time-related dynamic structure, and the encryption effect is improved.

The invention relates to the technical field of cryptographic analysis, and discloses an ARX type cryptographic algorithm differential path analysis method and system based on differential propagation, and the method comprises the following steps: constructing a round function of a cryptographic algorithm, configuring differential analysis parameters, and selecting a differential path search strategy. Comprising a multi-differential path automatic mining strategy, a differential aggregation analysis strategy and a search strategy with conditional constraints; converting the round function and the differential analysis parameters into intermediate description data; analyzing the intermediate description data, and extracting structure information of each basic operation unit in the round function; generating a differential analysis constraint; executing a differential path search; submitting the differential analysis constraint to a constraint solver for solving to obtain a differential path result; according to the method, the difference path result is analyzed, and the difference path and the aggregation analysis result are displayed, based on the method, a visual software system is constructed, and convenience and automation of difference analysis are achieved through visual modeling, automatic constraint generation and solver calling.

This invention belongs to the field of cryptanalysis technology and provides a cryptanalysis reverse attack method and system. It determines the classification of activation functions in a neural network model, including piecewise linear activation functions and piecewise nonlinear activation functions. For piecewise linear activation functions, it performs reverse attacks by achieving signature recovery with polynomial time complexity and symbol recovery with a certain time complexity on the original output and hard label settings, respectively. It also performs reverse attacks by achieving symbol recovery with polynomial time complexity on the original output of a contracted network. For piecewise nonlinear activation functions, it performs reverse attacks by achieving signature recovery with polynomial time complexity and symbol recovery with polynomial time complexity on the original output settings. This invention can recover an equivalent neural network with the same output characteristics as the original neural network through attack strategies.

Provided is an apparatus for a low CNOT count quantum point doubling circuit targeting to minimize resource consumption during quantum cryptanalysis, particularly in elliptic curve cryptography (ECC). The apparatus, according to an embodiment of this present invention, is designed to reduce the overall depth of cryptographic analysis by implementing an efficient point-doubling mechanism.

The invention discloses a linearization path searching method for a Sponge type cryptographic algorithm, and belongs to the technical field of information security and cryptographic analysis. The method comprises the following steps of: 1, deducing a linearized path dependency relationship; 2, constructing a mixed integer linear programming model; step 3, a target function setting and optimization solution step; 4, an optimal linearization path analysis and attack implementation step; and executing linearization path analysis and attack implementation according to an optimal solution result output by the optimization solver. According to the method, the branch and bound algorithm of the MILP solver is utilized, a theoretical global optimal path can be found in a full search space, an efficient attack path which is difficult to perceive manually can be found, and it can be ensured that an output attack scheme is executable under the actual computing power.

The invention discloses a Langlands outline unified calculation architecture based on a self-defense form and a cryptography co-processing method, and belongs to the field of number theory calculation, cryptography analysis, representation theory calculation and algebraic geometry calculation. Comprising a self-defense form construction engine (AFCE), an L function accurate evaluation unit (LFEU), a Galois expression constructor (GRC), a function principle verifier (FPVR), a local-overall bridge (LGBR), a cuspidal point form decomposer (CFDC), a modular symbol calculator (MSC), an elliptic curve-modular form correlator (ECMFC), a Hecke operator parallel computing unit, a Dedekindzeta function expander, a Rankin-Selberg convolver and the like. Through a three-layer architecture of ASIC + FPGA + cipher coprocessor, 107 times of modulus form Fourier coefficient calculation per second and 105 L function special value evaluation are realized, high-value applications such as Fermat's law verification, BSD guess calculation, RSA-2048 factor decomposition preprocessing, lattice cipher analysis, quantum error correction code optimization and the like are supported, and theoretical breakthrough and engineering implementation of number theory, cryptography and quantum information are promoted.