Recently Tate pairing and its variations are attracted in cryptography. Their operations consist of a main iteration loop and a final exponentiation. The final exponentiation is necessary for generating a unique value of the bilinear pairing in the extension fields. The speed of the main loop has become fast by the recent improvements, e.g., the Duursma-Lee algorithm and ηT pairing. In this paper we discuss how to enhance the speed of the final exponentiation of the ηT pairing in the extension field F36n. Indeed, we propose some efficient algorithms using the torus T2(F33n) that can efficiently compute an inversion and a powering by 3n + 1. Consequently, the total processing cost of computing the ηT pairing can be reduced by 16% for n=97.

In recent years, certain countermeasures against differential power analysis (DPA) at the logic level have been proposed. Recently, Popp and Mangard proposed a new countermeasure-masked dual-rail pre-charge logic (MDPL); this countermeasure combines dual-rail circuits with random masking to improve the wave dynamic differential logic (WDDL). They claimed that it could implement secure circuits using a standard CMOS cell library without special constraints for the place-and-route method because the difference between the loading capacitances of all the pairs of complementary logic gates in MDPL can be compensated for by the random masking. In this paper, we particularly focus on the signal transition of MDPL gates and evaluate the DPA-resistance of MDPL in detail. Our evaluation results reveal that when the input signals have different delay times, leakage occurs in the MDPL as well as WDDL gates, even if MDPL is effective in reducing the leakage caused by the difference in loading capacitances. Furthermore, in order to validate our evaluation, we demonstrate a problem with different input signal delays by conducting measurements for an FPGA.

HMAC is one of the most famous keyed hash functions, and widely utilized. In order to design secure hash functions, we often use PGV construction consisting of 64 schemes, each of which utilizes a block cipher. If the underlying block cipher is ideal, 12 schemes are proven to be secure. In this paper, we evaluate the security of these schemes in view of side channel attacks. As it turns out, HMACs based on 11 out of 12 secure PGV schemes are vulnerable to side channel attacks, even if the underlying block cipher is secure against side channel attacks. These schemes are classified into two groups based on their vulnerabilities. For the first group which contains 8 schemes, we show that the attacker can reveal the whole key of HMAC, and selectively forge in consequence. For the other group which contains 3 schemes, we specify the importance of the execution sequence for the inner operations of the scheme, and refine it. If wrong orders of operations are used, the attacker can reveal a portion of the key of HMAC. Hence, the use of HMACs based on such PGV schemes as they are is not recommended when the resistance against side channel attacks is necessary.

Most studies into multiple-input multiple-output (MIMO) antenna systems have aimed at determining the capacity-achieving (CA) input covariance given a certain degree of channel state information (CSI) at the transmitter and/or the receiver side. From the practical perspective, however, there is a growing interest in investigating the scenario where the system performance is power-limited as opposed to rate-limited. Of particular concern is the open problem of solving the optimal power-saving (PS) input covariance for spatially correlated MIMO channels when only the long-term (slow-varying) channel spatial covariance information is available at the transmitter. In an attempt to achieve this goal, this paper analyzes the characteristics of the optimal PS input covariance given the knowledge of channel spatial covariance information and the rate constraint of the transmission. Sufficient and necessary conditions of the optimal PS input covariance are derived. By considering the large-system regimes, we further devise an efficient iterative algorithm to compute the asymptotic optimal PS input covariance. Numerical results will show that the asymptotic solution is very effective in that it gives promising results even for MIMO systems with only a few antennas at the transmitter and the receiver.

In this paper, we propose a sequential type-based detection scheme for wireless sensor networks in the case of spatially and temporally identically and independently distributed observations. First, we investigate the optimal sequential detection rule of the proposed scheme, and then with the motivation of reducing the computational complexity of the optimal detection rule, we consider an approximation scheme and derive a suboptimal detection rule. We also compare the performances of the type-based sequential detection scheme with those of the non-sequential type-based detection scheme in terms of both average number of observations and total energy consumption, and determine the region of individual node power where the proposed scheme outperforms the non-sequential scheme. In addition, we show that the approximated detection rule provides the similar results as the optimal detection rule with a significant reduction of the computational complexity, which makes the approximated detection rule useful for real-time applications.

