Paper 2020/226
Multivariate Polynomial and Exponential Mappings based Password Authentication Protocol
Meher Krishna Duggirala, Ravi Duggirala, and Krishna Subba Rao Pulugurtha
Abstract
In this paper, a multivariate polynomial and exponential mappings based password protocol is presented. The method can be utilized in public domains. The key generator generates a vector, intended to be used as a password by the authentication protocol subsequently, such that when the vector is substituted and evaluated in certain fixed multivariate polynomials -- that may be listed in a public domain -- the value $0$ is found as a result of proper authentication. The public domain in this context could be internal to a large, and possibly distributed, system. The key generator can take hints from the owner of the password to generate the particular zero vector to suit the user. It may take into consideration biometric and any other user specific information at the time of key generation. The information collected by the key generator can be saved by the owner of the password for its possible retrieval upon requisition by the user, during the period of its validity, in case it is forgotten by the user.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Multivariate polynomialsExponential mappingsGroebner basisZeros of mappingsUser authentication
- Contact author(s)
- ravi @ gvpce ac in
- History
- 2020-02-21: received
- Short URL
- https://ia.cr/2020/226
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/226,
author = {Meher Krishna Duggirala and Ravi Duggirala and Krishna Subba Rao Pulugurtha},
title = {Multivariate Polynomial and Exponential Mappings based Password Authentication Protocol},
howpublished = {Cryptology ePrint Archive, Paper 2020/226},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/226}},
url = {https://eprint.iacr.org/2020/226}
}
