当前位置: X-MOL 学术Int. J. Inf. Technol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Group security using ECC
International Journal of Information Technology Pub Date : 2021-02-28 , DOI: 10.1007/s41870-021-00613-1
Purna Chandra Sethi 1 , Neelima Sahu 2 , Prafulla Kumar Behera 2
Affiliation  

Nowadays security is main issue during transmission of data. Among many cryptographic methods, ECC is the public key asymmetric cryptosystem which provides faster computation over smaller size in comparison to other asymmetric key cryptosystems. In this paper, we have proposed a group security algorithm using the ECC cryptography algorithm. The group security is applied to ECC in terms of m-gram selection called ECC m-gram selection. Due to the group security implementation in terms of common grams, processing speed will be faster in comparison to individual item security. We have also made the comparison study between the traditional ECC algorithm with the proposed group security algorithm using generalized frequent-common gram selection for depicting lesser time requirements to achieve better security for the whole process.



中文翻译:

使用 ECC 的组安全性

如今,安全是数据传输过程中的主要问题。在许多密码方法中,ECC 是公钥非对称密码系统,与其他非对称密钥密码系统相比,它在更小的尺寸上提供更快的计算。在本文中,我们提出了一种使用 ECC 密码算法的组安全算法。组安全性根据称为 ECC m-gram 选择的 m-gram 选择应用于 ECC。由于以普通克为单位的组安全实施,与单个项目安全相比,处理速度将更快。我们还对传统的 ECC 算法与所提出的组安全算法进行​​了比较研究,该算法使用广义的频繁公共 gram 选择来描述更少的时间要求,从而实现整个过程的更好的安全性。

更新日期:2021-03-01
down
wechat
bug