One-Way Hash Function Based on Cellular Automata

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 215)

Abstract

This paper proposes a secure and efficient one-way hash function based on a linear group and nonlinear non-group cellular automata (CA). The proposed architecture is based on parallelism and logical bitwise operation on CA so that our function forms remarkably simple structure. We show that the proposed one-way hash function based on a CA satisfies the secure properties and produces an excellent quality of message digest in spite of a low construction cost.

Keywords

One-way hash function Cellular automata Confusion Diffusion 

Notes

Acknowledgments

This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (2011-0014977).

References

  1. 1.
    Rivest RL (1991) The MD4 message-digest algorithm. Crypto, LNCS 537:303–311Google Scholar
  2. 2.
    Daemen J, Govaerts R, Vandewalle J (1993) A framework for the design of one-way hash functions including cryptanalysis of Damgard’s one-way function based on a cellular automaton. Proc Asiacrypto’91, LNCS 739:82–96Google Scholar
  3. 3.
    Mihaljecvic M, Zheng Y, Imai H (1999) A family of fast dedicated one-way hash functions based on linear cellular automata over GF(q). IEICE Trans Fundam E82-A(1):40–47Google Scholar
  4. 4.
    Zheng Y, Pieprzyk J, Sebery J (1993) HAVAL—a one-way hashing algorithm with variable length of output. Auscrypt, LNCS 718:83–104Google Scholar
  5. 5.
    Wolfram S (1983) Statistical mechanics of cellular automata. Rev Modern Phys 55:601–644MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Jeon JC, Yoo KY (2008) Montgomery exponent architecture based on programmable cellular automata. Math Comput Simul 79:1189–1196MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Jeon JC (2010) Nonlinear and nongroup cellular automata chaining technique for cryptographic applications. Math Comput Modell 51:995–999MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Damgarrd IB (1989) A Design Principle for Hash Functions. Crypto, LNCS 435:416–442Google Scholar
  9. 9.
    Knuth DE (1997) The art of computer programming, seminumerical algorithms, vol 2, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., ReadingGoogle Scholar
  10. 10.
    Gajski DD (1997) Principles of digital design. Prentice-Hall International Inc., Prentice HallGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Department of Computer EngineeringKumoh National Institute of TechnologyGumiSouth Korea

Personalised recommendations