In this paper we first demonstrate that effective selection functions in power analysis attacks change depending on circuit architectures of a block cipher. We then conclude that the most resistant architecture on its own, in the case of the loop architecture, has two data registers have separate roles: one for storing the plaintext and ciphertext, and the other for storing intermediate values. There, the pre-whitening operation is placed at the output of the former register. The architecture allows the narrowest range of selection functions and thereby has resistance against ordinary CPA. Thus, we can easily defend against attacks by ordinary CPA at the architectural level, whereas we cannot against DPA. Secondly, we propose a new technique called "self-templates" in order to raise the accuracy of evaluation of DPA-based attacks. Self-templates enable to differentiate meaningful selection functions for DPA-based attacks without any strong assumption as in the template attack. We also present the results of attacks to an AES co-processor on an ASIC and demonstrate the effectiveness of the proposed technique.

Device mismatch plays an important role in the design of accurate analog circuits. The common centroid structure is commonly employed to reduce device mismatches caused by symmetrical layouts and processing gradients. Among the candidate placements generated by the common centroid approach, however, whichever achieves better matching is generally difficult to be determined without performing the time-consuming yield evaluation process. In addition, this rule-based methodology makes it difficult to achieve acceptable matching between multiple capacitors and to handle an irregular layout area. Based on a spatial correlation model, this study proposed a design methodology for yield enhancement of analog circuits using switched-capacitor techniques. An efficient and effective placement generator is developed to derive a placement for a circuit to achieve the highest or near highest correlation coefficient and thus accomplishing a better yield performance. A simple yield analysis is also developed to evaluate the achieved yield performance of a derived placement. Results show that the proposed methodology derives a placement which achieves better yield performance than those generated by the common centroid approach.

Spatial encryption is one of the generalized identity based encryption proposed by Boneh and Hamburg in 2008. Spatial encryption provides a framework for generating many identity based cryptosystems such as broadcast encryption, forward secure encryption or ring signature. While this may appear to be an attractive feature, all existing spatial encryption schemes are only selectively secure. In this paper, we present a fully secure spatial encryption scheme based on the three composite order bilinear groups.

Spectrum sensing is a fundamental function for cognitive radio network to protect transmission of primary system. Cooperative spectrum sensing, which can help increasing sensing performance, is regarded as one of the most promising methods in realizing a reliable cognitive network. In such cooperation system, however the communication resources such as sensing time delay, control channel bandwidth and consumption energy for reporting the cognitive radio node's sensing results to the fusion center may become extremely huge when the number of cognitive users is large. In this paper, we propose an ordered sequential cooperative spectrum sensing scheme in which the local sensing data will be sent according to its reliability order to the fusion center. In proposed scheme, the sequential fusion process is sequentially conducted based on Dempster Shafer theory of evidence's combination of the reported sensing results. Above all, the proposed scheme is highly feasible due to the proposed two ordered sequential reporting methods. From simulation results, it is shown that the proposed technique not only keeps the same sensing performance of non-sequential fusion scheme but also extremely reduces the reporting resource requirements.

A design methodology of Random Switching Logic (RSL) using CMOS standard cell libraries is proposed to counter power analysis attacks against cryptographic hardware modules. The original RSL proposed in 2004 requires a unique RSL-gate for random data masking and glitch suppression to prevent secret information leakage through power traces. In contrast, our new methodology enables to use general logic gates supported by standard cell libraries. In order to evaluate its practical performance in hardware size and speed as well as resistance against power analysis attacks, an AES circuit with the RSL technique was implemented as a cryptographic LSI using 130-nm and 90-nm CMOS standard cell library. From the results of attack experiments that used a million traces, we confirmed that the RSL-AES circuit has very high DPA and CPA resistance thanks to the contributions of both the masking function and the glitch suppressing function.

CAST-128 is a block cipher used in a number of products, notably as the default cipher in some versions of GPG and PGP. It has been approved for Canadian government use by the Communications Security Establishment. Haruki Seki et al. found 2-round differential characteristics and they can attack 5-round CAST-128. In this paper, we studied the properties of round functions F1 and F3 in CAST-128, and identified differential characteristics for F1 round function and F3 round function. So we identified a 6-round differential characteristic with probability 2-53 under 2-23.8 of the total key space. Then based on 6-round differential characteristic, we can attack 8-round CAST-128 with key sizes greater than or equal to 72 bits and 9-round CAST-128 with key sizes greater than or equal to 104 bits. We give the summary of attacks on reduced-round CAST-128 in Table 10.

