可证安全的常数长度无证书聚合签名方案

针对无证书密码体制可以解决基于身份的公钥密码体制的密钥托管问题和基于证书的公钥密码体制的公钥认证问题,构造了无证书聚合签名的可证明安全模型,并提出了一个具体的签名长度与人数无关的聚合签名方案.基于计算性Diffie Hellman难题,在随机预言模型下,证明了提出的方案可以抵抗适应性选择消息和身份的存在性伪造攻击.     

对一种无证书聚合签名方案的攻击与改进

无证书聚合签名方案能够有效提高签名验证阶段的效率,其存在两类攻击,在类型I攻击中,攻击者不知道系统主密钥和用户的部分私钥,但能替换用户的公钥;在类型II攻击中,攻击者知道系统主密钥和用户的部分私钥,但不能替换用户公钥.无证书聚合签名方案只有同时能够抵抗这两类攻击,才能说明方案是安全的.大多数无证书聚合签名方案在随机预言机模型下证明了其安全性,但是有些方案不能抵抗类型II攻击.以陈提出的无证书聚合签名方案为例,给出一种适用于一些无证书聚合签名方案的对应攻击方法.攻击者在拥有系统主密钥的情况下,根据两个有效的签名可以伪造出任意一个消息的有效签名.在此基础上提出了一个改进的无证书聚合签名方案,并在随机预言机模型下证明了新方案针对类型I攻击和类型II类攻击是存在性不可伪造的.     

Lüroth Expansion Digits and Maclaurin's Inequality

It is well known that for almost all real number x, the geometric mean of the first n digits d_i(x) in the Lüroth expansion of x converges to a number K_0 as n→∞. On the other hand, for almost all x, the arithmetric mean of the first n Lüroth expansion digits d_i(x) approaches infinity as n→∞. There is a sequence of refinements of the AM-GM inequality, Maclaurin's inequalities, relating the 1/k-th powers of the k-th elementary symmetric means of n numbers for 1≤k≤n. In this paper, we investigate what happens to the means of Lüroth expansion digits in the limit as one moves f(n) steps away from either extreme. We prove sufficient conditions on f(n) to ensure divergence when one moves away from the arithmetic mean and convergence when one moves f(n) steps away from geometric mean.     

Properties of a class of groups on <Emphasis Type="Italic">Z</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript>

In this paper, we obtain the factorization of direct production and order of group GL(n, Z _m ) in a simple method. Then we generalize some properties of GL(2, Z _p ) proposed by Huppert, and prove that the group \(GL\left( {2,{Z_{{z^\lambda }}}} \right)\) is solvable. We also prove that group GL(n, Z _p ) is solvable if and only if GL(n, Z _p ) is solvable, and list the generators of groups GL(n, Z _p ) and SL(n, Z _p ). At last, we prove that PSL(2, Z _p )(p > 3) and PSL(n, Z _p )(n > 3) are simple.     

Binding number,minimum degree and bipancyclism in bipartite graphs

Let G =(V_1,V_2,E) be a balanced bipartite graph with2 n vertices.The bipartite binding number of G,denoted by B(G),is defined to be n if G =K_n and min i∈{1,2}|N(S)|n min |N(S)|/|S|otherwise.We call G bipancyclic if it contains a cycle of every even length m for 4 ≤ m ≤ 2n.A theorem showed that if G is a balanced bipartite graph with 2n vertices,B(G) 3 / 2 and n 139,then G is bipancyclic.This paper generalizes the conclusion as follows:Let 0 c 3 / 2 and G be a 2-colmected balanced bipartite graph with 2n(n is large enough) vertices such that B(G) c and δ(G)(2-c)n/(3-c)+2/3.Then G is bipancyclic.     

Gracefulness of several unconnected graphs with wheel

In the paper, we study the gracefulness of several unconnected graphs related to wheel. For natural number p ≥1,t ≥1, let n =2t +3, 2t +4, which proved W_n∪K_(p,t)~(1)∪K_(p,t)~(2) is graceful; for p ≥1, t ≥1,let n=2t+3,2t+4, then W_(n,2n+1)∪K_(p,t)~(1)∪K_(p,t)~(2) is graceful and for m≥1,r ≥1, let n =2m +5, W_(n,2n+1) ∪( C_3∨K m) U St( r)is graceful.     