This paper presents MACs that combine a block cipher and its component such as a reduced-round version. Our MACs are faster than the standard MAC modes such as CBC-MAC, and provably secure if the block cipher is pseudorandom and its component is a permutation with a small differential probability. Such a MAC scheme was recently proposed by one of authors, and we provide improvements about security and treading-off between speed and amount of preprocessing.

In these days, many dynamically reconfigurable architectures have been introduced to fill the gap between ASICs and software-programmed processors such as GPPs and DSPs. These reconfigurable architectures have shown to achieve higher performance compared to software-programmed processors. However, reconfigurable architectures suffer from a significant reconfiguration overhead and a speedup limitation. By reducing the reconfiguration overhead, the overall performance of reconfigurable architectures can be improved. Therefore, we will describe temporal partitioning, which are able to amortize the reconfiguration overhead at synthesis phase or compilation time. Our temporal partitioning methodology splits a configuration context into temporal partitions to amortize reconfiguration overhead. And then, we will present benchmark results to demonstrate the effectiveness of our methodology.

Wireless content sharing where peers share content and services via wireless access networks requires user contributions, as in fixed P2P content sharing. However, in wireless access environments, since the resources of mobile terminals are strictly limited, mobile users are not as likely to contribute as ones in fixed environments. Therefore, incentives to encourage user contributions are more significant in wireless access environments. Although an incentive service differentiation architecture where the content transfer rate is adjusted according to the contributions of each downloading user has been already proposed for fixed P2P, it may not work well in wireless access environments because several factors effect wireless throughput. In this paper, we propose a novel architecture for contribution-based transfer-rate differentiation using wireless quality of service (QoS) techniques that motivates users to contribute their resources for wireless content sharing. We also propose a radio resource assignment method for our architecture. Computer simulations and game-theoretic calculations validate our architecture.

A method of sequential circuit synthesis is proposed for Single-Flux-Quantum (SFQ) digital circuits. Since all logic gates of SFQ digital circuits are driven by a clock signal, methods of sequential circuit synthesis for semiconductor digital circuits cannot derive the full power of high-throughput computation of SFQ circuit technology. In the method, a 'state module' consisting of a DFF and several AND gates is used. First, states of a sequential machine are encoded by one-hot encoding and state modules are assigned to the states one-by-one, and then, the modules are connected with each other according to the state transition. For the connection, Confluence Buffers (CBs), i.e., merger gates without clock signals are used. Consequently, gates driven by a clock signal are removed from its feedback loops, and therefore, a high-throughput SFQ sequential circuit is achieved. The experimental results on benchmark circuits show that compared with a conventional method for semiconductor digital circuits, the proposed method synthesizes circuits that work with 4.9 times higher clock frequency and have 17.3% more gates on average.

We consider power and rate adaptations in multicarrier (MC) direct-sequence code-division multiple-access (DS/CDMA) communications under the assumption that channel state information is provided at both the transmitter and the receiver. We propose, as a power allocation strategy in the frequency domain, to transmit each user's DS waveforms over the user's sub-band with the largest channel gain, rather than transmitting identical DS waveforms over all sub-bands. We then adopt channel inversion power adaptation in the time domain, where the target user's received power level maintains at a fixed value. We also investigate rate adaptation in the time domain, where the data rate is adapted such that a desired transmission quality is maintained. We analyze the BER performance of the proposed power and rate adaptations with fixed average transmission power, and show that power adaptation in both the frequency and the time domains or combined power adaptation in the frequency domain and rate adaptation in the time domain make significant performance improvement over the power adaptation in the frequency domain only. We also compare the performance of the proposed power and rate adaptation schemes in MC-DS/CDMA systems to that of power and rate adapted single carrier DS/CDMA systems with RAKE receiver.

