We develop several tools to derive quadratic equations from algebraic S-boxes and to prove their linear independence. By applying them to all known almost perfect nonlinear (APN) power functions and the inverse function, we can estimate the resistance against algebraic attacks. As a result, we can show that APN functions have different resistance against algebraic attacks, and especially S-boxes with Gold or Kasami exponents have very weak resistance.

In this paper, we present a new class of public-key cryptosystem (PKC) using algebraic coding on the basis of superimposition and randomness. The proposed PKC is featured by a generator matrix, in a characteristic form, where the generator matrix of an algebraic code is repeatedly used along with the generator matrix of a random code, as sub-matrices. This generator matrix, in the characteristic form, will be referred to as K-matrix. We show that the K-matrix yields the following advantages compared with the conventional schemes: (i) It realizes an abundant supply of PKCs, yielding more secure PKCs, (ii) It realizes a short public key.

Automated reasoning of inductive theorems is considered important in program verification. To verify inductive theorems automatically, several implicit induction methods like the inductionless induction and the rewriting induction methods have been proposed. In studying inductive theorems on higher-order rewritings, we found that the class of the theorems shown by known implicit induction methods does not coincide with that of inductive theorems, and the gap between them is a barrier in developing mechanized methods for disproving inductive theorems. This paper fills this gap by introducing the notion of primitive inductive theorems, and clarifying the relation between inductive theorems and primitive inductive theorems. Based on this relation, we achieve mechanized methods for proving and disproving inductive theorems.

This paper presents a color demosaicing method by introducing iterative asymmetric average interpolation. Missing primary colors on a Bayer pattern color filter array (CFA) are estimated by an asymmetric average interpolation where less intensity variation is assumed to be of stronger significance, before sharpness of an initial estimate is further improved by an iterative procedure. The iteration is implemented by an observation process followed by a restoration process. The former is modeled by blurring followed by CFA sampling and the latter is completely as same as the color demosaicing method initially applied. Experimental results have shown a favorable performance in terms of PSNR and visual appearance, in particular, in sharpness recovery.

This paper gives an efficient algorithm to compute addition in Jacobian of C34 curves, aiming at C34 curve cryptosystems. Using C34 curves for cryptosystems has two advantages. The first is safety and the second is the short size of the base field. In the paper, we modify the addition algorithm of for Cab curves in the specific manner to C34 curves. We classify all of the forms of the Groebner bases of ideals involved in the algorithm and eliminate the use of Buchberger algorithm from it. Our resulting algorithm computes the addition in Jacobian of C34 curves in about 3 times amount of computation of the one in elliptic curves, when the sizes of groups are set to be the same.

Cyberworlds are being formed in cyberspaces as computational spaces. Now cyberspaces are rapidly expanding on the Web either intentionally or spontaneously, with or without design. Widespread and intensive local activities are melting each other on the web globally to create cyberworlds. The major key players of cyberworlds include e-finance that trades a GDP-equivalent a day and e-manufacturing that is transforming industrial production into Web shopping of product components and assembly factories. Lacking proper theory and design, cyberworlds have continued to grow chaotic and are now out of human understanding and control. This research first presents a generic theoretical framework and design based on algebraic topology, and also provides an axiomatic approach to theorize the potentials of cyberworlds.

In Japanese, there is frequent alternation between CV morae and moraic geminate consonants. In this study, we analyzed the phonemic environments of consonant gemination (CG) using the "Corpus of Spontaneous Japanese (CSJ)." The results revealed that the environment in which gemination occurs is, to some extent, parallel to that of vowel devoicing. However, there are two crucial differences. One difference is that the CG tends to occur in a /kVk/ environment, whereas such is not the case for vowel devoicing. The second difference is that when the preceding consonant is /r/, gemination occurs, but not vowel devoicing. These observations suggest that the mechanism leading to CG differs from that which leads to vowel devoicing.

In this study, we construct balanced Boolean functions with a high nonlinearity and an optimum algebraic degree for both odd and even dimensions. Our approach is based on modifying functions from the Maiorana-McFarland's superclass, which has been introduced by Carlet. A drawback of Maiorana-McFarland's function is that their restrictions obtained by fixing some variables in their input are affine. Affine functions are cryptographically weak functions, so there is a risk that this property will be exploited in attacks. Due to the contribution of Carlet, our constructions do not have the potential weakness that is shared by the Maiorana-McFarland construction or its modifications.

We fabricated organic p-n heterojunction, p-i-n heterojunction and all-i-layer photovoltaic cells of a zinc phthalocyanine (ZnPc)/1:1 codeposition (ZnPc:C60)/C60 structure with Al cathode. We investigated the effects of the device structure and the cathode material on the photovoltaic properties. The thickness of the i-layer was changed as 0 nm (= p-n heterojunction), 10 nm (= p-i-n heterojunction) or 50 nm (= all-i-layer) with the total thickness of 50 nm. We also changed cathode materials from Al to low-workfunction Mg:Ag electrode. Photovoltaic properties, i.e., short-circuit current density, fill factor and power conversion efficiency, were strongly influenced by the device structure and cathode material. Finally, the power conversion efficiency showed a maximum (1.5%) with the p-i-n structure and a Mg:Ag cathode under Air Mass 1.5 global solar conditions.

We describe a simulation method and design for a stand-alone hybrid power supply system composed of a wind turbine generator and photovoltaic modules. The system has been developed to supply power for telecommunications equipment in areas with no commercial power sources. We also report a comparison of the simulation results with actual measured data. The results show that the hybrid system can function effectively as a power supply for telecommunications equipment.