In this paper, we propose an AGC (Automatic Gain Control) algorithm for initial cell search in 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) TDD (Time Division Duplex) system. Since the received signal has a large signal power difference between uplink and downlink subframe in wireless communication systems using a TDD scheme, conventional AGC scheme cannot sufficiently adjust the AGC gain because the AGC gain cannot converge fast enough to properly respond. Therefore, conventional AGC scheme leads to increased AGC gain variation, and the received signal will be attenuated by large AGC gain variation. To overcome this limitation, we propose an AGC scheme based on the average amplitude ratio calculation which can not only effectively increase convergence speed of the AGC gain but also maintain the stability of AGC operation in LTE TDD system. Also, it is important for AGC to converge efficiently for the accurate radio frame timing detection during the subsequent initial cell search procedure. Therefore, we also consider the proposed AGC scheme in combination with PSS (Primary Synchronization Signal) detection interface for the first step of initial cell search process in LTE TDD system to obtain both a stable AGC operation and accurate PSS detection performance. By extensive computer simulation in the presence of frequency offset and various channel environments, we verified that the proposed method can obtain a good behavior in terms of demodulation and PSS detection performance in LTE TDD system.

A cognitive radio will have to sense and discover the spectral environments where it would not cause primary radios to interfere. Because the primary radios have the right to use the frequency, the cognitive radios as the secondary radios must detect radio signals before use. However, the secondary radios also need identifying the primary and other secondary radios where the primary radios are vulnerable to interference. In this paper, a method of simultaneously identifying signals of primary and secondary radios is proposed. The proposed bandwidth differentiation assumes the primary and secondary radios use orthogonal frequency division multiplexing (OFDM), and the secondary radios use at the lower number of subcarriers than the primary radios. The false alarm and detection probabilities are analytically evaluated using the characteristic function method. Numerical evaluations are also conducted on the assumption the primary radio is digital terrestrial television broadcasting. Result showed the proposed method could achieve the false alarm probability of 0.1 and the detection probability of 0.9 where the primary and secondary radio powers were 2.5 dB and 3.6 dB higher than the noise power. In the evaluation, the reception signals were averaged over the successive 32 snapshots, and the both the primary and secondary radios used QPSK. The power ratios were 4.7 dB and 8.4 dB where both the primary and secondary radios used 64QAM.

For over 40-Gbps optical communication systems, phase coded modulation formats, like differential phase shift keying (DPSK) and quadrature phase shift keying (QPSK), are very important for signal frequency efficiency and long-reach transmission. In such systems, differential receivers which regenerate phase signals are key components. Dual Photo Diodes (dual PDs) are key semiconductor devices which determine the receiver performance. Each PD of the dual PDs should realize high speed performance, high responsibility and high input power operation capability. Highly symmetrical characteristics between the two PDs should be also realized, thus the dual PDs are desired to be monolithically integrated to one chip. In this paper, we describe the design, fabrication, characteristics and reliability of monolithically integrated dual evanescently coupled waveguide photodiodes (EC-WG-PDs) for the purpose described above. The structure of the EC-WG-PDs offers the attractive advantages of high speed performance, high responsivity and high input power operation. Furthermore, their fabrication process is suitable for the integration of two PDs on one ship. First, the optimization was done for high products of 3-dB bandwidth and responsivity for 43-Gbps DPSK receivers. Excellent characteristics (50 GHz bandwidth with a responsivity of 0.95 A/W), and high reliability were demonstrated. The other type of optimization was done for ultra high speed operation up to 100-Gbps. The fabricated PDs exhibited the 3 dB-bandwidth of 80 GHz with a responsivity of 0.25 A/W. Furthermore, 43-Gbps RZ-DPSK receivers including the dual EC-WG-PDs based on the former optimization and differential transimpedance amplifiers (TIAs) newly developed for the purpose were also presented. Clear and symmetrical eye openings were observed for both ports. The OSNR characteristics exhibited 14.3 dB at a bit error rate of 10-3 that is able to be recovery with FEC. These performances are enough for practical use in 43-Gbps RZ-DPSK systems.

