Authentication based on singular cellular automata

Authors:
Jun-Cheol Jeon;Kee-Young Yoo
Affiliations:
Department of Computer Engineering, Kyungpook National University, Daegu, Korea;Department of Computer Engineering, Kyungpook National University, Daegu, Korea
Venue:
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Year:
2006

Citing 6
Cited 0

Password authentication with insecure communication

Communications of the ACM
Handbook of Applied Cryptography

Handbook of Applied Cryptography
A Novel Web Security Evaluation Model for a One-Time-Password System

WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Montgomery exponent architecture based on programmable cellular automata

Mathematics and Computers in Simulation
Weaknesses and improvements of an efficient password based remote user authentication scheme using smart cards

IEEE Transactions on Consumer Electronics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.