Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.