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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Low-Complexity Authentication Scheme Based on Cellular Automata in Wireless Network
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA