超椭圆曲线密码体制的研究与进展

椭圆曲线密码是目前最流行的公钥密码体制,超椭圆曲线密码作为椭圆曲线密码的推广,近几年对它的研究也日益被人们重视.在该文中,作者就目前国内外对超椭圆曲线密码体制的研究现状作了综述,并提出了在超椭圆曲线密码体制的理论与实现中急需解决的几个问题.     

超椭圆密码体制的性能

本文讨论几种超椭圆曲线密码体制,详细介绍超椭圆曲线群规律的实现和产生适用于密码的曲线的方法,本文专门对椭圆曲线数字签名方案和超椭圆曲线方案的性能进行了比较。结论是,目前没有任何超椭圆曲线的性能优于椭圆曲线     

椭圆曲线密码体制相关问题

椭圆曲线密码体制是近年来密码学理论与应用研究的一个热点。介绍了椭圆曲线密码体制的数学原理、应用和攻击现状,重点分析了对一般曲线的各种攻击方法,针对超奇异椭圆曲线的MOV攻击,对异常椭圆曲线的SS-SA攻击。并介绍了目前较为关注的超椭圆曲线。     

超椭圆曲线盲数字签名方案的设计

超椭圆曲线密码体制(HECC)是以超椭圆曲线离散对数问题的难解性为基础的,相对于其他密码体制而言,具有安全性高、操作数短等优点。文中设计了一种基于超椭圆曲线密码体制的盲数字签名方案,方案中提出了对消息盲化的方法。该方案具有很高的安全性,非法用户很难通过截获的消息来获取明消息,因为盲化是建立在离散对数问题上的。     

基于椭圆曲线密码体制的Ad Hoc保密与认证协议

针对Ad Hoc终端计算资源受限的特点,提出了一种基于椭圆曲线密码体制的Ad Hoc网络保密与认证协议.该协议在椭圆曲线密码体制加解密方案和数字签名方案的基础上,结合Ad Hoc网络的特点,引入一次性口令生成算法HOTP(HMAC-Based One-Time Password Algorithm),在节省计算资源的同时,保证了协议的安全性.     

RSA公钥密码体制及其在SET协议中的应用

SET协议是电子商务中最为重要的安全协议之一,其关键技术有数据加解密技术、数字签名、数字信封、CA数字证书技术。这些技术的实现均以RSA公钥密码体制为基础。文中首先分析了RSA密码体制的基本原理,然后研究了RSA密码体制在SET协议中的应用。     

椭圆曲线密码体制的应用及其安全性分析

椭圆曲线密码体制已经成为密码学的研究热点之一.相对于其它公钥密码体制,椭圆曲线密码体制有短密钥和计算效率高等优点.本文介绍椭圆曲线密码体制及其在加密和数字签名等方面的应用,并讨论了椭圆曲线密码体制的安全性.     

ECC密码技术及其优越性

椭圆曲线密码体制是近年来兴起的一种性能优良的公钥密码体制，本文介绍了椭圆曲线密码体制的有关概念和基本理论，将它与其它公钥密码体制进行了比较，阐述了椭圆曲线密码体制的优越性。     

移动通信网中的双向认证与密钥协商新协议

本文基于椭圆曲线密码体制,设计了适用于移动通信网的双向认证和密钥协商协议。     

一种基于ECC的RFID认证协议

文章通过对物联网所存在安全问题的研究,结合椭圆曲线密码体制的高安全性和零知识证明的零知识性等优点,设计了一种在物联网环境下控制系统中针对终端设备和后台数据库间的身份认证协议。该协议利用椭圆曲线密码体制又引入了零知识证明的思想,是一种基于椭圆曲线的零知识证明的身份认证协议,并且在认证的过程当中与哈希函数相结合,来有效地保护认证时双方交互的证据信息。协议可以有效地完成对物联网环境下控制系统中终端设备和后台数据库间的双向身份认证。     

Flexible Prime‐Field Genus 2 Hyperelliptic Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw

This paper presents an energy‐efficient (low power) prime‐field hyperelliptic curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 μm standard CMOS technology, performs an 81‐bit divisor multiplication in 503 ms consuming only 6.55 μJ of energy (average power consumption is 12.76 μW). In addition, we present a technique to make the power consumption of the HECC processor more uniform and lower the peaks of its power consumption.     

Hyperelliptic Curve Crypto‐Coprocessor over Affine and Projective Coordinates

