This paper describes a finite element method to obtain an accurate solution of the scalar Helmholtz equation with field singularities. It is known that the spatial derivatives of the eigenfunction of the scalar Helmholtz equation become infinite under certain conditions. These field singularities under mine the accuracy of the numerical solutions obtained by conventional finite element methods based on piecewise polynomials. In this paper, a regularized eigenfunction is introduced by subtracting the field singularities from the original eigenfunction. The finite element method formulated in terms of the regularized eigenfunction is expected to improve the accuracy and convergence of the numerical solutions. The finite element matrices for the present method can be easily evaluated since they do not involve any singular integrands. Moreover, the Dirichlet-type boundary conditions are explicitly imposed on the variables using a transform matrix while the Neumann-type boundary conditions are implicitly imposed in the functional. The numerical results for three test problems show that the present method clearly improves the accuracy of the numerical solutions.

RDES cryptosystem is an n-round DES in which an probabilistic swapping is added onto the right half of the input in each round. It is more effective than a simple increase of DES rounds for a countermeasure against differential attack. In this paper, we show that the RDES is also effective against linear cryptanalysis. We applied Matsui's search algorithm to find the best expression for RDES-1 and RDES-2. The results are as follows: (a) The 16-round RDES-1 is approximately as strong as a 22-round DES, and the 16-round RDES-2 is approximately as strong as a 29-round DES. (b) Linear cryptanalysis for a 16-round RDES-1 and a 16-round RDES-2 requires more than 264 known-plaintexts.

GDL is the language whose membership problerm is polynomial-time Turing equivalent to the discrete logarithm problem for a general finite group G. This paper gives a characterization of GDL from the viewpoint of computational complexity theory. It is shown that GDL NP co-AM, assuming that G is in NP co-NP, and that the group law operation of G can be executed in polynomial time of the element size. Furthermore, as a natural probabilistic extension, the complexity of GDL is investigated under the assumption that the group law operation is executed in an expected polynomial time of the element size. In this case, it is shown that GDL MA co-AM if G MA co-MA. As a consequence, we show that GDL is not NP-complete unless the polynomial time hierarchy collapses to the second level.

Computer viruses, hackers, intrusions and ther computer crimes have recently become a serious security problem in information systems. Digital signatures are useful to defend against these threats, especially against computer viruses. This is because a modification of a file can be detected by checking the consistency of the originai file with its accompanying digital signature. But an executable program might have been infected with the viruses before the signature was created. In this case, the infection cannot be detected by signature verification and the origin of the infection cannot be specified either. In this paper, we propose a signature scheme in which one can sign right after the creation of an executable program. That is, when a user compiles a source program, the compiler automatically creates both the executable program and its signature. Thus viruses cannot infect the executable programs without detection. Moreover, we can specify the creator of contaminated executable programs. In our signature scheme, a signature is created from a set of secret integers stored in a compiler, which is calculated from a compiler-maker's secret key. Each compiler is possessed by only one user and it is used only when a secret value is fed into it. In this way a signature of an executable program and the compiler-owner are linked to each other. Despite these measures, an executable program could run abnormally because of an infection in prepro-cessing step, e.g. an infection of library files or included files. An infection of these files is detected by ordinary digital signatures. The proposed signature scheme together with digital signature against infection in the preprocessing step enables us to specify the origin of the infection. The name of the signature creator is not necessary for detecting an infection. So, an owner's public value is not searched in our scheme, and only a public value of a compiler-maker is required for signature verification. Furthermore, no one can use a compiler owned by another to create a proper signature.

