To　check　the　integrity　of　an　IP　address　efficiently　and　economically,　the　authors　propose　a　new　non-Merkle-Damgard　structural　hash　function　which　is　based　on　a　multivariate　permutation　problem　and　an　anomalous　subset　product　problem　to　which　no　subexponential　time　solutions　are　found　so　far.　It　includes　an　initialization　algorithm　and　a　compression　algorithm,　and　converts　a　short　message　of　n　bits　treated　as　only　a　block　into　a　digest　of　m　bits,　where　80　＜=　m　＜=　232　and　80　＜=　m　＜=　n　＜=　4096.　Analysis　shows　that　the　new　hash　is　one-way,　weakly　collision-free,　and　strongly　collision-free　along　with　a　proof,　and　its　security　against　existent　attacks　such　as　birthday　attack　and　meet-in-the-middle　attack　is　to　O(2(m)).　In　comparison　with　the　Chaum-Heijst-Pfitzmann　hash　based　on　a　discrete　logarithm　problem,　the　new　hash　is　lightweight,　and　opens　a　door　to　convenience　for　utilization　of　lightweight　digital　signing　schemes.