|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Removal of pharmaceutical and personal care products by sequential ultraviolet and ozonation process in a full-scale wastewater treatment plant显示文摘在市政的废水处理植物(WWTP ) 的适当先进处理过程的应用程序就新兴的沾染物的消除而言成为了一个重要问题,例如药品、个人的照顾产品(PPCP ) 。在现在的学习,属于不同的治疗学的班由的 13 PPCP 的移动顺序紫外(紫外) 并且在在北京的照原尺寸的 WWTP 的 ozonation 过程在十个月的功课上被调查。大多数目标 PPCP 有效地被移开,并且单个 PPCP 的中部的移动效率,从 13% ~ 89%,依赖于他们有分子的臭氧的反应率常数。在一样的 PPCP 的移动效率的显著变化在不同采样运动被观察。不过,顺序紫外并且仍然在照原尺寸的 WWTP 成为重要贡献到大多数 PPCP 的全部的消除的 ozonation 过程,由由生物学的处理补偿 PPCP 的差或变动的移动性能处理。 | Qian SU Jun HUANG Shuguang LU Shubo DENG Bin WANG Wentao ZHAO Zhaofu QIU Gang YU | 2014 | Frontiers of Environmental Science & Engineering2014，8，1： | 6 |
| 2 | Evolutionary ciphers against differential power analysis and differential fault analysis显示文摘Side channel analysis(SCA) focuses on attacking cryptographic algorithm implementations by collecting leaked information and analyzing the correlation between the leaked and key information in the cryptographic system.Currently,SCA is the main threat to cryptographic implementations,with DPA(differential power analysis) and DFA(differential fault analysis) being two of the most threatening types of SCA.However,the existing countermeasures against DPA and DFA have shortcomings and can hardly protect cipher designs perfectly.Based on a comprehensive analysis of DPA and DFA,this paper proposes a new idea of using an evolutionary cipher(EVOC) against DPAs based on the model proposed by Kocher,and several different new types of DFAs.In fact,an EVOC is a kind of dynamic cipher designing method.Moreover,combined with intelligent searching algorithms and cryptography design policies,EVOCs utilize the dynamic and unpredictable properties of TRNG(a truly random number generator) to ensure cipher design at a high level of security.Therefore,with an EVOC we could design cryptography algorithms with high security to resist mathematical analysis as well as DPAs and DFAs.This paper analyzes and proves the security,efficiency,cost,and original features of EVOCs against DPA and DFA both theoretically and experimentally.Compared with existing countermeasures against SCAs,EVOCs use dynamic non-linear operations to destroy the bases of DPA and DFA.At the algorithm level,EVOCs are more efficient than other resistance methods.Based on the theory and experiments,this paper proposes certain modifications to the EVOC in the AES(advanced encryption standard) algorithm,which can be referenced by other dynamic designs of cryptographic algorithms. | TANG Ming QIU ZhenLong YANG Min CHENG PingPan GAO Si LIU ShuBo MENG QinShu | 2012 | Science China(Information Sciences)2012，55，11： | 5 |
| 3 | Reverse Engineering Analysis Based on Differential Fault Analysis Against Secret S- boxes显示文摘To evaluate the security of cipher algorithms with secret operations, we built a new reverse engineering analysis based on Differential Fault Analysis (DFA) to recover the secret S-boxes in Secret Private Network (SPN) and Feistel structures, which are two of the most typical structures in block ciphers. This paper gives the general definitions of these two structures and proposes the reverse engineering analysis of each structure. Furthermore, we evaluate the complexity of the proposed reverse analyses and theoretically prove the effectiveness of the reverse method. For the Twofish-like and AES-like algorithms, the experimental results verify the correctness and efficiency of the reverse analysis. The proposed reverse analysis can efficiently recover the secret S-boxes in the encryption algorithms with SPN and Feistel structures. It can successfully recover the Twofish-like algorithm in 2.3 s with 256 faults and the AES-like algorithm in 0.33 s with 23 faults. | Tang Ming Qiu Zhenlong Deng Hui Liu Shubo Zhang Huanguo | 2012 | China Communications2012，9，10： | 2 |
| 4 | Polar differential power attacks and evaluation显示文摘Side channel attacks (SCAs) on security software and hardware have become major concerns on computer and system security.The existing SCAs generally require the knowledge of the corresponding cryptographic algorithm and implementation adopted in the target; therefore,they are not fully suitable for practical applications.In this paper,we propose a novel SCA-polar differential power attack (polar DPA).We found that DPA peaks have different biases for different cryptographic algorithms and implementations.Based on these biases,we can successfully attack a block cipher,assuming that the cipher algorithm uses a secret key in its first round,without the knowledge of the cipher algorithm or implementation.Other rounds can be treated as a black box.We present a detailed theoretical analysis and experiment to demonstrate the correctness and efficiency of our scheme.Furthermore,our scheme has demonstrated an improvement over the leakage evaluation scheme due to Ichikawa et al.(CHES 2005).Our evaluation method can be used in electronic design automatic (EDA) flows and can help security circuit designers to understand the data leakage due to SCAs. | TANG Ming QIU ZhenLong GAO Si YI Mu LIU ShuBo ZHANG HuanGuo JIN YingZhen | 2012 | Science China(Information Sciences)2012，55，7： | 1 |
| 5 | Partition sampling strategy for robot motion planning under uncertainty显示文摘In order to solve the sensing and motion uncertainty problem of motion planning in narrow passage environment,a partition sampling strategy based on partially observable Markov decision process(POMDP)was proposed.The method combines partition sampling strategy and can improve the success rate of the robot motion planning in the narrow passage.Firstly,the environment is divided into open area and narrow area by using a partition sampling strategy,and generates the initial trajectory of the robot with fewer sampling points.Secondly,the method can calculate a local optimal solution of the initial nominal trajectory by solving POMDP problem,and iterates an overall optimal trajectory of robot motion.The proposed method follows the general POMDP solution framework,in which the belief dynamics is approximated by an extended Kalman filter(EKF),and the value function is represented by an effective quadratic function in the belief space near the nominal trajectory.Using a belief space variant of iterative linear quadratic Gaussian(iLQG)to perform the value iteration,which results in a linear control policy over the belief space that is locally optimal around the nominal trajectory.A new nominal trajectory is generated by executing the control strategy iteration,and the process is repeated until it converges to a locally optimal solution.Finally,the robot gets the optimal trajectory to safely pass through a narrow passage.The experimental results show that the proposed method can efficiently improves the performance of motion planning under uncertainty. | Cao Qihe Li Qinghua Qiu Shubo Han Fengjian Feng Chao | 2021 | The Journal of China Universities of Posts and Telecommunications2021，28，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员