Attack on Libert et al.＇s ID-Based Undeniable Signature Scheme

In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this paper, we show that the scheme is not secure. In other words, if a signer reveal a pair of signature and message,an adversary can forge the signer＇s signature for arbitrary message. The signature will be confirmed with this protocol, and can not be denied by the signer. More importantly, through this example, we illustrate that the bilinear property of pairings, although is useful for the design of cryptographic schemes, is also a source for security flaws.     

Accelerating Pollard’s Rho Algorithm on Finite Fields

Most generic and memory-efficient algorithms for solving the discrete logarithm problem construct a certain random graph consisting of group element nodes and return the solution when a collision is found among the graph nodes.     

Research on the Speech Coding Algorithm at 1200bit/s

ＲｅｓｅａｒｃｈｏｎｔｈｅＳｐｅｃｈＣｏｄｉｎｇＡｌｇｏｒｉｔｈｍａｔ１２００ｂｉｔ／ｓＣｈｅｎＸｉｎｆｕＷｕＪｉａ’ａｎ（ＡｉｒＦｏｒｃｅＴｅｌｅｃｏｍｍｕｎｉｃａｔｉｏｎｓＥｎｇｉｎｅｒｉｎｇＩｎｓｔｉｔｕｔｅ，Ｘｉ’ａｎ７１００７７）Ａｂｓｔｒ...     

Algorithm for scenario benefit route planning based on user’s requests

Most of the existing research for point of interest route planning only consider the static properties of POI,however,the congestion of the hot spots and users’ discontent may greatly reduce the travel quality.In order to increase the tourists’ satisfaction,the dynamic attributes of POI was considered and a route planning algorithm based on user’s requests was proposed.Firstly,Markov-GM(1,1) forecasting algorithm was designed to predict the number of people in each scenic spot.Markov-GM(1,1) could make the average predication error 12.2% lower than the GM(1,1) algorithm by introducing the predication residual.And then,the forward refinement (FR) algorithm was designed which could avoid visiting the unnecessary place and satisfy user’s requests as well.The average solving time of forward refinement algorithm was 9.4% lower than TMT algorithm under the same amount of user’s requests.Finally,based on the factors such as spot popularity,KL divergence of time,visiting order and distance et al,the scenic route profit planning algorithm which could make the number of Rank 1-5 spots 34.8% higher than Time_Based algorithm and 47.3% higher than Rand_GA algorithm.     

An Attack Modeling Based on Colored Petri Net

1 Attack Modeling A typical attack contains the following elements: 1) Objects attacked. These objects belong to the victims or can be regarded as public resource, such as networking bandwidth. 2) Attacker. These objects contain the hacker’s information, attacking tools and other states of attacker. 3) Attack processes. The stages of an attack and attack processes are used to depict the attacking action. 4) Control actions. These actions can be classified into response actions and defensiv…     

Two Improvements in Grover＇s Algorithm

When the current Grover algorithm is applied to searching some targets in an unsorted quantum database, the differences of the significance for each target are not taken into consideration. When the targets are more than a quarter of the total items, the probability of finding targets rapidly falls with the increase of the targets, and when the targets are more than half of the total items, the algorithm will be invalidated. Aiming at these problems, flrstly, an improvement based on the weighted targets is proposed in which each target is endowed a weight coefficient according to its significance. Using these different weight coefficients, we give a quantum superposition of all target states, which may make the probability for each target equal to its weight coefficient. Secondly, an improved phase matching is proposed in which two directions of phase rotation are same, and two magnitudes are determined by the inner product of the superposition of target states and the initial system state. When this inner product is more than 1/2, using the improved phase matching. The targets can be found with a probability of 100% and by the only one Grover iteration. Finally, the validity of these measures is validated by a simple searching example.     

Wavelet Image Encryption Algorithm Based on AES

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅＩｎｔｅｒｎｅｔａｎｄｔｈｅｍｕｌｔｉｍｅｄｉａｔｅｃｈｎｉｑｕｅａｒｅｔａｋｉｎｇｔｈｅｔｅｌｅｃｏｍｍｕｎｉｃａｔｉｏｎｓｗｏｒｌｄｂｙｓｔｏｒｍ .Ｗｉｔｈｔｈｅｉｎｃｒｅａｓｉｎｇａｗａｒｅｎｅｓｓｏｆｄｉｇｉｔａｌｃｏｍｍｕｎｉｃａ ｔｉｏｎｓｂｅｃａｕｓｅｏｆｔｈｅＩｎｔｅｒｎｅｔ,ｔｈｅｄｅｍａｎｄｆｏｒｉｎｔｅｒ ａｃｔｉｖｅｍｕｌｔｉｍｅｄｉａｃｏｍｍｕｎｉｃａｔｉｏｎａｐｐｌｉｃａｔｉｏｎｓｉｓｇｒｏｗｉｎｇｒａｐｉｄｌｙ .Ｗｅｃｏｍｍｕｎｉｃａｔ…     

Design and Implementation of a Driver＇s Eye State Recognition Algorithm Based on PERCLOS

In order to improve the general detection accuracy of eye state, this paper puts forward an innovative method for judging human eye state based on PERCLOS. After pretreatment of the eye image, Hough transformation is used for ellipse detection and pupil position. The gray projection variance threshold analysis is then used to help make the final detection. Freeman chain and the Snake model algorithm are used for the corner detection and pre- cise calculation of the height of an open eye. Thus the PER- CLOS value and the eye state can be figured out. The performance of our eye state recognition algorithm is validated by more than 1000 images within product database. The statistics result shows that the fatigue detection accuracy rate can meet the need of usage in complex environment.     

