arXiv subjects

Gao Ming

Publications and source records attributed to Gao Ming.

4 recordsLinked to original sources

arXiv2023

Molecular design method based on novel molecular representation and variational auto-encoder

Based on the traditional VAE, a novel neural network model is presented, with the latest molecular representation, SELFIES, to improve the effect of generating new molecules. In this model, multi-layer convolutional network and Fisher information are added to the original encoding layer to learn the data characteristics and guide the encoding process, which makes the features of the data hiding layer more aggregated, and integrates the Long Short Term Memory neural network (LSTM) into the decoding layer for better data generation, which effectively solves the degradation phenomenon generated by the encoding layer and decoding layer of the original VAE model. Through experiments on zinc molecular data sets, it is found that the similarity in the new VAE is 8.47% higher than that of the original ones. SELFIES are better at generating a variety of molecules than the traditional molecular representation, SELFIES. Experiments have shown that using SELFIES and the new VAE model presented in this paper can improve the effectiveness of generating new molecules.

q-bio.BM↗

arXiv2022

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

P vs NP problem is the most important unresolved problem in the field of computational complexity. Its impact has penetrated into all aspects of algorithm design, especially in the field of cryptography. The security of cryptographic algorithms based on short keys depends on whether P is equal to NP. In fact, the security requirements for cryptographic keys are much stricter than those for P $\neq$ NP, the security of the key must ensure not only a sufficiently high computational complexity to crack it, but also consider the security of each bit of the key, while fully avoiding the effectiveness of various attack methods. In this paper, we innovatively propose a new encoding mechanism and develop a novel block symmetric encryption algorithm, which be named Eagle, whose encryption and decryption can be completed in linear time. The key consists of 6 variables, for the attacker, in the case when only the plaintext-ciphertext correspondence is known, the problem of cracking the key is equivalent to solving a system of equations about six unknown variables. We prove that the computational complexity of verifying two variables should not be lower than the computational complexity of enumerating any intermediate unknown variable whose number of possible values is exponentially to the length of the key, thus proving that the computational complexity of verifying two variables can't be polynomial. Due to the computational complexity satisfying the condition of ``complexity of cracking the key = complexity of solving six variables $\geq$ complexity of solving two variables $\geq$ complexity of verifying two variables", thus the computational complexity of cracking the key can't be polynomial, So the decryption is a one-way function, and according to ``the existence of one-way function means P $\neq$ NP", thus solving the unsolved problem of P vs NP.

cs.CC↗

arXiv2015

Practical Attacks on Decoy State Quantum Key Distribution Systems with Detector Efficiency Mismatch

To the active basis choice decoy state quantum key distribution systems with detector efficiency mismatch, we present a modified attack strategy, which is based on faked states attack, with quantum nondemolition measurement ability to restress the threat of detector efficiency mismatch. Considering that perfect quantum nondemolition measurement ability dose not exist in real life, we also propose a practical attack strategy using photon number resolving detectors. Theoretical analysis and numerical simulation results show that, without changing the channel, our attack strategies are serious threats to decoy state quantum key distribution systems. The eavesdropper may get some information ab out the secret key without causing any alarms. Besides, the lower bound of detector efficiency mismatch to run our modified faked states attack successfully with perfect quantum nondemolition measurement ability is also given out, which provides the producers of quantum key distribution systems with a reference and can be treated as the approximate secure bound of detector efficiency mismatch in decoy state quantum key distribution systems.

quant-ph↗

arXiv2013

Effect of imperfect Faraday mirrors on security of a Faraday-Michelson quantum cryptography system

The one-way Faraday-Michelson system is a very useful practical quantum cryptography system where Faraday mirrors(FMs) play an important role. In this paper we analyze the security of this system against imperfect FMs. We consider the security loophole caused by the imperfect FMs in Alice's and Bob's security zones. Then we implement a passive Faraday mirror attack in this system. By changing the values of the imperfection parameters of Alice's FMs, we calculate the quantum bit error rate between Alice and Bob induced by Eve and the probability that Eve obtains outcomes successfully. It is shown that the imperfection of one of Alice's two FMs makes the system sensitive to the attack. At last we give a modified key rate as a function of the Faraday mirror imperfections. The security analysis indicates that both Alice's and Bob's imperfect FMs can compromise the secure key.

quant-ph↗