This paper presents a systemic analysis for phase noise performances of differential cross-coupled LC oscillators by using Hajimiri and Lee's model. The effective impulse sensitivity functions (ISF) for each noise source in the oscillator is mathematically derived. According to these effective ISFs, the phase noise contribution from each device is figured out, and phase noise contributions from the device noise in the vicinity of the integer multiples of the resonant frequency, weighted by the Fourier coefficients of the effective ISF, are also calculated. The explicit closed-form expression for phase noise of the oscillator is definitely determined. The validity of the phase noise analysis is verified by good simulation agreement.

In a spectrum sharing system, lower-priority users are allowed to spatially reuse the spectrum allocated to higher-priority users as long as they do not disrupt communications of the latter. Therefore, to improve spectrum utilization, an important requirement for the former users is to manage the interference and ensure that the latter users can maintain reliable communications. In the present paper, a game theoretic framework of joint channel selection and power allocation for spectrum sharing in distributed cognitive radio networks is proposed. First, a utility function that captures the cooperative behavior to manage the interference and the satisfaction level to improve the throughput of the lower-priority users is defined. Next, based on the defined utility function, the proposed framework can be formulated as a potential game; thus, it is guaranteed to converge to a Nash equilibrium when the best response dynamic is performed. Simulation results show the convergence of the proposed potential game and reveal that performance improvements in terms of network throughput of the lower-priority users and outage probability of the higher-priority users can be achieved by the introduction of an adaptive coefficient adjustment scheme in the proposed utility function at the expense of the convergence to the Nash equilibrium.

A mobile ad-hoc network (MANET) consists of a collection of wireless mobile nodes without any fixed network infrastructure. Since the mobile nodes form a constantly changing topology, the design of efficient and scalable routing protocols is a fundamental challenge in MANETs. In the current literature, position-based routing protocols are regarded as having better scalability and lower control overhead than topology-based routing protocols. Since location services are the most critical part of position-based routing protocols, we present a multi-home-region scheme, Distributed Virtual Home Region with Spatial Awareness (DVHR-SA), to improve the performance of location service in this paper. Our scheme adaptively selects different update and query procedures according to the location of a source node. The simulation results show that DVHR-SA shortens the lengths of the update, query and reply paths. Our scheme also reduces the overall network message overhead. Therefore, DVHR-SA is considerably fast and stable.

In order to evaluate the goodness of frequency hopping sequence design, the periodic Hamming correlation function is used as an important measure. Usually, the length of correlation window is shorter than the period of the chosen frequency hopping sequence, so the study of the partial Hamming correlation of frequency hopping sequence is particularly important. In this paper, the maximum partial Hamming correlation lower bounds of frequency hopping sequences with low hit zone, with respect to the size of the frequency slot set, the length of correlation window, the family size, the low hit zone, the maximum partial Hamming autocorrelation and the maximum partial Hamming crosscorrelation are established. It is shown that the new bounds include the known Lempel-Greenberger bound, Peng-Fan bounds, Eun-Jin-Hong-Song bound and Peng-Fan-Lee bounds as special cases.

Binary maximal-length sequences (or m-sequences) are sequences of period 2m-1 generated by a linear recursion of degree m. Decimating an m-sequence {st} by an integer d relatively prime to 2m-1 leads to another m-sequence {sdt} of the same period. The crosscorrelation of m-sequences has many applications in communication systems and has been an important and well studied problem during more than 40 years. This paper presents an updated survey on the crosscorrelation between binary m-sequences with at most five-valued crosscorrelation and shows some of the many recent connections of this problem to several areas of mathematics such as exponential sums and Dickson polynomials.

Based on the characteristics of the thresholds of two detection schemes employing locally optimum test statistics, a sequential detection design procedure is proposed and analyzed. The proposed sequential test, called the sequential locally optimum test (SLOT), inherently provides finite stopping time (terminates with probability one within the finite horizon), and thereby avoids undesirable forced termination. The performance of the SLOT is compared with that of the fixed sample-size test, sequential probability ratio test (SPRT), truncated SPRT, and 2-SPRT. It is observed that the SLOT requires smaller average sample numbers than other schemes at most values of the normalized signal amplitude while maintaining the error performance close to the SPRT.

Recently, novel full-diversity full-rate quasi-orthogonal space-time block codes (QSTBCs) with power scaling and double-symbol maximum likelihood (ML) decoding was proposed. Specifically, the codes can achieve full-diversity through linearly combining two adequately power scaled orthogonal space-time block codes (OSTBCs). In this letter, we derive expressions for mutual information and post-processing signal-to-noise ratio (SNR) for a system with four transmit antennas. By exploiting these formulas, we propose three transmit antenna grouping (TAG) methods for a closed-loop system with low-rate feedback information. The TAG methods make it possible to provide an excellent error-rate performance even with a low-complexity zero-forcing (ZF) detection, especially in spatially correlated fading channels.

