The design of multi-branch optical waveguides having 3 or more output ports is not so easy as that of 2-output branches because some innovative geometry is required to realize equal power splitting. All previous studies take the same approach in which they first introduce innovative geometries and then adjust the structural parameters for equal splitting. On the other hand, we propose quite a different method where distribution of refractive index is calculated from an ideal field distribution which is synthesized artificially. The method is extended to design 3-D 4-branch waveguides. It is exemplified that 4-branch waveguides with low-loss and equal splitting can be realized by the proposed method.

We have proposed a unique and simple modification to the definition of surface-normal vectors in Physical optics (PO). The modified surface-normal vectors are so defined as that the reflection law is satisfied at every point on the surface. The PO with currents defined by this new surface-normal vector has the enhanced accuracy for the edged scatterers to the level of Geometrical Theory of Diffraction (GTD), though it dispenses with the knowledge of high frequency asymptotic techniques. In this paper, firstly, the remarkable simplicity and the high accuracy of the modified PO as applied to the analysis of Radar Cross Section (RCS) is demonstrated for 2 dimensional problems. Noteworthy is that the scattering not only from edge but also from wedge is accurately predicted. This fringe advantage is confirmed asymptotically by comparing the edge and wedge diffraction coefficients of GTD. Finally, the applicability for three dimensional cube is also demonstrated by comparison with experimental data.

This paper proposes a Inter-symbol Interference (ISI) suppressing method For Orthogonal Frequency Division Multiplexing (OFDM) system. In the environments where the delay spread exceeds the guard interval, the occurrence of ISI results in a degradation of system performance. A receiving method based on the Equivalent Transmission Path (ETP) model is proposed for Single-Input Multiple-Output (SIMO) OFDM system. Compared to the receiving scheme using Maximal Ratio Combining (MRC) method, the proposed one shows better performance in suppressing errors due to ISI. The paper also points out that the ETP-based model can be used for detecting the desired signal in the multi-user OFDM system. Simulation results of the system performance show the effectiveness of the proposed method over the conventional OFDM system in suppressing ISI.

In this paper, we propose an effective key recovery attack on stream ciphers Py and Pypy with chosen IVs. Our method uses an internal-state correlation based on the vulnerability that the randomization of the internal state in the KSA is inadequate, and it improves two previous attacks proposed by Wu and Preneel (a WP-1 attack and a WP-2 attack). For a 128-bit key and a 128-bit IV, the WP-1 attack can recover a key with 223 chosen IVs and time complexity 272. First, we improve the WP-1 attack by using the internal-state correlation (called a P-1 attack). For a 128-bit key and a 128-bit IV, the P-1 attack can recover a key with 223 chosen IVs and time complexity 248, which is 1/224 of that of the WP-1 attack. The WP-2 attack is another improvement on the WP-1 attack, and it has been known as the best previous attack against Py and Pypy. For a 128-bit key and a 128-bit IV, the WP-2 attack can recover a key with 223 chosen IVs and time complexity 224. Second, we improve the WP-2 attack by using the internal-state correlation as well as the P-1 attack (called a P-2 attack). For a 128-bit key and a 128-bit IV, the P-2 attack can recover a key with 223 chosen IVs and time complexity 224, which is the same capability as that of the WP-2 attack. However, when the IV size is from 64 bits to 120 bits, the P-2 attack is more effective than the WP-2 attack. Thus, the P-2 attack is the known best attack against Py and Pypy.

We have proposed a noise reduction method based on a noise reconstruction system (NRS). The NRS uses a linear prediction error filter (LPEF) and a noise reconstruction filter (NRF) which estimates background noise by system identification. In case a fixed step size for updating tap coefficients of the NRF is used, it is difficult to reduce background noise while maintaining the high quality of enhanced speech. In order to solve the problem, a variable step size is proposed. It makes use of cross-correlation between an input signal and an enhanced speech signal. In a speech section, a variable step size becomes small so as not to estimate speech, on the other hand, large to track the background noise in a non-speech section.

This paper proposes a new algorithm for evaluating the number of chaining variable conditions (CVCs) in the selecting step of a disturbance vector (DV) for the analysis of SHA-1 collision search. The algorithm is constructed by combining four strategies, that can evaluate the number of CVCs more strictly compared with the previous approach. By using our method, we found some DVs that have 57 (or 59) essential CVCs for 1st (or 2nd) block in the case if we assume that we can modify messages up to step 25, which we have not confirmed the practicability of the assumption.

