Informatica

The paper presents a secure and usable variant of the Game Changer Password System, first proposed by McLennan, Manning, and Tuft. Unlike the initial proposal based on inadequately secure Monopoly and Chess, we propose an improved version based on a layered “Battleship” game resilient against brute force and dictionary attacks. Since the initially proposed scheme did not check for the memorability and usability of a layered version, we conducted an experiment on the usability and memorability aspects. Surprisingly, layered passwords are just as memorable as single ones and, with an 80% recall rate, comparable to other graphical password systems. The claim that memorability is the most vital aspect of game-based password systems cannot be disproved. However, the experiment revealed that the usability decreased to such a low level that users felt less inclined to use such a system daily or recommend it to others.

In this paper on basis of the results (Dyomin et al., 2003a) the structure of Shannon information amount in the joint filtering and extrapolation problem of the stochastic processes by continuous‐discrete time memory observations is investigated. For particular class of processes with applying of the general results the problem of optimal transmission over the lag channels is considered and efficiency of filtering and extrapolation receptions under transmission over channels with memory or lag is investigated.

This paper considers an information aspect of the problem of the joint filtering and generalized extrapolation, when the output of observation channels (data transmission) is the realizations set of the processes with continuous and discrete time, which depend on both the current and the past values of unobservable process (useful signal). The relations defining time evolution of Shannon information are obtained. The particular problems of the memory channels information efficiency and optimal transmission of stochastic processes, with applying the general results are considered.