This paper presents a self-reconfigurable adaptive FIR filter system design using dynamic partial reconfiguration, which has flexibility, power efficiency, advantages of configuration time allowing dynamically inserting or removing adaptive FIR filter modules. This self-reconfigurable adaptive FIR filter is responsible for providing the best solution for realization and autonomous adaptation of FIR filters, and processes the optimal digital signal processing algorithms, which are the low-pass, band-pass and high-pass filter algorithms with various frequencies, for noise removal operations. The proposed stand-alone self-reconfigurable system using Xilinx Virtex4 FPGA and Compact-Flash memory shows the improvement of configuration time and flexibility by using the dynamic partial reconfiguration techniques.

In this letter, we consider a class of approximately feedback linearized systems that contain both triangular and feedforward forms. With a utilization of the transformation scaling factor, we analytically show that the considered system can be globally exponentially stabilized, globally bounded, or locally stabilized depending on the shapes of triangular and feedforward forms. Our new method broadens a class of nonlinear systems under consideration over the existing results.

In rich scattering environments, multiple antenna systems designed to accomplish spatial multiplexing have enormous potential of lifting the capacity of corresponding multiple input multiple output channels. In this paper, we present a new low complexity algorithm for decision feedback equalization detector in the SM scheme. The basic idea is to reduce the joint optimization problem to separate optimization problems to achieve better performance-complexity tradeoffs. Concretely, we separately optimize the detection order and the detector filters so that the complexity of the entire signal detection task is reduced. The new order search rule approximates the optimal Bell Labs layered space time (BLAST) approach from a geometrical perspective, and the detector filters are derived using a Cholesky based QR decomposition. The new algorithm is able to switch from zero forcing to minimum mean square error without additional operations and the computational effort is a small fraction of that in the optimal BLAST algorithm. Despite its low complexity, the error performance of new detector closely approximates that of the standard BLAST.

Service differentiation is one of the key issues in the current Internet. In this paper, we focus on a recent proposal for proportional loss rate differentiation which employs a single FIFO queue, an AQM algorithm for computing the packet drop probability, and a counter-based packet dropping routine for achieving the intended proportional loss rate differentiation among classes. It is first shown that, when the target dropping probability of a class is large, the counter-based packet dropping routine may yield a significant amount of error between the target and measured drop probabilities for the class, and subsequently, fails to maintain the loss rate ratios between classes as intended. To avoid this problem, a new compensatory packet dropping routine is developed in this paper. Then, a series of simulation experiments are conducted using the ns-2 simulator to assess the performances of the two dropping routines under various congestion conditions and quality spacings between classes. The simulation results show that, unlike the counter-based dropping routine, the proposed compensatory dropping routine is effective in keeping the loss rate ratios between classes closely on target regardless of the degree of congestion and quality spacing between classes, while the two dropping routines perform similarly in terms of throughput and queueing delay in the bottleneck link. In addition, such robustness of the proposed routine is achieved without any additional control parameter or computational effort compared to the counter-based routine.

Correctness of Java programs is important because they are executed in distributed computing environments. The object initialization scheme in the Java programming language is complicated, and this complexity may lead to undesirable semantic bugs. Various tools have been developed for detecting program patterns that might cause errors during program execution. However, current tools cannot identify code patterns in which an uninitialized field is accessed when an object is initialized. We refer to such erroneous patterns as uninitialized field references. In this paper, we propose a static pattern detection algorithm for identifying uninitialized field references. We design a sound analysis for this problem and implement an analyzer using the Soot framework. In addition, we apply our algorithm to some real Java applications. From the experiments, we identify 12 suspicious field references in the applications, and among those we find two suspected errors by manual inspection.

