摘要
分析和对比了哈希函数在信息安全、数据结构和数据挖掘等领域的应用，找出了它在不同领域里所呈现的特点和要求：信息安全领域里的单向性、随机性和无碰撞性，数据结构里尽可能减少碰撞、但不能避免碰撞，而数据挖掘里用于任务分配时则要求均匀碰撞。这为相关课程的教学提供了一些有益的参考，便于澄清一些模糊、混淆的认识。
The application of hash function has been analyzed and compared in the areas of information security, data structure and data mining. It is found that the characteristics and requirements in different areas are not similar. In the field of information security, one-way, randomness and collision-free is stressed. Yet collisions could not be avoided and are just supposed to be min-imized in data structure. In addition, uniform collisions are required for a task assignment in data mining. This will help teachers and students clarify some misunderstanding in the related courses.
作者
何山
何文胜
唐中林
HE Shan,HE Wen-sheng,TANG Zhong-lin （School of Economics and Management, Southwest Petroleum University, Chengdu 610500, China）
出处
《电脑知识与技术》
2013年第12期7741-7742,7745,共3页
Computer Knowledge and Technology
基金
西南石油大学校级教改项目“信息系统安全（双语）”（XUTPl301109）
关键词
哈希函数
信息安全
数据结构
数据挖掘
hash function
information security
data structure
data mining