This paper presents the design and implementation of a hyperelliptic curve cryptography (HECC) coprocessor over affine and projective coordinates, along with measurements of its performance, hardware complexity, and power consumption. We applied several design techniques, including parallelism, pipelining, and loop unrolling, in designing field arithmetic units, group operation units, and scalar multiplication units to improve the performance and power consumption. Our affine and projective coordinate‐based HECC processors execute in 0.436 ms and 0.531 ms, respectively, based on the underlying field GF(2⁸⁹). These results are about five times faster than those for previous hardware implementations and at least 13 times better in terms of area‐time products. Further results suggest that neither case is superior to the other when considering the hardware complexity and performance. The characteristics of our proposed HECC coprocessor show that it is applicable to high‐speed network applications as well as resource‐constrained environments, such as PDAs, smart cards, and so on.     

一种新的安全电子商务协议CPK-SET

现在所流行的安全电子商务协议（SET）是基于PKI构建的,购买者、商家和支付网关之间的身份认证靠传递和验证证书来实现,交互过程复杂,计算量大,效率不高,而且还不满足商品原子性和确认发送原子性。基于组合公钥算法和新型认证技术给出一种安全电子支付协议,能够简单地实现交易三方的相互身份认证,克服了SET存在的不足。通过安全性分析和与SET的比较,说明其具有更好的安全性、更高的效率且更容易实现。     

电子商务中数据加密技术浅析

概要介绍了数据加密的一些经典方法,重点介绍了数据加密技术中的DES和RSA算法,并以此为基础讨论电子商务安全技术中的SET协议,对数字签名、数字信封和双重签名进行了讨论.     

基于安全信誉机制的SET协议

针对安全电子支付协议不能刺激商家售后服务质量提高的弊端,文中提出了基于安全信誉机制SET支付协议的改进方案,并对该方案的安全性能进行分析。分析结果表明文中提出的改进方案不仅保持了原有SET协议的安全性,而且提高了商家对客户售后投诉的响应速度,避免了商家通过聘用托的合谋攻击问题,进一步保障了消费者的利益。     

一种高效的按需路由协议安全性改进方法

研究了移动AdHoc网络(MANET)按需路由协议的安全问题,分析了现有的安全改进方案的优缺点.以一种基于椭圆曲线密码体制的高效数字签名算法为基础,提出一种适合按需路由协议的安全性改进方法,对其执行效率和安全性进行了分析,并在QualNet仿真平台下对应用该方法改进的AODV协议进行验证.仿真过程实现了真实的安全算法,针对blackholes和rushing两种常见攻击分别构建了攻击模型,结果表明改进后协议以很小的延时和协议开销代价得到了较高的安全性.     

计算机支持的协同工作中的安全机制

分析和比较了3种可在协同工作中采用的安全机制，包括基于单钥体制、基于公钥体制，以及基于混合方式的安全机制。单钥体制更适合于保密通信，公钥体制更适合于分配单钥体制的密钥，而混合方式则兼有单钥体制及公钥体制的优点，因而更符合协同工作系统对于安全机制的要求。     

Anonymous trust: digital rights management using broadcast encryption

Broadcast encryption is an active area of cryptographic research. Originally defined by Fiat and Naor, broadcast encryption refers to key management schemes that operate when the participating parties do not have a two-way communication path. We contrast that with public-key cryptography: all known public-key protocols require a handshake to establish a common key. We extend the use of broadcast encryption to solve problems that have been traditionally addressed by public-key cryptography: we discuss the xCP cluster protocol, a proposed digital rights management (DRM) system for the home entertainment network, and we illustrate a broadcast-encryption-based content distribution system, which can work without requiring any secrets in the DRM client.     

Verifying the SET registration protocols

Secure electronic transaction (SET) is an immense e-commerce protocol designed to improve the security of credit card purchases. In this paper, we focus on the initial bootstrapping phases of SET, whose objective is the registration of cardholders and merchants with a SET certificate authority. The aim of registration is twofold: getting the approval of the cardholder's or merchant's bank and replacing traditional credit card numbers with electronic credentials that cardholders can present to the merchant so that their privacy is protected. These registration subprotocols present a number of challenges to current formal verification methods. First, they do not assume that each agent knows the public keys of the other agents. Key distribution is one of the protocols' tasks. Second, SET uses complex encryption primitives (digital envelopes) which introduce dependency chains: the loss of one secret key can lead to potentially unlimited losses. Building upon our previous work, we have been able to model and formally verify SETs registration with the inductive method in Isabelle/HOL (T. Nipkow et al., 2002). We have solved its challenges with very general techniques.