Electronic commerce (E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method’s performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system’s quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method’s complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as $\mathrm{O}\left(ɲ\times \mathsf{\tau }\right)$which is higher than Rabin-P ($\mathrm{O}(ɲ))$ algorithms.

The advancements in communication speeds have enabled the centralized financial market to be faster and more complex than ever. The speed of the order execution has become exponentially faster when compared to the early days of electronic markets. Though the transaction speed has increased, the underlying architecture or models behind the markets have remained the same. These models come with their own disadvantages. The disadvantages are usually faced by non-institutional or small traders. The bigger players, such as financial institutions, have an advantage over smaller players because of factors such as information asymmetry and access to better infrastructure, which give them an advantage in terms of the speed of execution. This makes the centralized stock market an uneven playing field. This paper discusses the limitations of centralized financial markets, particularly the disadvantage faced by non-institutional or small traders due to information asymmetry and better infrastructure access by financial institutions. The authors propose the usage of blockchain technology and the data highway protocol to create a decentralized stock exchange that can potentially eliminate these disadvantages. The data highway protocol is used to generate new blocks with a flexible finality condition that allows for the consensus mechanism to configure security thresholds more freely. The proposed framework is compared with existing frameworks to confirm its effectiveness and identify areas that require improvement. The evaluation of the proposed approach showed that the improved highway protocol boosted the transaction rate compared to the other two mechanisms (PoS and PoW). Specifically, the transaction rate of the proposed model was found to be 2.2 times higher than that of PoS and 12 times higher than that of the PoW consensus model.

RSA is one among the most popular public key cryptographic algorithm for security systems. It is explored in the results that RSA is prone to factorization problem, since it is sharing common modulus and public key exponent. In this paper the concept of fake modulus and generalized Pell’s equation is used for enhancing the security of RSA. Using generalized Pell’s equation it is explored that public key exponent depends on several parameters, hence obtaining private key parameter itself is a big challenge. Fake modulus concept eliminates the distribution of common modulus, by replacing it with a prime integer, which will reduce the problem of factorization. It also emphasizes the algebraic cryptanalysis methods by exploring Fermat’s factorization, Wiener’s attack, and Trial and division attacks.

Plastics reinforced with glass fiber have a significant likelihood of being replaced by natural fiber hybrid composites (NFHCs). Making holes helps in part assembly, which is a crucial activity in the machining of composite constructions. As a result, choosing the right drill bit and cutting parameters is crucial to creating a precise and high-quality hole in composite materials. The present study employs the Taguchi approach to examine the delamination behavior and hole quality of ramie–bamboo composite laminates consisting of epoxy and nano-fillers (SiC, Al₂O₃) with feed, spindle speed, and three distinct drill bit types. Surface roughness and delamination are significantly influenced by feed and spindle speed, as indicated by the results of the analysis of variance. It was found that the spindle speed had a major impact on the delamination factor and surface roughness, while the feed and drill bit type had a minor influence. The surface roughness (76.5%) and delamination factor (66.7%) are significantly affected by the spindle speed.