Authentication based on singular cellular automata

One-Time Password (OTP) authentication schemes have been grown based on the time synchronization or one-way hash functions, although they can be trouble some and have a high computational complexity. In order to remedy the problems, the current paper provides a low-complexity authentication scheme which is only composed of logical bitwise operations such as XOR, AND, OR, and NOT. Our scheme highly minimizes the computational and transmission complexity and solves the time or sequence synchronization problems by applying singular CA based on the non-reversibility and uniqueness of the state configuration. Thus, our secure authentication scheme can be effectively used for other applications requiring authentication that is secure against passive attacks based on replaying captured reusable passwords.