This paper discusses a software verification support environment Vega which is based on a model-theoretic methodology that enables verification support for the temporal properties of protocol specifications described in the formal description technique LOTOS. In the methodology of Vega, a protocol specification is defined through the LOTOS process reflecting its practical system structure. The temporal properties to be verified are given as the requirement which the protocol needs to satisfy from the viewpoint of events and are formulated by using the branching time temporal logic defined in this paper. Verification is done by determining whether or not the given temporal properties are satisfied by the model, which corresponds to the transition system derived from the LOTOS specification of the protocol. Vega is provided with an effective interface function, as well as the function of simple model checking based on the above methodology, to give some degree of flexibility for the expression of temporal properties to be verified. Specifically, it allows the user to define useful expressions by combining builtin temporal logic formulas and enter them in Vega for use at any time. With the provision of these functions, Vega is expected to serve as a very powerful and flexible verification support tool.

In this paper we discuss the relation between a one-way group homomorphism and a one-way ring homomorphism. Let U,V be finite abelian groups with #U=n. We show that if there exists a one-way group homomorphism f:UV, then there exists a one-way ring homomorphism F:ZnUZnImf. We also give examples of such ring homomorphisms which are one-way under a standard cryptographic assumption. This implies that there is an affirmative solution to an extended version of the open question raised by Feigenbaum and Merrit: Is there an encryption function f such that both f(x+y) and f(xy) can be efficiently computed from f(x) and f(y)? A multiple signature scheme is also given as an application of one-way ring homomorphisms.

This paper discusses the problem of reducing the number of keys required to authenticate a source state (plaintext), as well as introducing a new way of constructing authentication codes. The construction uses association schemes, which are well-defined schemes in combinatorial design theory. The association scheme on the message (ciphertext) space is established by defining two relations between any two messages: The 1st relation is when the two messages do not share a common key, and the 2nd relation is when they do. Using association schemes of the triangular and group divisible types, we are able to reduce the number of keys.

We describe the design, fabrication, and characteristics of a push-pull type ridged Ti:LiNbO3 optical modulator with two electrodes. The structure keeps microwave propagation loss low and enables a large interaction between microwaves and optical waves under the condition of velocity and impedance matching, resulting in a large modulation bandwidth and low driving voltage. Using this structure, we have developed an optical intensity modulator with an optical 3-dB bandwidth of 45 GHz (an electrical 3-dB bandwidth of 30 GHz) and a half-wave voltage of 3.9 V in single-electdoe operation (a half-wave voltage of 1.95 V in push-pull operation)at a wavelength of 1.55µm.

External modulators, which have smaller chirping characteristics than laser diode direct modulation, are desired for high-speed and long-distance optical fiber communication systems. This paper reviews semiconductor and Ti:LiNbO3 guided-wave high-speed optical modulators. Since several effects exist for semiconductor materials, various kinds of semiconductor optical modulators have been investigated. Among these, absorption type intensity modulators based on Franz-Keldysh effect in bulk materials and quantum confined stark effect in multiple quantum well materials, are promising because of compactness, low drive voltage nature and integration ease with DFB lasers. Recent progress on semiconductor absorption modulators and DFB-LD integrated semiconductor modulators is discussed with emphasis on a novel fabrication method using selective area growth by MOVPE (Metal Organic Vapor Phase Epitaxy). The Ti:LiNbO3 optical modulators are also important, due to the advantage of superior chirping characteristics and wide bandwidth. Since the Ti:LiNbO3 optical modulator has low propagation loss and low conductor loss natures for optical waves and microwaves, respectively, the traveling-wave electrode configuration is suitable for high-speed operation. Here, broadband Ti:LiNbO3 optical modulators are discussed with emphasis on traveling-wave electrode design.

This paper proposes a novel optical modulator for a millimeter wave (MMW) subcarrier optic link. The modulator enables the bi-phase modulation of MMW subcarriers. It simplifies the optic link by unifying such functions as IF modulation, up-convertion to MMW, and optical modulation, which are separately equipped in a conventional system. A simple model of a Mach-Zehnder external optical modulator (EOM) is used to illustrate how bi-phase modulation of millimeter wave (MMW) subcarriers can be accomplished by switching the EOM bias with a binary data signal. Experimental results are presented to confirm predictions. A wideband communications test system employing the EOM as a bi-phase modulator and utilizing spread spectrum modulation (1.3 µm optical wavelength, 40 GHz subcarrier, 100 MHz chip rate, 10MHz data rate) was developed. Bit error rate (BER) characteristics of an optical link that includes the proposed modulator are presented and compared with ideal performance and simulated predictions. Degradation of the BER characteristics from the simulation was less than 1 dB at a BER of 10-6. A frequency doubling subcarrier bi-phase modulator is also described.