This paper discusses stability boundaries in an electric power system with dc transmission based on a differential-algebraic equation (DAE) system. The DAE system is derived to analyze transient stability of the ac/dc power system: the differential equation represents the dynamics of the generator and the dc transmission, and the algebraic equation the active and reactive power relationship between the ac system and the dc transmission. In this paper complete characterization of stability boundaries of stable equilibrium points in the DAE system is derived based on an energy function for the associated singularly perturbed (SP) system. The obtained result completely describes global structures of the stability boundaries in solution space of the DAE system. In addition the characterization is confirmed via several numerical results with a stability boundary.

Diagonal algebraic space time (DAST) block codes was proved to achieve the full transmit diversity over a quasi-static fading channel and to maintain 1 symbol/s/Hz. When the number of transmit antennas employed is larger than 2, DAST codes outperform the codes from orthogonal design with the equivalent spectral efficiency. However, due to the limitation on the signal constellation with complex integer points, no good 3bits/symbol DAST block code was given previously. In this paper, we propose a general form of 8-star-PSK constellations with integer points and present some theoretical results on the performance of the equivalent 8-star-PSK modulations. By using our proposed 8-star-PSKs, we present a searching algorithm to construct DAST codes with 3 bits per symbol under some criteria and investigate their performances over flat Rayleigh fading channels. It is shown that (5,2) 8-star-PSK scheme has a comparable performance to conventional 8PSK over additive white Gaussian noise (AWGN) channel and the corresponding DSAT codes constructed can achieve significant performance gain over flat Rayleigh fading channel.

In this paper, we describe a technique for optimizing the algebraic method that is applied to higher order differential attack. The higher order differential attack is a well-known attack on block ciphers, in which we derive an attack equation to determine a round key from a property of a higher order differential of a target block cipher. The algebraic method is a linearization of the attack equation and determines the true key by a method such as Gaussian elimination. Our technique is based on linear dependency and can reduce the complexity of that method. We also describe a technique that allows the algebraic method to be used as an attack equation that holds probabilistically. We demonstrate this method by attacking a five-round MISTY1 and show that it needs 221.6 chosen plaintexts and 228.0 encryption times. The computer simulation took about two minutes to complete.

This letter presents the advantages of a cascaded algebraic codebook structure at relatively high bit-rates. The cascaded structure that consists of two stages provides flexible pulse combinations due to an additional gain term in the second stage. The perceptual quality of the cascaded structure can be further improved by using a gain re-estimation scheme. Experiments confirm that the cascaded structure has a big advantage in terms of quality and complexity as the bit-rate becomes higher.

Finding a nonnegative integer solution x for Ax = b (A Zmn, b Zm1) in Petri nets is NP-complete. Being NP-complete, even algorithms with theoretically bad worst case and with average complexity can be useful for a special class of problems, hence deserve investigation. Then a Grobner basis approach to integer programming problems was proposed in 1991 and some symbolic computation systems became to have useful tools for ideals, varieties, and algorithms for algebraic geometry. In this letter, Grobner basis approach is applied to three typical problems with respect to state equation in P/T Petri nets. In other words, after Grobner bases are derived by the tool Maple 7, we consider how to derive the T-invariants and particular solutions of the Petri nets by using them in this letter.

We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.

This paper presents an edge alignment method for stitching images when they have large displacements and light changes. First, without building any correspondences, the proposed method predicts all possible translation solutions by examining the consistency between edge positions. Then, the best solution can be obtained from the set of possible translations by a verification process. The proposed method has better capabilities to stitch images when they have large light changes and displacements. Since the method doesn't require building any correspondences or involve any optimization process, it performs more efficiently than other correlation techniques like feature-matching or phase-correlation approaches. Due to its simplicity and efficiency, different images can be very quickly aligned (less than 0.1 seconds) with the proposed method. Experimental results are provided to verify the superiority of the proposed method.

The strong RSA assumption is an assumption that the following problem is hard to solve: Given an RSA modulus and a ciphertext, find a pair of plaintext and exponent corresponding to them. It differs from the standard RSA assumption in a sense that in the strong version, no exponent is given as an input. The strong RSA assumption is considered to be stronger than the RSA assumption, but their exact relationship is not known. We investigate the strength of the strong RSA assumption and show that the strong RSA assumption restricted to low exponents is equivalent to the assumption that RSA problem is intractable for any low exponent. We also show that in terms of algebraic computation, the strong RSA assumption is properly stronger than the RSA assumption if there exists an RSA modulus n such that gcd((n),3)=1 and RSA problem is intractable.

This paper proposes a new multistage technique of algebraic codebook in CELP coders called Trellis Search inspired from the Trellis Coded Quantization (TCQ). This search technique is implemented into the fixed codebook of the standard G.729 for objective evaluation on a large corpus of a testing speech database. Simulations results show that in terms of computer execution time the proposed search scheme reduces the codebook search by approximately 23% compared to the time of focused search used in the standard G.729. This yields to a reduction of about 8% in the computer execution time of the coder at the cost of a slight degradation of speech quality but perceptually not noticeable. Moreover, this new technique shows better speech quality than the G.729A at the expense of a higher complexity.

We observed the log normal, log-Weibull and K-distributed sea-clutter from high sea state 7 with an X-band radar for grazing angles between 3.1 and 17.5. To determine the sea-clutter amplitude statistics, we introduced the Akaike Information Criterion (AIC), which is more rigorous fit of the distribution to the data than the least-squares method.