On the Selection of Random Numbers in the EIGamal Algorithm

The EIGamal algorithm, which can be used for both signature and encryption, is of importance in public-key cryptosystems. However, there has arisen an issue that different criteria of selecting a random number are used for the same algorithm. In the aspects of the sufficiency, necessity, security and computational overhead of parameter selection, this paper analyzes these criteria in a comparative manner and points out the insecurities in some textbook cryptographic schemes. Meanwhile, in order to enhance security a novel generalization of the EIGamal signature scheme is made by expanding the range of selecting random numbers at an acceptable cost of additional computation, and its feasibility is demonstrated.     

基于Harn签名方案的远距离通行字认证方案

本文首先利用Ｓｈａｍｉｒ的秘密共享方法将Ｃｈａｎｇ－Ｌｉａｏ通行字认证方案转变成（ｔ，ｎ）共享认证方案，从而使ｎ个认证者中任意ｔ个人能够认证通行字的正确性。其次提出了一个基于Ｈａｒｎ数字签名方案的远距离通行字认证方案。     

Knot signature functions are independent

A Seifert matrix is a square integral matrix satisfying

To such a matrix and unit complex number there corresponds a signature,

Let denote the set of unit complex numbers with positive imaginary part. We show that is linearly independent, viewed as a set of functions on the set of all Seifert matrices.

If is metabolic, then unless is a root of the Alexander polynomial, . Let denote the set of all unit roots of all Alexander polynomials with positive imaginary part. We show that is linearly independent when viewed as a set of functions on the set of all metabolic Seifert matrices.

To each knot one can associate a Seifert matrix , and induces a knot invariant. Topological applications of our results include a proof that the set of functions is linearly independent on the set of all knots and that the set of two-sided averaged signature functions, , forms a linearly independent set of homomorphisms on the knot concordance group. Also, if is the root of some Alexander polynomial, then there is a slice knot whose signature function is nontrivial only at and . We demonstrate that the results extend to the higher-dimensional setting.

     

Time,Complex Systems,and Public Policy: A Theoretical Foundation for Adaptive Policy Making

Nonlinear Dynamics, Psychology, and Life Sciences - Can public policy development and implementation be improved by closely tracking and coordinating its timing with that of the regulated sector?...     

一种新的无可信中心的门限签名体制

文章基于双线性对提出了一种新的无可信中心的门限签名体制。在多数环境中一个可信中心并不存在,所以没有可信中心的门限签名体制更受青睐,并且该协议几乎满足一个良好的门限签名体制的所有要求。该协议简单可行,在电子商务和电子投票中比其他协议更实用。     

XML加密技术与XML签名技术的研究

基于XML数据安全的新要求，国际标准化组织提出了一系列XML安全规范研究。分析了目前XML安全技术的两个最为核心的技术：XML加密技术和XML签名技术，并具体研究了XML加密和XML签名技术的目标、语法以及它们的分类。     

基于特征不变矩的签名鉴别方案

脱机手写签名鉴别的主要困难在于有效特征的提取,因此本文主要围绕提取能反映签名本质的特征进行了相关研究。在具体解决签名鉴别时,一方面要考虑签名的静态特征,另一方面寻找动态特征。重点研究了静态特征。提取静态特征时,利用伪Zernike矩的尺度及位移不变性,计算签名图像的0~10阶伪Zernike矩来组成特征向量。在此基础上,对基于上述两种不同特征的加权欧氏距离分类器进行性能比较,并找到了一个有效的数据融合方案。     

数据通信中常用的安全加密技术

基于对称密钥加密、公开密钥加密以及安全单向散列函数等基本安全技术和算法,数据通信通常采用以下几种安全加密技术来解决其应用中遇到的安全问题:采用数字信封技术保证数据的传输安全;采用数字签名和双重数字签名技术进行身份认证并同时保证数据的完整性、完成防抵赖;采用口令字技术或公开密钥技术进行身份认证.     

Investigation into the rotational bands of ~(185)Pt with the particle-rotor model

Theoretical calculations have been performed for the ν9/2+[624](i13/2) and ν7/2-[503](f7/2) bands of 185Pt in the framework of particle-rotor model. The band properties of signature splitting and configuration mixing have been analyzed. The level energy and signature splitting before the band crossing can be well interpreted by introducing triaxiality. The positive-parity yrast band is pro posed to be dominated by the ν9/2+[624](i13/2) component, while the negative-parity band shows strong mixing of ν7/2-[5...