New Hash Function and Braid Subgroups

2015 INTERNATIONAL CONFERENCE ON SOFTWARE, MULTIMEDIA AND COMMUNICATION ENGINEERING (SMCE 2015)(2015)

引用 23|浏览4
暂无评分
摘要
Based on the generators of Mihailova subgroups of a braid group where the Mihailova subgroups enjoy unsolvable subgroup membership problem, we propose a new hash function by employing AES algorithm. We show that the proposed hash function is a one-way and collision free function. We also show that this new hash function can be applied for data integration, message or entity authentication, and digital signature.
更多
查看译文
关键词
Braid group, Mihailova subgroup, Subgroup membership problem, AES, One-way function, Collision resistance function
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要