首页 | 本学科首页   官方微博 | 高级检索  
     

一种高效的基于 Fiat-Shamir 认证协议的陷门哈希函数
引用本文:高崇志,曹嘉莉. 一种高效的基于 Fiat-Shamir 认证协议的陷门哈希函数[J]. 广州大学学报(自然科学版), 2007, 6(3): 42-46
作者姓名:高崇志  曹嘉莉
作者单位:1. 广州大学,信息与机电工程学院,广东,广州,510006
2. 广东工业大学,应用数学学院,广东,广州,510090
摘    要:陷门哈希函数在2000年由Krawczyk和Rabin正式描述.它是一种带有陷门密钥的哈希函数.陷门密钥的作用在于寻找函数的"碰撞".陷门哈希函数是构造变色龙签名协议和在线/离线签名协议的关键构件.现有的陷门哈希函数在计算函数值或者在寻找碰撞的运算中,均为指数运算复杂度.基于Fiat-Shamir认证协议,文章构造了一种新的陷门哈希函数.新的构造具有乘法运算复杂度,因此,大大提高了陷门哈希函数的效率.

关 键 词:陷门哈希函数  Fiat-Shamir认证协议
文章编号:1671-4229(2007)03-0042-05
修稿时间:2006-11-272007-03-18

An efficient trapdoor hash function based on the Fiat-Shamir identification scheme
GAO Chong-zhi,CAO Jia-li. An efficient trapdoor hash function based on the Fiat-Shamir identification scheme[J]. Journal og Guangzhou University:Natural Science Edition, 2007, 6(3): 42-46
Authors:GAO Chong-zhi  CAO Jia-li
Affiliation:1. School of Information and Electro-Mechanical Eegineering, Guangzhou University, Guangzhou 510006, China; 2. College of Applied Mathematics, Guangdong University of Technology, Guangzhou 510090, China
Abstract:The notion of trapdoor hash function was first formalized in 2000 by Krawczyk and Rabin.It is a type of hash function with a trapdoor key which can be used to find collisions of the function's input.The trapdoor hash function is an essential component to construct chameleon signatures and online/offline signatures.But all of them have exponential complexity either in computing the values of hash functions or in finding collisions of hash functions.Based on the Fiat-Shamir identification scheme, we propose a new construction of trapdoor hash function, which has multiplicative complexity.Therefore, our new construction highly improves the efficiency of trapdoor hash functions.
Keywords:trapdoor hash function  Fiat-Shamir identification scheme
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号