In this paper, we propose to use graded-index multimode fibers (GI-MMFs) with Fabry-Perot laser diodes (FP-LDs) for short-span and low-cost feeders. The multimode fiber feeders can be applied to wireless personal communication systems where the required feeder length is within several hundred meters, such as distributed antenna networks for microcellular systems or wireless LANs. The use of multimode fibers makes fiber coupling and connection easier, and has the potential to greatly reduce total system cost. Three types of GI-MMFs are considered as transmission media, (1) silica-based glass optical fiber (GI-GOF),(2) silica-core plastic-clad fiber (GI-PCF), and (3) all-plastic optical fiber (GI-POF). It is shown that GI-GOF and GI-PCF are suitable for use as feeders in the microcells of CDMA cellular and wireless LAN systems within 300m in length. GI-POF is estimated to be suitable for use as feeders in wireless LANs within 100m in length. A multimode fiber feeder with FP-LDs and GI-PCF of 300 m is developed in order to demonstrate its applicability to a wireless LAN system operating in the 2.4 GHz ISM band.

In ITU-T Recommendation I.371, the Generic Cell Rate Algorithm (GCRA) is used to define Peak Cell Rate for the ATM network. It is further applied by the ATM Forum '93 to define Sustainable Cell Rate and Burst Tolerance so as to facilitate Usage Parameter Control and Network Parameter Control. To judge the validity of a cell according to declared GCRA parameters, the enforcer must read the clock time when the cell arrives. However, the clock of the enforcer would roll over frequently and accordingly the judgment would be incorrect. On the other hand, for a shaper in a customer premise node to dispatch cells conforming to the declared GCRA parameters, the clock would also roll over and the cell would not be dispatched correctly. To overcome the problems induced by clock roll-over, based on "time difference" concept, we propose two modified GCRA's for the enforcer and shaper, respectively. According to the proposed algorithms, we design a feasible architecture for a multi-connection shaper and simplify it for an enforcer. They are proven to perform well in spite of the inherent clock roll-over characteristics. By simulation, we evaluate the delay in the shaper and the loss in the enforcer. The features of the architectures are also discussed.

A design method of 2-D lattice digital filter using the Genetic Algorithm (GA) is proposed. By using the GA. 2-D all-pole lattice filter with the cascade connection of transversal (all-zoro) filter is designed directly from a given desired frequency responce.

In 1980, Hellman presented "time-memory trade-off cryptanalysis" for block ciphers, which requires precomputation equivalent to time complexity of exhaustive search, but can drastically reduce both time complexity on intercepted ciphertexts of exhaustive search and space complexity of table lookup. This paper extends his cryptanalysis and optimizes a relation among the breaking cost, time, and success probability. The power of the optimized cryptanalytic method can be demonstrated by the estimates as of January 1995 in the following. For breaking DES in one hour with success probability of 50% or more, the estimated cost of a simple and a highly parallel machine is respectively about 0.26[million dollars] and 0.06[million dollars]. Also it takes about six and two years respectively until each machine costs for breaking FEAL-32 on the same condition decreases to 1[million dollars]. Moreover, it takes about 22.5 and 19[years] respectively until each costs for breaking Skipjack similarly decreases to 1[million dollars], but time complexity of precomputation is huge in case of the former. The cost-time product for this precomputation will decrease to 20[million dollarsyears] in about 30[years].

