[计算机]超椭圆曲线密码体制论文：超椭圆曲线群快速算法研究.doc

超椭圆曲线密码体制论文：超椭圆曲线群快速算法研究【中文摘要】随着互联网的日益普及,人们的生活生产方式、管理方式也在发生着变化,对于网络的依赖也日益加深,随之而来的网络安全问题越来越受到人们的广泛关注计算机网络安全是目前研究的重点,因为它为网络电子商务、政府电子公务、军事等重要领域在互联网上的应用提供了保障随着公钥密码技术PKI的发展,RSA、椭圆曲线密码体制(ECC)等成为了人们研究的热点自从1989年N.Kobiltz提出了超椭圆曲线密码体制(HECC)理论以来,因为与ECC以及其他密码体制相比具有以下优点：一,在同等安全水平条件下,所用基域更小；二、可以模拟基于乘法群上的如RSA、ElGamal等几乎所有协议;三、在同样的定义域上,亏格大,曲线多,选取用于密码中的安全曲线就多HECC成为近年来的一个新研究热点目前超椭圆曲线密码体制主要还处于理论研究阶段,最主要的原因是,超椭圆曲线密码的实现速度要比椭圆曲线密码实现速度慢,因为超椭圆曲线的Jacobian商群上的基本运算比椭圆曲线复杂的多。

本文主要的研究工作是如何减少超椭圆曲线的除子加和标量乘法的计算量,从而提高超椭圆曲线密码的实现速度,具体工作有以下两点：(1)对文献中已经给出的亏格为3的超椭圆曲线退化除子算法确定性公式进行改进,从多种方向对于公式进行优化首先利用几种不同的求逆技巧,针对不同情况的公式进行优化,从而将求逆的过程化简,甚至变换成乘法等运算量较低的运算再利用公式的性质与结构,将多个乘法运算合并为1个乘法运算,从而减少无谓的运算最后,利用其他文献中提及的一些乘法化简公式,以及公式变形来减少乘法运算量各个方法都具有其局限性,但针对适应的公式进行改进,能取得不错的效果2)进一步就退化除子算法进行了扩展与改进给出了亏格为2的确定性公式,并对其计算量进行估计估计结果表明,在达到最低的安全水平条件下,d取160比特的大整数,此时标准除子标量乘法的运算量为318I+12044M,比标准除子标量乘法大约快30%然后结合二分法、并行算法等其他算法思想进一步改进退化除子算法,分别得到两个运算量更小的优化算法其中二分法改进后效果明显,明显减少了求逆与乘法的计算次数而并行算法主要是将运算合并在同一个运算轮中,运算量降低不明显,但是将乘法处理器与运算轮数降到最低,从而使总体的运算时间能进一步缩短。

英文摘要】With the increasing popularity of the Internet, people’s lives and production methods, management is changing; the network has acquired a deeper dependence, followed by the network security problem more and more people’s attention. Computer network security is the focus of the study, because it for the network e-commerce, electronic government official, military and other important areas ofapplication of the Internet has provided a guarantee.With the development of PKI public key cryptography,RSA,Elliptic curve cryptography (ECC) have become a hot research people. Since 1989, N.Koblitz proposed hyperelliptic curve cryptosystem (HECC) theory since, as with the ECC, and other than the password system has obvious advantages:First, at the same level of security conditions, the use of the base domain smaller; Second, can be simulated based on the multiplicative group on, such as RSA, ElGamal, etc. Almost all the agreements; Third, in the same domain, the genus of a large, curvedand more, select Curve for the security of the password the more. HECC become a newhotspot in recent years.Hyperelliptic curve cryptography key is still in the stage of theoretical research, the main reason is the realization rate of HECC is slower than ECC, because the Jacobian of hyperelliptic curve quotient than the basic operations on theelliptic curve more complicated. In this paper, the research is how to reduce the divisor of hyperelliptic curves and scalar multiplication plus the computation, thereby enhancing the realization of ultra-speed elliptic curve cryptography, the following two specific work:(1) the literature has given genus 3 hyperelliptic curves degenerate divisor deterministic algorithm to improve, the formula from a variety of directions for optimization.First, the inverse using several different techniques for different situations to optimize the formula, which will simplify the process of inversion, and even transform into a low multiplication operations such as computation. Reuse of the nature and structure of the formula, the number of multiplication into a multiplication operation, thus reducing unnecessary operations. Finally, some of the other documents mentioned in the simplified formula for multiplication, and multiplication formula to reduce the amount of deformation. Each method has its limitations, but to improve the formula for adaptation can achieve good results.(2) In addition to the further degradation of sub-algorithm for the extended and improved.the deterministic genus 2 formula and its computation is estimated. Estimation results show that the minimum level of security conditions, d take the big 160-bit integer, then the standard divisor scalar multiplication capacity of 318I+12044 M, than the standard divisor scalar multiplication about 30% faster.Then combined with the dichotomy, parallel algorithms and other algorithms to further improve the degradation of ideological divisor algorithm, respectively, are two smaller computational algorithm. Dichotomy which results improved significantly, a significant reduction in the calculation of the inverse and the multiplication number. The parallel algorithm is computing the major merger in the same round operation, the computation reduction is not obvious, but the processor and the multiplication operation to minimize the number of rounds, so that the overall computation time can be further reduced.【关键词】超椭圆曲线密码体制 Jacobian商群 除子标量乘法【英文关键词】Hyperelliptic curve crypto systems Jacobian quotient group Divisor scalar multiplication【目录】超椭圆曲线群快速算法研究摘要6-7Abstract7第1章 绪论11-161.1 计算机网络安全与公钥密码发展11-121.2 超椭圆曲线密码体制的研究背景意义和研究现状12-141.3 本论文的研究内容及章节安排14-16第2章 超椭圆曲线密码体制概述16-422.1 超椭圆曲线的定义16-212.2 超椭圆曲线Jacobian群的运算法则21-262.2.1 除子有关概念及性质21-242.2.2 Jacobian商群24-262.3 超椭圆曲线密码体制26-392.3.1 有限域的算法约定27-352.3.2 Jacob。