首页> 外文会议>2000 Symposium on Performance Evaluation of Computer and Telecommunication Systems, 2000, Jul 16-20, 2000, Vancouver, British Columbia >AN AUTHENTICATION AND DIGITAL SIGNATURE SCHEME BASED ON BLOCK CIPHER HASHING AND RSA CRYPTOGRAPHY
【24h】

AN AUTHENTICATION AND DIGITAL SIGNATURE SCHEME BASED ON BLOCK CIPHER HASHING AND RSA CRYPTOGRAPHY

机译:基于块密码散列和RSA密码学的认证和数字签名方案

获取原文
获取原文并翻译 | 示例

摘要

This paper introduces a scheme for authentication and digital signature. This scheme is based on block cipher hashing and RSA crypto-systems. At the sending end the message is encrypted, hashed, and signed and at the receiving end it is decrypted and verified. The implementation at both sides starts by computing public and private keys of the RSA crypto-system for the sender and receiver. The block cipher keys are obtained from a key string that is read from a file or given by the keyboard. Then, an initial hash sequence (H_0) is computed from two public number (Ns_0) and (gs_0) published by the sender. This sequence is used in conjunction with a block cipher technique to hash message blocks (M_i) with different lengths to obtain their encryption and hash values (C_i,S_i) respectively. The hash sequence is obtained according to the block length. It is updated from a block to the next. This is done by computing the value rr_i =(S_n~*r_i) mod n_s where (S_n) is the block hash and (r_i) is chosen from the values (l,α,β,γ) based on the concepts of quadratic residues where (α,β,γ) are published by the sender and satisfy certain conditions. The value (rr_i) is encrypted by the private key of the sender (d_s) and public key of the receiver (e_r) according to the RSA principles such that the cipher (RR_i) is obtained and sent along with the message code. The transmitted code of a block (M_i) is {C_i,RR_i,N_i,gs_i}.
机译:本文介绍了一种认证和数字签名方案。该方案基于分组密码散列和RSA密码系统。在发送端,对消息进行加密,散列和签名,在接收端,对消息进行解密和验证。双方的实现始于为发送方和接收方计算RSA密码系统的公钥和私钥。分组密码密钥是从文件或键盘指定的密钥字符串中获取的。然后,根据发送方发布的两个公用号码(Ns_0)和(gs_0)计算初始哈希序列(H_0)。该序列与块密码技术结合使用,对具有不同长度的消息块(M_i)进行哈希处理,分别获取其加密和哈希值(C_i,S_i)。根据块长度获得哈希序列。它从一个块更新到下一个。这是通过计算值rr_i =(S_n〜* r_i)mod n_s来完成的,其中(S_n)是块哈希,并且根据二次余数的概念从值(l,α,β,γ)中选择(r_i)其中(α,β,γ)由发件人发布并满足某些条件。根据RSA原理,值(rr_i)由发送方的私钥(d_s)和接收方的公钥(e_r)加密,以便获得密码(RR_i)并与消息代码一起发送。块(M_i)的发送代码是{C_i,RR_i,N_i,gs_i}。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号