Counting the number of points of Jacobian varieties of hyperelliptic curves over finite fields is necessary for construction of hyperelliptic curve cryptosystems. Recently Gaudry and Harley proposed a practical scheme for point counting of hyperelliptic curves. Their scheme consists of two parts: firstly to compute the residue modulo a positive integer m of the order of a given Jacobian variety, and then search for the order by a square-root algorithm. In particular, the parallelized Pollard's lambda-method was used as the square-root algorithm, which took 50CPU days to compute an order of 127 bits. This paper shows a new variation of the baby step giant step algorithm to improve the square-root algorithm part in the Gaudry-Harley scheme. With knowledge of the residue modulo m of the characteristic polynomial of the Frobenius endomorphism of a Jacobian variety, the proposed algorithm provides a speed up by a factor m, instead of in square-root algorithms. Moreover, implementation results of the proposed algorithm is presented including a 135-bit prime order computed about 15 hours on Alpha 21264/667 MHz and a 160-bit order.

The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.

The certified discrete logarithm problem modulo p prime is a discrete logarithm problem under the conditions that the complete factorization of p-1 is given and by which the base g is certified to be a primitive root mod p. For the cryptosystems based on the intractability of certified discrete logarithm problem, Sakurai-Shizuya showed that breaking the Diffie-Hellman key exchange scheme reduces to breaking the Shamir 3-pass key transmission scheme with respect to the expected polynomial-time Turing reducibility. In this paper, we show that we can remove randomness from the reduction above, and replace the reducibility with the polynomial-time many-one. Since the converse reduction is known to hold with respect to the polynomial-time many-one reducibility, our result gives a stronger evidence for that the two schemes are completely equivalent as certified discrete log cryptosystems.

We demonstrate a mode-locked fiber laser (MLFL) method for measuring the chromatic dispersion of long transmission fiber. In this method, device under test (DUT) is inserted in the laser cavity, and the chromatic dispersion is measured by the shift of mode-locking frequency when the lasing wavelength is changed. The experimental results of the MLFL method for a 5km-long single-mode fiber had good agreement with the conventional phase-shift method.

In this paper, we present an Internet personal live-broadcasting server system. Our solution is not only for experts but also for amateur users who want to broadcast using simple multimedia equipment. For scalable broadcasting services, we developed multiple-channel establishment and channel expansion. Concurrent services for a large number of broadcasting channels are effectively provided. Also, the capacity of channels can be expanded as the number of participants increases. Furthermore, for the sake of complete live broadcasting with high-quality transmission, the system supports both TCP (transmission control protocol) and UDP (user datagram protocol) according to the status of network environments as well as the received packet loss in the user system. The performance of the system is effectively evaluated at such practical commercial sites as well-known community and E-business sites.

This paper describes the scalability of a full-mesh wavelength division multiplexing star-structure network based on an arrayed-waveguide grating router (AWG-STAR). The scalability of the network is examined experimentally. A power penalty of 0.1dB is obtained with a 32-node network and an estimated scalability of up to 100 nodes is confirmed.

In this paper, we examine the basic properties of n-th order linear feedback shift registers and show that n-th order shift registers based discrete logarithm problem is equivalent to discrete logarithm problem. This shows that the algebraic structure of n-th order linear feedback shift registers is useful in constructing cryptographic primitives.

A type of carbon nanoform (carbon nanowalls: CNWs) has been successfully deposited on both Ni wafers and Ni wires using dc plasma chemical-vapor-deposition (CVD) method. Transmission electron microscopy (TEM) and Raman spectroscopy were used to characterize CNWs' microstructure. It is found that CNWs are well crystallized, and each CNW consists of several pieces of curved graphene sheets, presenting a quasi-two-dimensional geometry. The average length and width of CNWs are about 2-4µm, while their thickness is less than 7nm. Field emission measurement showed that such CNW films exhibited the excellent electron emission efficiency, comparable to the high-grade carbon nanotube (CNT) emitters. The threshold field defined as the field to obtained 1µA/cm2 is less than 1V/µm and the electrical field for 1mA/cm2 current density is only about 1.5V/µm. Moreover, the CNWs have stable emission behaviors, and we have successfully fabricated a kind of high-brightness lamps based on the CNW coated Ni wires.

Control scheme for accurately optimizing (and also automatically stabilizing) the interferometer phase bias of Symmetric-Mach-Zehnder (SMZ)-type ultrafast all-optical switches is proposed. In this control scheme, a weak cw light is used as a supervisory input light and its spectral power ratio at the switch output is used as a bipolar error signal. Our experimental result at 168-Gb/s 16:1 demultiplexing with a hybrid-integrated SMZ switch indicates the feasibility and the sensitivity of this control scheme.

The conventional describing function of Coulo-mb friction is based on the assumption that the reference input is constant. The author proposes the describing function of Coulomb friction for the ramp reference input. The experimental results for the DC servo motor control system with ramp tracking controller are shown.

This paper proposes a wireless scheduling algorithm that can provide the Internet with delay proportional differentiated services in wireless networks. When considering wireless network environments that include burst and location-dependent channel errors, the proposed WDPS (Wireless Delay Proportional Service) scheduling algorithm can adaptively serve packets in class queues based on the delivered delay performance for each class. The significant characteristics of the WDPS scheduler include support for a fair relative delay service, the provision of graceful throughput and delay compensations, and the avoidance of class queue-blocking problems. Simulations show that the proposed algorithm can achieve the desirable properties for providing delay proportional services in wireless networks.

