A New Public Key Encryption Using Dickson Polynomials Over Finite Field with $$2^{m}$$

Paul, Kamakhya; Singh, Madan Mohan; Goswami, Pinkimani

doi:10.1007/978-3-030-99792-2_45

Cited by 1 publication

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to these characteristics, a group authentication scheme has been proposed to perform the authentication amongst a group of IoT devices managed by different trusted authority has been proposed. In order to facilitate this, Dickson polynomials over a finite field can be utilized for public key cryptosystems 19 . The inherent nature of semigroup property and permutation behaviors exhibited by the Dickson polynomials makes it suitable to design an authentication scheme.…”

Section: Introductionmentioning

confidence: 99%

Dickson polynomial-based secure group authentication scheme for Internet of Things

Syed,

Manickam,

Uddin

et al. 2024

Sci Rep

View full text Add to dashboard Cite

Internet of Things (IoT) paves the way for the modern smart industrial applications and cities. Trusted Authority acts as a sole control in monitoring and maintaining the communications between the IoT devices and the infrastructure. The communication between the IoT devices happens from one trusted entity of an area to the other by way of generating security certificates. Establishing trust by way of generating security certificates for the IoT devices in a smart city application can be of high cost and expensive. In order to facilitate this, a secure group authentication scheme that creates trust amongst a group of IoT devices owned by several entities has been proposed. The majority of proposed authentication techniques are made for individual device authentication and are also utilized for group authentication; nevertheless, a unique solution for group authentication is the Dickson polynomial based secure group authentication scheme. The secret keys used in our proposed authentication technique are generated using the Dickson polynomial, which enables the group to authenticate without generating an excessive amount of network traffic overhead. IoT devices' group authentication has made use of the Dickson polynomial. Blockchain technology is employed to enable secure, efficient, and fast data transfer among the unique IoT devices of each group deployed at different places. Also, the proposed secure group authentication scheme developed based on Dickson polynomials is resistant to replay, man-in-the-middle, tampering, side channel and signature forgeries, impersonation, and ephemeral key secret leakage attacks. In order to accomplish this, we have implemented a hardware-based physically unclonable function. Implementation has been carried using python language and deployed and tested on Blockchain using Ethereum Goerli’s Testnet framework. Performance analysis has been carried out by choosing various benchmarks and found that the proposed framework outperforms its counterparts through various metrics. Different parameters are also utilized to assess the performance of the proposed blockchain framework and shows that it has better performance in terms of computation, communication, storage and latency.

show abstract

Section: Introductionmentioning

confidence: 99%