http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Quantum Cryptanalysis of Multivariate Permutation Problem
Guodong Sun,Shenghui Su,Maozhi Xu 보안공학연구지원센터 2014 International Journal of Security and Its Applicat Vol.8 No.6
Quantum computation is a new computational model based on quantum mechanical principle. Shor invented the polynomial time algorithms for the prime factorization and discrete logarithm problem, which indicated that the cryptosystems based on them are totally unsafe in the quantum world. Grover constructed an algorithm that finds a solution in only O(2n)steps whereas the exhaustive search algorithm needs O(2n) steps on average. In this paper we investigate the cryptanalysis of a new cryptography problem----multivariate permutation problem (MPP), which could be used to design public-key cryptosystem, with the help of the two quantum algorithms. Specially, we discuss the strength of a private key of the REESSE1+ public-key cryptosystem, whose security is based on the hardness of MPP. Besides, some suggestions are also given about the implementation of the REESSE1+.
Jin Yi,Su Guodong,Yu Jiangang 대한화학회 2021 Bulletin of the Korean Chemical Society Vol.42 No.6
A Mannich reaction of 2,2,2-trifluoroethylamine hydrochloride, paraformaldehyde and acetophenone was described both in oil bath and microwave-heating conditions to give main products varied from trifluoroethyl derived tertiary to secondary amine. In the microwave-heating manner, the reaction was carried out in a commercial available microwave oven and took only 10 min to complete this transformation. After a simple post-treatment including washing and recrystallization, the product of trifluoroethyl derived secondary amine was obtained in high yield (71.4%).