Showing papers on "Rainbow table published in 1995"
TL;DR: This paper proposes a password authentication scheme where the system keeps polynomials instead of a table for verification, and it is shown that the system is vulnerable to keep such a table.
33 citations
TL;DR: Two password authentication schemes, based on triangle and straight line encoding, respectively, are proposed, which are suitable for real-time applications and do not need to reconstruct any term of the existing key table when a new user is inserted into the system.
Abstract: In this paper, two password authentication schemes, based on triangle and straight line encoding, respectively, are proposed. In our schemes, a one-way function and a strong cryptographic operation such as DES (data encryption standard) are adopted. Besides, in each scheme, the system only needs to store a secret key pair, and each user can select his own password freely. Instead of storing a password verification table inside the computer system, both methods proposed only have to store a corresponding table of identities, which is used by the computer system for validating the submitted passwords. Owing to these two schemes quickly and efficiently responding to any log-in attempt, they are suitable for real-time applications. Furthermore, in each scheme, the system does not need to reconstruct any term of the existing key table when a new user is inserted into the system. Thus, these two schemes are suitable for practical implementation.
14 citations
TL;DR: A password authentication scheme based on a unit circle encoding that can quickly and efficiently respond to any log-in attempt, and is suitable for real-time applications is proposed.
Abstract: In this paper, a password authentication scheme based on a unit circle encoding is proposed. In our scheme, a one-way function and a cryptographic operation such as DES (data encryption standard) are adopted. Besides, in our scheme, the system only need to store a master secret key, and each user can select his own password freely. Instead of storing a password verification table inside the computer system, our method only has to store a corresponding table of identities, which is used by the computer system for validating the submitted passwords. Owing to this scheme the system can quickly and efficiently respond to any log-in attempt, and is suitable for real-time applications. Furthermore, in our scheme, the system does not need to reconstruct any term of the existing key table, when a new user is inserted into the system. Thus, our scheme is suitable for practical implementation.
8 citations
TL;DR: This research note shows that Laih et al.'s scheme is breakable, and a possible attack on Lai h, Harn and Huang's scheme is discussed.
3 citations