Time filter

Source Type

Du Z.-Q.,Institute of Electronic Equipment System Engineering Company | Zhang J.,Institute of Electronic Equipment System Engineering Company | Zhang Q.,Institute of Electronic Equipment System Engineering Company | Liu Z.-B.,Institute of Electronic Equipment System Engineering Company | Zhu B.,63636 Troops
Proceedings - 12th International Conference on Computational Intelligence and Security, CIS 2016 | Year: 2016

In order to figure out the security problem in block cipher algorithm, the principle and the key steps of the reconstruction design are studied and analyzed, including the common models and research methods. After analysis and comparison, an S-box of the encryption algorithm based scheme is proposed and demonstrated, it combines the idea of reconstruction and the mathematical function. The simulation results show that the design improves the security of S-box effectively, and the avalanche effect is excellent as well as other properties. It could meet the needs of our application and work for the secure increase. © 2016 IEEE.


Du Z.,Institute of Electronic Equipment System Engineering Company | Xu Q.,Institute of Electronic Equipment System Engineering Company | Zhang J.,Institute of Electronic Equipment System Engineering Company | Zhong X.,Institute of Electronic Equipment System Engineering Company
Proceedings - 2015 11th International Conference on Computational Intelligence and Security, CIS 2015 | Year: 2015

With the development of the wireless sensor networks (WSNs), the security is becoming more and more serious. The key schedules in lightweight block ciphers are often highly simplified, which causes loopholes that could be exploited in many attacks. The research on key expansion has become one of the pivotal technologies which aimed at improving performances of the encryption algorithms to solve the issue on how to guarantee enough safety and diffusion of secret key with limited resources and operations. After lucubrating and analyzing the commonly methods, a new key expansion algorithm based on the dynamic dislocation counts is proposed. The data from the simulation and verification show that the method can achieve the expansion of the key effectively and it has a good randomness. It can also be extended to the plaintext to increase the random diversity. © 2015 IEEE.


Du Z.-Q.,Institute of Electronic Equipment System Engineering Company | Xu Q.-J.,Institute of Electronic Equipment System Engineering Company | Zhang J.,Institute of Electronic Equipment System Engineering Company | Li M.,Institute of Electronic Equipment System Engineering Company
Proceedings of 2015 IEEE Advanced Information Technology, Electronic and Automation Control Conference, IAEAC 2015 | Year: 2015

As one of the core modules of block cipher algorithm, the S-box had a direct impact on the entire cipher algorithm. In order to improve the security strength, a lot researches and analyses on the block cipher algorithm have been done. The design scheme of dynamic S-box has been put forward through learning from the Feistel architecture and the reconstruction thought of S-box. After introducing the design in detail, we create S-boxes to do some analyses to verify its performance. The analyses in the end show that the value of this idea is worth further discussion and we see it as a potential research direction in block cipher encryption. © 2015 IEEE.


Liang S.,PLA University of Science and Technology | Liang S.,63892nd Unit of the PLA | Luo Q.,Institute of Electronic Equipment System Engineering Corporation | Xu G.,63892nd Unit of the PLA | And 2 more authors.
Advances in Intelligent and Soft Computing | Year: 2011

Large ontology matching problem brings a new challenge to the state of ontology matching technology. In this paper we present a criteria-Based approximate matching approach to solve the problem. The main principle of our approach is based on fully explore semantic information hidden in ontology structures, either physically or logically, and tightly coupled element-level and structure-level features to obtain matching results. Through joining the quantitative structural information for the matching process can significantly decrease the execution time with pretty good quality. © 2011 Springer-Verlag Berlin Heidelberg.


Wu H.L.,Chong Qing Communication College | Yin H.,Institute of Electronic Equipment System Engineering Company | Shen W.D.,Chong Qing Communication College | Meng H.J.,Institute of Electronic Equipment System Engineering Company | Tan X.C.,Institute of Electronic Equipment System Engineering Company
Applied Mechanics and Materials | Year: 2014

In order to analyze the influence of the near-ground reflection on aperture coupling, a full-scale model of metal shelter with a lossy ground was constructed. The rules of aperture coupling of the High-altitude Electromagnetic Pulse were researched, while the angle of incidence, the conductance and relative permittivity of the ground were changed respectively. Then the strength of electric field inside the shelter was computed and compared when the shelter was above on different topography. Studies show that the coupling electromagnetic energy strengthen with the incident angle of plane wave increasing. When the conductance and relative permittivity of the ground gain, the main crest of the electric field substantially keeps constant, while the second crest increases dramatically. Sea surface has the strongest reflection of electromagnetic pulse, followed by sand land, then the mud land. The reflection of wet land is much stronger than dry land. © (2014) Trans Tech Publications, Switzerland.


Liang S.,PLA University of Science and Technology | Luo Q.,Institute of Electronic Equipment System Engineering Corporation | Huang Z.,PLA University of Science and Technology
Proceedings - 6th International Conference on Semantics, Knowledge and Grid, SKG 2010 | Year: 2010

There is much implicit semantic information hidden in ontology structure, which hasn't been used in ontology matching. In this paper, we analyse the network characteristics of ontology. Propose a set of semantic and theoretical criterions to measure the different characteristics of nodes and edges. Use these quantitative characteristics to identify core concept nodes and assign weight to edges. Then, convert the ontology matching to Labelled Weighted Graph Matching problem, and use convex relaxation algorithm to solve this quadratic programming problem. We implement our prototype and experimentally evaluate our approach on data sets. The evaluation results demonstrate that structure information significant effect matching result and our approach can achieve good precision and recall. © 2010 IEEE.


Xu F.,Nanjing University of Science and Technology | Xu F.,Institute of Electronic Equipment System Engineering Corporation | Yin J.,Institute of Electronic Equipment System Engineering Corporation | Huang L.,Institute of Electronic Equipment System Engineering Corporation
Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University | Year: 2015

Service discovery is a hot topic in the field of services computing. As compared to classic methods that focus on service contents, this paper presents a new approach from the viewpoint of interconnectivity, to find important services and the corresponding composable services based on previous records of service composition. Empirical results show that (1) 95% of mashups on the website ProgrammableWeb contain important Web APIs discovered by our approach, and (2) the rate of success for analyzing the composability of a given set of Web APIs runs up to 98%. Thus, this approach would be helpful for effectively searching and recommending services on the Internet. © 2015, Wuhan University All right reserved.

Loading Institute of Electronic Equipment System Engineering Corporation collaborators
Loading Institute of Electronic Equipment System Engineering Corporation collaborators