See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/304157084

Analysis and Implementation of a Fast Hash Function Based upon Elliptic

Article · October 2011

CITATIONS READS

0 68

1 author:

Mahdi Nouri
Sharif University of Technology
47 PUBLICATIONS 304 CITATIONS

SEE PROFILE

All content following this page was uploaded by Mahdi Nouri on 02 December 2017.

The user has requested enhancement of the downloaded file.

Analysis and Implementation of a Fast Hash Function

Mahdi Nouri, Sajjad Abazari Aghdam, Mostafa Nourzadeh, Mona Hatami, Somayeh Abazari Aghdam

Abstract— Hash functions are probably the most popular generates the corresponding hash value simultaneously, but the
component employed in cryptographic applications for their well efficiency and security need further improvements [8]. Based
known advantages they provide over digital communication on the Piecewise Linear Chaotic Map (PWLCM) or tent map
links. Hash algorithms bearing the chaos and chaotic behaviors some hash algorithms with higher efficiency are proposed
have attracted many attentions due to their full unpredictability. [9–11]. Furthermore, many methods for predicting chaotic time
The proposed hash algorithm is based on elliptic functions with series are published [12–14]. They all try to prevent attacks that
the employment of chaos and coupled map lattice with variable breaks hash functions by predicting the chaotic series that
parameters. The floating point representation is used to prevent employ the complex chaotic map.
changing a message to different hash values in different
environments. The study results show that the proposed hash Moreover, a one-way function h is a function that for each x in
function has irreversibility, collision resistibility as well as the domain of h it is easy to compute h(x); but for essentially
sensitivity to initial values. It can be implemented in parallel, in all y in the range of h, it is computationally infeasible to find
easy and fast processing for today’s technology. This method is any x such that y = h(x). Hash function is a special kind of
more secure than hash functions based on low-dimensional
one-way function that possesses the following properties [13]:
dissipative chaotic maps and it can be implemented much easier.
• Compression: h maps an input x of an arbitrary finite
Keywords- Hash function; Two-dimensional coupled map length to an output h(x) of fixed length n.
lattices; chaotic behaviors; Variable parameter
• Irreversibility: Given h and an input x make it easy to
I. INTRODUCTION compute h(x). However, it is computationally
With the rapid development of Internet, ever increasing infeasible to find any input which hashes to a specific
security and confidentiality of information transfer in the field output, i.e., to find any pre-image x such that h(x) = y
of electronic communication are required as an essential must when any given y for which a corresponding input is
[2], A hash function is a fundamental building block of not known.
information security and plays an important role in modern • Second pre-image resistance: It is computationally
cryptography. It takes a message as input and produces an infeasible to find some second input which has the
output referred to as a hash value. Generally, hash functions same output as some specific input, i.e., given x, find
can be classified into two categories [1,2]: unkeyed hash a second pre-image (x0 ≠ x) such that h(x) = h(x0).
functions for data integrity, and keyed hash functions usually
known as Message Authentication Code (MAC). Conventional • Sensitivity to input bits: Each output bit is related to
hash functions such as MD5 and SHA are involved with logical input bits. An avalanche property similar to that of
operations or multi-round iterations of some available ciphers. good block ciphers is desirable whereby every input
Although each step of the performed iteration is simple the bit affects every output bit.
number of processing rounds could be enormous even if the
message is very short. Moreover, recent investigations on the It is well known that Elliptic Functions have the following
collision frequencies reveal many undiscovered flaws in the properties: sensitivity to tiny changes for initial conditions and
well-known methods such as MD5, SHA1, and RIPEMD [3– coefficients, mixing, ergonomics, etc [23].
5]. As a result, the research on the design of the secure and
efficient keyed/unkeyed hash functions attracts more and more
attentions. As a ubiquitous phenomenon in nature, chaos is a Recently, spatiotemporal chaos has been magnetizing more
kind of deterministic random-like process found in nonlinear and more interests among researchers in the fields of
dynamic systems. It is employed for data protection due to its mathematics, physics, and engineering. Compared with simple
attractive features such as the sensitivity to initial values, chaotic maps, spatiotemporal chaos has two supplementary
random-like and argotic [6]. Like chaotic cryptosystems, merits for cryptographic purpose. Due to the finite computing
chaos-based hash functions have also interested many precision, chaotic orbits will ultimately become periodic. The
researchers. Based on Baptist's encryption method, Wong period of spatiotemporal chaos is longer than that of simple
developed a scheme combining encryption and hashing [7] chaotic maps [6,12]. In particular, the period of chaotic orbits
Although this method is able to encrypt messages and created by a system with a great number of chaotic coupled

58

View publication stats