High performance elliptic curve point operations with pipelined GF（2m） field multiplier

This paper studies the effect high performance pipelined GF（2^256） bit-serial multiplier on elliptic curve point operations. A 3-stage pipelined version of the Massy-Omura GF（2m） normal basis multiplier for 160 ≤ m ≤256 was studied in terms of area overhead and throughput improvement. Simple gate area and delay models were used to estimate the throughput of the pipelined and the non-pipelined multipliers. The proposed pipelined architecture has been shown to have a significant improvement in throughput allowing a single 3-stage pipelined multiplier to have higher throughput than an architecture employing three parallel non-pipelined multipliers. The AT2 performance metric has shown an even more significant improvement.     

一种快速实现椭圆曲线密码体制的贪心算法

快速实现椭圆曲线密码体制的一个关键问题就是椭圆曲线上点的数乘。文中利用大整数S可以表示为S=S1m S2的形式,提出了一种贪心算法。该算法比经典算法减少了点的加法的计算次数,从而加快了椭圆曲线上点的数乘的运算速度。     

抵抗SPA攻击的分段Montgomery标量乘算法

基于Akishita在Montgomery形式椭圆曲线上计算双标量乘kP+lQ的思想,提出了一种计算三标量乘kP+lQ+tR的新算法,使运算量减少了约23%。在上述算法基础上提出一种椭圆曲线上分段计算标量乘bP的方法,通过预计算少量点,将计算bP转化为计算kP+lQ或kP+lQ+tR,并使用边信道原子化的方法使其可以抵抗简单能量分析(SPA)攻击。最后使用Magma在二进制域上对分段算法仿真,结果显示二分段算法计算速度最快,三分段算法其次,在效率上均比原始Montgomery算法提升很大。     

利用半点计算椭圆曲线双标量乘法算法

实现椭圆曲线密码体制最主要的运算是椭圆曲线点群上的标量乘法(或点乘)运算。一些基于椭圆曲线的密码协议比如ECDSA签名验证,就需要计算双标量乘法kP+lQ,其中P、Q为椭圆曲线点群上的任意两点。一个高效计算kP+lQ的方法就是同步计算两个标量乘法,而不是分别计算每个标量乘法再相加。通过对域F2m上的椭圆曲线双标量乘法算法进行研究,将半点公式应用于椭圆曲线的双标量乘法中,提出了一种新的同步计算双标量乘法算法,分析了效率,并与传统的基于倍点运算的双标量乘法算法进行了详细的比较,其效率更优。     

椭圆曲线数字签名在电子政务中的应用

随着电子政务系统的推广,电子公文的安全性受到人们的关注。本文描述了椭圆曲线密码体制,并在此基础上介绍了基于椭圆曲线的数字签名,讨论了椭圆曲线数字签名在电子政务中的应用。     

The Impact of Experience and Perception on the Efficiency of E-procurement in Malaysia

The technology of E-procurement becomes more popular in many developed countries due to its accuracy in decision making for big projects that enhance the public bidding process for development projects in any country. The experience of employees who operate the system of E-procurement and the perception of users who bid for projects are essential to ensure the efticiency of procurement and the whole bidding process for public projects. This paper examined the impact of employee＇s experience on the efficiency of E-procurement systems in public agencies. In addition, we attempt to examine the perception factor of using E-procurement systems with regard to users in the seller side. A survey was conducted to identify the impact of experience and perception on the efficiency towards adoption and use of E-procurement system among users who working in firms participated in online bidding for public agencies projects, and employees who are working in E-procurement department in government administrations Malaysian government. A total of 80 questionnaires were collected and the data were analyzed to look at the level of the impact of experience and perception in E-procurement users. The general findings indicate a positive attitude experience and perception among the users in using the E-procurement.     

Probabilistic Health-lnformatics and Bioterrorism

