Effective generalized equations of secure hyperelliptic curve digital signature algorithms

You, Lin; Sang, Yongxuan

doi:10.1016/s1005-8885(09)60454-4

Cited by 15 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mobile communication system needs wireless channels to establish secure communication and perform any transactions(G. Rajesh et al, 2018). In this scenario, error correction and secure transmission needs concentration in wireless channels that can be achieved through coding algorithms and ciphering algorithms respectively (Ktari et al, 2017;Martiri & Baxhaku, 2012;Park & Ogunfunmi, 2017;You & Sang, 2010). Presently, GSM uses coding and ciphering for mobile communication systems.…”

Section: Introductionmentioning

confidence: 99%

Digital Signature Algorithm for M-Payment Applications Using Arithmetic Encoding and Factorization Algorithm

David

Kathrine

2021

Journal of Cases on Information Technology

View full text Add to dashboard Cite

Mobile communication systems employ an encoding-encryption model to ensure secure data transmission over the network. This model encodes the data and encrypts it before transmitting it to the receiver's end. A non-trivial operation is performed to generate a strong secret key through which the data is encrypted. To support the security level of this model, arithmetic encoding is performed upon the data before encryption. The encrypted data is hashed using a lightweight hashing algorithm to generate a small and fixed length hash digest to overcome the overheads before it is communicated to the other end. To authorize the message being sent by the sender to the receiver, signature plays an important role. To avoid forging using proxy signature, blind signature, etc., a hybrid scheme is proposed in this article. The mobile communication system is enhanced by introducing the hybrid encode-encrypt-hashing mechanism which stands secure against the plain text attacks, mathematical attacks, and increases confidentiality of the data, security of the key, and thereby enhances the security of the system. In this paper, the design is applied over the mobile payment system which is considered as one of the appreciable mobile services. It proves that the designed security model can ensure swift transactions in a secure way.

show abstract

Section: Introductionmentioning

confidence: 99%

Digital Signature Algorithm for M-Payment Applications Using Arithmetic Encoding and Factorization Algorithm

David

Kathrine

2021

Journal of Cases on Information Technology

View full text Add to dashboard Cite

show abstract

“…The equation that is generally used for digital signature algorithm (DSA) established over hyperelliptic curve (HEC-DSA) are proposed in [24]. Nizamuddin et al [18,19] proposed different singcryptions over HECC and reduced significant computation and communication but [19] lacked forward secrecy and public verifiability and [18] just lacking direct public verifiability, for verification zero knowledge protocol is required.…”

Section: Introductionmentioning

confidence: 99%

An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography

Ashraf

Uddin

Sher

et al. 2014

Multimed Tools Appl

View full text Add to dashboard Cite

The need for Lightweight cryptography is on the rise as transition has been made from wired to wireless network. Wireless systems inherently are insecure and resource (power) constrained, to deal with these constraints, many techniques for symmetric and asymmetric cryptography are defined. One such important developement is Signcryption to achieve message confidentiality, integrity, sender and message authentication, non repudiation, forward secrecy as well as unforgeability,and public verifiability. Since Signcryption combines the signature and encryption therefore the cost is very less in comparison to those schemes based on the signature then encryption. Many signcryption schemes have been proposed based on El-Gamal, RSA and ECC till today. This paper highlights limitations of the existing ECC based schemes using signcryption. These limitations include some missing security aspects as well as high computation power requirement, more communication overhead incurred and large memory requirements. Further it proposes an efficient lightweight signcryption scheme based on HECC which fulfills all the security requirements. The scheme reduced significant amounts of computation, communication costs and Multimed Tools Appl message size as compared to existing signcryption schemes making it the good candidate for environments suffer from the resource limitation problems.

show abstract

Secure lightweight multi‐party key agreement based on hyperelliptic curve Diffie–Hellman for constraint networks

Naresh¹,

Reddi²

2022

Concurrency and Computation

View full text Add to dashboard Cite

With recent developments in hyperelliptic curve cryptographic system (HECC) processing and the proposed work, the myth that HECC is not suited for practical applications in constrained networks is dispelled. This article proposes dynamic authenticated contributory group key agreement (DACGKA) protocol using HEC-DH. The DACGKA is less costly and ideally appropriate for resource-restricted networks such as VANETs, MANETs, and WSNs because of its lesser key sizes and advancements in operational processing. The suggested protocol is implemented across a finite field using an HEC of genus 1 (ECC), genus 2, and genus 3, with promising results, including a significant reduction in key size and exchange overhead, an increase in key safety, and a broader range of applicability. According to a comparison of the proposed approach on different genus curves, HECC over genus 2 with a suitable key length can be applied for memory and power restricted devices to increase data secrecy and system efficiency. Further, HECC can outperform ECC for low-cost, secure group communication applications.As a part of security analysis, first, we proved that each coordinate of HEC-DH secret value is as hard as the entire DH value, and then concrete security proofs based on the HEC-DLP were established. K E Y W O R D Sconstraint networks, group key agreement, hyperelliptic curves, Jacobian, key exchange operations INTRODUCTIONA range of collaborative applications focusing on secure group communication (SGC) is becoming a more active study field in cryptography. It is based on specific distribution and management strategies. All group key agreement (GKA) protocols can be classified into one of two groups. The key is generated by a single group member and distributed to the remaining members in the first. However, it necessitates the involvement of a reliable third party and a safe route between a trustworthy third party and the group members. As a result, key distribution and administration become more complicated. On the other hand, contributory group key agreements (CGKAs) are GKAs in which each member gives a portion of the group key (GK). The focus of this work is on a protocol that falls into the second category.GKA allows SGC across an unprotected, open network by producing the GK. Well-established GKA 1-10 allows participants to agree on a GK in the presence of an alive opponent using signature techniques. To guarantee confidentiality and integrity in the SGC, group members use their authenticated group key with cryptographic techniques.The simplicity and beauty of the 2-party Diffie-Hellman (DH) key agreement 11 has prompted several researchers to apply it to group situations.The majority of GKA protocols are based on DLP. On the other hand, Constraint networks require longer key lengths and higher computational demands. Elliptic curve cryptography (ECC) 12,13 is the natural solution to this problem since, with reduced key sizes, cheaper computational costs, and increased efficiency, it can provide good security.

show abstract

Effective generalized equations of secure hyperelliptic curve digital signature algorithms

Cited by 15 publications

References 17 publications

Digital Signature Algorithm for M-Payment Applications Using Arithmetic Encoding and Factorization Algorithm

Digital Signature Algorithm for M-Payment Applications Using Arithmetic Encoding and Factorization Algorithm

An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography

Secure lightweight multi‐party key agreement based on hyperelliptic curve Diffie–Hellman for constraint networks

Contact Info

Product

Resources

About