MISTY1 is a 64-bit block cipher that has provable security against differential and linear cryptanalysis. MISTY1 is one of the algorithms selected in the European NESSIE project, and it has been recommended for Japanese e-Government ciphers by the CRYPTREC project. This paper reports a previously unknown higher order differential characteristic of 4-round MISTY1 with the FL functions. It also shows that a higher order differential attack that utilizes this newly discovered characteristic is successful against 6-round MISTY1 with the FL functions. This attack can recover a partial subkey with a data complexity of 253.7 and a computational complexity of 264.4, which is better than any previous cryptanalysis of MISTY1.

Orthogonal Frequency Division Multiple Access (OFDMA) is the technique for the next generation wireless networks, whose enhanced capacity is to serve a combination of traffic with diverse QoS requirements. To realize this, the resource allocation scheme has to be carefully designed so that the instantaneous channel condition, QoS provision, and the network utilization are integrated. In this paper, we propose the resource allocation scheme for downlink traffic of 2 classes; guaranteed and non-guaranteed, having different traffic contracts. We provide guaranteed throughput for the guaranteed class by considering the cost incurred from serving this class. Then, we formulate the assignment problem with the objective of minimizing this cost. For the non-guaranteed class, we aim to maximize network utilization and to maintain throughput fairness, by employing Proportional Fairness (PF) utility function and emphasizing on the portion of network resource that the user received and the individual user's queue length. We use a heuristic approach to schedule users' data into the downlink subframe by exploiting multi-user multi-channel diversity to utilize system's bandwidth efficiently. Intensive simulation shows that our scheme differentiates classes of traffic and provides satisfied throughput, lower packet drop rate, and lower queuing delay to the guaranteed class, comparing with those of the non-guaranteed class. Furthermore, the results also show that the scheme is fair to users in the same class in both throughput and service time.

This letter presents a necessary and sufficient condition for a class of quasi-cyclic low-density parity-check (QC LDPC) codes without girth four. Girth-four property of a class of QC LDPC codes is investigated. Good QC LDPC codes without girth four can be constructed by selecting proper shifting factors according to the proposed theorems. Examples are provided to verify the theorems. The simulation results show that the QC LDPC codes without girth four achieve a better BER performance compared with that of randomly constructed LDPC codes.

In this paper, we propose password recovery attacks against challenge-response authentication protocols. Our attacks use a message difference for a MD5 collision attack proposed in IEICE 2008. First, we show how to efficiently find a message pair that collides with the above message difference. Second, we show that a password used in authenticated post office protocol (APOP) can be recovered practically. We also show that the password recovery attack can be applied to a session initiation protocol (SIP) and digest authentication. Our attack can recover up to the first 31 password characters in a short time and up to the first 60 characters faster than the naive search method. We have implemented our attack and confirmed that 31 characters can be successfully recovered.

The Green's function of free space for the fast inhomogeneous plane wave algorithm is represented by an integration in the complex plane. The error in the computational process is determined by the number of sampling points, the truncation of the integration path, and the extrapolation. Therefore, the error control method is different from that for the fast multipole method. We will discuss the worst-case interactions of the fast inhomogeneous plane wave algorithm for the box implementation and define the upper and lower bounds of the computational error.

In this paper, performance of a novel interference cancellation technique for the single user detection in a direct-sequence code-division multiple access (DS-CDMA) system has been investigated. This new algorithm is based on the Cycle-and-Add property of PN (Pseudorandom Noise) sequences and can be applied for both synchronous and asynchronous systems. The proposed strategy provides a simple method that can delete interference signals one by one in spite of the power levels of interferences. Therefore, it is possible to overcome the near-far problem (NFP) in a successive manner without using transmit power control (TPC) techniques. The validity of the proposed procedure is corroborated by computer simulations in additive white Gaussian noise (AWGN) and frequency-nonselective fading channels. Performance results indicate that the proposed receiver outperforms the conventional receiver and, in many cases, it does so with a considerable gain.

We investigate the symbol error rate (SER) of the cooperative transmission with the decode-and-forward relay protocol under Rayleigh fading channels. The technique of orthogonal space-time block coding (OSTBC) is applied at the links source-relay, source-destination and relay-destination. A closed-form SER expression is derived. Simulation results demonstrate the theoretical solutions.