A generalized funk’s section theorem for measures

If L is a star body in R~n whose central(n-i)-slices have the same(n-i)-dimensional measure μ_(n-i)(with appropriate density)as the central(n-i)-slices of an origin-symmetric star body K,then the corresponding n-dimensional measures μ_n of K and L satisfy μ_n(K)≤μ_n(L).This extends a generalized Funk’s section theorem for volumes to that for measures.     

Fault-tolerant cycles embedding in folded hypercubes

The generalized conditional fault-tolerant embedding is investigated, in which the n-dimensional folded hypercube networks(denoted by FQ_n) acts as the host graph, and the longest fault-free cycle represents the guest graph. Under the conditions looser than that of previous works, it is shown that FQ_n has a cycle with length at least 2~n-2︱F_v︱ when the number of faulty vertices and non-critical edges is at most 2n-4; where ︱F_v︱ is the number of faulty vertices. It provides further theoretical evidence for the fact that FQ_n has excellent node-fault-tolerance and edge-fault-tolerance when used as a topology of large scale computer networks.     

An algorithm for the spectral immunity of binary sequence with period 2<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

To resist the fast algebraic attack and fast selective discrete Fourier transform attacks, spectral immunity of a sequence or a Boolean function was proposed. At the same time, an algorithm to compute the spectral immunity of the binary sequence with odd period N was presented, here N is a factor of 2 ⁿ ? 1, where n is an integer. The case is more complicated when the period is even. In this paper, we compute linear complexity of every orthogonal sequence of a given sequence using Chan-Games algorithm and k - error linear complexity algorithm. Then, an algorithm for spectral immunity of binary sequence with period N = 2 ⁿ is obtained. Furthermore, the time complexity of this algorithm is proved to be O(n).     

<Emphasis Type="Italic">a</Emphasis>-Wythoff’s game with <Emphasis Type="Italic">n</Emphasis> players

Letting a = 1 in a- Wythoff’s game introduced by Fraenkel yields Wythoff’s game which is a well-known 2-player impartial combinatorial game introduced by Wythoff in 1907. A method of solving n-player impartial games was presented by Krawec in 2012. In this paper, we employ Krawec’s function to analyze n > 2 players a-Wythoff’s game and obtain game values for all a 1. The results obtained cover n-player Wythoff’s game, a special case 1-Wythoff’s game.     

Vertex disjoint cycles in intersection graphs of bases of matroids

The intersection graph of bases of a matroid M=(E, B) is a graph G=G~I(M) with vertex set V(G) and edge set E(G) such that V(G)=B(M) and E(G)={BB′:|B∩B′|≠0, B, B′∈B(M), where the same notation is used for the vertices of G and the bases of M. Suppose that|V(G~I(M))| =n and k_1+k_2+…+k_p=n, where k_i is an integer, i=1, 2,…, p. In this paper, we prove that there is a partition of V(G~I(M)) into p parts V_1 , V_2,…, V_p such that |V_i| =k_i and the subgraph H_i induced by V_i contains a k_i-cycle when k_i ≥3, H_i is isomorphic to K_2 when k_i =2 and H_i is a single point when k_i =1.     

Multi-pattern matching algorithm with wildcards based on bit-parallelism

Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set{p~1,---,p~k}in a given text t. If the percentage of wildcards in pattern set is not high,this problem can be solved using finite automata. We introduce a multi-pattern matching algorithm with a fixed number of wildcards to overcome the high percentage of the occurrence of wildcards in patterns. In our proposed method,patterns are matched as bit patterns using a sliding window approach. The window is a bit window that slides along the given text,matching against stored bit patterns. Matching process is executed using bit wise operations. The experimental results demonstrate that the percentage of wildcard occurrence does not affect the proposed algorithm's performance and the proposed algorithm is more efficient than the algorithms based on the fast Fourier transform. The proposed algorithm is simple to implement and runs efficiently in O(n+d(n/σ)(m/w))time,where n is text length,d is symbol distribution over k patterns,m is pattern length,and σ is alphabet size.     

The periodic solution for a kind odd order delay differential equation

In this paper, we use the coincidence degree theory to research the odd order delay differential equation a(t)χ(2n+1)(t)+b(t)χ(t)+g(t,-τ(t)))=p(t), and we obtain the sufficient conditions for the existence of periodic solutions, which improves and generalizes some related results in the literatures.     

