检索结果-南通市图书馆

Efficient Scalar Multiplication for Elliptic Curves over Binary Fields

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2008年第6期13卷 717-720页

作者： gu haihua gu Dawu LIU Ya School of Electronic lnforamation and Electrical Engineering Shanghai Jiao Tong University Shanghai 200240 China

Scalar multiplication [n]P is the kernel and the most time-consuming operation in elliptic curve cryptosystems. In order to improve scalar multiplication, in this paper, we propose a tripling algorithm using Lopez and Dahab projective coordinates, in which there are 3 field multiplications and 3 field squarings less than that in the Jacobian projective tripling algorithm. Furthermore, we map P to（φε^-1（P）, and compute [n]（φε^-1（P） on elliptic curve Eε, which is faster than computing [n]P on E, where φε is an isomorphism. Finally we calculate （φε（[n]φε^-1（P）） = [n]P. Combined with our efficient point tripling formula, this method leads scalar multiplication using double bases to achieve about 23% improvement, compared with Jacobian projective coordinates.

关键词： elliptic curve cryptosystem scalar multiplication double-base number system projective coordinates

Enhanced Side-Channel Leakage Detection Method by Considering Combinational Logic

在线全文

学校读者我要写书评

暂无评论

China Communications 2015年第6期12卷 1-10页

作者： LIU Junrong guO Zheng gu Dawu YU Yu LU Haining gu haihua BAO Sigang School of Electronic Information and Electrical Engineering Shanghai JiaoTong University Shanghai Viewsource Information Science & Technology Co. Ltd. Shanghai Huahong Integrated Circuit Co. Ltd.

In this paper,we propose a hybrid power model that includes the power consumption of not only the registers but also part of the combinational *** doing knownkey analysis with this hybrid model,power side-channel leakage caused by correct keys can be *** experiment,PRINTcipher and DES algorithms were chosen as analysis targets and combinational logic s-box unit was selected to build power *** analysis results showed the signal-to-noise ratio(SNR) power consumption increase of more than 20%after considering s-box's power consumption so that the information of keys can be obtained with just half number of power *** addition,the side channel-leakage detection capability of our method also shows better effectiveness that can identify the correct keys.

关键词： power analysis leakage detection combinational logic known-key analysis

A Combinational Power Analysis Method against Cryptographic Hardware

在线全文

学校读者我要写书评

暂无评论

China Communications 2015年第1期12卷 99-107页

作者： guO Zheng gu Dawu LU Haining LIU Junrong XU Sen BAO Sigang gu haihua School of Electronic Information and Electrical Engineering Shanghai JiaoTong University Shanghai Viewsource Information Science & Technology Co. Ltd. Shanghai Huahong Integrated Circuit Co. Ltd.

Power analysis is a non-invaslve attack against cryptographic hardware, which effectively exploits runtime power consumption characteristics of circuits. This paper proposes a new power model which combines Hamming Distance model and the model based on the template value of power consumption in combinational logic circuit. The new model can describe the power consumption characteristics of sequential logic circuits and those of combinational logic as well. The new model can be used to improve the existing power analysis methods and detect the information leakage of power consumption. Experimental results show that, compared to CPA（Correlation Power Analysis） method, our proposed attack which adopt the combinational model is more efficient in terms of the number of required power traces.

关键词： cryptographic hardware side channel attack power analysis combinational logic

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第3期61卷 131-147页

作者： Sen XU Xiangjun LU Kaiyu ZHANG Yang LI Lei WANG Weijia WANG haihua gu Zheng guO Junrong LIU Dawu gu Department of Computer Science and Engineering Shanghai Jiao Tong University College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics

