Non-group Cellular Automata Based One Time Password Authentication Scheme in Wireless Networks

  • Jun-Cheol Jeon
  • Kee-Won Kim
  • Kee-Young Yoo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4074)


Wireless network applications mostly authenticate clients with an identity / password or pin. OTP authentication schemes have developed based on time synchronization or one-way hash functions, although they can be trouble some and they have a high computational complexity. The current paper provides secure authentication for low-power wireless devices and other applications requiring authentication that is secure against passive attacks based on replaying captured and reusable passwords. In addition, our scheme highly minimizes the computational and transmission complexity and solves time or sequence synchronization problems by applying non-group cellular automata, based on the non-reversibility and uniqueness of the state configuration.


Cellular Automaton Authentication Scheme Authentication Phase Group Rule Passive Attack 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    IEEE Standard 802.11. Wireless LAN medium access control (MAC) and physical layer (PHY) specification IEEE Draft Standard (1996)Google Scholar
  2. 2.
    Perkins, C.: IP mobility support. Internet Request for Comments 2002 (1996)Google Scholar
  3. 3.
    Menezes, A.J., Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)MATHGoogle Scholar
  4. 4.
    Lamport, L.: Password Authentication with Insecure Communication. Communication of ACM 24, 770–772 (1981)CrossRefGoogle Scholar
  5. 5.
    Haller, N.: The S/KEY One-Time Password System. In: Proc. of the ISOC Symposium on Network and Distributed System Security. University of Illinois Press (1994)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urbana (1966)Google Scholar
  8. 8.
    Jeon, J.C., Yoo, K.Y.: Design of Montgomery Multiplication Architecture based on Programmable Cellular Automata. Computational intelligence 20, 495–502 (2004)CrossRefMathSciNetGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Das, S., Sikdar, B.K., Pal Chaudhuri, P.: Characterization 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)CrossRefGoogle Scholar
  11. 11.
    Koc, C.K., Apohan, A.M.: Inversion of cellular automata iterations. IEE Proc. Comput. Digit. Tech. 144, 279–284 (1997)CrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jun-Cheol Jeon
    • 1
  • Kee-Won Kim
    • 1
  • Kee-Young Yoo
    • 1
  1. 1.Department of Computer Engineering at Kyungpook National UniversityDaeguKorea

Personalised recommendations