This paper defines a generalized SHA algorithm based on the SHA family rules. The proposed algorithm accepts arbitrary length message as input to generate message digest with the required length. It contains the initial values, constant values, padding, parsing, as well as the generalized main body. Further, the proposed algorithm solves the Length-of-the-Hash-Value (LHV) problem that occurs when SHA-r cannot be expressed as r = mn uniquely.