Construction, Randomness and Security of New Hash Functions Derived from Chaos Mappings

Access this Article



We introduce new hash functions SSI<I>n</I>hash, <I>n</I>=160, 192, 256, 384, 512, 1024 and 2048, whose algorithm is, differently from many other hash functions, consisting of multiplication and shift of multiple-precision integers. The base of algorithm is a repetition of piecewise linear chaos mappings called SSR computations. We first construct a tiny hash function SSRhash which is derived from SSR algorithm directly, and then translate it into all-integer version SSI<I>n</I>hash whose hash value is <I>n</I> bits. After constructing hash functions we verify randomness of hash values generated by SSI<I>n</I>hash by applying the NIST statistical test suite and TestU01. We further discuss the security of our hash function by deriving algebraic equation of high degree.


  • Interdisciplinary Information Sciences

    Interdisciplinary Information Sciences 18(1), 1-11, 2012

    The Editorial Committee of the Interdisciplinary Information Sciences


  • NII Article ID (NAID)
  • Text Lang
  • ISSN
  • Data Source
Page Top