An Initiative Learning Algorithm Based on System Uncertainty

1　Introduction　Initiative learning method is characterized by and henceadvantageous for its independence of prior domain knowl edge. Rough set theory is a good tool for handling uncertaininformation in initiative learning way, because theoreticallyspeaking, data analyses based on rough set model can befully data autonomous and with no necessity of prior or exter nal information[1~6]. Possibly thanks to this advantage,rough set theory itself and its application have been kept in…     

An Incremental Rule Acquisition Algorithm Based on Rough Set

1　Introduction　Rough set theory introduced by Pawlak (1982)[1] is avalid mathematical theory developed in recent years, whichhas the ability to deal with imprecise, uncertain, and vagueinformation. It has been used successfully in such field asmedicine, pharmacology, market analysis, engineering,pattern recognition, data mining etc. Pawlak showed that theproblems of machine learning could be explained, analyzedand disposed within the framework of rough set theory[2]. Inhis paper[2], t…     

A Secure Watermarking Algorithm Based on Coupled Map Lattice

Based on the nonlinear theory, a secure watermarking algorithm using wavelet transform and coupled map lattice is presented. The chaos is sensitive to initial conditions and has a good non-relevant correlation property, but the finite precision effect limits its application in practical digital watermarking system. To overcome the undesirable short period of chaos mapping and improve the security level of watermarki‘ng, the hyper-chaotic sequence is adopted in this algorithm. The watermark is mixed with the hyper-chaotic sequence and embedded in the wavelet domain of the host image. Experimental results and analysis are given to demonstrate that the proposed watermarking algorithm is transparent, robust and secure.     

An Improved Rijndael Algorithm and its Implementation on DSP

1　IntroductionWiththecontinuousimprovementofcomputingpowerandthedevelopmentofdistributedcomputingbasedonInternet,itisahighchallengetotheDES[1 ] algorithmwhosekeyisonly 5 6bitslong .SotheNationalInstituteofStandardsandTechnology(NIST)requestcandidatesforanewAdvancedEn cryptionStandard (AES)algorithmtoreplaceDES .TheAESrequires[2 ] ablockcipherofsupportingadatablocksizeof 1 2 8bitsandkeysof 1 2 8,1 92and2 5 6bitslong .NISTwantsanalgorithmwhosese curityisatleastasgoodasTriple DES[1 …     

Attack Resilient and Efficient Protocol based on Greedy Perimeter Coordinator Routing—Mobility Awareness for Preventing the Attack in the VANET

Wireless Personal Communications - A Greedy Perimeter Coordinator Routing and Mobility Awareness (GPCR-MA) vehicular routing is a widely accepted routing protocol for VANET (Vehicular Ad hoc...     

New Cost-Effective Simplified Euclid’s Algorithm for Reed-Solomon Decoders

This paper proposes a cost-effective simplified Euclid’s (SE) algorithm for Reed-Solomon decoders, which can replace the existing modified Euclid’s (ME) algorithm. The new proposed SE algorithm, using new initial conditions and polynomials, can significantly reduce the computation complexity compared with the existing ME and reformulated inversionless Berlekamp-Massey (RiBM) algorithms, since it has the least number of coefficients in the new initial conditions. Thus, the proposed SE architecture, consisting of only 3t basic cells, has the smallest area among the existing key solver blocks, where t means the error correction capability. In addition, the SE architecture requires only the latency of 2t clock cycles to solve the key equation without initial latency. The proposed RS decoder has been synthesized using the 0.18 μm Samsung cell library, and the gate count of the RS decoder, excluding FIFO memory, is only 40,136 for the (255, 239, 8) RS code.     

Research on Threshold Adjustment Algorithm in Adaptive Modulation and Coding

1Introduction AMCisoneofthekeytechniquesinHSDPA[1].AMChasbeenofinterestasanefficientwaytoincrease thethroughputof3Gwirelesscommunicationsystems.ThecoreideaofAMCistodynamicallychangethe MCSinsubsequentframeswiththeobjectiveofmaxi mizingthespectralefficienc…     

A Novel Admission Control Algorithm Based on Negotiation and Price

1　Introduction　In a media server that supports Quality of Service (QoS),an admission control algorithm determines whether or not anew request can be admitted to the server such that all userswill receive their required performance[1]. In general, ad mission control algorithms can be divided into deterministic,observation based and statistical ones. Deterministic algo rithms guarantee the specific QoS requirement by reservingthe resources for the worst case requirement of each applic…     

A New Built-in TPG Based on Berlekamp–Massey Algorithm

In this work, a new method to design a mixed-mode Test Pattern Generator (TPG) based only on a simple and single Linear Feedback Shift Register (LFSR) is described. Such an LFSR is synthesized by Berlekamp–Massey algorithm (BMA) and is capable of generating pre-computed deterministic test patterns which detect the hard-to-detect faults of the circuit. Moreover, the LFSR generates residual patterns which are sufficient to detect the remaining easy-to-detect faults. In this way, the BMA-designed LFSR is a mixed-mode TPG which achieves total fault coverage with short testing length and low hardware overhead compared with previous schemes according to the experimental results.