The SubBytes operation in the Advanced Encryption Standard (AES) is a critical step performed over the extended field GF(28), defined using the irreducible polynomial p(x) = x8+x4+x3+x+1. However, its implementation using Look-Up Tables (LUTs) on Field Programmable Gate Arrays (FPGAs) is computationally intensive and resource-consuming. This poses a significant challenge for resource-constrained IoT devices, where efficient hardware utilization is critical. Previous studies have explored composite field arithmetic GF((24)2) to reduce complexity by mapping 8-bit elements from GF(28) to GF((24)2). Although these approaches reduce resource usage compared to traditional methods, they primarily rely on polynomial basis (PB)-based arithmetic, which still requires significant LUT resources. To address this limitation, this study proposes an advanced solution by optimizing inverse operations using polynomial ring representation (PRR) in the composite field. By decomposing 8-bit operations into 4-bit computations and leveraging PRR, the method significantly reduces LUT consumption while maintaining AES security and encryption throughput. Experimental validation on an FPGA demonstrates its feasibility for resource-constrained IoT applications, offering a practical and efficient approach to hardware-accelerated AES encryption.

This paper proposes a new exercise format for programming assignments called Quality Assurance Programming Exercises (QAEx), which incorporates the use of generative artificial intelligence (Al). In QAEx, students are allowed to use Al tools to generate solutions for programming problems and are also required to submit comprehensive test cases to validate these solutions. Students can use Al to create these test cases as well. The inclusion of Al in both solution development and testing underscores the importance of effective software testing and encourages students to engage more deeply with programming and quality assurance practices. A preliminary trial of QAEx was conducted to assess students' engagement and performance.

Random number generators (RNGs) are crucial in applications requiring unpredictable sequences, including cryptography, simulations, and gaming. Among the different types of RNGs, ring oscillator (RO)-based RNGs have gained popularity due to their simplicity, and suitability for FPGA implementation. Previous research by Wold et al. has suggested that connecting directly a D flip-flop (D-FF) to the RO circuit enhances randomness. However, the precise factors contributing to the improved randomness through the connection of the D-FF remain unclear. Then, we hypothesize that the D-FF acts as a synchronization circuit, enhances randomness. To verify this hypothesis, we design and implement RO-based RNG circuits with and without a D-FF directly connected to the RO circuit on an FPGA platform. By analyzing and comparing the bit distribution of the generated number sequences, we investigate the impact of the D-FF on the stability of the generated numbers. The results confirm that incorporating a D-FF into the RO-based RNG circuit stabilizes the random number sequence, leading to the conclusion that the D-FF plays a synchronization role in these circuits.

Software-defined networks (SDN) have become prominent technologies in recent times owing to their centralized network management, flexibility, and rapidity. The centralized structure of SDN architecture may introduce vulnerability and threat, which can affect normal users through resource depletion, decreased internet speeds, and memory consumption on controllers and switches. An efficient intrusion detection system (IDS) is required for actively monitoring and identifying malicious activities or potential threats within SDN networks. The current machine learning techniques in IDS often face challenges when dealing with imbalanced datasets. These datasets can lead to biased model performance toward the dominant class, causing inadequate detection of minority-class instances like anomalies or intrusions. Moreover, a large number of features in the dataset increases computational challenges and may adversely affect the model's performance. This work presents a deep learning-based technique generative adversarial networks (GAN) to generate synthetic data for balancing the imbalanced dataset issues in IDS. This helps in improving detection performance, especially for minority classes. The chi-square test based on statistics is also used to select the most significant features that enhance model performance and decrease both training and testing time. We evaluate the model's performance using multiple machine learning algorithms, including Naive Bayes (NB), Extra Trees (ET), Random Forest (RF), and XGBoost (XGB). Our evaluation demonstrates improved accuracy and reduced training and testing times across these algorithms. Notably, XGB achieves the highest accuracy$\mathbf{0. 9 9}$.

In this research, the choice of the parameter of the Montgomery trick in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The average number of generated rational points per unit time is chosen as a measure of the effectiveness of the choice of the parameter of the Montgomery trick. The results are derived from a sufficient number of experiments with several BN curves.

