Systolic finite field multiplier over GF(2m), because of its superior features such as high throughput and regularity, is highly desirable for many demanding cryptosystems. On the other side, however, obtaining high-performance systolic multiplier with relatively low hardware cost is still a challenging task due to the fact that the systolic structure usually involves large area complexity. Based on this consideration, in this paper, we propose to carry out two novel coherent interdependent efforts. First, a new digit-serial multiplication algorithm based on polynomial basis over binary field (GF(2m)) is proposed. Novel Toeplitz matrix-vector product (TMVP)-based decomposition strategy is employed to derive an efficient subquadratic space complexity. Second, The proposed algorithm is then innovatively mapped into a low-complexity systolic multiplier, which involves less area-time complexities than the existing ones. A series of resource optimization techniques also has been applied on the multiplier which optimizes further the proposed design (it is the first report on digit-serial systolic multiplier based on TMVP approach covering all irreducible polynomials, to the best of our knowledge). The following complexity analysis and comparison confirm the efficiency of the proposed multiplier, that is, it has lower area-delay product (ADP) than the existing ones. The extension of the proposed multiplier for bit-parallel implementation is also considered in this paper.

This paper introduces a novel free space optics (FSO) communication system for future-generation high-speed networks. The proposed system integrates orbital angular momentum (OAM) modes with an optical code division multiple access (OCDMA) technique. Two OAM beams are used ($L{G}_{0,0}$ and $L{G}_{0,10}$), each of which is used for transmitting three independent channels. Each channel is assigned by fixed right shift (FRS) codes and carries 10 Gbps of information data. The performance of the proposed model is evaluated under different foggy and dust storm conditions. Furthermore, the performance of two cities with different geographical locations, Alexandria city in Egypt and Srinagar city in India, is investigated to demonstrate its ability to be implemented in future generations. Bit error rate (BER), eye diagrams, received optical power (ROP), and channel capacity are used for studying the performance of the proposed system. The observed simulation results show successful transmission of 60 Gbps overall capacity with the longest propagation FSO range for Alexandria city, which is 1400 m. Because dust storms have a large attenuation when compared to different foggy conditions, the proposed model had the shortest propagation range of 315 m under low dust (LD), 105 m under moderate dust (MD), and 40 m under heavy dust (HD). Furthermore, the cloudy weather conditions that affect Srinagar city, which is considered a hilly area, make our suggested model achieve 1000 m.

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 curveswith 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 mm2 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.

Free Space Optics (FSO) has emerged as a viable solution to meet the growing demand for high bandwidth, secure data transmission, and high speed. However, the FSO system is highly susceptible to environmental factors, with precipitation in particular having a significant impact on FSO links. Optical loss, phase fluctuation, and multipath fading of the received optical power are all caused by these external factors. From this perspective, to improve the system’s performance in such conditions, a novel image encryption technique based on the Choquet Fuzzy Integral (CFI) in conjunction with the integer wavelet transform is proposed. The security of the proposed method is demonstrated via analysis security on the one, and its efficacy in terms of transmission performance of an encrypted image over an FSO channel exposed to rainy weather conditions is analyzed on the other. Authentic meteorological data from two distinct cities are considered to demonstrate the model’s real-world applicability: Alexandria, Egypt, in Africa, and Jeddah, Kingdom of Saudi Arabia (KSA), in Asia. To evaluate the system’s performance, a variety of metrics such as FSO range, Signal-to-Noise Ratio (SNR), Peak Signal-to-Noise Ratio (PSNR), and the Structural Similarity Index Method (SSIM) are used. Furthermore, the findings from studying the impact of weather conditions reveal that, as the intensity of rainfall increases, the encrypted image experiences a reduction in its propagation range within the FSO channel. For example, under heavy rain (HR) conditions, the maximum FSO range for high-quality received encrypted images is 1055 m, which extends to 2290 m as rain intensity decreases (for light rain). In terms of the two cities, Jeddah, with its lower average rainfall intensity compared to Alexandria, allows the encrypted image to travel an additional 2400 m.

With the rapid evolution of security technology, small field-size elliptic curve-based point multiplication (PM) has gradually become obsolete, leading to the implementation of PM with large field sizes. From this perspective, in this article, through a novel algorithm-architecture co-design strategy, we propose an efficient implementation of the PM on the elliptic curve over GF(2 $^m)$ (particularly targeting large field sizes). To achieve an area-time-efficient elliptic curve cryptography (ECC) processor implementation on the field-programmable gate array (FPGA) platform, we have proposed a bottom-up approach based on three coherent interdependent layers of efforts. First, we proposed an efficient digit-serial versatile multiplier (DSVM) based on polynomial representation. The system is built using the four-way overlap-free Karatsuba algorithm (OFKA) and a modified radix-n interleaved multiplication (mRnIM) technique (for area and time complexities reduction). Of course, the efficiency of the proposed multiplier is demonstrated by the complexity analysis and comparison with the existing reported designs. Second, we have adopted the López–Dahab (LD) Montgomery PM algorithm to avoid data dependency and enhance signal control in the ECC design. Meanwhile, a series of resource optimization techniques have also been adopted for the proposed ECC processor to optimize the overall design efficiency further. Third, the proposed ECC PM architecture is then implemented on the FPGA platform, showing that the proposed ECC crypto-processor obtains the least area-delay product (ADP) among all the existing structures for the large field sizes.

In this paper, we present a new algorithm to generate two-dimensional (2D) permutation vectors’ (PV) code for incoherent optical code division multiple access (OCDMA) system to suppress multiple access interference (MAI) and system complexity. The proposed code design approach is based on wavelength-hopping time-spreading (WHTS) technique for code generation. All possible combinations of PV code sets were attained by employing all permutations of the vectors with repetition of each vector weight (W) times. Further, 2D-PV code set was constructed by combining two code sequences of the 1D-PV code. The transmitter-receiver architecture of 2D-PV code-based WHTS OCDMA system is presented. Results indicated that the 2D-PV code provides increased cardinality by eliminating phase-induced intensity noise (PIIN) effects and multiple user data can be transmitted with minimum likelihood of interference. Simulation results validated the proposed system for an agreeable bit error rate (BER) of 10⁻⁹.