An anonymous authentication scheme withstanding the conspiracy attack

A novel anonymous authentication scheme is proposed based on the ring signature. In the scheme, the private key and the the freely chosen anonymity set are used to achieve anonymous authentication. In terms of the threshold sharing, a group of t members jointly implement threshold tracking. In order to improve the security of tracking, message recovery equation is used to verify and recover data leaked by the user. Compared with Liu et al’s scheme, the proposed scheme can resist conspiracy tracking and has less computational cost. On the premise of the discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf (LRSW) and Diffie-Hellman (DDH) assumption, the scheme is proved to meet the demands of anonymous authentication. The scheme has broad application prospects in many fields such as ad hoc network, electronic voting, and so on.     

Research on a Class of Equations over Finite Fields

Let F_q stand for the finite field of odd characteristic p with q elements(q=p~n,n∈N)and F_q~* denote the set of all the nonzero elements of F_q.In this paper,by using the augmented degree matrix and the result given by Cao,we obtain a formula for the number of rational points of the following equation over F_q:f(x _1,x _2,...,x _n)=(a_1 x_1 x_2~d+a_2 x_2 x_3~d...+a_(n-1)x_(n-1)x_n~d+a_n x_n x_1~d)~λ-bx_1~(d1)x_2~d2...x_n~(dn),with a_i,b∈F_q~*,n≥2,λ0 being positive integers,and d,d_i being nonnegative integers for 1≤i n.This technique can be applied to the polynomials of the form h_1~λ=h_2 with λ being positive integer and h_1,h_2∈F_q[x _1,x _2,...,x _n].It extends the results of the Markoff-Hurwitz-type equations.     

A new second-order Mehrotra-type predictor-corrector algorithm for SDO

In Zhang's recent works,a second-order Mehrotra-type predictor-corrector algorithm for linear optimization was extended to semidefinite optimization and derived that the algorithm for semidefinite optimization had O(n~(3/2)log(X~0)~T·S~0/ε) iteration complexity based on the NT direction as Newton search direction. In this paper, we extend the second-order Mehrotra-type predictor-corrector algorithm for linear optimization to semidefinite optimization and discuss the polynomial convergence of the algorithm by modifying the corrector direction and new iterates. It is proved that the iteration complexity is reduced to O(n~(3/2)log(X~0)~T·S~0/ε), which coincides with the currently best iteration bound of Mehrotra-type predictor-corrector algorithm for semidefinite optimization.     

A new quantum algorithm for computing RSA ciphertext period

Shor proposed a quantum polynomial-time integer factorization algorithm to break the RSA public-key cryptosystem. In this paper, we propose a new quantum algorithm for breaking RSA by computing the order of the RSA ciphertext C. The new algorithm has the following properties: 1) recovering the RSA plaintext M from the ciphertext C without factoring n; 2) avoiding the even order of the element; 3) having higher success probability than Shor’s; 4) having the same complexity as Shor’s.     

Ranks of repeated-root constacyclic code

By the discussion of division in \(F_{^{^{^{_2 m} } } } \left[ u \right]/\left\langle {u^4 } \right\rangle \), the minimal spanning set and the rank of a (1 + u + u ²) - constacyclic code with an arbitrary length N = 2 ^e n over \(\Phi \) are determined based on the factorization of (x ⁿ - 1) over \({F_{{2^m}}}\).     

Critical Chords of Convex Bodies of Constant Width

In this paper, we show that when Minkowski measure of asymmetry of convex body K of constant width is bigger than α (n-1), K has at least n+1 critical chords, where \(\alpha (n) = \frac{{n + \sqrt {2n(n + 1)} }}{{n + 2}}\).     

The Reverse Hoelder Classes in Martingale Setting

In martingale setting, it has been shown that Ap weights can be factorized in terms of A1 weights. This factorization benefits many problems very much. ]n this paper, the new class of RH~ plays the same role for RHs, which makes the reverse HOlder inequalities hold with exponent s＞1, that the class A1 does for Ap class. Therefore, the Jones‘ factorization theorem for Ap weights was extended to include some information about the reverse HOlder classes. And it is the most convenient obiect in weight theory indeed.