| 注册
首页|期刊导航|计算机工程|基于 RSA 与剩余定理的多秘密共享方案

基于 RSA 与剩余定理的多秘密共享方案

史恰 杜伟章

计算机工程2011,Vol.37Issue(2):141-142,2.
计算机工程2011,Vol.37Issue(2):141-142,2.DOI:10.3969/j.issn.1000-3428.2011.02.048

基于 RSA 与剩余定理的多秘密共享方案

Multi-secret Sharing Scheme Based on RSA and Remainder Theorem

史恰 1杜伟章1

作者信息

  • 1. 长沙理工大学计算机与通信工程学院,长沙,410114
  • 折叠

摘要

Abstract

This paper proposes a multi-secret sharing scheme, where the knowledge of Chinese remainder theorem is used.Each participant can select his own secret sharing.In the scheme, the RSA cryptosystem is used, and the system has a wide application in the cryptography field.The distributor of the system can ensure that each participant selects different secret sharing, and it is for the purpose that the secret share can progress smoothly.The security of the scheme is based on the difficulty of large integer number factorization.It is a useful multi-secret sharing scheme.

关键词

中国剩余定理/RSA 密码体制/多秘密共享

Key words

Chinese remainder theorem/ RSA cryptosystem/ multi-secret sharing

分类

信息技术与安全科学

引用本文复制引用

史恰,杜伟章..基于 RSA 与剩余定理的多秘密共享方案[J].计算机工程,2011,37(2):141-142,2.

计算机工程

OACSCDCSTPCD

1000-3428

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