One-time password tree

Year, pages: 2004, 49 - 55

We consider the problem of one-time password scheme in systems with limited resources (memory, computation time, number of recordings to memory) like smart cards. We show that using the tree of passwords, recordings to memory can be omitted (with exception of the counter). The number of authorizations is exponential in relation to maximal computation time.

Kozioł, A. 2004. One-time password tree. In Tatra Mountains Mathematical Publications, vol. 29, no.3, pp. 49-55. 1210-3195.

Kozioł, A. (2004). One-time password tree. Tatra Mountains Mathematical Publications, 29(3), 49-55. 1210-3195.