A template attack, the most powerful side-channel attack methods, usually first builds the leakage profiles from a controlled profiling device, and then uses these profiles to recover the secret of the target device. It is based on the fact that the profiling device shares similar leakage characteristics with the target device. In this study, we focus on the similar operations in a single device and propose a new variant of the template attack, called the similar operation template attack(SOTA). SOTA builds the models on public variables(e.g., input/output) and recovers the values of the secret variables that leak similar to the public variables. SOTA’s advantage is that it can avoid the requirement of an additional profiling device. In this study, the proposed SOTA method is applied to a straightforward RSA-CRT implementation. Because the leakage is(almost) the same in similar operations, we reduce the security of RSA-CRT to a hidden multiplier problem(HMP) over GF(q), which can be solved byte-wise using our proposed heuristic algorithm. The effectiveness of our proposed method is verified as an entire prime recovery procedure in a practical leakage scenario.

关键词： side channel attack template attack RSA-CRT hidden number problem prime recovery

To Construct High Level Secure Communication System： CTMI Is Not Enough

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2018年第11期15卷 122-137页

作者： Sen Xu Xiangjun Lu Aidong Chen Haifeng Zhang haihua gu Dawu gu Kaiyu Zhang Zheng guo Junrong Liu Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Software Engineering Beijing Union University Beijing 100 101 China Wanda Internet Technology Group Shanghai 200127 China Beijing Smart-Chip Microelectronics Technology Co. Ltd. Beijing China

Public key cryptographic （PKC） algorithms, such as the RSA, elliptic curve digital signature algorithm （ECDSA） etc., are widely used in the secure communication sys- tems, such as OpenSSL, and a variety of in- formation security systems. If designer do not securely implement them, the secret key will be easily extracted by side-channel attacks （SCAs） or combinational SCA thus mitigat- ing the security of the entire communication system. Previous countermeasures of PKC im- plementations focused on the core part of the algorithms and ignored the modular inversion which is widely used in various PKC schemes. Many researchers believe that instead of straightforward implementation, constant time modular inversion （CTMI） is enough to resist the attack of simple power analysis combined with lattice analysis. However, we find that the CTMI security can be reduced to a hidden t-bit multiplier problem. Based on this feature, we firstly obtain Hamming weight of interme- diate data through side-channel leakage. Then, we propose a heuristic algorithm to solve the problem by revealing the secret （partial and full） base of CTMI. Comparing previous nec-essary input message for masking filtering, our procedure need not any information about the secret base of the inversion. To our knowl- edge, this is the first time for evaluating the practical security of CTM! and experimental results show the fact that CTMI is not enough for high-level secure communication systems.

关键词： information security side channelanalysis elliptic curve digital signature algo-rithm constant time modular inversion ham-ming weight leakage

Sol-gel synthesis and photoluminescence characterization of La_2Ti_2O_7:Eu^(3+) nanocrystals

在线全文

学校读者我要写书评

暂无评论

Rare Metals 2011年第6期30卷 602-606页

作者： CHENG Hua LU Zhouguang LIU Ying YANG haihua gu Yingying LI Wei TANG Yougen College of Chemistry ＆ Chemical Engineering Central South University Changsha 410083 China

Eu3＋ doped La2Ti2O7 nanocrystals with pure monoclinic phase and size of about 100 nm were prepared by a citric acid （CA） assisted sol-gel method. Techniques of thermo-gravimetric （TG） and differential scanning calorimetry （DSC）, X-ray diffraction （XRD）, as well as transmission electron microscopy （TEM） were employed to characterize the as-synthesized nanoparticles. Furthermore, photoluminescence （PL） performances of the Eu3＋ doped La2Ti2O7 nanocrystals were evaluated with focus on the effects of calcination temperature and Eu3＋ doping concentration on the photoluminescence properties.

关键词： lanthanum titanate rare earth metals photoluminescence nanophosphors pechini citric acid sol-gel

在线全文

学校读者我要写书评

暂无评论

使用三个数域的数域筛算法

国防科技大学学报 2012年第2期34卷 1-5页