Although subspace-based methods for estimating the Angle of Arrival (AOA) require a precise array response to achieve highly accurate results, it is difficult to obtain this response in practice even though the antennas are calibrated. Therefore, a method of compensating for errors in calibration is required. This paper proposes a procedure to enable precise AOA estimates to be obtained in a real system by applying array calibration and spatial smoothing preprocessing (SSP). Measured data were collected from experiments using two scenarios, i.e., in an anechoic chamber and at an open site, where a single source signal arrived at the array antenna. All measured data were then calibrated by using data obtained at 0 deg in an anechoic chamber before the AOAs were estimated. Nevertheless, errors in the array response remained after calibration because errors in the AOA estimates could still be observed. SSP was then applied to the calibrated data to obtain more accurate AOA estimates. We found that SSP can reduce the random error in an array response obtained in a real system, leading to reduced errors in AOA estimates in the observed data. To generalize the problem that SSP can reduce random perturbation in the array response, simple expressions are illustrated and verified by Monte-Carlo simulation. Random gain and phase errors in the array response are only considered in this paper and ESPRIT was used to estimate the AOAs.

This paper shows the effectiveness of a cinematographic camera for controlling 3D video by measuring its effects on viewers with several typical camera works. 3D free-viewpoint video allows us to set its virtual camera on arbitrary positions and postures in 3D space. However, there have been neither investigations on adaptability nor on dependencies between the camera parameters of the virtual camera (i.e., positions, postures, and transitions) nor the impressions of viewers. Although camera works on 3D video based on expertise seems important for making intuitively understandable video, it has not yet been considered. When applying camera works to 3D video using the planning techniques proposed in previous research, generating ideal output video is difficult because it may include defects due to image resolution limitation, calculation errors, or occlusions as well as others caused by positioning errors of the virtual camera in the planning process. Therefore, we conducted an experiment with 29 subjects with camera-worked 3D videos created using simple annotation and planning techniques to determine the virtual camera parameters. The first point of the experiment examines the effects of defects on viewer impressions. To measure such impressions, we conducted a semantic differential (SD) test. Comparisons between ground truth and 3D videos with planned camera works show that the present defects of camera work do not significantly affect viewers. The experiment's second point examines whether the cameras controlled by planning and annotations affected the subjects with intentional direction. For this purpose, we conducted a factor analysis for the SD test answers whose results indicate that the proposed virtual camera control, which exploits annotation and planning techniques, allows us to realize camera working direction on 3D video.

Direction of arrival estimation of coherent multipath waves by using superresolution technique often requires decorrelation preprocessings. Spatial smoothing preprocessings are the most popular schemes as the techniques. In mobile environment, position change of the target/transmitter often brings us decorrelation effect. In addition, multiple signals transmitted by an antenna array, such as a MIMO transmitter, can also cause the same effect. These effects can be categorized as the spatial smoothing preprocessing at the transmitter. In this paper, we analyze the spatial smoothing effect at the transmitter in the presence of multipath coherent waves. Theoretical and simulation results show that the spatial smoothing at the transmitter has a good feature in comparison with the conventional SSP at the receiving array. We also show that better decorrelation performance can be obtained when the SSPs at the transmitter and receiving array are applied simultaneously.

This paper presents a partially resonant active filter based on a digital PWM control circuit with a DSP that can improve the power factor and input current harmonic distortion factor of distributed power supply systems in communications buildings. The steady-state and dynamic characteristics of this active filter are analyzed experimentally and the relationship between the control variables of digital control circuit with the DSP and performance characteristics such as regulation of the output voltage, input power factor, input current harmonic distortion factor, boundaries of stabilities and transient response are defined. Using the partially resonant circuit, the efficiency is over 91%, which is 0.9 point higher than that of non-resonant circuit and the high frequency switching noise is suppressed. Furthermore, the digital control strategy with the DSP proposed in this paper can realize the superior transient response of input current and output voltage for the step change of load, the power factor over 0.99 and total harmonic distortion factor less than 1.1%.

This study examines treatment of a boundary between media to simulate an acoustic field using the CIP method. The handling of spatial derivatives of fields is extremely important for CIP acoustic field analysis. We demonstrate a method of handling this boundary and report results of CIP acoustic field analysis using the present treatment.