Current Issue

• 2012, No. 5　Published:25 May 2012 Last issue    Next issue
  Columns in this issue: 论文

• 论文

  Research on the New Development of Image Encryption Algorithms

  ZHANG Xiaoqiang1，WANG Mengmeng2，ZHU Guiliang2

  2012, 34(5): 1-6. doi:

  Abstract ( 454 )   PDF (486KB) ( 955 )   　　

  With the rapid development of information netization, image interaction in the Internet is widely applied in many fields. People pay much attention to the security of image interaction. We illustrate the encryption principles, characteristics and new development of the important image encryption algorithms, such as those based on matrix transformation, chaos, image secret sharing, frequency domains, SCAN languages, and DNA computing. Finally, the development trend of image encryption algorithm is discussed in this paper. This study is significant in algorithm improvement, new algorithm design and algorithm selection in the practice of image encryption.

  A Novel SubStreamOriented LowDelay Scheduling Algorithm

  WU Guofu,DOU Qiang,WU Jiqing,DOU Wenhua

  2012, 34(5): 7-12. doi:

  Abstract ( 366 )   PDF (693KB) ( 345 )   　　

  Peer-to-Peer streaming is an effectual and promising way to distribute media content. In this paper, we present a novel substreamoriented lowdelay scheduling strategy under the pushpull hybrid framework. First the substream scheduling problem is transformed into the matching problem of the weighted bipartite graph. Then the wellknown Hungarian Algorithm is ameliorated, and a minimum delay, maximum matching algorithm is presented. Not only maximum matching is reserved by the new improved algorithm, but also the transmitting delay of each substream is as low as possible. The simulation results show that our method can greatly reduce the transmission delay.

  A Design of the VEA Scrambling Encryption Algorithm Based on TwoDimensional Logistic Chaos Mapping

  LIANG Yuan1,LI Jianping1,GUO Ke2

  2012, 34(5): 13-17. doi:

  Abstract ( 379 )   PDF (591KB) ( 330 )   　　

  A VEA scrambling encryption algorithm design based on twodimensional Logistic chaos mapping is put forward to deal with the security problem of video information．Firstly we transform the I frame，P frame and B frame of video data by DCT(Discrete Cosine Transform), and scramble the DC and AC coefficients, and then use the two dimensional chaotic sequences of the Logistic chaotic system to encrypt the DC and AC coeficients twice, and then we obtain the encryption data. The video data which are encrypted twice by the chaos key have the characteristics of high security, strong attackresistance and so on.

  SE_DSR:A Security Enhanced MultiPath Dynamic Source Routing Protocol for Wireless Mesh Networks

  LI Meihu,GUO Yuanbo

  2012, 34(5): 18-23. doi:

  Abstract ( 360 )   PDF (612KB) ( 370 )   　　

  The DSR protocol is a typical multihop routing protocol on demand, which can connect the existing networks in a seamless way and can adapt to the dynamic changes of the networks. In order to satisfy the demand of wireless Mesh networks, this paper proposes a security enhanced multipath DSR routing protocol—the SE_DSR protocol in wireless Mesh networks based on analyzing the DSR protocol. This protocol adopts the multipath routing discovery mechanisms to provide loadbalancing and faulttolerant capability, and adopts the twoway path trust assessment and oneway certificate chain verification mechanisms to enhance security. Compared with the traditional security protocols, the SE_DSR protocol can ensure the routing security, which,at the same time, shortens the routing discovery delay and increases the data transfer rate, with a little more storage overhead. Performance analysis and simulation experiments show that the protocol can defend various attacks effectively, while providing loadbalancing and faulttolerance capability, with a higher network throughput and stronger security performance.

  Research on the P2P Data Storage Strategy in Wireless Sensor Networks

  LI Zhigang,XIAO Nong

  2012, 34(5): 24-30. doi:

  Abstract ( 370 )   PDF (576KB) ( 321 )   　　

  In wireless sensor networks, peertopeer data transmission and innetwork data management is also very important except sinkbased data transmission. We introduce the characteristics of  the peertopeer data transmission applications and the relationship between data storage and data transmission. How to implement effective and efficient data storage in peertopeer data transmission is a key issue and big challenge for wireless sensor networks. We make a survey on  peertopeer data storage in wireless sensor networks. Based on location, we classify the existing work into the  locationbased strategy and the locationfree strategy. We compare the related indexes and analyze their performance on the data retrieval success ratio and load balancing.

  Research on the Platform of Social Network Services for Older Adults

  ZHENG Zhigang，LU Jiehua

  2012, 34(5): 31-34. doi:

  Abstract ( 392 )   PDF (525KB) ( 464 )   　　

  Little research has been conducted on the effect of social network services (SNS) on older adults because teenagers are among the most prolific users of SNS. In this paper, we introduce a platform of social network services for older citizens. The technical architecture has been described. We illustrate the social network sites, the approach of data analysis, and the information services. The platform can acquire data about the behavior pattern of older population from the SNS system. Data can be integrated in the spatiotemporal data warehouse. Based on the data model and principle of statistics, we can analyze the elder people’s social network behaviors. The results of analysis meet the needs of a broad range of users.

  Fast Construction and Security Analysis of the Verifiable Random Numbers in the Finite Field

  YE Jun1，2,DING Yong1,LIU Yining1,CAO Jianyu1

  2012, 34(5): 35-39. doi:

  Abstract ( 358 )   PDF (398KB) ( 300 )   　　

  Using the interpolation polynomials in the finite field, and adopting the Lagrange interpolation and Newton interpolation respectively, two methods of constructing verifiable random numbers, are proposed. They have the advantages of high efficiency and no error. Then their security attributes such as uncontrollability and unpredictability are analyzed. Finally some experiments are given to verify the correctness of the two methods.

  A Practical Electronic Voting System Based on Digital Signature

  YU Bo1,CHEN Jianping1,GU Xiang2

  2012, 34(5): 40-44. doi:

  Abstract ( 405 )   PDF (468KB) ( 544 )   　　

  The design of an electronic voting system has been a hot research topic in the area of information security. This paper investigates three typical electronic voting models and presents a new electronic voting system. The system is designed using the techniques of RSA, blind signature, bit commitment, and temporary id. It can solve the key problems of an electronic voting system, which is proved a practical and reliable electronic voting system.

  A Study on the Converter of Web to WAP Based on the Semantic Association and Structural Analysis

  ZHAO Lijuan，XU Zhiwei，WU Zhaojie

  2012, 34(5): 45-48. doi:

  Abstract ( 357 )   PDF (609KB) ( 288 )   　　

  With the rapid development of the 3G mobile communication technologies, more and more users begin to use wireless devices to obtain information. It is hard for mobile browsers to scan web pages because of the large amount of information, wasting of the Internet traffic, and complex layout. The problems above have been solved by WAP, which is a series of protocols customized for the wireless environment. However, it will cost lots of human resources and other resources for the converting all existing Internet information to WAP. This article has proposed an effective mechanism for the conversion of WEB to WAP, which is used for the migration of the Internet systems to the applications of the mobile phones, including web page segmentation, web page purification, semantic association and page reorganization. This solution ensures the reasonable web page layout and strong semantic association after the conversion. By some experiments, the result of the solution turned out to reach the expected effect.

  A Vector Space Secret SharingThreshold Proxy Signature Scheme from Bilinear Pairings

  LI Bing,HU Wei

  2012, 34(5): 49-52. doi:

  Abstract ( 306 )   PDF (379KB) ( 337 )   　　

  In this paper, by combining vector space secret sharing with proxy signature, we present a vector space secret sharing scheme,the threshold proxy signature. In this scheme, there is a trusted share distribution center, and the threshold proxy signature can be easily produced if an authorized subset of participants pool their secret shares, and it is impossible for them to generate a proxy signature if an unauthorized subset of participants pool their secret shares. The validity of the partial signature and the threshold proxy signature can be verified by means of verification equations. Moreover the suspected forgery can be traced and the malicious participants can be caught in this scheme. None of the possible attacks can successfully break this scheme.

  Research on the UI Consistency and Function Difference of the Soft Keyboard in Embedded Systems

  CHEN Yihong1,2,FENG Quanyuan1，LIU Tao 1,3,LI Xiaowu1

  2012, 34(5): 53-57. doi:

  Abstract ( 322 )   PDF (658KB) ( 310 )   　　

  In order to resolve the conflicts between the small soft keyboard buttons of WinCE and the touching operation easily in embedded devices, a new soft keyboard, instead of the similar one of WinCE, is designed. To resolve the conflicts between multiple soft keyboard interfaces which input data and limited system resources, a method that the soft keyboard interface and the keyboard processing logic function of adding, deleting, displaying, checking range, are separated，which means that the same soft keyboard interface is called by serveral software function components, and realizes the UI consistency and function difference of the touching screen soft keyboard in embedded systems，thus the system resource is saved. In addition, to reduce the number of soft keyboard buttons, and thus the botton of soft keyboard has big size on the condition of small size touch screen, the technology of appending a unit string to data is presented, and the input data speed can be improved by the technology. By these techniques, the soft keyboard based on WinCE is developed,and an easy operation is attained in practice.

  Research and Implementation of a Trusted Data Storage Technology Based on Virtual Isolation

  WU Jiangjiang,WANG Zhiying,MA Jun,REN Jiangchun,CHENG Yong,MEI Songzhu

  2012, 34(5): 58-62. doi:

  Abstract ( 331 )   PDF (689KB) ( 456 )   　　

  Against the risk of information leakage because of that the data is stored and used in an open network environment, this paper presents a trusted data storage architecture based on virtual isolation. The structure draws on the design idea of trusted root in the trusted computing technology, in the architecture, the credible storage root is used to verify the legitimacy of user identity and manage data access, and the data is stored with centralized encryption in the server; while  the enduser use the data, the local memory and disk virtual isolation techniques are used to ensure data security, preventing nonauthorized users and processes to leak information to nonprotected areas. The security analysis and testing toward the credible data storage system based on virtual isolation which are designed and implemented in this article shows that the structure can guarantee the security of the entire life cycle including storage, use, transfer and destruction when the data locates in the open network environment.

  Analysis and Evaluation of the NetworkonChip Routing Algorithms

  ZHU Xinghui,HUANG Jingru

  2012, 34(5): 63-67. doi:

  Abstract ( 397 )   PDF (875KB) ( 406 )   　　

  In this paper, we analyze the deterministic routing algorithm (XY routing) and 4 adaptive routing algorithms based on the turn model for NetworkonChip. We also evaluate the performance of the 5 routing algorithms with Noxim NoC simulator under 6 synthetic traffic patterns. The experimental results illustrate that the performance of the XY routing algorithm is better than those of the adaptive routing algorithms under a uniform random traffic pattern; for transpose 1 and shuffle traffic patterns, the oddeven routing algorithm outperforms other routing algorithms; for transpose 2, bit reverse and butterfly traffic patterns, the performance of the negativefirst routing algorithm is better than those of other routing algorithms.

  Development of the USBCAN Converter Based on CotexM3

  YUE Binbin,LI Xiangyang

  2012, 34(5): 68-72. doi:

  Abstract ( 345 )   PDF (705KB) ( 407 )   　　

  Comparing the USB and CAN protocols, for practical use, a converter based on STM32f107 CotextM3 is designed in this paper .It is small, cheap, and reliable, which makes sure it can be used widely. This paper includes the design methods, the framework of drivers developed by Windriver, the software development based on VB, which facilitates the device development. This converter realizes the data communication and protocol conversion between USB and CAN, which accomplishes data transmission, monitoring, display and storage. The highlight of this paper is that the rapid development of drivers is based on the thirdparty software Windriver, which avoids the catastrophic effect of possible errors on the operating system.

  Research and Implementation of a Low Power Asynchronous Multiplier

  SHI Wei,SU Bo,REN Hongguang,WANG Zhiying

  2012, 34(5): 73-77. doi:

  Abstract ( 380 )   PDF (576KB) ( 350 )   　　

  The asynchronous logic only performs actions on demand, and it is often adopted in the powerefficient design. There are three significant factors that may affect the power consumption of pipelined circuits: the structure of the pipeline, the behavior of the operation, and characteristics of operands. In this paper, the three factors are analyzed, and a poweroptimized desynchronized multiplier considering the influence of the factors is designed. The experiments show that the proposed multiplier has lower power dissipation and higher performance than the traditional desynchronized multipliers.

  A CountingCopyBased Commodity Operating System Code Quiescent Detection Mechanism

  LIU Xiaojian,REN Yi,DAI Huadong

  2012, 34(5): 78-83. doi:

  Abstract ( 335 )   PDF (702KB) ( 369 )   　　

  or high availability systems, it is desirable to fix the discovered operating system security holes and other bugs, and do performance improvement without rebooting. However, as commodity operating systems are usually implemented without keeping the hot update issue in mind, when the code to be updated is frequently used by the kernel, hot update may fail due to  finding no safe point, even if there do exist occasions that the code are not in use. In this article, a code reference monitoring mechanism is introduced to solve this problem. In order to safely add reference counting to the functions which are to be updated, each function is replaced by its counting counterpart. For the threads that are using these functions, their stacks are adjusted to make the function replacement safe, and to make these threads callback the code reference maintenance routine as soon as they leave these functions. Finally, experiments are conducted on Ksplice, an open source Linux hot updating software, to verify the effectiveness of this study.

  Research on the Second Level Buffer Cache Replacement Algorithm with Low Miss Penalty and High Performance for Networked Storage System

  ZHAO Yingjie,XIAO Nong

  2012, 34(5): 84-88. doi:

  Abstract ( 302 )   PDF (454KB) ( 375 )   　　

  Early researchers have observed that second level buffer caches commonly suffer from severe performance degradation, because the networked storage servers have special access patterns. To address the critical issue, this paper presents a novel cache replacement algorithm using a new mechanism called sequentiality detecting to achieve high performance. The attribute named sequentiality is defined for buffer pages to make a replacement decision: sequential pages with a high sequentiality value are preferred to be discarded rather than the random pages with a low sequentiality value. That is to say, this algorithm can reduce the numbers of random disk access and avoid unnecessary seeking and rotating cost of the disk heads. Our tracedriven simulation results show that it can significantly reduce effective access time and deliver a better performance for a wide range of cache sizes.

  Application of the EDA Algorithm in the Near Range Optimal Rendezvous for Spacecrafts

  ZHANG Qixin,WANG Shixing

  2012, 34(5): 89-94. doi:

  Abstract ( 289 )   PDF (776KB) ( 340 )   　　

  The methods for the optimization of timeenergy in the orbit maneuvering of spacecraft under two indexes, with emphasis on the optimization of near range orbit, are explored. By means of the CW equations, the characteristic velocity is derived for the onorbit servicing spacecraft using a twoimpulse orbit. The numerical calculation shows that EDA can accelerate the convergence of the algorithm, and has good optimal capability. It can also build a macro model for the entire group, getting time and energy relations under the mixed indicators. As a result, an accurate numerical simulation of the optimal indexes in the near range is realized. From the numerical results and comparison between these results, some conclusions of significance are drawn, which  provides reference for future research.

  Research on the Virtual Machine Placement Algorithmin Cloud Computing Based on Stochastic Programming

  XIE Wenjing,TANG Zhuo,YANG Liu,LI Renfa

  2012, 34(5): 95-100. doi:

  Abstract ( 345 )   PDF (640KB) ( 347 )   　　

  Iaas is a basic service model in cloud computing, and virtual machine placement is an important task in IaaS. In this paper, an algorithm based on stochastic programming is proposed to optimize the virtual machine placement under the condition of uncertain demand requirements. This algorithm has considered the factors of both response time and cost, meets the users’ requirements, and reduces their cost at the same time.

  A Study on the Scene Simulation and the Visualization of Tracking on Earth for Flying Satellite

  YANG Pingli,HUANG Shaohua,JIANG Ling,YUAN Yuan

  2012, 34(5): 101-106. doi:

  Abstract ( 362 )   PDF (628KB) ( 638 )   　　

  With a  constructed satellite flying virtual scene, we can disply the flying state and the ground tracking of flying satellite in a realtime way. This is useful for orbit design, flying state monitoring and application of satellite. The visulization software with such functions is developed based on studying the satellite orbit caculation, entity modeling, virtual scene assembling and virtual scene driving. The softeware can simulate satellite flying scenes, show the longitude and latitude of satellite in a realtime way. This software has been applied in practice.