In this article, new probabilistic health-informatics indices connecting probabilities： Pr（A）,Pr（B）,Pr（A IB） and P r（A ]B-） are discovered, where .4 and B denote respectively the ＂ability of a hospital to treat anthrax patients＂ and ＂whether a hospital drilled to be prepared to deal with an adverse bioterrorism＂. These probabilistic informatics are not seen in any textbooks or journal articles and yet, they are too valuable to be unnoticed to comprehend the hospitals＇ preparedness to treat anthrax patients in an outbreak of bioterrorism. A demonstration of this new probabilistic informatics is made in this article with the data in the U.S. Government＇s General Accounting Office＇s report GA0-03-924. Via this example, this article advocates the importance of the above mentioned probabilistic-informatics for health professionals to understand and act swiftly to deal with public health emergencies.     

New exact solutions of the (n+1)-dimensional sine-Gordon equation using double elliptic equation method

In this paper, the (n+1)-dimensional sine-Gordon equation is studied using double elliptic equation method. With the aid of Maple, more exact solutions expressed by Jacobi elliptic functions are obtained. When the modulus m of Jacobi elliptic function is driven to the limit 1 and 0, some exact solutions expressed by hyperbolic function solutions and trigonometric functions can also be obtained, respectively.     

How cooperation arises from rational players？

In classical control systems, the plant to be controlled does not have intention to gain its payoff or benefit, which is obviously not the case in various aspects of social and economic systems（or subsystems）. In the latter case, competition and cooperation between players who will optimize their own payoffs turn out to be an important feature, and a fundamental problem is how to achieve cooperation from these rational players. In this paper, we present a neat way to lead to cooperation in dynamical Prisoner＇s Dilemma game. In our scenario, the two players are heterogenous with hierarchical roles as the ＇leader＇ and the ＇follower＇ respectively. It is shown that the system will co-evolve into and stay at the cooperation state if and only if the leader is restricted not to take the dominating strategies. For the special case of 1-step-memory, the optimal strategies for the leader and follower are ＇Tit for Tat＇ and ＇ALL C＇ respectively. In this framework, both the heterogeneity of the players＇ roles and the multiplicity of time-scales are crucial for cooperation, which are quite natural settings from the view point of control theory. Besides, the boundary for cooperation also turns out to depend on the relative payoffs of the players.     

Pearson＇s Correlation Coefficient： A More Realistic Threshold for Applications on Autonomous Robotics

Many applications for control of autonomous platform are being developed and one important aspect is the excess of information, frequently redundant, that imposes a great computational cost in data processing. Taking into account the temporal coherence between consecutive frames, the PCC （Pearson＇s Correlation Coefficient） was proposed and applied as： discarding criteria methodology, dynamic power management solution, environment observer method which selects automatically only the regions-of-interest; and taking place in the obstacle avoidance context, as a method for collision risk estimation for vehicles in dynamic and unknown environments. Even if the PCC is a great tool to help the autonomous or semi-autonomous navigation, distortions in the imaging system, pixel noise, slight variations in the object＇s position relative to the camera, and other factors produce a false PCC threshold. Whereas there are homogeneous regions in the image, in order to obtain a more realistic Pearson＇s correlation, we propose to use some prior known environment information.     

A top-down positioning scheme for underwater wireless sensor networks

In order to increase the localization coverage while keeping the localization error small in a unique network architecture in which there are not evenly distributed anchor nodes with great ability of communication or additional infrastructure,a Top-down Positioning Scheme(TPS)for underwater acoustic sensor networks is proposed.By defining node’s confidence reasonably,TPS insures the quality of the new reference nodes.TPS also refines the nodes which have just been positioned via the gradient method and helps non-localized nodes search for more reference nodes via the new scheme for 3D Euclidean distance estimation.By comparing the new scheme for 3D Euclidean distance estimation with the existing scheme,the new scheme is shown to have greater ability to estimate two-hop Euclidean distance in 3D space.Simulation results show that TPS which integrates node’s confidence defined reasonably,the gradient method,and the new scheme for 3D Euclidean distance estimation can increase the localization coverage ratio,while keeping the localization error small.     

Vulnerability of two multiple-key agreement protocols

In 2008, Lee et al. proposed two multiple-key agreement protocols, first one based on elliptic curve cryptography (ECC) and the other one, based on bilinear pairings. Shortly after publication, Vo et al. showed that the Lee-Wu-Wang’s pairing-based protocol is vulnerable to impersonation attack then for removing the problem, they proposed an improved protocol. In this paper, first We show that the Lee-Wu-Wang’s ECC-based protocol is insecure against forgery attack and also, if long-term private keys of two entities and one key of the session keys are revealed, the other session keys are exposed too. Then, we demonstrate that the Vo-Lee-Yeun-Kim’s protocol is vulnerable to another kind of forgery attacks and a reflection attack.     

