• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2292-2309
• /
• 2017

Ciphertext policy attribute-based encryption (CP-ABE) is a useful cryptographic technology for guaranteeing data confidentiality but also fine-grained access control. Typically, CP-ABE can be divided into two classes: small universe with polynomial attribute space and large universe with unbounded attribute space. Since the learning with errors over rings (R-LWE) assumption has characteristics of simple algebraic structure and simple calculations, based on R-LWE, we propose a small universe CP-ABE scheme to improve the efficiency of the scheme proposed by Zhang et al. (AsiaCCS 2012). On this basis, to achieve unbounded attribute space and improve the expression of attribute, we propose a large universe CP-ABE scheme with the help of a full-rank differences function. In this scheme, all polynomials in the R-LWE can be used as values of an attribute, and these values do not need to be enumerated at the setup phase. Different trapdoors are used to generate secret keys in the key generation and the security proof. Both proposed schemes are selectively secure in the standard model under R-LWE. Comparison with other schemes demonstrates that our schemes are simpler and more efficient. R-LWE can obtain greater efficiency, and unbounded attribute space means more flexibility, so our research is suitable in practices.

• Structural Engineering and Mechanics
• /
• v.38 no.2
• /
• pp.211-229
• /
• 2011

In this paper, we present a new explicit procedure using periodic cubic B-spline interpolation polynomials to solve linear and nonlinear dynamic equation of motion governing single degree of freedom (SDOF) systems. In the proposed approach, a straightforward formulation was derived from the approximation of displacement with B-spline basis in a fluent manner. In this way, there is no need to use a special pre-starting procedure to commence solving the problem. Actually, this method lies in the case of conditionally stable methods. A simple step-by-step algorithm is implemented and presented to calculate dynamic response of SDOF systems. The validity and effectiveness of the proposed method is demonstrated with four examples. The results were compared with those from the numerical methods such as Duhamel integration, Linear Acceleration and also Exact method. The comparison shows that the proposed method is a fast and simple procedure with trivial computational effort and acceptable accuracy exactly like the Linear Acceleration method. But its power point is that its time consumption is notably less than the Linear Acceleration method especially in the nonlinear analysis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.628-636
• /
• 2010

In this paper, we present a new type high speed parallel multiplier for performing the multiplication of two polynomials using standard basis in the finite fields GF($2^m$). Prior to construct the multiplier circuits, we design the basic cell of vector code generator(VCG) to perform the parallel multiplication of a multiplicand polynomial with a irreducible polynomial and design the partial product result cell(PPC) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial with VCG circuits. The presented multiplier performs high speed parallel multiplication to connect PPC with VCG. The basic cell of VCG and PPC consists of one AND gate and one XOR gate respectively. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields GF($2^4$). Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper uses the VCGs and PPCS repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSL.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.8
• /
• pp.35-45
• /
• 1999

In this paper, the addition and the multiplicative algorithm of two polynomials over finite field $GF(p^m)$ are presented. The 4-valued arithmetic processor of the serial input-parallel output modular structure on $GF(4^3)$ to be performed the presented algorithm is implemented by current mode CMOS. This 4-valued arithmetic processor using current mode CMOS is implemented one addition/multiplication selection circuit and three operation circuits; mod(4) multiplicative operation circuit, MOD operation circuit made by two mod(4) addition operation circuits, and primitive irreducible polynomial operation circuit to be performing same operation as mod(4) multiplicative operation circuit. These operation circuits are simulated under $2{\mu}m$ CMOS standard technology, $15{\mu}A$ unit current, and 3.3V VDD voltage using PSpice. The simulation results have shown the satisfying current characteristics. The presented 4-valued arithmetic processor using current mode CMOS is simple and regular for wire routing and possesses the property of modularity. Also, it is expansible for the addition and the multiplication of two polynomials on finite field increasing the degree m and suitable for VLSI implementation.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2013

In this paper, we propose a new multiplication algorithm for two polynomials using primitive polynomial with all 1 of coefficient on finite fields GF($2^m$), and design the multiplier with high-speed parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $m^2$ same basic cells that have a 2-input XOR gate and a 2-input AND gate. Since the basic cell have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $D_A+D_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.3
• /
• pp.1-5
• /
• 1984

It is investigated that Mahalanobis distances are invariant under a proper transformation and interest MDs are distributed as non-central chi-square while it is well known that intraset MDs are distributed as central chi-square. And their moments have been expressed as simple polynomials whose coefficients satisfy straightforward recursive relations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1993

Tangent stiffness matrices are derived for the torsional and lateral stability analysis of the space beams and framed structures with the symmetric thin-walled section by using the principle of virtual displacement. In the cases of restrained torsion and unrestrained torsion, the elastic and geometric stiffness matrices are evaluated by using the Hermitian polynomials which represent the displacement field of the beam element in simple flexure. Numerical examples illustrate the accuracy and convergence characteristics of the derived formulations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.60-68
• /
• 1994

In this paper, the multiplicative algorithm of two polynomials over finite field GF(($p^{m}$) is presented. Using the presented algorithm, the multiple-valued multiplier of the serial input-output modular structure by CCD is constructed. This multiple-valued multiplier on CCD is consisted of three operation units: the multiplicative operation unit, the modular operation unit, and the primitive irreducible polynomial operation unit. The multiplicative operation unit and the primitive irreducible operation unit are composed of the overflow gate, the inhibit gate and mod(p) adder on CCD. The modular operation unit is constructed by two mod(p) adders which are composed of the addition gate, overflow gate and the inhibit gate on CCD. The multiple-valued multiplier on CCD presented here, is simple and regular for wire routing and possesses the property of modularity. Also. it is expansible for the multiplication of two elements on finite field increasing the degree mand suitable for VLSI implementation.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.4
• /
• pp.267-280
• /
• 2009

In this paper we investigate a simple two-level additive Schwarz preconditioner for the P1 symmetric interior penalty Galerkin method of the Poisson equation on rectangular meshes. The construction is based on the decomposition of the global space of piecewise linear polynomials into the sum of local subspaces, each of which corresponds to an element of the underlying mesh, and the global coarse subspace consisting of piecewise constants. This preconditioner is a direct combination of the block Jacobi iteration and the cell-centered finite difference method, and thus very easy to implement. Explicit upper and lower bounds for the maximum and minimum eigenvalues of the preconditioned matrix system are derived and confirmed by some numerical experiments.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.