Answers are grounded in this paper and cite their sources.
The public keys in a public key cryptosystem need not to be protected for confidentiality, however, it is important to confirm their legality. In this paper, motivated by Meshram et al. (2017), we develop a simple novel key authentication scheme for public key cryptosystems whose security rely on discrete logarithm problem in group ring. The advantage of our novel scheme is that it requires no authority unlike regular certificate based techniques. In our scheme, we consider a pair of secret key and password as the certificate of public key. We show that the security of our scheme relies on discrete logarithm problem in group ring (DLPGR). The DLPGR is an NP problem for which no known quantum algorithm exists that solves it in polynomial time.
No takes yet. Share an insight, caveat, or question.
Kumar et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: