No abstract

No abstract

Abstract:The Elliptic Curve Digital Signature Algorithm (ECDSA) is the analog to the Digital Signature Algorithm (DSA). Based on the elliptic curve, which uses a small key compared to the others public-key algorithms, ECDSA is the most suitable scheme for environments where processor power and storage are limited. This paper focuses on the hardware implementation of the ECDSA over elliptic curves with the 163-bit key length recommended by the NIST (National Institute of Standards and Technology). It offers two services: signature generation and signature verification. The proposed processor integrates an ECC IP, a Secure Hash Standard 2 IP (SHA-2 Ip) and Random Number Generator IP (RNG IP). Thus, all IPs will be optimized, and different types of RNG will be implemented in order to choose the most appropriate one. A co-simulation was done to verify the ECDSA processor using MATLAB Software. All modules were implemented on a Xilinx Virtex 5 ML 50 FPGA platform; they require respectively 9670 slices, 2530 slices and 18,504 slices. FPGA implementations represent generally the first step for obtaining faster ASIC implementations. Further, the proposed design was also implemented on an ASIC CMOS 45-nm technology; it requires a 0.257 mm 2 area cell achieving a maximum frequency of 532 MHz and consumes 63.444 (mW). Furthermore, in this paper, we analyze the security of our proposed ECDSA processor against the no correctness check for input points and restart attacks.

The article proposes a new classification method based on implementing the high-speed search tools for the indexed data structure created on the etalon set of features, which has significant advantages in processing speed compared to the traditional approaches. The classifier is represented as twostage processing, where at the first stage the class for the separate object descriptor is determined, and at the second stage, the resulting class of the object is determined based on the obtained set of local solutions. The developed method is based on the preliminary construction of the indexed hash structures for the set of descriptors of the base of the etalon images. Implementing the hash representation allows for increasing the speed of identification or classification of visual objects. A comparative experiment with the traditional method of voting has been conducted, where the linear search for the nearest descriptor has been implemented for the identification without the use of prior creation of the indexed hash representation of the etalons. In the experiment, we have gained in processing speed for the developed method compared to the traditional over 10 times. The gain in processing speed increases proportionally with the number of the etalons and the number of the descriptors in the descriptions. The experiment has shown that the efficiency of the method can be enhanced by varying the values of its parameters and adapting to the properties of the data.

No abstract

Fixed alternate routing is a potential routing scheme for routing and spectrum allocation (RSA) in elastic optical networks (EON) which has less complexity and time consumption compared to adaptive routing scheme. However, adaptive routing scheme efficiently reduces the amount of network bandwidth blocking probabilities (BBPs) which uses traffic engineered paths and tunes according to the current network status. In this paper, an algorithm for routing is proposed for dynamic traffic in EON which works iteratively to arrange the pre-computed fixed alternate routes offline to incorporate link loading. During the offline process, the pre-computed routes are arranged with an objective to reduce link congestion and diverts lightpaths to the under-utilized links. The proposed scheme merges the properties of fixed alternate routing and adaptive routing and is utilized for dynamic traffic in EON. It has been shown through simulation results that the proposed scheme efficiently improves the performance of RSA in EON and reduces the amount of BBPs compared to the fixed alternate routing and an existing constrained-lower-indexed-block (CLIB) based adaptive routing algorithm. The proposed LCA greatly reduces congestion over all links during dynamic network operation and lowers congestion spikes over some links which occues in the existing alternate routing scheme in different network scenarios.

No abstract

In this paper, a diagonal permutation code is presented for spectral amplitude coding optical code division multiple access (SAC-OCDMA) employing a single photodiode (SPD) detection technique. It is characterized by practical code length and ideal in-phase cross correlation (CC) that results in multiple access interference (MAI) suppression. A diagonal permutation shift (DPS) code can be constructed using both prime codes and some matrix operations. In addition, it can be easily implemented as it exists for prime numbers P, which limits the addressing probability of codes to P2. Fiber Bragg gratings (FBGs) are used for code encoding and decoding. Simulation analysis that calibrates with BER, Q-factor, and eye diagram proves that DPS code using SPD technique is able to maintain error free transmission compared to the complementary detection scheme (CDS) technique. It is reported that a reduction of fiber Bragg grating (FBG) sets by 41.6% was achieved for SPD over CDS techniques.