Low-complexity authentication scheme based on cellular automata in wireless network

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes an efficient authentication protocol for wireless networks based on group and non-group cellular automata (CA). Most previous protocols employed typical cryptosystems such as symmetric and asymmetric encryptions in spite of their high computation and communication cost. In addition, previous protocols are problematic in that the mobile user copies his/her anonymous ticket and shares it with friends, We propose an efficient and secure authentication protocol which provides a mobile user's anonymity and which has a low computation cost to withstand the above weakness without employing any typical cryptosystems. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jeon, J. C., Kim, K. W., & Yoo, K. Y. (2005). Low-complexity authentication scheme based on cellular automata in wireless network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3794 LNCS, pp. 413–421). https://doi.org/10.1007/11599463_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free