In this paper we present an improved version of HF-hash, viz., GB-hash : Hash
Functions Using Groebner Basis. In case of HF-hash, the compression function
consists of 32 polynomials with 64 variables which were taken from the first 32
polynomials of hidden field equations challenge-1 by forcing last 16 variables
as 0.
In this article, we find the equations defining the Rees algebra for certain
Monomial Curves explicitly and use them to prove that the blowup scheme is not
smooth. This proves a conjecture of Francia in affirmative, which says that a
dimension one prime in a regular local ring is a complete intersection if it
has a smooth blowup.