Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rou...Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and f-hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.展开更多
This paper is on fuzzy decision theory and information security theory which are mutually independent and engrafted. This paper presents both-branch fuzzy decision and problems on decision encryption-authentication, p...This paper is on fuzzy decision theory and information security theory which are mutually independent and engrafted. This paper presents both-branch fuzzy decision and problems on decision encryption-authentication, puts forward two kinds of both-branch fuzzy decision on X: both-branch fuzzy decision on X having bounded domains X = X+∩X- ={x0}, both-branch fuzzy decision on X havingoverlapping domains X* = X+∩X- = {x_1~*,x_2~*,…,x_1~*}. It presents single branch separate-separate out theoremof both-branch fuzzy decision on X, single branch superposition theorem of both-branch fuzzy decision, exclusive-decompose principle of both-branch fuzzy decision. This paper presents encryption-authentication theorem of decision by engrafting information security theory and technique with both-branch fuzzy decision, and provides encryption-decryption and signature-authentication of both-branch fuzzy decision.展开更多
Montgomery方法是椭圆曲线密码中计算多倍点运算 k P的一种新方法。为减少在椭圆曲线数字签名算法验证过程中需完成的 k P+l Q的计算量 ,该文在分析 Mont-gom ery方法的基础上 ,将计算 k P和计算 l Q的流程结合在一起 ,提出了一种计算...Montgomery方法是椭圆曲线密码中计算多倍点运算 k P的一种新方法。为减少在椭圆曲线数字签名算法验证过程中需完成的 k P+l Q的计算量 ,该文在分析 Mont-gom ery方法的基础上 ,将计算 k P和计算 l Q的流程结合在一起 ,提出了一种计算多倍点运算 k P+l Q的新算法 ,使椭圆曲线数字签名算法中验证签名所需的计算量减少了2 5 %。新算法对改善椭圆曲线密码的实现技术具有一定意义。展开更多
基金the National Natural Science Foundation of China (Grant No.10771073)the Natural Science Foundation of Shandong Province (Grant No.Y2004A04)
文摘Function S-rbugh sets are defined by R-function equivalence class, which have dynamic characteristic. Function S-rough sets have dynamic characteristic, law characteristic and law-hiding characteristic. Function S-rough sets can generate f-hiding law and f-hiding law. By engrafting, crossing, and penetrating between the information security theory and function S-rough sets, the security hiding and the authentication of f-hiding law and f-hiding law are given respectively in this paper. The fusion and share between function S-rough sets and information security theory is a new research direction of the application of information law in information system.
基金This work was supported by the National Natural Science Foundation of China (Grant No. 70271048) the Natural Science Foundation of Shandong Province (Y2001G07).
文摘This paper is on fuzzy decision theory and information security theory which are mutually independent and engrafted. This paper presents both-branch fuzzy decision and problems on decision encryption-authentication, puts forward two kinds of both-branch fuzzy decision on X: both-branch fuzzy decision on X having bounded domains X = X+∩X- ={x0}, both-branch fuzzy decision on X havingoverlapping domains X* = X+∩X- = {x_1~*,x_2~*,…,x_1~*}. It presents single branch separate-separate out theoremof both-branch fuzzy decision on X, single branch superposition theorem of both-branch fuzzy decision, exclusive-decompose principle of both-branch fuzzy decision. This paper presents encryption-authentication theorem of decision by engrafting information security theory and technique with both-branch fuzzy decision, and provides encryption-decryption and signature-authentication of both-branch fuzzy decision.
文摘Montgomery方法是椭圆曲线密码中计算多倍点运算 k P的一种新方法。为减少在椭圆曲线数字签名算法验证过程中需完成的 k P+l Q的计算量 ,该文在分析 Mont-gom ery方法的基础上 ,将计算 k P和计算 l Q的流程结合在一起 ,提出了一种计算多倍点运算 k P+l Q的新算法 ,使椭圆曲线数字签名算法中验证签名所需的计算量减少了2 5 %。新算法对改善椭圆曲线密码的实现技术具有一定意义。
