IMPROVED THE EXECUTION SPEED OF ECDSA OVER GF(2N) ALGORITHM FOR CONCURRENT COMPUTATION

A. SAKTHIVEL; R. NEDUNCHEZHIAN

首页> 外文期刊>Journal of Theoretical and Applied Information Technology >IMPROVED THE EXECUTION SPEED OF ECDSA OVER GF(2N) ALGORITHM FOR CONCURRENT COMPUTATION

【24h】

IMPROVED THE EXECUTION SPEED OF ECDSA OVER GF(2N) ALGORITHM FOR CONCURRENT COMPUTATION

机译：改进了用于并行计算的GF（2N）算法上ECDSA的执行速度

获取原文

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Recently Elliptic Curve Digital Signature Standard (ECDSA) is used for smart card applications and financial transaction applications, because it needs less memory space, low bandwidth, limited power, reuse and portability. So it is more suitable for wire

机译：最近，椭圆曲线数字签名标准（ECDSA）用于智能卡应用程序和金融交易应用程序，因为它需要较少的存储空间，低带宽，有限的功率，重用性和可移植性。所以比较适合电线

著录项

来源
《Journal of Theoretical and Applied Information Technology》 |2013年第1期|共页
作者
A. SAKTHIVEL; R. NEDUNCHEZHIAN;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. IMPROVED THE EXECUTION SPEED OF ECDSA OVER GF(2N) ALGORITHM FOR CONCURRENT COMPUTATION [J] . A. SAKTHIVEL, R. NEDUNCHEZHIAN Journal of Theoretical and Applied Information Technology . 2013,第1期

机译：改进了用于并行计算的GF（2N）算法上ECDSA的执行速度
2. Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem overGF(2n) [J] . KenliLi, ShutingZou, JinXv BioMed research international . 2008,第2期

机译：基于DNA的计算的快速并行分子算法：求解overGF（2n）的椭圆曲线离散对数问题
3. Using the GRID to improve the computation speed of electrical impedance tomography (EIT) reconstruction algorithms [J] . Fritschy J, Horesh L, Holder DS, Physiological measurement . 2005,第2期

机译：使用GRID来提高电阻抗层析成像（EIT）重建算法的计算速度
4. Improved generalizations of the Karatsuba algorithm in GF(2n) [C] . Nursalman Muhamad, Sasongko Arif, Kurniawan Yusuf, International Conference on Advanced Informatics: Concept, Theory and Application . 2014

机译：改进了GF中的Karatsuba算法的概括（2 n ）
5. New hardware algorithms and designs for Montgomery modular inverse computation in Galois fields GF(p) and GF(2n). [D] . Gutub, Adnan Abdul-Aziz. 2003

机译：Galois场GF（p）和GF（2n）中蒙哥马利模块化逆计算的新硬件算法和设计。
6. Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n) [O] . Kenli Li, Shuting Zou, Jin Xv 2008

机译：基于DNA的快速并行分子算法：求解GF（2n）上的椭圆曲线离散对数问题
7. New Hardware Algorithms and Designs for Montgomery Modular Inverse Computation in Galois Fields GF(p) and GF(2n) [O] . Gutub Adnan 2002

机译：伽罗瓦域GF（p）和GF（2n）中蒙哥马利模块化逆算法的新硬件算法和设计

IMPROVED THE EXECUTION SPEED OF ECDSA OVER GF(2N) ALGORITHM FOR CONCURRENT COMPUTATION

摘要

著录项

相似文献

相关主题

期刊订阅