| 注册
首页|期刊导航|计算机应用研究|基于hash函数的一次群签名模型

基于hash函数的一次群签名模型

高晓东 杨亚涛 李子臣

计算机应用研究2012,Vol.29Issue(7):2665-2667,3.
计算机应用研究2012,Vol.29Issue(7):2665-2667,3.DOI:10.3969/j.issn.1001-3695.2012.07.072

基于hash函数的一次群签名模型

One-time group signature model based on hash function

高晓东 1杨亚涛 2李子臣2

作者信息

  • 1. 西安电子科技大学通信工程学院,西安710071
  • 2. 北京电子科技学院,北京100070
  • 折叠

摘要

Abstract

Since traditional digital signature based on the big integer prime decomposition and discrete logarithm problem can't resist attack in quantum computing,this paper proposed a signature model based on the hash function. The security of this model is based on the hash function is unidirectional. Its key generation, signature and verification are completed by hash computing. This model could help achieve higher efficiency, and resist attack in quantum computing effectively. Proved by ex-periments, its efficiency is 21 times higher than ECC (a key length for 224), and can reach 102 limes higher than RSA-2048.

关键词

量子攻击/一次群签名/单向函数/hash运算

Key words

quantum attacked/ one-time group signature/ one-way function/ hash computing

分类

信息技术与安全科学

引用本文复制引用

高晓东,杨亚涛,李子臣..基于hash函数的一次群签名模型[J].计算机应用研究,2012,29(7):2665-2667,3.

基金项目

国家自然科学基金资助项目(61070219) (61070219)

北京电子科技学院信息安全重点实验室资助项目 ()

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文