作者：顾海华谷大武谢文录李升严家驹上海交通大学计算机科学与工程系上海200240 上海华虹集成电路有限责任公司上海201203

大整数分解难题是RSA密码的数学安全基础。目前数域筛算法是分解365比特以上大整数的最有效方法,然而它的时间复杂度仍然是亚指数的。对于目前普遍使用的1024比特以上大整数,数域筛算法还不能分解,所以研究数域筛算法具有重要的意义。... 详细信息

大整数分解难题是RSA密码的数学安全基础。目前数域筛算法是分解365比特以上大整数的最有效方法,然而它的时间复杂度仍然是亚指数的。对于目前普遍使用的1024比特以上大整数,数域筛算法还不能分解,所以研究数域筛算法具有重要的意义。现有的一般数域筛算法普遍使用两个数域,对多个数域的研究极少。一般数域筛算法经过修改可以使用三个数域,即两个代数数域和一个有理数域。分析表明:修改后的数域筛算法与原来的一般数域筛算法在时间复杂度上处于同一量级。但修改后的数域筛算法有更多地方可以合并计算,所以计算速度更快了。通过两个实验也验证了这一结论。

关键词：公钥密码 RSA密码整数分解数域筛算法

二元扩域超奇异Koblitz曲线的标量乘计算

在线全文

学校读者我要写书评

暂无评论

计算机应用与软件 2013年第11期30卷 145-148,194页

作者：徐云秀顾海华马博上海华虹集成电路有限责任公司设计部上海201203 上海交通大学计算科学与工程系上海200240

二元扩域超奇异Koblitz曲线是目前双线性对计算中被广泛采用的曲线。研究二元扩域超奇异Koblitz曲线上标量乘的快速实现算法。由于Koblitz曲线存在特殊的自同态映射τ,使得标量乘算法可以由"double-and-add"算法变成"τ-and-add"算法,... 详细信息

二元扩域超奇异Koblitz曲线是目前双线性对计算中被广泛采用的曲线。研究二元扩域超奇异Koblitz曲线上标量乘的快速实现算法。由于Koblitz曲线存在特殊的自同态映射τ,使得标量乘算法可以由"double-and-add"算法变成"τ-and-add"算法,因此可以大大提高标量乘的运算效率。基于这个思想,提出了二元扩域超奇异Koblitz曲线上基于τ的非相邻表示型TNAF(τ-adic Non-Adjacent Form)窗口标量乘的实现算法;同时,为了抵御简单功耗分析SPA(Simple Power Analysis)攻击,将TNAF算法进一步改进为规则序列TNAF算法。以窗口取4为例,在同等安全强度下,规则序列TNAF4算法的运算效率比传统的二进制规则序列NAF4标量乘算法提高50%,比传统的Montgomery标量乘算法提高23%。

关键词： Koblitz曲线双线性对基于τ的非相邻表示型(TNAF) 简单功耗分析(SPA) 标量乘

在线全文

学校读者我要写书评

暂无评论

一种基于多关联规则的全局快速分类算法

计算机工程与应用 2006年第22期42卷 161-163页

作者：顾海花赵传申孙志挥东南大学计算机科学与工程系

提出了一种分布多库环境下的全局库分类规则发现算法——FGCMAR。FGCMAR在各个站点采用CMAR算法分别生成频繁模式树,并在各个站点间传送条件模式基来形成全局条件频繁模式树,最终通过挖掘条件频繁模式树来得到全局分类规则。该算法能够... 详细信息

提出了一种分布多库环境下的全局库分类规则发现算法——FGCMAR。FGCMAR在各个站点采用CMAR算法分别生成频繁模式树,并在各个站点间传送条件模式基来形成全局条件频繁模式树,最终通过挖掘条件频繁模式树来得到全局分类规则。该算法能够有效的减小网络通信量,提高挖掘效率。理论分析和实验结果表明该算法是有效可行的。

关键词：数据挖掘分布多库全局分类规则频繁模式树