The Letter presents a digital signature scheme based on the discrete logarithm problem which enables any t of the n verifiers to verify the validity of the signature.
The Letter presents a digital signature scheme based on the discrete logarithm problem which enables any t of the n verifiers to verify the validity of the signature.
The complete constraint analysis for the Rarita-Schwinger 3/2 field coupled to an external electromagnetic field is given, showing the parallel between the Lagrangian and Dirac-Bergman algorithms. The analysis confirm...
详细信息
The complete constraint analysis for the Rarita-Schwinger 3/2 field coupled to an external electromagnetic field is given, showing the parallel between the Lagrangian and Dirac-Bergman algorithms. The analysis confirms the connection between the Velo-Zwanzinger (1969) and Johnson-Sudarshan (1961) pathologies, and illustrates that these do not, in fact, arise because the constraint analysis leading to them is incomplete. On the contrary, a new tier of constraints occurs for the critical field values, reducing the pathology to a field-induced change in degrees of freedom.
This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N x N Multistage Cube-Type Network (MCTN) implemented by 2 X 2 switching elements (SEs) ...
详细信息
This paper introduces a simple O(NlogN) sequential algorithm that determines the admissibility of an arbitrary permutation to an N x N Multistage Cube-Type Network (MCTN) implemented by 2 X 2 switching elements (SEs) in contrast to previous O(Nlog(2)N) algorithms. It is proven that the new algorithm is optimal in the sense that any algorithm, based on bit-operations, has to examine at least (N/4)logN different bits among the total NlogN bits in the binary representations of the destinations numbered from 0 through N - 1.
Some two-function minimax theorems are proved. In these results, the staircase and quantitative-topological conditions of both functions involve strictly monotone transformation and mixing of functional values. Conseq...
详细信息
Some two-function minimax theorems are proved. In these results, the staircase and quantitative-topological conditions of both functions involve strictly monotone transformation and mixing of functional values. Consequently, Lin Quan and Kindler＇s minimax theorems are generalized.
A systematic and readily programmable comput.tional method is given to extract the S-function content of any arbitrary symmetric polynomial function. Applications to the derivation of new series and the outer product ...
A systematic and readily programmable comput.tional method is given to extract the S-function content of any arbitrary symmetric polynomial function. Applications to the derivation of new series and the outer product or skew division of an S-function by a series are shown.
Presents a new probabilistic encryption algorithm based on the sci.nce proposed by Jingmin and Kaicheng in 1988. This algorithm utilises the public key concept and recursively encrypts two bits at a time. The message ...
详细信息
Presents a new probabilistic encryption algorithm based on the sci.nce proposed by Jingmin and Kaicheng in 1988. This algorithm utilises the public key concept and recursively encrypts two bits at a time. The message bit expansion is very low and is the same as in their scheme. At the same time, this new scheme is twice as fast.
The authors propose a modified public-key cryptosystem based on the Rabin scheme. It can provide simultaneously both private encryption and digital signatures for network users. In the cases where it provides only enc...
详细信息
The authors propose a modified public-key cryptosystem based on the Rabin scheme. It can provide simultaneously both private encryption and digital signatures for network users. In the cases where it provides only encryption or only digital signatures, the scheme provides that the bit ratio between plaintext and ciphertext is 1:1, i.e. equivalent to that of the RSA scheme.
The long time behavior of solution for Hirota equation with zero order dissipation is studied. The global weak attractor for this system in Hper^k is constructed. And then by exact analysis of the energy equation, it ...
详细信息
The long time behavior of solution for Hirota equation with zero order dissipation is studied. The global weak attractor for this system in Hper^k is constructed. And then by exact analysis of the energy equation, it is shown that the global weak attractor is actually the global strong attractor in Hper^k.
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we deriv...
详细信息
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we derive criteria for linear codes to be algebraic-geometric. In particular, the family of q-ary Hamming codes is investigated, and it is proven that only those with redundancy one or two and the binary [7,4,3] code are algebraic-geometric in this sense. For these codes we explicitly give a curve, rational points and a divisor. It is proven that this triple is in a certain sense unique in the case of the [7,4,3] code.
It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for ail source-destination pairs in each group can be established on an omega network. Based on linea...
详细信息
It is difficult to partition an arbitrary permutation into a minimum number of groups such that conflict-free paths for ail source-destination pairs in each group can be established on an omega network. Based on linear algebra theory, this paper presents an optimal algorithm which solves this problem for the LC class of permutations on a large class of multi-stage networks. This algorithm extends the previous result which deals with the BPC class of permutations on the omega network.
暂无评论