判定不是(k,n)门限方案的简易方法
Saved in:
Main Authors: | 岳殿武, 胡正名 |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
1996-01-01
|
Series: | Tongxin xuebao |
Online Access: | http://www.joconline.com.cn/zh/article/74379263/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
广义(k,n)-门限方案
by: 刘焕平, et al.
Published: (1998-01-01) -
门限视觉密码方案的组构造方法
by: 费如纯, et al.
Published: (2008-01-01) -
没有SDC的(t,n)门限秘密共享方案
by: 周福才, et al.
Published: (2006-01-01) -
基于RSA密码体制(t,n)门限秘密共享方案
by: 庞辽军, et al.
Published: (2005-01-01) -
一个新的具有指定接收者(t,n)门限签名加密方案
by: 曹珍富, et al.
Published: (2003-01-01)