In this research, the choice of the parameter for a method to generate distinguished rational points in Pollard's Rho method to solve the elliptic curve discrete logarithm problem for Barreto-Naehrig (BN) curves is shown. The structures of random walk paths are confirmed by experiments for several BN curves. From the results, the authors clarify the conditions in which the Rho method does not stop during an attack, and the authors also show an indication for the choice of the parameter for the method to generate distinguished points with large bits of ECDLP.

With the matter of secure communication between devices, and especially for IoT devices, more and more applications need trustful protocols to communicate using public key cryptography. Elliptic curve cryptography is nowadays a very secure and efficient public key cryptography method. One of the most recent and secure curve is Curve25519 and one of its failure is attack on low-order elements during a Diffie-Hellman key exchange. This document demonstrates that an attack using an order 4 point is possible on an embedded system with a simple power analysis, pointing out every IoT using Curve255119 as a cryptographic method, a potential target to side-channel attacks.

In recent years, with the increase in physical distribution volume, unmanned transportation robots are expected as an alternative means of transporting baggage in factories and warehouses. The development of a control system for cooperative transportation by multiple robots is important when the objects to be transported are long and exceed the size and the weight limit. From this, we develop a control system for cooperative transportation using two robots independently driven by two wheels. In this paper, a communication system between two mobile robots and a host PC is constructed by using ROS, and a sub-goal is generated to each robot to realize a cooperative running with two robots. The effectiveness of the proposed method is verified through an experiment that the controlled point of an object is subject to a movement along the square of 1 m.

Abstract In this paper, we show efficient implementations of binary field multiplication over ARMv8. We exploit an advanced 64‐bit polynomial multiplication (PMULL) supported by ARMv8 and conduct multiple levels of asymptotically faster Karatsuba multiplication for polynomial multiplication. Finally, our method completed binary field multiplication within 57 and 153 clock cycles for B‐251 and B‐571 cases, respectively. Proposed method improves the speed‐performance by a factor of 4.5 times than previous techniques on same target platform. Copyright © 2016 John Wiley & Sons, Ltd.

In this article, we present a hybrid method to improve the performance of the Montgomery reduction by taking advantage of the Karatsuba technique. We divide the Montgomery reduction into two sub-parts, including one for the conventional Montgomery reduction and the other one for Karatsuba-aided multiplication. This approach reduces the multiplication complexity of n -limb Montgomery reduction from θ( n 2 + n ) to asymptotic complexity θ (7 n 2 /8 + n ). Our practical implementation results over an 8-bit microcontroller also show performance enhancements by 11%.

Several methods for finding a basis conversion matrix between two different bases in an extension field have been proposed. Among them, the one based on Gauss period normal basis (GNB) is on average the most efficient. However, since it needs to construct a certain tower field , some inefficient cases in which the towering degree becomes large have been reported. This paper first determines that such inefficient cases are caused by the GNB condition. In order to overcome this inefficiency, we propose a method that does not use any GNB in the target extension field , but instead uses a certain polynomial basis in derived by a certain small cyclic group in . This causes re- laxation of the condition for the towering degree . In addition, our experimental results show that the proposed method substantially accelerates the computation time for finding a basis conversion matrix.

Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rate and Xate pairings adopt a certain special rational point group with an efficient isomorphic mapping and then accelerate pairing-related operations such as a pairing calculation and a scalar multiplication. Based on cubic, quartic, and sextic twists, this paper shows how to activate these efficient techniques together with point compression on pairing-friendly curves of embedding degree 1.

Recently, efficient pairings such as optimal-ate, R-ate, and Xate pairings have been proposed. On the other hand, some pairing-based cryptographic protocols need several pairing calculations for one procedure. Thus, multi-pairing technique will be efficiently applied. This paper optimizes Xate pairing for multi-pairing and then evaluates its efficiency with comparing to the other efficient pairings. Then, it is shown that the multi-pairing with the optimized Xate pairing is the most efficient.

Self-dual normal basis is efficient for the arithmetic operations in extension field and especially trace calculation. However, self-dual normal bases do not exist in when characteristic p is odd and degree m is even. This paper proposes a method to construct an efficient normal basis for trace calculation when extension degree is even. In this paper, we call it pseudo self-dual normal basis.