Modular addition is a fundamental operation in public-key cryptographic algorithms operating in finite fields, such as elliptic curve cryptography (ECC), Chebyshev polynomials, and post-quantum cryptography (PQC). The performance of these cryptographic algorithms is limited by the conventional modular adder approach, which incorporates two cascaded adders in series. This approach leads to a doubled critical path delay, ultimately causing a decrease in frequency despite utilizing a high-performance adder. This research presents a high-performance, low-area architecture for a modular adder, employing a novel approach. Specifically designed for various prime fields recommended in public key cryptography, the architecture optimally utilizes the carry chain and exploits the structural advantages of the 7-series field programmable gate array and series beyond. Implementation results demonstrate superior performance, achieving operating frequencies of 290.0 MHz for 192 bits and 205.5 MHz for 1024 bits. Notably, the proposed design performs modular addition in a single clock cycle, resulting in an approximate 57% frequency enhancement compared to the conventional approach. Consequently, this architecture stands as an optimal solution for systems demanding high-speed operations.

Cognitive radio (CR) technology is getting extensive attention to eliminate the problem of spectrum scarcity. This technology is based on Software Defined Radio (SDR) and some integrated intelligent functions such as spectrum sensing. This function is one of the crucial elements and its hardware implementation is important for the practical realization of the CR. This paper presents experimental results of the hardware implementation of the Goodness of Fit (GoF) based sensing for CR. Universal Software Radio Peripheral platform (USRP) is used for the experiments conducted. The choice of GoF based sensing for detecting spectrum holes is motivated by the advantage of requiring fewer samples to achieve the same sensing performance compared to Energy Detector (ED). Besides, the analytical expressions for the theoretical detection performance are derived. Computer simulations are carried out to evaluate the impact of fading channels on GoF based sensing. Numerical results confirm that the proposed GoF based sensing method outperform ED under fading channels. Furthermore, theoretical results of GoF based spectrum sensing are validated experimentally taking into account some parameters such as sample rate and sensing time. Finally, several scenarios of wideband GoF based sensing are considered to demonstrate the strengths of the considered method.

In this paper, a new algorithm combined compression and image encryption is presented. The proposed algorithm can be used in the field of high-speed confidential data transmission where security is required. The compression is based on a hierarchical structure called SPIHT(Set Partitioning in Hierarchical Trees). This compression is followed by an encryption scheme PSCS (Parametric Switching Chaotic System). The performances of this technique were evaluated in terms of compression quality and data security. Simulation results have shown the effectiveness of this technique, and thereafter, it is ready for a hardware implementation.

In this paper, we propose an interesting and original solution to the problem of chaotic synchronization which is focused in its high sensitivity to channel noise. We demonstrate through experimental design, the synchronization of tow embedded hyperchaotic Lorenz generators implemented separately in two FPGA circuits. The basic idea of the proposed solution consists of synchronizing two hyperchaotic systems without perturbing the hyperchaotic dynamic of the slave system. This means that, in an eventual wireless hyperchaotic communication system, whatever the perturbations suffered by the transmitted hyperchaotic carrier (drive signal) through the channel, our solution permits to generate an identical copy of the hyperchaotic carrier at the receiver and then recover the information signal correctly.