In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and compression functions) which includes some recent constructions [4, 6, 10]. We also propose a secure double length hash function which is as efficient as the insecure concatenated classical hash functions [7].