期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
不使用Hash和Redundancy函数的认证加密方案 被引量:6
1
作者 张串绒 尹忠海 肖国镇 《电子学报》 EI CAS CSCD 北大核心 2006年第5期874-877,共4页
本文提出了一类新的认证加密方案,这类方案首次将消息可恢复签名和对称加密有机结合.它有两个特点,一个是签名中的承诺值只有预定的接收者才能算出,从而又可将该承诺值用作对称加密的密钥,取得一举两得之功效;另一个是用签名中恢复出的... 本文提出了一类新的认证加密方案,这类方案首次将消息可恢复签名和对称加密有机结合.它有两个特点,一个是签名中的承诺值只有预定的接收者才能算出,从而又可将该承诺值用作对称加密的密钥,取得一举两得之功效;另一个是用签名中恢复出的消息与对称解密得到的消息相比较,实现消息有效性的验证,改变了传统上使用Hash函数或Redundancy函数的验证方法.因此本文提出的新方案是一类不使用Hash函数和Re-dundancy函数的认证加密方案, 展开更多
关键词 码学 消息可恢复签名 认证加 哈希函密 冗余
下载PDF
Randomized Stream Ciphers with Enhanced Security Based on Nonlinear Random Coding
2
作者 Anton Alekseychulk Sergey Gryshakov 《Journal of Mathematics and System Science》 2015年第12期516-522,共7页
We propose a framework for designing randomized stream ciphers with enhanced security. The key attribute of this framework is using of nonlinear bijective mappings or keyless hash functions for random coding. We inves... We propose a framework for designing randomized stream ciphers with enhanced security. The key attribute of this framework is using of nonlinear bijective mappings or keyless hash functions for random coding. We investigate the computational security of the proposed ciphers against chosen-plaintext-chosen-initialization-vector attacks and show that it is based on the hardness of solving some systems of random nonlinear Boolean equations. We also provide guidelines for choosing components to design randomizers for specified ciphers. 展开更多
关键词 Symmetric cryptography randomized stream cipher random coding computational security chosen-plaintext-chosen-initialization-vector attack.
下载PDF
Improving the efficiency of quantum hash function by dense coding of coin operators in discrete-time quantum walk 被引量:1
3
作者 YuGuang Yang YuChen Zhang +3 位作者 Gang Xu XiuBo Chen Yi-Hua Zhou WeiMin Shi 《Science China(Physics,Mechanics & Astronomy)》 SCIE EI CAS CSCD 2018年第3期18-25,共8页
Li et al. first proposed a quantum hash function(QHF) in a quantum-walk architecture. In their scheme, two two-particle interactions, i.e., I interaction and π-phase interaction are introduced and the choice of I or ... Li et al. first proposed a quantum hash function(QHF) in a quantum-walk architecture. In their scheme, two two-particle interactions, i.e., I interaction and π-phase interaction are introduced and the choice of I or π-phase interactions at each iteration depends on a message bit. In this paper, we propose an efficient QHF by dense coding of coin operators in discrete-time quantum walk. Compared with existing QHFs, our protocol has the following advantages: the efficiency of the QHF can be doubled and even more; only one particle is enough and two-particle interactions are unnecessary so that quantum resources are saved. It is a clue to apply the dense coding technique to quantum cryptographic protocols, especially to the applications with restricted quantum resources. 展开更多
关键词 quantum cryptography quantum walk discrete-time quantum walk COLLISION birthday attack
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部