In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mat...In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mathematical problems. Combining the E1Gamal scheme based on the discrete logarithm problem and the OSS scheme based on the factoring problem, a digital signature scheme based on these two cryptographic assumptions is proposed. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring problem and the discrete logarithm problem. So the signature scheme will be still secure under the situation that any one of the two hard-problems is solved. Compared with previous schemes, the proposed scheme is more efficient in terms of space storage, signature length and computation complexities.展开更多
The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equatio...The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equation translates into the problem of variational iteration. And then the approximate solution of the soliton for the equation is obtained.展开更多
In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estima...In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.展开更多
By using cone expansion-compression theorem in this paper, we study boundary value problems for a coupled system of nonlinear third-order differential equation. Some sufficient conditions are obtained which guarantee ...By using cone expansion-compression theorem in this paper, we study boundary value problems for a coupled system of nonlinear third-order differential equation. Some sufficient conditions are obtained which guarantee the boundary value problems for a coupled system of nonlinear third-order differential equation has at least one positive solution. Some examples are given to verify our results.展开更多
The design of H∞ reduced order controllers is known to be a non-convex optimization problem for which no generic solution exists. In this paper, the use of Particle Swarm Optimization （PSO） for the computation of H...The design of H∞ reduced order controllers is known to be a non-convex optimization problem for which no generic solution exists. In this paper, the use of Particle Swarm Optimization （PSO） for the computation of H~ static output feedbacks is investigated. Two approaches are tested. In a first part, a probabilistic-type PSO algorithm is defined for the computation of discrete sets of stabilizing static output feedback controllers. This method relies on a technique for random sample generation in a given domain. It is therefore used for computing a suboptimal Ha static output feedback solution, In a second part, the initial optimization problem is solved by PSO, the decision variables being the feedback gains. Results are compared with standard reduced order problem solvers using the COMPIeib （Constraint Matrix-optimization Problem Library） benchmark examples and appear to be much than satisfactory, proving the great potential of PSO techniques.展开更多
基金The National Natural Science Foundation of China(No60402019)the Science Research Program of Education Bureau of Hubei Province (NoQ200629001)
文摘In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mathematical problems. Combining the E1Gamal scheme based on the discrete logarithm problem and the OSS scheme based on the factoring problem, a digital signature scheme based on these two cryptographic assumptions is proposed. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring problem and the discrete logarithm problem. So the signature scheme will be still secure under the situation that any one of the two hard-problems is solved. Compared with previous schemes, the proposed scheme is more efficient in terms of space storage, signature length and computation complexities.
基金Supported by the National Natural Science Foundation of China under Grant No. 40876010the Knowledge Innovation Project of Chinese Academy of Sciences under Grant No. KZCX2-YW-Q03-08+3 种基金the R & D Special Fund for Public Welfare Industry (meteorology) under Grant No. GYHY200806010the LASG State Key Laboratory Special Fundthe E-Institutes of Shanghai Municipal Education Commission under Grant No. E03004the Natural Science Foundation of Zhejiang Province under Grant No. Y6090164
文摘The corresponding solution for a class of disturbed KdV equation is considered using the analytic method. From the generalized variational iteration theory, the problem of solving soliton for the corresponding equation translates into the problem of variational iteration. And then the approximate solution of the soliton for the equation is obtained.
文摘In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.
基金Foundation item： Supported by the National Natural Science Foundation of China（10801001） Supported by the Natural Science Foundation of Anhui Province（1208085MA13）
文摘By using cone expansion-compression theorem in this paper, we study boundary value problems for a coupled system of nonlinear third-order differential equation. Some sufficient conditions are obtained which guarantee the boundary value problems for a coupled system of nonlinear third-order differential equation has at least one positive solution. Some examples are given to verify our results.
文摘The design of H∞ reduced order controllers is known to be a non-convex optimization problem for which no generic solution exists. In this paper, the use of Particle Swarm Optimization （PSO） for the computation of H~ static output feedbacks is investigated. Two approaches are tested. In a first part, a probabilistic-type PSO algorithm is defined for the computation of discrete sets of stabilizing static output feedback controllers. This method relies on a technique for random sample generation in a given domain. It is therefore used for computing a suboptimal Ha static output feedback solution, In a second part, the initial optimization problem is solved by PSO, the decision variables being the feedback gains. Results are compared with standard reduced order problem solvers using the COMPIeib （Constraint Matrix-optimization Problem Library） benchmark examples and appear to be much than satisfactory, proving the great potential of PSO techniques.