An optoelectronic beam forming network (BFN) is presented for a single beam, 3-element phased array antenna that utilizes electrically controllable birefringence mode nematic liquid-crystal cells (ECB mode NLC cells) for phase shifting and amplitude control. In the circuit, a microwave signal is carried by a pair of orthogonal linearly polarized lightwaves (signal and reference lightwaves) using the optical heterodyning technique. Birefringence of liquid-crystals is utilized to selectively control the phase of the signal and reference lightwaves. Because an interferometer is formed on a single signal path, the complexity of the optical circuit is much reduced, compared to the BFNs based on arrays of Mach-Zender interferometers. A prototype circuit is built using laser sources of 1.3 µm, and its performance experimentally examined. With small deviations among the three cells, phase shifts of up to 240 degrees are achived for MW signals from 0.9 GHz to 20 GHz with good stability; attenuation of more than 18dB is achieved. An optoelectronic technique for parallel control of amplitude and phase of MW signals was developed.

Parallel processing is a well-known approach to enhance the performance of communication subsystems. The several forms of parallelism embedded in communication protocols have been applied to the OSI protocol stack. However, the OSI protocol stack involves sequential processing due to the layered architecture. Thus, all the layers have been prevented from performing immediate processing as soon as the data arrives. To solve the problem, we apply a Multiple Instruction Single Data (MISD) parallel scheme to OSI processing for the network layer through the presentation layer. In the MISD scheme, different processors can be allocated to different layers and concurrently run the code for each layer. In contrast, the conventional approach adopts for a pipeline scheme that all the layers can be assigned to different pipeline stages and will be performed in a time interval and their dependence. The implementations have been performed to compare the pipeline scheme with the MISD scheme on the Parsytec Super Cluster consisting of 64 Transputers. The measures show that the MISD scheme has performance improvement as high as about 84% in comparison with the pipeline one.

Experimental demonstrations of congestion avoidance network are described. These test results show the feasibility of multi-media services in wide area networks; no congestion and fair band sharing are achieved with almost 716km optical fiber propagation delay.

We have developed a method to automatically generate a multi-input-adder circuit for an irregular array of partial products. "FASTOOL," an FIR Filter Automatic Synthesis TOOL for an HDL design environment, is proposed for use with this method and with conventional filter coefficient design programs. Filter design from specifications to the structure of Verilog-HDL has been automated. It is possible for a system designer to quickly perform filter LSI optimization by balancing cost and performance.

This paper discusses and evaluates an effect of cell level FEC (Forward Error Correction) capability on error-free (i.e. reliable) IP multicast service over ATM networks. In the error-free IP multicast service, every receiver is delivered IP packet from the sender synchronously. Without applying the FEC policy, the expected IP packet error/loss probability becomes large, when the number of multicast receivers is large. For example, when the cell error/loss probability of each ATM data-link segment is 10-6 and the number of receivers is 103, the IP packet error/loss probability observed at the sender is about 0.5, which means that about 50% of IP packet sent from the sender will be subject to retransmission. One possible solution would be using the intermediate multicast-TCP entities, that terminate TCP protocol, among the sender and the receivers. However, this approach requires the additional entities within the network and can not provide the ordered message delivery for a multipoint-to-multipoint communication. On the contrary, with applying the FEC policy, the expected IP packet error/loss probability is dramatically reduced. Therefore, an error-free IP multicast service can be provided with a simple architecture, even when the number of multicast receiver is large, e.g. 105. For example, when the cell error/loss probability of each ATM data-link segment is 10-6, the packet error/loss probability observed at the sender is less than 10-2 even for 106 receivers. Finally, even when the cell error/loss probability of ATM data-link segment is large, e.g. 10-3, the IP multicast service without the FEC policy can not apply even for 10 receivers. However, the IP multicast with the FEC policy can apply upto few hundred of receivers.

In arithmetic units multiplication is a very important operation. It is a common approach to use the modified Booth's algorithm to reduce the number of partial products in a multiplication and speed it up. In this letter we show two circuits that fuse the usually separate functions of generating the partial products and selecting them. The circuits designed in DPL (Double Pass-transistor Logic) are bigger in MOS transistors, but are faster and, function at higher frequencies than a typical CMOS implementation. One of our circuits also has lower power consumption.