Datacycle is an information delivery system designed in Bellcore . It uses broadcast delivery and multiple channels of an optical fiber to provide a large volume of information to many users. In this system, the mean access time depends on the broadcast delivery schedule because different information items (called pages) may have different popularity and there are multiple channels for concurrent broadcast delivery. In this paper, we design broadcast delivery schedules for M channels where M 2 and our objective is to minimize the mean access time. We show that this design problem can be divided into two subproblems: (1) divide the pages into M partitions such that the pages of each partition are broadcast in a distinct channel and (2) determine a broadcast schedule for the pages of each partition. We analyze and solve these subproblems, and we demonstrate that the schedules found can nearly reach a lower bound on the minimal mean access time.

We propose a simple technique for reducing the jitter of the output clock generated in the clock recovery circuit (CRC) for burst-mode data transmission. By using this technique, the proposed CRC based on the gated oscillator (GO) can recover the output clock with a low-jitter even when there are consecutive same data streams encountered in the system. The circuit is composed only of digital logic devices and can recover the input data errorless until 1,000 consecutive same data bits are incoming.

In fast frequency hopped (FFH) non-coherent MFSK systems, the diversity combining scheme can be used effectively in order to combat the interference, especially jamming noise. In this paper, we simulate and discuss the BER performance of FH/MFSK system for different diversity combining schemes, such as linear combining, clipped-linear combining, normalized envelop detection (NED), order statistics (OS) NED and product combining receiver (PCR), in the presence of both the worst case partial band jamming (PBJ) and the fading channel. The performances of those combining schemes except for linear combining are similar each other in the worst case PBJ without the fading. In the existence of both the worst case PBJ and the fading channel, the clipped-linear combining scheme suffers a larger drop in performance than other combining schemes. It is noteworthy that the performances of OSNED and PCR are the best in Rayleigh fading channel among those combining schemes.

In this study, wave propagation phenomena of phase differences observed in van der Pol oscillators coupled by inductors as a ladder are investigated. The phenomena are called "phase waves. " We classify the observed phenomena and analyze the difference in detail. We observe that the behavior of the phase waves generated by giving a phase difference of positive value is different from the behavior of those generated by giving a phase difference of negative value. We can also observe the generation of two pairs of phase waves. We clarify the mechanisms of these complicated phenomena. Finally, for the case of nine oscillators, we carry out both computer calculations and circuit experiments. Circuit experimental results agree well with computer calculated results qualitatively.

Following the developments in the use of ID-based schemes and smart cards, Yang and Shieh proposed two password authentication schemes to achieve two purposes: (1) to allow users to choose and change their passwords freely, and (2) to make it unnecessary for the remote server to maintain a directory of passwords or a verification table to authenticate users. Recently, Chan and Cheng showed that Yang and Shieh's timestamp-based password authentication scheme is insecure against forgery. In this paper, we point out that Chan and Cheng's forgery attack can not work. Thus, we further examine the security of Yang and Shieh's password authentication schemes and find that they are insecure against forgery because one adversary can easily pretend to be a valid user and pass the server's verification which allows the adversary to login to the the remote server.

This paper describes an ultra low power, motion estimation (ME) processor for MPEG2 HDTV resolution video. It adopts a Gradient Descent Search (GDS) algorithm that drastically reduces required computational power to 6 GOPS. A SIMD datapath architecture optimized for the GDS algorithm decreases the clock frequency and operating voltage. A low power 3-port SRAM with a write-disturb-free cell array arrangement is newly designed for image data caches of the processor. The proposed ME processor contains 7-M transistors, integrated in 4.50 mm 3.35 mm area using 0.13 µm CMOS technology. Estimated power consumption is less than 100 mW at 81 MHz@1.0 V. The processor is applicable to a portable HDTV system.

This letter presents a Monte-Carlo FDTD technique to determine the scattered field from a perfectly conducting fractal surface from which the useful information on the incoherent pattern tendency could be observed. A one-dimensional fractal surface was generated by the bandlimited Weierstrass function. In order to verify the numerical results by this technique, these results are compared with those of Kirchhoff approximations, which show a good match between them. To investigate the incoherent pattern tendency involved, the dependence of the fitting curve slope on the different D and is discussed for the bistatic and back scattering case, respectively.

This paper presents a maximum likelihood (ML) identification and restoration method for noisy blurred images. The unitary discrete sine transform (DST) is employed to decouple the large order spatial state-space representation of the noisy blurred image into a bank of one-dimensional real state-space scalar subsystems. By assuming that the noises are Gaussian distributed processes, the maximum likelihood estimation technique using the expectation-maximization (EM) algorithm is developed to jointly identify the blurring functions, the image model parameters and the noise variances. In order to improve the computational efficiency, the conventional Kalman smoother is incorporated to give the estimates. The identification process also yields the estimates of transformed image data, from which the original image is restored by the inverse DST. The experimental results show the effectiveness of the proposed method and its superiority over the recently proposed spatial domain DFT-based methods.

In this letter, we investigate a diversity scheme which employs a simple transform, symbol interleaving and decision-feedback differential detection (DF-DD) for differential phase-shift-keying signal transmission over correlated Rayleigh fading. The proposed scheme merits instinct time diversity within each transmitted block and thus presents patent resistance to fading. It is shown that the considered technique provides significant diversity gains in a correlated Rayleigh fading channel.