Image registration is an important topic in medical image analysis. It is usually used in 2D mosaics to construct the whole image of a biological specimen or in 3D reconstruction to build up the structure of an examined specimen from a series of microscopic images. Nevertheless, owing to a variety of factors, including microscopic optics, mechanisms, sensors, and manipulation, there may be great differences between the acquired image slices even if they are adjacent. The common differences include the chromatic aberration as well as the geometry discrepancy that is caused by cuts, tears, folds, and deformation. They usually make the registration problem a difficult challenge to achieve. In this paper, we propose an efficient registration method, which consists of a feature-based registration approach based on analytic robust point matching (ARPM) and a refinement procedure of the feature-based Levenberg-Marquardt algorithm (FLM), to automatically reconstruct 3D vessels of the rat brains from a series of microscopic images. The registration algorithm could speedily evaluate the spatial correspondence and geometric transformation between two point sets with different sizes. In addition, to achieve subpixel accuracy, an FLM method is used to refine the registered results. Due to the nonlinear characteristic of FLM method, it converges much faster than most other methods. We evaluate the performance of proposed method by comparing it with well-known thin-plate spline robust point matching (TPS-RPM) algorithm. The results indicate that the ARPM algorithm together with the FLM method is not only a robust but efficient method in image registration.

Simple power analysis (SPA) can be employed in examining the power consumption trace of elliptic curve scalar multiplication to retrieve the computational sequence. However, SPA cannot distinguish point addition from point subtraction. The attacker still requires an exhaustive search to recover the private key when it is recoded in NAF or recoded by the 2-bit sliding window method. The average Hamming weight of an n-bit NAF recoded scalar is n/3, and an exhaustive search among the 2n/3 candidates is required. This paper shows that in a left-to-right NAF recoded or a left-to-right 2-bit sliding window manipulated scalar the relative position of nonzero bits will reveal their values. Our analysis skill reduces the number of candidates of the scalar from the naive search of 2n/3 to 22n/9 and 20.19n respectively for the cases of NAF and sliding window method.

Introducing diffusion bonding of laminated thin metal plates to the fabrication of slotted waveguide arrays enlightens the high potential and the feasibility of multi-layer antennas with high-performance. It is a promising process with low cost even for a double-layer antenna, because the number of etching patterns for thin metal plates is only five. In this paper, a double-layer antenna for broadband characteristics is designed in 39 GHz band as demonstration. A 20 20-element antenna is composed of 2 2 sub-arrays by installing a partially-corporate feed circuit in the bottom layer underneath radiating waveguides in the top layer. The five-element sub-arrays in both the feeding and radiating parts are designed first. A new structure for the last slot coupler with shortened termination is also proposed to avoid an extra slot-free region when assembling the neighbor sub-arrays. As the simulation results by HFSS, the maximum gain of 34.55 dBi with the antenna efficiency of 85.5% is estimated at 38.5 GHz. The test antenna is fabricated by the diffusion bonding of thin copper plates. As the measurement results, a very high aperture efficiency of 83.2% with the directivity of 34.5 dBi is realized at the center frequency of 38.75 GHz, where the antenna gain of 34.4 dBi with the high antenna efficiency of 81.4% is achieved. The bandwidth of 5.0% defined as 1 dB down from the maximum gain is achieved.

This paper describes a spatial fading emulator based on Clarke's model that can evaluate spatial correlation characteristics between signals received by handset antennas including human-body effect under emulated multipath propagation environments. The proposed model is composed of scatterers, phase-shifters and attenuators. The scatterers are located at equal intervals on the circumference of a circle. Phase shifters and attenuators in a control circuit are used to control the phase and amplitude of each wave radiated from the scatterers in order to emulate multi-path propagation environments, such as Rayleigh or Nakagami-Rice distribution, to be generated at their center. In this paper, the maximum distance between receiving antennas that could be used to evaluate spatial correlation characteristics between antennas was investigated experimentally. The measurement results show that 15 scatterers with a radius of 1.5 m are sufficient to evaluate spatial correlation characteristics within the branch separation of 1.7 λ when parallel dipole antennas are used as receiving antennas.