The rapid growth of the Internet of Things (IoT) has contributed to significant challenges in dealing with congestion within IoT communications due to high packet error rates, latency, and interference in networks. With an emphasis on the Constrained Application Protocol (CoAP), the present study aims to propose the design and development of a novel congestion control mechanism, namely, Fast Response Congestion Control—Random Early Detection, abbreviated as FaCoCo-RED, along with performance analysis and comparison of congestion management efficacy between FaCoCo-RED and Default CoAP Congestion Control (Default CoAP CC) under a Cooja simulator on the Contiki OS platform. The findings from both experiment and performance analysis, which were based on statistical testing, showed that, under medium-scale to large-scale node networks across all traffic scenarios in this study, FaCoCo-RED significantly outperformed Default CoAP CC. The improvement can be seen in such metrics as average throughput, packet loss, response time, settling time, and retransmission timeout values (RTOs). The experimental findings also showed that FaCoCo-RED can perform effectively within the IoT networks, thus potentially enhancing the reliability and scalability of CoAP for large-scale and more complex IoT applications in the future.
1 January 2024 in Journal of Interdisciplinary Mathematics
In this research, a new technique based on quantum key distribution (QKD) is described to lower the likelihood that eavesdroppers can intercept two-party communications without being detected by the sender and the recipient. The central idea is to enhance BB84 by increasing two quantum gates, Pauli-X gate and Pauli-Z gate, on both the sender and receiver sides to change the direction of each quantum state. This signifies that three control parameters must be specified to control three gates on both sides, excluding the control parameter for the quantum gate that generates a random bit on the sender side. In fact, the possibility that eavesdroppers may discreetly capture the information is 0.5 for nearly all methods. However, the probability of information captured by an eavesdropper decreases to 0.25 when all conceivable cases from Tables 1 through 7 are considered. Therefore, the proposed technique for exchanging the secret key is more secure and should be chosen for the implementation.
Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modular operations in the LightSaber cryptosystem. Four polynomial multiplication algorithms, including Schoolbook, Karatsuba (128 and 64 splits), and Toom-3, are evaluated under both conventional and lazy reduction settings within the same polynomial ring domain. The experimental results show that lazy reduction reduces execution time across all evaluated algorithms. The reductions range from 44.52% to 59.15%. When the number of modular reduction operations is considered, they are reduced by more than 99% for Schoolbook and Karatsuba-based methods, and by 57.14% for Toom-3. Under lazy reduction, the number of modular reductions becomes identical across all algorithms. Among the evaluated coefficient-domain methods, Toom-3 achieved the lowest execution time. Karatsuba-based methods provide a more balanced trade-off between performance, memory usage, and structural complexity. This study further examines coefficient growth and evaluates the risk of overflow to ensure numerical reliability. All intermediate values remain within the range of signed 32-bit integers. Furthermore, lazy reduction leads to an increase in peak memory usage across all algorithms, with the most significant increase observed in Schoolbook, while more advanced methods exhibit only modest growth. Since this study focuses on coefficient-domain polynomial multiplication, transform-based approaches such as the Number Theoretic Transform (NTT) are beyond the scope of this work. NTT operates in a different computational domain and involves distinct implementation trade-offs. Accordingly, the reported performance comparisons are restricted to the coefficient-domain methods evaluated in this study. In addition, hardware-specific evaluations are beyond the scope of this work, because the primary objective is to provide an algorithm-level analysis of computational efficiency, modular reduction behavior, and numerical safety under controlled conditions. Under the evaluated Python implementation and the LightSaber parameter configuration, the results show that lazy reduction is an effective technique for reducing computational overhead in coefficient-domain polynomial multiplication. The observed performance remains dependent on the structural characteristics of each multiplication algorithm.
1 January 2024 in Journal of Interdisciplinary Mathematics
Because RSA is the cryptographic algorithm that is still extensively employed today, several attack techniques against RSA are continually being developed. These algorithms are divided into two distinct groups. The first group is a general group unaffected by RSA parameters. The other group is unique due to at least one characteristic that represents a vulnerability. The aim of this research is to reveal the new vulnerabilities in RSA and to provide ways for recovering the original plaintext. The first vulnerability occurs when the sum of the private key and Euler totient function is near to the modulus but lower than the modulus. If this result is found, it can be selected as the exponent which is called the fake key. The second situation occurs whenever the key is larger than the modulus. The experimental results indicate that if a new weak point is found, the fake key may be disclosed quickly despite the modulus’s size. In addition, when the sum of the public key and the Euler totient function is relatively near to the modulus, the proposed method can be also used to break the modulus. Additionally, the other vulnerability is demonstrated. It occurs when the product of the unknown integer j and the modulus is near to the addition of the key and the product of the other unknown integer and the Euler totient function. However, the issue with the second weak point is the mechanism for finding j.