This paper deals with a new formulation for the diffraction of a plane wave by a periodic grating. As a simple example, the diffraction of a transverse magnetic wave by a perfectly conductive periodic array of rectangular grooves is discussed. On the basis of a shadow hypothesis such that no diffraction takes place and only the reflection occurs with the reflection coefficient -1 at a low grazing limit of incident angle, this paper proposes the scattering factor as a new concept. In terms of the scattering factor, several new formulas on the diffraction amplitude, the diffraction efficiency and the optical theorem are obtained. It is newly found that the scattering factor is an even function due to the reciprocity. The diffraction efficiency is defined for a propagating incident wave as well as an evanescent incident wave. Then, it is theoretically found that the 0th order diffraction efficiency becomes unity and any other order diffraction efficiencies vanish when a real angle of incidence becomes low grazing. Numerical examples of the scattering factor and diffraction efficiency are illustrated in figures.

This paper addresses the problem of joint transceiver design for Tomlinson-Harashima Precoding (THP) in the multiuser multiple-input-multiple-output (MIMO) downlink under both perfect and imperfect channel state information at the transmitter (CSIT). For the case of perfect CSIT, we differ from the previous work by performing stream-wise (both inter-user and intra-user) interference pre-cancelation at the transmitter. A minimum total mean square error (MT-MSE) criterion is used to formulate our optimization problem. By some convex analysis of the problem, we obtain the necessary conditions for the optimal solution. An iterative algorithm is proposed to handle this problem and its convergence is proved. Then we extend our designed algorithm to the robust version by minimizing the conditional expectation of the T-MSE under imperfect CSIT. Simulation results are given to verify the efficacy of our proposed schemes and to show their superiorities over existing MMSE-based THP schemes.

Bolstering survivable backbone networks against multiple failures is becoming a common concern among telecom companies that need to continue services even when disasters occur. This paper presents a multiple-failure recovery scheme that considers the operation and management of optical paths. The presented scheme employs scheme escalation from pre-planned restoration to full rerouting. First, the survivability of this scheme against multiple failures is evaluated considering operational constraints such as route selection, resource allocation, and the recovery order of failed paths. The evaluation results show that scheme escalation provides a high level of survivability even under operational constraints, and this paper quantitatively clarifies the impact of these various operational constraints. In addition, the fundamental functions of the scheme escalation are implemented in the Generalized Multi-Protocol Label Switching control plane and verified in an optical-cross-connect-based network.

An inverse scattering problem of estimating the reflection coefficient and the surface impedance from two sets of absolute values of the near field with periodic change is investigated. The problem is formulated in terms of a nonlinear simultaneous equations which is derived from the relation between the two sets of absolute values and the field defined by a finite summation of the modal functions by applying the Fourier analysis. The reflection coefficient is estimated by solving the equations by Newton's method through the successive algorithm with the increment of the number of truncation in the summation one after another. Numerical examples are given and the accuracy of the estimation is discussed.

Traditional traffic analysis is can be performed online only when detection targets are well specified and are fairly primitive. Local processing at measurement point is discouraged as it would considerably affect major functionality of a network device. When traffic is analyzed at flow level, the notion of flow timeout generates differences in flow lifespan and impedes unbiased monitoring, where only n-top flows ordered by a certain metric are considered. This paper proposes an alternative manner of traffic analysis based on source IP aggregation. The method uses flows as basic building blocks but ignores timeouts, using short monitoring intervals instead. Multidimensional space of metrics obtained through IP aggregation, however, enhances capabilities of traffic analysis by facilitating detection of various anomalous conditions in traffic simultaneously.

We designed an asynchronous multi-bit one-time-programmable (OTP) memory which is useful for micro control units (MCUs) of general mobile devices, automobile appliances, power ICs, display ICs, and CMOS image sensors. A conventional OTP cell consists of an access transistor, a NMOS capacitor as antifuse, and a gate-grounded NMOS diode for electrostatic discharge (ESD) protection to store a single bit per cell. On the contrary, a newly proposed OTP cell consists of a PMOS program transistor, a NMOS read transistor, n NMOS capacitors as antifuses, and n NMOS switches selecting antifuse to store n bits per cell. We used logic supply voltage VDD (=1.5 V) and an external program voltage VPPE (=8.5 V). Also, we simplified the sens amplifier circuit by using the sense amplifier of clocked inverter type [3] instead of the conventional current sens amplifier [2]. The asynchronous multi-bit OTP of 128 bytes is designed with Magnachip 0.13 µm CMOS process. The layout area is 229.52495.78 µm2.

An odd composite number n for which an-1 ≡ 1 (mod n) for all integers a coprime to n is called a Carmichael number. This paper shows that some class of Carmichael numbers which have relatively large prime factors can be recognized in deterministic polynomial time under the assumption of the Extended Riemann Hypothesis (ERH). Also some related problems are discussed.