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.
This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment). This work was also partially supported by the Brain Korea 21 Project in 2006.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lamport, L.: Password Authentication with Insecure Communication. Communication of ACM 24, 770–772 (1981)
Haller, N.: The S/KEY One-Time Password System. In: Proc. of the ISOC Symposium on Network and Distributed System Security (1994)
Soh, B., Joy, A.: A Novel Web Security Evaluation Model for a One Time Password System. In: Proc. of the IEEE/WIC International Conference on Web Intelligence (2003)
Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Ku, W.C., Chen, S.M.: Weaknesses and Improvement of an Efficient Paword Based Remote User Authentication Scheme Using Smart Cards. IEEE trans. On Consumer electronics 50, 204–207 (2004)
Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urbana, London (1966)
Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)
Seredynski, M., Pienkosz, K., Bouvry, P.: Reversible Cellular Automata Based Encryption. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds.) NPC 2004. LNCS, vol. 3222, pp. 411–418. Springer, Heidelberg (2004)
Das, S., Sikdar, B.K., Pal Chaudhuri, P.: Charaterization of Reachable / Nonreachable Cellular Automata States. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 813–822. Springer, Heidelberg (2004)
Koc, C.K., Apohan, A.M.: Inversion of cellular automata iterations. IEE Proc. Comput. Digit. Tech. 144, 279–284 (1997)
Seredynski, M., Bouvry, P.: Block Encryption Using Reversible Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 785–792. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, JC., Yoo, KY. (2006). Authentication Based on Singular Cellular Automata. In: El Yacoubi, S., Chopard, B., Bandini, S. (eds) Cellular Automata. ACRI 2006. Lecture Notes in Computer Science, vol 4173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861201_70
Download citation
DOI: https://doi.org/10.1007/11861201_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40929-8
Online ISBN: 978-3-540-40932-8
eBook Packages: Computer ScienceComputer Science (R0)