
Message integrity and authenticity is crucial with ever increasing network communication. Cryptographic Hash Functions are main building block of message integrity. Many types of hash functions are being used and developed. In this paper, a new keyed hash function is being proposed and described. This proposed algorithm produces a hash code of 128 bits for an arbitrary length of input. The function uses a key during hashing, so that any intruder who does not know the key cannot forge the hash code, and, thus it satisfies the purpose of security, authentication and integrity for a message in network. The paper discusses the algorithm on the function design, its security aspects and implementation details.
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
