Secure Authentication of WLAN Based on Elliptic Curve Cryptosystem

The security of wireless local area network （WI.AN） becomes a bottleneck for its further applications. At present, many standard organizations and manufacturers of WLAN try to solve this problem. However, owing to the serious secure leak in IEEES02.11 standards, it is impossible to utterly solve the problem by simply adding some remedies. Based on the analysis on the security mechanism of WLAN and the latest techniques of WI.AN security, a solution to WLAN security was presented. The solution makes preparation for the further combination of WLAN and Internet.

An FPGA Implementation of GF(p) Elliptic Curve Cryptographic Coprocessor

A GF(p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrary point on a curve defined over GF(2192?264?1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74 ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.

Data Mining with Privacy Protection Using Precise Elliptical Curve Cryptography

Protecting the privacy of data in the multi-cloud is a crucial task.Data mining is a technique that protects the privacy of individual data while mining those data.The most significant task entails obtaining data from numerous remote databases.Mining algorithms can obtain sensitive information once the data is in the data warehouse.Many traditional algorithms/techniques promise to provide safe data transfer,storing,and retrieving over the cloud platform.These strategies are primarily concerned with protecting the privacy of user data.This study aims to present data mining with privacy protection(DMPP)using precise elliptic curve cryptography(PECC),which builds upon that algebraic elliptic curve infinitefields.This approach enables safe data exchange by utilizing a reliable data consolidation approach entirely reliant on rewritable data concealing techniques.Also,it outperforms data mining in terms of solid privacy procedures while maintaining the quality of the data.Average approximation error,computational cost,anonymizing time,and data loss are considered performance measures.The suggested approach is practical and applicable in real-world situations according to the experimentalfindings.

Scheme for Secure Communication via Information Hiding Based on Key Exchange and Decomposition Protocols

This paper considers a decomposition framework as a mechanism for information hiding for secure communication via open network channels. Two varieties of this framework are provided: one is based on Gaussian arithmetic with complex modulus and another on an elliptic curve modular equation. The proposed algorithm is illustrated in a numerical example.

Security Implementation in WSN with Symmetric and Matrix Mapping on Asymmetric ECC Cryptographic Techniques

As the wireless sensor networks are easily deployable, the volume of sensor applications has been increased widely in various fields of military and commercial areas. In order to attain security on the data exchanged over the network, a hybrid cryptographic mechanism which includes both symmetric and asymmetric cryptographic functions is used. The public key cryptographic ECC security implementation in this paper performs a matrix mapping of data’s at the points on the elliptical curve, which are further encoded using the private symmetric cipher cryptographic algorithm. This security enhancement with the hybrid mechanism of ECC and symmetric cipher cryptographic scheme achieves efficiency in energy conservation of about 7% and 4% compared to the asymmetric and symmetric cipher security implementations in WSN.

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

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.

结合ECC算法的电力监控网络智能接入协议

为了进一步降低电力监控网络遭受攻击的风险,基于ECC公钥加密算法,提出了具有较高安全性能的智能接入协议。通过研究电力监控网络的基本架构和安全体系,总结了电力监控终端所面临的多种攻击方式。并在此基础上,利用ECC公钥加密算法,深度改进适用于电力监控网络的智能接入协议,进而优化协议的加密耗时、解密耗时及安全强度等多项参数。仿真结果表明,与基于RSA算法的协议相比,基于ECC算法的智能接入协议具备更高的安全强度。

空间信息网络公钥管理方案的设计与分析

为保障空间信息网络认证与密钥分发的安全性,本文提出了一种基于椭圆曲线密码系统的公钥管理方案,提供入网认证、密钥协商和密钥更新等功能,实现了认证性、抗重放和前向/后向安全性等多种安全目标。对于卫星间的认证和密钥协商,本方案仅需卫星之间进行3次交互即可完成。通过对方案进行安全性和效率分析,证实了本方案在空间信息网络中的实际可用性以及同现有公钥管理方案相比效率上的优越性。

Privacy Preserving Blockchain Technique to Achieve Secure and Reliable Sharing of IoT Data

In present digital era,an exponential increase in Internet of Things(IoT)devices poses several design issues for business concerning security and privacy.Earlier studies indicate that the blockchain technology is found to be a significant solution to resolve the challenges of data security exist in IoT.In this view,this paper presents a new privacy-preserving Secure Ant Colony optimization with Multi Kernel Support Vector Machine(ACOMKSVM)with Elliptical Curve cryptosystem(ECC)for secure and reliable IoT data sharing.This program uses blockchain to ensure protection and integrity of some data while it has the technology to create secure ACOMKSVM training algorithms in partial views of IoT data,collected from various data providers.Then,ECC is used to create effective and accurate privacy that protects ACOMKSVM secure learning process.In this study,the authors deployed blockchain technique to create a secure and reliable data exchange platform across multiple data providers,where IoT data is encrypted and recorded in a distributed ledger.The security analysis showed that the specific data ensures confidentiality of critical data from each data provider and protects the parameters of the ACOMKSVM model for data analysts.To examine the performance of the proposed method,it is tested against two benchmark dataset such as Breast Cancer Wisconsin Data Set(BCWD)and Heart Disease Data Set(HDD)from UCI AI repository.The simulation outcome indicated that the ACOMKSVM model has outperformed all the compared methods under several aspects.

基于改进ECC的含电动汽车用户负荷信息保护方案

在智能电网的大趋势下,电力公司与用户之间的数据传输交换愈加频繁高效。通信网络经常遭受网络攻击或窃听,为确保用户的用电数据在传输过程中不被恶意篡改,提出一种面向电动汽车用户的信息保护方案。通过改进加法运算和标量乘运算对传统椭圆曲线加密算法(elliptic curve cryptography,ECC)做轻量级优化,克服电网双向互动环境中智能电表资源有限的问题。在此基础上,设计负荷分解算法作为加密方案的检验工具,分解加密后的电力数据。最后,通过仿真算例分析,验证了所提方案的可靠性和安全性。

远程医疗信息系统中的三因素匿名认证协议

远程医疗信息系统为特定的患者提供无缝的医疗信息转移和及时共享,用户认证协议是保障远程医疗信息系统中安全与隐私的重要技术。对Dharminder等基于RSA的授权访问医疗保健服务的认证方案进行了安全性分析,指出该方案无法抵抗密钥泄露伪装攻击、拒绝服务攻击,无法提供前向安全性。对Dharminder等方案进行了改进,提出了一种基于椭圆曲线密码体制的三因素匿名身份认证协议。所提出协议保留了Dharminder等方案的大致流程,将RSA方法替换为椭圆曲线算法和对称加解密算法,并修改了Dharminder等方案认证过程最后步骤的错误。对新提出的协议,利用BAN(Burrows-Abadi-Needham)逻辑进行了形式化安全分析,并使用AVISPA(automated validation of Internet security-sensitive protocols and applications)实现了形式化安全验证。结果表明,提出的协议能够抵抗各种恶意攻击。此外,利用MIRACL(multiprecision integer and rational arithmetic C/C++library)大数运算函数库进行了性能分析,新协议相比于最近的其他方案具备性能优势。

基于量子密码的网络信息安全动态防护方法

由于传统方法在网络信息安全动态防护中应用效果不佳,无法达到预期的防护效果,为此提出了基于量子密码的网络信息安全动态防护方法。首先利用椭圆曲线密码生成网络信息数字签名,初次加密网络信息,其次利用量子密码二次加密网络信息,最后利用数字签名与密钥的交换协议,验证网络通信参与者身份,完成基于量子密码的网络信息安全动态防护。经实验证明,设计方法在网络信息安全动态防护方面具有良好的应用前景。

基于离群点算法的低压窃电行为主动辨识系统

为了更有效地打击窃电行为、提高对窃电行为的辨识能力,基于离群点算法设计了一种低压窃电行为主动辨识系统,用以实现对窃电现象的全面分析.根据距离离群点检测算法对原始数据进行预处理,利用判别规则筛选出离群点,再通过数据采集器直接采集用户侧用电信息,作为判断窃电的依据.基于此,通过管理电力负荷来监控电路数据信息,并引入椭圆曲线密码体制,确保用电信息的安全传输,从而构建低压窃电行为主动辨识系统.实验结果表明:该系统能够准确、安全地获取用电信息,及时辨识窃电行为,增强反窃电能力.

改进的前向安全代理多重盲签名方案

前向安全的代理多重盲签名(Forward-secure proxy blind multi-signature,FSPBMS)同时具备前向安全性、代理多重签名及盲签名的优势。将前向安全特性和代理多重盲签名的基本思想融为一体,提出了一种改进的前向安全代理多重盲签名方案,并给出它的形式化定义和安全性证明。方案在具有前向安全性的基础上保护了消息拥有者的隐私权。证明了FSPBMS方案的正确性,并分析其安全性和复杂度。结果表明了FSPBMS方案具有快速且易于实现的优点。

椭圆曲线加密系统的性能分析

对比其他公钥系统，分析了椭圆曲线加密系统(ECC)的安全性和有效性；说明了ECC与其他公钥加密系统相比，能提供更好的加密强度、更快的执行速度和更小的密钥长度，因此可用较小的开销和时延实现较高的安全性，能满足在带宽、计算能力或存储能力等受限的应用场合。

椭圆曲线密码体制的安全性分析

分析了椭圆曲线密码体制的安全性基础以及常见的攻击方法.考虑到目前还没有有效的方法可以求解有限域上阶中含有大素因子的非超奇异椭圆曲线的离散对数问题,指出高安全性的椭圆曲线密码体制可以靠选择有限域上高安全性的椭圆曲线来获得.给出了适于构建密码体制的椭圆曲线的构造方法。

GF(p)上安全椭圆曲线及其基点的选取

椭圆曲线密码体制的研究与实现已逐渐成为公钥密码体制研究的主流,适用于密码的安全椭圆曲线及其基点的选取,是椭圆曲线密码实现的基础。在该文中,作者讨论了大素数域上的安全椭圆曲线的选取算法和基点的选取,并借助于MIRACL系统利用标准C语言对它们成功实现。

椭圆曲线密码体制

椭圆曲线密码体制目前已引起了信息安全及密码学各界的广泛关注， 从安全性及有效性来看， 这种密码体制有着广阔的应用前景， 是一种可能近期在某些领域取代ＲＳＡ，ＤＳＳ等现存体制的密码（签名）体制， 现已逐渐形成了研究与开发热点． 文中首先对椭圆曲线及其相关知识作了简单介绍， 而后给出了一些典型的椭圆曲线密码体制并较为详细地讨论了这种密码体制的安全性． 文中还以相当的篇幅对适用于密码体制的椭圆曲线的构造方法作了重点介绍， 这是实现椭圆曲线密码体制的关键性问题． 作为一篇综述， 文中反映了椭圆曲线密码体制的历史进展和现状以及当前所面临的理论问题， 体现了该领域目前的最新成就，

一类安全椭圆曲线的选取及其标量乘法的快速计算

安全椭圆曲线的选取和标量乘法的快速计算是有效实现椭圆曲线密码体制的两个主要问题 .本文将二者结合起来考虑给出了一类适合普通PC机实现的安全椭圆曲线 ,并详细给出了选取这类曲线的具体步骤和基于“大步 小步法”思想构造了一种新的计算这类曲线上标量乘法的快速算法 .这类曲线不仅选取容易而且利用本文所提出方法计算其标量乘法时能使所需椭圆曲线运算次数大大减少 .此外 ,选用这类曲线后基域中元素不再需要专门的表示方法 ,各种运算能非常快地得到实现 。