基于半点和多基表示的标量乘法扩展算法

在半点运算和多基表示思想的基础上,结合Extended DBNS方法,提出一种形如 的新标量k的多基表示,其中,d属于一个给定的整数集,并给出相应的多基链的标量乘法。数值实验结果表明,该算法以增加少量的预计算存储为代价,能有效降低标量乘法的计算复杂度和多基链的链长。     

Turkish Cypriot Mufti Struggle in the Media

The aim of this article is to provide information on the struggle to re-establish the Mufti of Cyprus, （abolished in 1928 by the British colonial government） in the context of the power of Turkish society media which began to be emphasized and highlighted in the pages of ＂Halkin Sesi＂ （People＇s Voice） and ＂lstiklal＂ （Independence） newspapers first with articles to emphasize the importance of Muftis Struggle. Communication, which is one of the most essential properties in a society, is the key to inculcate the idea of social solidarity into people. The most important media of the period was the print press and this study examines its contributions to social solidarity of the community during British Period in Cyprus. During this period, the two most influential news paper ＂Halkln Sesi＂ and ＂lstiklal＂ and their communicational skills had countless effects on community and social solidarity. In this study, these effects and influences over a specific struggle are examined and interpreted. With this study, it is concluded that these two newspapers had very big impacts on the media of that period and they had really important contributions on the Mufti struggle of the community.     

有限域GF(2m)上ECDSA算法的优化

椭圆曲线数字签名算法(ECDSA)是数字签名算法(DSA)在椭圆曲线密码体制中的实现,其安全性依赖于椭圆曲线离散对数问题(ECDLP)的难解性。该文介绍了ECDSA在有限域GF(2m)上的实现,利用射影坐标思想,改进椭圆曲线上求两点和运算公式,对点乘算法进行优化,有效地提高了数字签名和签名验证的速度。     

A new approach of conditions on for s-sparse recovery δ2s（φ）

In this paper, we provide a unified expression to obtain the conditions on the restricted isometry constant δ2s（φ）. These conditions cover the important results proposed by Candes et al. and each of them is a sufficient condition for sparse signal recovery. In the noiseless case, when δ2s（φ） satisfies any one of these conditions, the s-sparse signal can be exactly recovered via （11） constrained minimization.     

一种门限的双线性基盲签名方案

提出了一种新型的门限盲签名方案,称为基于双线性映射的门限盲签名方案。该方案使用椭圆曲线上的Weil对和Shamir的秘密分享方法来构造,并分析了新方案的正确性和安全性,分析结果表明,在双线性Diffie-Hellman难题下,参与者能方便地产生个体盲签名,公开验证者可通过验证公式决定是否接受发送方计算出的门限盲签名。而任何攻击者不能伪造个体盲签名,即使已知所有参与者的秘密值也无法伪造门限盲签名。     

椭圆曲线底层域快速算法的优化

为了提高椭圆曲线底层域运算的效率,基于将乘法转换为平方运算的思想,提出在素数域[FP]上用雅克比坐标直接计算[2kP]和[3kP]的改进算法,其运算量分别为[(3k-1)M+(5k+3)S]和[(6k-1)M+(9k+3)S],与DIMITROY和周梦等人所提的算法相比,算法效率分别提升了6.25%和5%。另外,利用相同的原理,给出了素数域[FP]上用在仿射坐标系直接计算[3kP]的改进算法,其运算量为[I+(6k+1)M+(9k+1)S],与周梦和殷新春等人所提的算法相比,效率分别提升了3.4%和24%。     

有限域GF(2m)上椭圆曲线密码体制的快速实现

椭圆曲线密码体制的快速实现是当前公钥密码体制研究的热点之一。椭圆曲线上点的标量乘和加法运算是椭圆曲线密码算法的核心运算。为了提高运算速度,利用射影坐标思想,改进椭圆曲线上求两点和运算公式,对标量乘算法进行优化。讨论了椭圆曲线密码体制的优势及研究其快速实现的意义。