Empirical Study of a Key Authentication Scheme in Public Key Cryptography
Kumaraswamy Palleboina
Abstract
Open-access reader
Kumaraswamy Palleboina
Abstract
Open-access reader
Public key cryptosystem plays major role in many online business applications.In public key cryptosystem, public key need not be protected for confidentiality, but the authenticity of public key is needed.Earlier, many key authentication schemes are developed based on discrete logarithms.Each scheme has its own drawbacks.We developed a secure key authentication scheme based on discrete logarithms to avoid the drawbacks of earlier schemes.In this paper, we illustrate the empirical study to show the experimental proof of our scheme.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Public key cryptosystem plays major role in many online business applications.In public key cryptosystem, public key need not be protected for confidentiality, but the authenticity of public key is needed.Earlier, many key authentication schemes are developed based on discrete logarithms.Each scheme has its own drawbacks.We developed a secure key authentication scheme based on discrete logarithms to avoid the drawbacks of earlier schemes.In this paper, we illustrate the empirical study to show the experimental proof of our scheme.
Key concepts: Key (lock), Computer science, Public-key cryptography, Computer security, Scheme (mathematics), Authentication (law), Cryptography, Mathematics