LWO vs. LWE Lattice Problems in Human-Computable Passwords Protocol

Abstract

In this paper, we will compare the results of introducing the well-known Learning with Errors (LWE) and the newly discovered Learning with Options (LWO) lattice problems to a human-computable one-time passwords (OTP) protocol, designed for this purpose. This innovative post-quantum secure challenge-response protocol allows the user to calculate safely many thousands of such passwords, e.g. 6-digit OTP, in about 10 seconds. As a method of human-computer identification, safe also in untrusted systems and environments (Zero Trust), it allows the elimination of any supplementary gadgets/devices or theft-sensitive biometric data used by the Multi-Factor Authentication (MFA), and using only one secret as a universal private key for all obtainable online accounts. Moreover, all these accounts can use OTP calculated from this one secret known only by the user, not the verifier. The secret has the form of an outline similar to a handwritten autograph, designed in invisible ink on the mapping grid. The password generation process requires following such an invisible contour on the challenge matrix created randomly by the verifier and reading values from secret fields to calculate the OTP.