Search

We show the following hold, unconditionally unless otherwise stated, relative to a random oracle: — There are NP search problems solvable by quantum polynomial-time (QPT) machines but not classical probabilistic polynomial-time (PPT) machines. — There exist functions that are one-way, and even collision resistant, against classical adversaries but are easily inverted quantumly. Similar counterexamples exist for digital signatures and CPA-secure public key encryption (the latter requiring the assumption of a classically CPA-secure encryption scheme). Interestingly, the counterexample does not necessarily extend to the case of other cryptographic objects such as PRGs. — There are unconditional publicly verifiable proofs of quantumness with the minimal rounds of interaction: for uniform adversaries, the proofs are non-interactive, whereas for non-uniform adversaries the proofs are two message public coin. — Our results do not appear to contradict the Aaronson-Ambanis conjecture. Assuming this conjecture, there exist publicly verifiable certifiable randomness, again with the minimal rounds of interaction. By replacing the random oracle with a concrete cryptographic hash function such as SHA2, we obtain plausible Minicrypt instantiations of the above results. Previous analogous results all required substantial structure, either in terms of highly structured oracles and/or algebraic assumptions in Cryptomania and beyond. [ABSTRACT FROM AUTHOR]

The technology-driven modern age emphasizes the security and privacy of communication. Through this paper, we delve deep into the need for user-centric security within cloud-based environments. The need for enhancement in encryption arises due to the increasing cases of data breaches and insider threats in cloud-based environments recently. The focus is laid upon the use of RSA encryption, end-to-end encryption, and anonymous messaging to address security-based concerns. The primary focus of this research is to develop a comprehensive security system to ensure the confidentiality and authenticity of text-based messages shared in the cloud. The proposed improved RSA algorithm, as suggested, incorporates three prime numbers in the key generation process. To address repetitive ciphertext, the proposed algorithm involves adding the index of each character in the plaintext string to the character's integer value before encryption. Conversely, during decryption, the same index is subtracted. This proposed algorithm has been utilized in a practical scenario, specifically in the implementation of a chat application. This paper presents a proof-of-concept for the proposed enhanced version of the RSA algorithm, accompanied by a thorough comparison and analysis of computational times across various bit lengths. Increase in data security at a cost of minor increase in computation time was observed through this research. [ABSTRACT FROM AUTHOR]

At present, there is a growing emphasis on safeguarding image data, yet conventional encryption methods are full of numerous limitations. In order to tackle the limitations of conventional color image encryption methodologies, such as inefficiency and insufficient security, this paper designs an expedited encryption method for color images that uses DNA coding in conjunction with multiple chaotic systems. The encryption algorithm proposed in this paper is based on three-dimensional permutation, global scrambling, one-dimensional diffusion and DNA coding. First of all, the encryption algorithm uses three-dimensional permutation algorithms to scramble the image, which disrupts the high correlation among the image pixels. Second, the RSA algorithm and the SHA-256 hashing algorithm are utilized to derive the starting value necessary for the chaotic system to produce the key. Third, the image is encrypted by using global scrambling and one-dimensional diffusion. Finally, DNA coding rules are used to perform DNA computing. The experimental results indicate that the encryption scheme exhibits a relatively weak inter-pixel correlation, uniform histogram distribution, and an information entropy value approaching eight. This shows that the proposed algorithm is able to protect the image safely and efficiently. [ABSTRACT FROM AUTHOR]

In today's rapidly evolving digital landscape, secure data transmission and exchange are crucial for protecting sensitive information across personal, financial, and global infrastructures. Traditional cryptographic algorithms like RSA and AES face increasing challenges due to the rise of quantum computing and enhanced computational power, necessitating innovative approaches for data security. We explored a novel encryption scheme leveraging the quadratic chaotic map (QCM) integrated with the Fibonacci sequence, addressing key sensitivity, periodicity, and computational efficiency. By employing chaotic systems' inherent unpredictability and sensitivity to initial conditions, the proposed method generates highly secure and unpredictable ciphers suitable for text and image encryption. We incorporated a combined sequence from the Fibonacci sequence and QCM, providing enhanced complexity and security. Comprehensive experimental analyses, including noise and occlusion attack simulations, demonstrate the scheme's robustness, resilience, and practicality. The results indicated that the proposed encryption framework offers a secure, efficient, and adaptable solution for digital data protection against modern computational threats. [ABSTRACT FROM AUTHOR]

The field of cryptography has grown significantly with the advent of information and communication technologies due to the increasing complexity of cyber threats and rising security requirements. This evolution has come with the creation of new cryptosystems and improvements to current ones. This study is the first to explore the RSA approach in the framework of t-intuitionistic fuzzy subgroups. This technique makes group-based cryptographic operations safer when there are unclear relationships and hesitations. This supports the complex and uncertain nature of subgroup membership, allowing for much more significant representations of the degrees of belonging, non-belonging, and hesitancy for the group elements along parameter 't'. The t-intuitionistic fuzzy RSA technique employs a t-intuitionistic fuzzy subgroup to address cryptosystem ambiguity, fuzziness, and imprecision. Consequently, inaccurate cryptographic data is more effectively represented, manipulated, and protected. Furthermore, this technique enhances the current level of fuzzy cryptography. The t-intuitionistic fuzzy RSA algorithms are of theoretical and practical value, as they significantly contribute towards developing fuzzy cryptography, fuzzy algebraic structures, and decision support systems. In this paper, the notions of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers are introduced. A new RSA cryptosystem based on a t-intuitionistic fuzzy subgroup is proposed in which the plaintext and the ciphertext are obtained in terms of t-intuitionistic fuzzy numbers and triangular t-intuitionistic fuzzy numbers. In addition, the significance of the concept of the t-intuitionistic fuzzy subgroup is highlighted as a suitable alternative tool to secure the data under consideration. In addition, the practical effect of the proposed methods is also investigated in this study. A mathematical mechanism is presented to implement the t-intuitionistic fuzzy RSA algorithm. Finally, a comparative analysis of the developed technique is presented with some existing methods to showcase the applicability and superiority of the recently developed method. [ABSTRACT FROM AUTHOR]

Due to the similar characteristics of chaotic systems and cryptography, public key encryption algorithms based on chaotic systems are worth in-depth research and have high value for the future. Chebyshev polynomials have good properties and are often used in the design of public key algorithms. This paper improves the Bose Multi-Chaotic Public Key Cryptographic Algorithm (BMPKC) by applying Chebyshev polynomials. The proposed algorithm (CMPKC- k i ) introduces the selective coefficient k i based on the properties of Chebyshev polynomials, allowing the special functions that need to be negotiated in the original system to be freely and randomly chosen as Chebyshev polynomials, and can also be expanded to m levels. The improved cryptographic algorithm also utilizes chaotic hash functions and logistic mapping to generate pseudo-random sequences and overcomes shortcomings of the Bose algorithm by iteratively iterating the selected Chebyshev polynomials based on the number of 0s or 1s in the pseudo-random sequence, thus providing better security. Analysis and software testing results indicate that this algorithm has strong robustness against brute force attacks, achieving a higher attack time for breaking the private key compared to the CEPKC, BMPKC, and CMPKC algorithms. Compared to the CMPKC algorithm, our proposal algorithm achieves better performance in the encryption and decryption phases. Furthermore, we combine this Multi-Chaotic System Key Exchange Protocol with the Advanced Encryption Standard (AES) algorithm, while providing a demonstration, offering more possibilities for practical applications of this system. [ABSTRACT FROM AUTHOR]

Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC with algorithms like Shor's algorithm, which can accelerate computations exponentially. This risks exposing these systems to attacks, necessitating quantum-resistant cryptography. Cloud computing poses data security concerns, requiring robust cryptographic mechanisms and access controls. Lattice-based cryptography, leveraging problems like the Short Integer Solution (SIS), emerges as a solution. This paper presents a novel quantum-resistant public key encryption scheme based on ElGamal and SIS, ensuring security against quantum and classical threats in modern cryptographic environments. [ABSTRACT FROM AUTHOR]

Any sharing mobility service aims to make urban mobility sustainable to help reduce environmental impacts and improve the quality of life for all in cities. Many transport services are not currently self-sustainable. The Life for Silver Coast (LifeSC) opened its mobility services on 22 May 2021 and offered electric mobility services during the summer for a few cities in Tuscany. E-bikes and e-scooters can be financially neutral, and even profitable, thanks to the low costs of the vehicles, but they only see a high utilization rate in winter. Shared electric cars, meanwhile, are not profitable. A new shared service that is viable must be profitable to become widely adopted and significantly contribute to sustainability. A few key characteristics have been identified, and one has been tested with a new business model that combines ride-sharing and car-sharing. The innovative Ride Sharing Algorithm (RSA) has been tested based on data from a potential city, Monterondo, where many commuters travel daily to Rome by train. The Italian census and local survey data allowed for the simulation of the scheduling of vehicle rides and an evaluation of the economic results, which could be positive if enough interest for such a system exists among the people, as at least 400 commuters from Monterotondo go to the train station daily in the morning and return in the afternoon. Such a transport demand would justify a new commercial sharing service by using the model tested with the RSA algorithm. [ABSTRACT FROM AUTHOR]

Social media blockchain is emerging as a promising solution to deal with privacy issues, by putting user privacy in edge nodes rather than centralized nodes. Under the protection of information encryption, only those who have cryptographic keys can get access to key information. This work aims at multimedia information in social media blockchain and utilizes the RSA encryption mechanism to construct the information encryption system. Due to the resilience of biometric features, the biometric cryptographic keys are not easy to be fabricated. Thus, this paper proposes a biometric keys-enhanced multimedia encryption algorithm for social media blockchain. First of all, the wiener filter is adopted to make some preprocessing operations to images, such as noise reduction. On this basis, the discrete wavelet transform is adopted to extract feature representation from images, and nonlinear approximation of contourlet transform is adopted to make feature fusion. Next, cryptographic keys can be generated from the fused biometric feature vectors to encrypt biometric data. Finally, some simulation experiments are conducted to evaluate performance of the proposal from three aspects: key generation time, security level and encryption-decryption time complexity. For key generation time, processing speed of the proposal is approximately 1–2 ms per sample. For security level, the proposal can reach an index value beyond 95% which is higher than comparison methods. For encryption-decryption time complexity, the proposal is about 30% lower than comparison methods. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA. [ABSTRACT FROM AUTHOR]

Big data, cloud computing and other hot areas are the use of personal information, but in the process of using this data, a large number of improper behavior is used to steal personal information. Most of the encryption algorithms in common use nowadays are based on ones that are no longer absolutely secure, such as RSA attacked by factorization, elliptic curves attacked by Pollard's lambda algorithm, and symmetric encryption algorithms attacked by collisions. In this paper, an integrated encryption and compression algorithm is designed, firstly, the data is transformed into the form of matrix, and the Jordan decomposition is used for preliminary compression and encryption from the two-dimensional point of view, and then based on the sparsity of matrix vectors, the compression-aware technique is used for compressing the set of key vectors, and the ciphertext group J produced by Jordan decomposition (which is a string of numbers with matrix diagonal length base √2 N), as well as the set of key vectors Y and the intermediate value Θ produced by compression awareness are obtained in the end. This sidesteps the common algorithms that have already been breached and is able to combine better encryption performance with compression performance while being innovative. [ABSTRACT FROM AUTHOR]

In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services. [ABSTRACT FROM AUTHOR]

The horizontal-to-vertical (H/V) method is a fundamental fast tool to estimate local site effect parameters by using the registered signals of the translational motion. The spectral ratio is mostly calculated using the Fourier Spectrum Analysis (FSA), which may lead to problems with accurate resonant frequency determination due to evident multi-amplification peaks occurrence on the spectrum. Alternatively the H/V ratio may be estimated by use Response Spectrum Analysis (RSA), where only a general amplification peak is expected. However, the fundamental limitations of the RSA assumption are related to the real impact of the events' scenario dependence (i.e., magnitude, distance, focal mechanism, etc.). The limitations and advantages of the RSA and FSA are commonly known in the case of the analysis performed for the translational signals. Therefore, the critical question is: should the RSA and FSA methods be used to estimate the H/V ratio of the recorded rotational signals of the events? The article presents horizontal-to-vertical (H/V) spectral ratios calculated for rotational and translational signals registered as an effect of mining-induced seismicity by four independent seismic stations located in Poland's Upper Silesian Coal basin. The spectral ratios of the signals were estimated using the RSA and the FSA method. The studies show that in the case of translational motion, the H/V estimations using the RSA derived clear information of the resonant frequency peak, confirming the method's usefulness in the case of multi-amplification peaks. The opposite situation was noticed in the case of the rotational motion. The derived H/V spectrum, using the RSA, produced single amplification peaks for the seismic stations, where the sensors were mounted on a small floor at a significant distance from the walls. In cases where the sensors were deployed on the building floor, a decrease in the reliability of the RSA and the FSA method was noticed. The results of the studies suggested that the possibility of the estimations of the H/V spectrum using the RSA and FSA algorithm is strongly limited for rotational motions due to the size of the floor and distance to the building walls where the sensors were mounted. The explanation of that fact is related to the effects of kinematic soil-structure interaction, which may significantly affect rotational measurements due to the tendency to obtain higher frequency content than in the case of the translations. Consequently, the values of the Zcomponent of the rotational motion may be lovered than in the free-field measurements, decreasing the reliability of the H/V estimations for rotational motion. [ABSTRACT FROM AUTHOR]

Advances in quantum computers may pose a significant threat to existing public-key encryption methods, which are crucial to the current infrastructure of cyber security. Both RSA and ECDSA, the two most widely used security algorithms today, may be (in principle) solved by the Shor algorithm in polynomial time due to its ability to efficiently solve the discrete logarithm problem, potentially making present infrastructures insecure against a quantum attack. The National Institute of Standards and Technology (NIST) reacted with the post-quantum cryptography (PQC) standardization process to develop and optimize a series of post-quantum algorithms (PQAs) based on difficult mathematical problems that are not susceptible to being solved by Shor's algorithm. Whilst high-powered computers can run these PQAs efficiently, further work is needed to investigate and benchmark the performance of these algorithms on lower-powered (constrained) devices and the ease with which they may be integrated into existing protocols such as TLS. This paper provides quantitative benchmark and handshake performance data for the most recently selected PQAs from NIST, tested on a Raspberry Pi 4 device to simulate today's IoT (Internet of Things) devices, and provides quantitative comparisons with previous benchmarking data on a range of constrained systems. CRYSTALS-Kyber and CRYSTALS-Dilithium are shown to be the most efficient PQAs in the key encapsulation and signature algorithms, respectively, with Falcon providing the optimal TLS handshake size. [ABSTRACT FROM AUTHOR]

[Display omitted] In the vanguard of safeguarding data integrity, optical encryption and anti-counterfeiting measures are indispensable. Structural color, with its inherent optical exclusivity, including tunable chromaticity and intricate high-resolution patterning, stands at the forefront of this domain. Despite its promise, the proliferation of structural color technologies in anti-counterfeiting applications is curtailed by the exorbitant production costs and the current limitations in information capacity and security. Addressing these constraints, our study delineates a novel encryption paradigm that interlaces color and digital data within a subwavelength grating matrix. This synergy is fortified by a tri-layered encryption schema, amalgamating electrical response signatures, inherent optical attributes, and the robust RSA algorithm, thereby elevating the information capacity exponentially to 10 n and reinforcing multi-faceted security throughout transmission. Our approach heralds a new era in the realm of high density, secure information storage. [ABSTRACT FROM AUTHOR]

Deep neural networks are vulnerable to adversarial attacks, bringing high risk to numerous security-critical applications. Existing adversarial defense algorithms primarily concentrate on optimizing adversarial training strategies to improve the robustness of neural networks, but ignore that the misguided decisions are essentially made by the activation values. Besides, such conventional strategies normally result in a great decline in clean accuracy. To address the above issues, we propose a novel RSA algorithm to counteract adversarial perturbations while maintaining clean accuracy. Specifically, RSA comprises three distinct modules: feature refinement, activation suppression, and alignment modules. First, the feature refinement module refines malicious activation values in the feature space. Subsequently, the feature activation suppression module mitigates redundant activation values induced by adversarial perturbations across both channel and spatial dimensions. Finally, to avoid an excessive performance drop on clean samples, RSA incorporates a consistency constraint and a knowledge distillation constraint for feature alignment. Extensive experiments on five public datasets and three backbone networks demonstrate that our proposed algorithm achieves consistently superior performance in both adversarial robustness and clean accuracy over the state-of-the-art. [ABSTRACT FROM AUTHOR]

Nowadays, technology is increasingly being adopted in different kinds of businesses to process, store, and share sensitive information in digital environments that include enormous numbers of users. However, this has also increased the likelihood of cyberattacks and misuse of information, potentially causing severe damage. One promising technology, which can provide the required security services with an improved level of efficiency, is blockchain. This research explores the use of Ethereum blockchain and smart contracts to create a secure and efficient quality assurance system (QAS) for academic programs. By utilizing blockchain and smart contracts, the proposed approach improves the integrity and reliability of sensitive information processed by the QAS, promotes transparency and governance, and reduces the time and effort required for quality operations. The current approach uses an additional access control layer to further enhance user privacy. Smart contracts automate various quality transactions and saves time and resources, and hence increases the efficiency of the QAS. The interplanetary file system (IPFS) is used to address the challenge of size limitations in blockchain. Additionally, this research investigates the use of various cryptographic schemes to provide robust security services at the application layer. The experimental results showed that the use of a hybrid cryptosystem relying on an Elliptic curve digital signature and AES encryption (AES_ECCDSA) outperforms other counterparts' cryptosystems using an RSA digital signature and AES encryption (AES_RSADSA) and Elliptic Curve Integrated Encryption Scheme (ECIES) in terms of speed. The performance results showed that AES_ECCDSA consumes 188 ms to perform the required cryptographic operations for a standard-quality document with a size of 8088 KB, compared to the 231 ms and 739 ms consumed by the AES_RSADSA and ECIES schemes, respectively. This study presents a prototype implementation of the blockchain-based QAS, which outlines the processing model and system requirements for key QAS processes. It has been found that the cost and time required for blockchain operations vary depending on the size of the input data—a larger data size requires more time and costs more to process. The results of the current study showed that the time delay for blockchain transactions ranges from 15 to 120 s, while the cost ranges from USD 50 to USD 400. This research provides evidence that blockchain and smart contract technologies have the potential to create a secure, efficient, and trustworthy QAS environment for academic programs. [ABSTRACT FROM AUTHOR]

In the rapid evolving digital landscape, the imperative to ensure data security has never been more crucial. This paper addresses the pressing challenges in data security by introducing a file encryption management system, leveraging a modified advanced encryption standard (AES) algorithm with reduced round iterations and bit permutation. This system aims to comprehensively secure various file types, providing a dependable solution for file exchange. Our findings reveal substantial improvements in both encryption and decryption processes using the reduced-round permutationbased AES (RRPBA). The adapted algorithm demonstrates a significant 38.8% acceleration in encryption time and a remarkable 44.86% improvement in decryption time, positioning it as a pivotal component for efficient file operations within the management system. Moreover, the throughput assessments showcase a remarkable 33.73% improvement in encryption and 23.72% in decryption, outperforming the original AES, emphasizing the algorithm's superior computational effectiveness, signaling positive implications for future high-performance applications. In conclusion, the study not only addresses critical security challenges but also presents a viable solution with tangible speed advantages for file encryption and decryption processes within digital file management systems. [ABSTRACT FROM AUTHOR]

Large number factorization is not only the most critical entry point for Rivest–Shamir–Adleman (RSA) security analysis, but also the most direct means of attacking the asymmetric encryption algorithm RSA. In this paper, the factorization methods of large numbers are summarized and analysed: classical integer factoring algorithms, Shor's circuit model algorithm, quantum adiabatic methods (integer factorization based on a quantum nuclear magnetic resonance (NMR) platform and D-Wave quantum annealing), and hybrid quantum-classical computing. Finally, the feasibility of integer factorization based on quantum adiabatics is discussed. In this paper, quantum annealing is regarded as a quantum attack method that is completely different from the famous Shor algorithm, and the potential of D-Wave factorization of large numbers to crack RSA cryptography is verified, which provides a new idea for a quantum attack on RSA public key cryptography. [ABSTRACT FROM AUTHOR]

The ever-growing threats in cybersecurity growing with the rapid development of quantum computing, necessitates the development of robust and quantum-resistant cryptographic systems. This paper introduces a novel cryptosystem, Public Key Cryptosystem based on Systematic Polar Encoding (PKC-SPE), based on the combination of systematic polar encoding and public-key cryptographic principles. The Systematic Polar Encoding (SPE), derived from the well-established field of polar codes, serves as the foundation for this proposed cryptographic scheme. Here, we have used MATLAB Software to introduce and implement the PKC-SPE Cryptosystem. The paper examines key generation, encryption, and decryption algorithms, providing insights into the adaptability and efficiency of systematic polar encoding in public-key cryptography. We assess the efficiency of the PKC-SPE Cryptosystem in three aspects: key size, computational complexity, and system implementation timings. In addition, we compare the PKC-SPE Cryptosystem with PKC-PC cryptosystem and find that it has reduced key sizes ( P r = 0.8436 kbytes). The results obtained through simulations validate the effectiveness of the proposed cryptosystem and highlighting its potential for integration into real-world communication systems. Thus, in the paradigm shift to quantum computing, the PKC-SPE cryptosystem emerges as a promising candidate to secure digital communication in the quantum computing era. [ABSTRACT FROM AUTHOR]

With the advancement of information and communication technology, vehicles role in people's lives is not just for transportation but also equipment for the carrier of mobile communication. The new direction is provided by the Internet for the automobiles development and upgrading. Internet of Vehicles (IoVs) includes smart vehicles, Autonomous Vehicles (AVs) as well as roadside units (RSUs) that communicate for providing the enhanced transportation services such as high traffic efficiency and reduced congestion and accidents. In the hazardous chemical logistics sector, the integration of Internet of Vehicles (IoVs) introduces significant security, privacy, and trust challenges. Vulnerabilities to cyberattacks, such as hacking and data manipulation, threaten the integrity of sensitive information regarding hazardous cargo, while concerns about location privacy and data minimization arise due to the tracking of vehicle movements. Ensuring authentication, authorization, and compliance with regulatory standards is essential for building trust within the IoV ecosystem, as any compromise in supply chain integrity could lead to safety hazards or legal liabilities. Robust encryption algorithms like AES and RSA play a crucial role in securing data transmission, but proper implementation and key management practices are necessary to prevent cryptographic weaknesses. Addressing these issues comprehensively is vital for safeguarding the transportation of hazardous chemicals and ensuring the safety of both the environment and the public. IoVs, suffer from security, privacy and trust issues. In order to solve the problem of hazardous chemical logistics of encryption algorithm, the author proposed a research on the information security of the Internet of Vehicles. Firstly, the information characteristics of dangerous chemicals vehicles are analyzed, then analyze the Data Encryption Standard (DES) algorithm. Advanced Encryption Standard (AES) algorithm is analyzed in the symmetric cryptosystem and then RSA algorithm is analyzed in the public key cryptosystem. Finally, the performance of the algorithm and the characteristics of vehicle information are comprehensively analyzed. The security of Internet of Vehicle's data transmission is efficiently improved by the proposed method. [ABSTRACT FROM AUTHOR]

In recent years, there has been significant growth in location-based services (LBSs) and applications. These services empower users to transmit their location data to location service providers, thereby facilitating the provisioning of pertinent resources and services. However, in order to prevent malicious users from sending fake location data, users must attest to their location for service providers, namely, through a proof of location (PoL). Such a proof should additionally prevent attackers from being able to obtain users' identity and location information through it. In this paper, we propose an efficient privacy-preserving proof of location (PPPoL) scheme. The scheme is based on the standard cryptographic primitives, including Group Time-based One-Time Password (GTOTP) and public key encryption, which achieves entity privacy, location privacy, and traceability. Unlike the previous GTOTP-based PPPoL scheme, our scheme enables instant location verification with additional hash operations. To encourage the active participation of witnesses in location proofs, we propose an incentive mechanism based on smart contracts. Additionally, we implement a proof of concept of our PPPoL scheme on an Android device. Our experimental results show that proof generation and verification time are on the order of milliseconds. Meanwhile, the total overhead for the incentive mechanism amounts to 0.0011 ETH. This result is practical for mobile device-based LBSs. [ABSTRACT FROM AUTHOR]

To secure sensitive medical records in the healthcare clouds, this paper proposes an End-to-End Encryption (E2EE) to enhance a patient-centric blockchain-based system for electronic health record (EHR) management. The suggested system with a focus on the patient enables individuals to oversee their medical records within various involved parties by authorizing or withdrawing permission for access to their records. Utilizing the inter-planetary file system (IPFS) for record storage is chosen due to its decentralized nature and its ability to guarantee the unchangeability of records. Then an E2EE enhancement maintains the medical data integrity using dual level-Hybrid encryption: symmetric Advanced Encryption Standard (AES) and asymmetric Elliptic Curve Cryptography (ECC) cryptographic techniques. The proposed system is implemented using the Ethereum blockchain system for EHR data sharing and integration utilizing a web-based interface for the patient and all users to initiate the EHR sharing transactions over the IPFS cloud. The proposed system performance is evaluated in a working system prototype. For different file sizes between 512 KB to 100 MB, the performance metrics used to evaluate the proposed system were the time consumed for generating key, encryption, and decryption. The results demonstrate the proposed system's superiority over other cutting-edge systems and its practical ability to share secure health data in cloud environments. [ABSTRACT FROM AUTHOR]

Panda and Chattopadhyay proposed "A Hybrid Algorithm for RSA Cryptosystem" in 2017, they modified well-known algorithm RSA into modulo four prime numbers. Later, Gondaliya, Savani, Dhaduvai and Hossain proposed "Hybrid Security RSA Algorithm in Application of Web Service" in 2018. However, we found that these two papers are highly similar, and the main focus of this article is how to determine the victim the (suffer) and the perpetrator (the plagiarist). [ABSTRACT FROM AUTHOR]

In emergency management, the transportation scheduling of emergency supplies and relief personnel can be regarded as the multi-objective shortest path problem with mixed time window (MOSPPMTW), which has high requirements for timeliness and effectiveness, but the current solution algorithms cannot simultaneously take into account the solution accuracy and computational speed, which is very unfavorable for emergency path decision-making. In this paper, we establish MOSPPMTW matching emergency rescue scenarios, which simultaneously enables the supplies and rescuers to arrive at the emergency scene as soon as possible in the shortest time and at the smallest cost. To solve the complete Pareto optimal surface, we present a ripple spreading algorithm (RSA), which determines the complete Pareto frontier by performing a ripple relay race to obtain the set of Pareto optimal path solutions. The proposed RSA algorithm does not require an initial solution and iterative iterations and only needs to be run once to obtain the solution set. Furthermore, we prove the optimality and time complexity of RSA and conduct multiple sets of example simulation experiments. Compared with other algorithms, RSA performs better in terms of computational speed and solution quality. The advantage is especially more obvious in the computation of large-scale problems. It is applicable to various emergency disaster relief scenarios and can meet the requirements of fast response and timeliness. [ABSTRACT FROM AUTHOR]

Due to its very desirable properties, Chebyshev polynomials are often used in the design of public key cryptographic systems. This paper discretizes the Chebyshev mapping, generalizes the properties of Chebyshev polynomials, and proposes an improved public key encryption algorithm based on Chebyshev chaotic mapping and RSA, i.e., C R P K C − K i . This algorithm introduces alternative multiplication coefficients K i , the selection of which is determined by the size of T r T d x m o d   N = T d T r x m o d   N , and the specific value selection rules are shared secrets among participants, overcoming the shortcomings of previous schemes. In the key generation and encryption/decryption stages, more complex intermediate processes are used to achieve higher algorithm complexity, making the algorithm more robust against ordinary attacks. The algorithm is also compared with other RSA-based algorithms to demonstrate its effectiveness in terms of performance and security. [ABSTRACT FROM AUTHOR]

Modular exponentiation is crucial for secure data exchange in cryptography, especially for resource-constrained Internet of Things (IoT) devices. These devices often rely on third-party servers to handle computationally intensive tasks like modular exponentiation. However, existing outsourcing solutions for the RSA algorithm may have security vulnerabilities. This work identifies a critical flaw in a recent outsourcing protocol for RSA proposed by Hu et al. We demonstrate how this flaw compromises the security of the entire RSA system. Subsequently, we propose a robust solution that strengthens the RSA algorithm and mitigates the identified vulnerability. Furthermore, our solution remains resilient against existing lattice-based attacks. The proposed fix offers a more secure and efficient way for IoT devices to leverage the power of third-party servers while maintaining data integrity and confidentiality. An extensive performance evaluation confirms that our solution offers comparable efficiency while significantly enhancing security compared to existing approaches. [ABSTRACT FROM AUTHOR]

Intelligent vehicular networks leverage communication technologies to enable vehicles to interact with each other and with infrastructure elements, such as roadside units and traffic signals, to enhance road safety and efficiency. However, the open nature of these networks exposes them to various security threats, including data interception, tampering, and unauthorized access. Traditional encryption methods may not suffice to address these challenges, necessitating the adoption of advanced cryptographic techniques like ECC and RSA. Prior research in the field has primarily focused on either enhancing communication protocols or improving security measures independently. However, there is a notable gap in research that comprehensively addresses both aspects simultaneously. This study aims to fill this void by proposing an integrated approach that ensures both seamless communication and robust security in intelligent vehicular networks. The proposed methodology involves the design and implementation of a hybrid cryptographic scheme combining ECC and RSA algorithms. This scheme will be integrated into the existing communication infrastructure of intelligent vehicular networks. The performance of the system will be evaluated through simulations and real-world experiments to assess its effectiveness in securing communication channels while minimizing overhead. The results show the effectiveness of the proposed ECC-RSA hybrid encryption scheme in securing communication channels within intelligent vehicular networks. The integration of ECC and RSA protocols not only enhances the security of data transmission but also ensures seamless communication, thereby advancing road safety in intelligent vehicular environments [ABSTRACT FROM AUTHOR]

Cryptographic technology can effectively defend against malicious attackers to attack sensitive and private information. The core of cryptographic technology is cryptographic algorithm, and the cryptographic algorithm identification is the premise of in-depth analysis of cryptography. In the cryptanalysis of unknown cryptographic algorithm, the primary task is to identify the cryptographic algorithm used in the encryption and then carry out targeted analysis. With the rapid growth of Internet data, the increasing complexity of communication environment, and the increasing number of cryptographic algorithms, the single-layer identification scheme of cryptographic algorithm faces great challenges in terms of identification ability and stability. To solve these problems, on the basis of existing identification schemes, this paper proposes a new cluster division scheme CMSSBAM-cluster, and then proposes a multi-layer composite identification scheme of cryptographic algorithm using a composite structure. The scheme adopts the method of cluster division and single division to identify various cryptographic algorithms. Based on the idea of ensemble, the scheme uses the hybrid random forest and logistic regression (HRFLR) model for training, and conducts research on a data set consisting of 1700 ciphertext files encrypted by 17 cryptographic algorithms. In addition, two ensemble learning models, hybrid gradient boosting decision tree and logistic regression (HGBDTLR) model and hybrid k-neighbors and random forest (HKNNRF) model are used as controls to conduct controlled experiments in this paper. The experimental results show that multi-layer composite identification scheme of cryptographic algorithm based on HRFLR model has an accuracy rate close to 100% in the cluster division stage, and the identification results are higher than those of the other two models in both the cluster division and single division stages. In the last layer of cluster division, the identification accuracy of ECB and CBC encryption modes in block cryptosystem is significantly higher than that of the other two classification models by 35.2% and 36.1%. In single division, the identification accuracy is higher than HGBDTLR with a maximum of 9.8%, and higher than HKNNRF with a maximum of 7.5%. At the same time, the scheme proposed in this paper has significantly improved the identification effect compared with the single division identification accuracy of 17 cryptosystem directly and the 17 classification accuracy of 5.9% compared with random classification, which indicates that multi-layer composite identification scheme of cryptographic algorithm based on HRFLR model has significant advantages in the accuracy of identifying multiple cryptographic algorithms. [ABSTRACT FROM AUTHOR]

A cyber-physical system (CPS) is a combination of physical components with computational elements to interact with the physical world. The integration of these two systems has led to an increase in security concerns. Traditional encryption algorithms designed for general-purpose computing environments may not adequately address the distinct challenges of CPS, such as limited processing power, delay, and resource-constrained hardware. Therefore, there is a pressing need to develop an encryption algorithm that is optimized for CPS security without compromising the critical real-time aspects of these systems. This research has designed a modified encryption technique named the advanced encryption standard in galois counter mode with nonce and rivest-shamir-adleman algorithm (AESGNRSA). A smart medical system is designed to monitor the health of remotely located patients. The AESGNRSA algorithm is applied to the three servers of this system. The data of 1.5 lakh patients is fed to this system to verify the effectiveness of the AESGNRSA algorithm. The performance parameters like encryption and decryption time, encryption and decryption throughput, and encrypted file size are calculated for the AESGNRSA algorithm. The comparative analysis proved that AESGNRSA has the highest performance as compared to other algorithms and it can protect CPS against many cyber-attacks. [ABSTRACT FROM AUTHOR]

Secure transmission of images over wireless communications systems can be done using RSA, the most known and efficient cryptographic algorithm, and OFDMA, the most preferred signal processing choice in wireless communications. This paper aims to investigate the performance of OFDMA system for wireless transmission of RSA-based encrypted images. In fact, the performance of OFDMA systems; based on different signal processing techniques, such as, discrete sine transforms (DST) and discrete cosine transforms (DCT), as well as the conventional discrete Fourier transforms (DFT) are tested for wireless transmission of gray-scale images with/without RSA encryption. The progress of transmitting the image is carried by firstly, encrypting the image with RSA algorithm. Then, the encrypted image is modulated with DFT-based, DCT-based, and DST-based OFDMA systems. After that, the modulated images are transmitted over a wireless multipath fading channel. The reverse operations will be carried at the receiver, in addition to the frequency domain equalization to overcome the channel effect. Exhaustive numbers of scenarios are performed for study and investigation of the performance of the different OFDMA systems in terms of PSNR and MSE, with different subcarriers mapping and modulation techniques, is done. Results indicate that the ability of different OFDMA systems for wireless secure transmission of images. However, the DCT-OFDMA system showed superiority over the DST-OFDMA and the conventional DFT-OFDMA systems. [ABSTRACT FROM AUTHOR]

Timed-release encryption (TRE) is a cryptographic primitive that can control the decryption time and has significant application value in time-sensitive scenarios. To solve the reliability issue of nodes in existing TRE anonymous interaction schemes, we propose a blockchain-based TRE protocol for anonymous query time trapdoors. In our protocol, the recipient divides the encrypted trapdoor request information into n ciphertext fragments using secret sharing technology near the decryption time, and employs the idea of onion routing to perform layer-by-layer encryption, creating onion-type data transmitted through middlemen selected from the smart contract. After receiving the ciphertext fragments, the time server integrates them to obtain the trapdoor request information and returns the corresponding time trapdoor to the recipient. This allows the recipient to query any time trapdoor anonymously. Our protocol provides a normative design for the smart contract and specific constraints on the participants' behavior. Compared with the related anonymous query trapdoor schemes, our protocol improves the probability of successful queries. Security analysis shows that our protocol can resist release-ahead attack, interruption attack, eavesdropping attack, and replacement attack. Performance analysis shows that our protocol outperforms related protocols regarding anonymity, efficiency, and flexibility, achieving highly efficient anonymous interactions. Finally, we conducted an experiment in the Ethereum Rinkeby test network. For the settings of ciphertext fragment number n = 3 and ciphertext fragment threshold t = 2 , the gas consumption for a user to execute the contract was $5.66, which was higher than the contract cost of related schemes, but the contract execution cost was within an acceptable range. [ABSTRACT FROM AUTHOR]

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Baghdad Science Journal is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Encryption methods had been widely used for secure data transmission and communication in both public and private organizations against intruders. Rivest-shamir-adleman (RSA) encryption algorithm is one of the most popular and efficient encryption schemes that has been in used for decades. Due to technological advancement and innovation, there is a threat to this algorithm. It is believed that introduction of quantum computer will break RSA algorithm easily. In view of this, it is pertinent to research into how RSA algorithm could be strengthened against all adversaries. This research aim at protecting client/server communication and file sharing by generating dynamic public and private keys. The proposed method was implemented in visual basic.net 2008. The result shows that dynamic keys do not affect the performance of the system and it is capable of protecting communication and file sharing between client/server. As the key generated keeps changing at an interval, it will difficult for most advance computer to factor any of the keys before another key is generated. This is the basis of the security of the proposed system. [ABSTRACT FROM AUTHOR]

In cryptography, we use different methods to hide information and make sure it's safe when shared. This keeps hackers from getting at it. The RSA cryptosystem is a way to protect messages that uses two different keys. In this paper, a new method is suggested. It includes changing messages into hexadecimal values and then turning them into decimals. Public and private keys are generated based on the input of message's length, adding an increase of complexity to enhance the security of the cryptosystem. The proposed algorithm uses two different keys to encrypt and decrypt each character, this makes the cryptosystem increasing the difficultly for attackers trying to hack it. A comparison is made between the proposed algorithm and the original RSA, using NIST tests and measuring the running time of key generation, encoding, and decoding operations. The results show that the new algorithm provides a secure transmitting of data. The proposed algorithm enhances security over the standard RSA algorithm by using hexadecimal conversion, multiple keys, dual key encryption per one-character, increased randomness, and a more advanced cryptography method, offering improved resistance against attacks and protecting data. [ABSTRACT FROM AUTHOR]

As a typical representative of the public key cryptosystem, RSA has attracted a great deal of cryptanalysis since its invention, among which a famous attack is the small private exponent attack. It is well-known that the best theoretical upper bound for the private exponent d that can be attacked is d ≤ N 0.292 , where N is a RSA modulus. However, this bound may not be achieved in practical attacks since the lattice constructed by Coppersmith method may have a large enough dimension and the lattice-based reduction algorithms cannot work so well in both efficiency and quality. In this paper, we propose a new practical attack based on the binary search for the most significant bits (MSBs) of prime divisors of N and the Herrmann-May's attack in 2010. The idea of binary search is inspired by the discovery of phenomena called "multivalued-continuous phenomena", which can significantly accelerate our attack. Together with several carefully selected parameters according to our exact and effective numerical estimations, we can improve the upper bound of d that can be practically achieved. More specifically, without the binary search method, we successfully attack RSA with a 1024-bit-modulus N when d ≤ N 0.285 . Moreover, by our new method, we can implement a successful attack for a 1024-bit-modulus RSA when d ≤ N 0.292 and for a 2048-bit-modulus RSA when d ≤ N 0.287 in about a month. We believe our method can provide some inspiration to practical attacks on RSA with mainstream-size moduli. [ABSTRACT FROM AUTHOR]

In this paper, we propose a centralized SDN network architecture under a smart factory for the problems under the traditional industrial IoT architecture and carry out the security analysis of industrial IoT to improve the performance of the smart factory network. Briefly describing the industrial SDN network architecture, combined with the design of a blockchain system for smart factories, the hash algorithm and asymmetric encryption algorithm are introduced to anonymize and protect the data. For traditional SDN, propose a blockchain-based SDN and analyze the probability of state transfer between SDNs. In order to solve the security problem at the SDN control level, the blockchain-based distributed SDN control model is proposed, and the PBFT consensus algorithm is introduced to realize the blockchain consensus-based multi-controller decision-making model. Add the MD5 algorithm and compare its performance with the SHA256 algorithm. Set up Adder modules with different bit widths and CSA Tree modules with different bases to calculate the encryption time of the RSA algorithm for various combinations. Set up simulation experiments to compare different malicious nodes and the average trust value of the consensus mechanism proposed in this paper for abnormal nodes in an SDN multi-controller. From the results, it can be seen that the computational speed of the RSA system is the fastest for the system implemented by Montgomery’s algorithm in base 16 and bit width 32 bits, and the time to complete the encryption process of 1024 bits once is only 0.97 ms. However, when the number of nodes is controlled in [0~5000], the rejection rate of abnormal nodes by the PBFT consensus algorithm in this paper basically maintains at about 92%. The consensus node designed and proposed in this paper is able to reject error nodes effectively and effectively secure the SDN smart factory network architecture.

With the deepening of digital development, the security protection of databases becomes more important while carrying out the digital transformation of party-building work in colleges and universities. In this study, for the database security in the party building work in colleges and universities, the protection framework of database security protection and the database hierarchical protection system based on the party building work in colleges and universities are constructed according to the needs of data hierarchical security protection. Then, on the basis of the intrusion tolerance mechanism, a database security monitoring system is established using a voting algorithm, and a multilevel information access control method is proposed for hierarchical protection. On this basis, an encryption protection mechanism based on the RSA algorithm is proposed for the sensitive information in the database of university party-building work. Through the empirical analysis of the security mechanism of counterattack protection of the university party building database, it is known that the security of the system in this paper and the probability of normal operation are both greater than 99%, and the likelihood of danger is 0.000002%. In the application of party building work, the data security of the three kinds of business is still maintained above 99.6%. The encryption time consumed is not more than 525ms, which shows that the database hierarchical protection security mechanism system constructed in this paper can meet the requirements of database security in the party building work in colleges and universities and provide a reliable guarantee for the security of the party building work database.

Ghost imaging technology has been widely used in the field of optical image encryption owing to its unique non-local imaging characteristics. However, there are some problems such as long encryption and decrypting time, poor reliability and large number of keys. To solve these problems, this paper proposed a computational ghost imaging encryption scheme based on RSA algorithm and wavelet transform. Firstly, the representation relationship between measurement matrix and random integer sequence is established to reduce the transmission of key quantity. Secondly, RSA encryption algorithm is used to improve the security of the system. Finally, using wavelet decomposition for packet transmission. In addition, the cake cutting matrix is used as the measurement matrix to reduce the sampling times and improve the quality of reconstructed images. The simulation results show that the encryption system has strong information transmission security and good robustness. It provides some reference for image encryption and information security transmission.

Since the RSA public key cryptosystem was proposed, it has been widely used because of its strong security. Although the proposal of the Shor's algorithm offers hope for cracking RSA, it is debatable whether the algorithm can actually pose a threat in practice. From the perspective of the quantum circuit of the Shor's algorithm, we analyse the feasibility of cracking RSA with improved quantum circuits using an ion-trap quantum computer. We present an improved quantum circuit for the modular exponentiation of a constant, which is the most expensive operation in Shor's algorithm for integer factorization. Whereas previous studies mostly focused on minimizing the number of qubits or the depth of the circuit, we minimize the number of CNOTs, which greatly affects the time to run the algorithm on an ion-trap quantum computer. First, we give the implementation of the basic arithmetic with the lowest known number of CNOTs and the construction of an improved modular exponentiation of a constant by accumulating intermediate data and using a windowing technique. Then, we precisely estimate the number of improved quantum circuits needed to perform the Shor's algorithm for factoring an n -bit integer, which is 217 n 3 / log 2 n + 4 n 2 + n. We analyse the running time and feasibility of the Shor's algorithm on an ion-trap quantum computer according to the number of CNOTs. Finally, we discussed the lower bound of the number of CNOTs needed to implement the Shor's algorithm. [ABSTRACT FROM AUTHOR]

Cyberphysical systems connect physical devices and large private network environments in modern communication systems. A fundamental worry in the establishment of large private networks is mitigating the danger of transactional data privacy breaches caused by adversaries using a variety of exploitation techniques. This study presents a privacy-preserving architecture for ensuring the privacy and security of transaction data in large private networks. The proposed model employs digital certificates, RSA-based public key infrastructure, and the blockchain to address user transactional data privacy concerns. The model also guarantees that data in transit remains secure and unaltered and that its provenance remains authentic and secure during node-to-node interactions within a large private network. The proposed model has increased the encryption speed by about 17 times, while the decryption process is expedited by 4 times. Therefore, the average overall acceleration obtained was 16.5. Both the findings of the security analysis and the performance analysis demonstrate that the proposed model can safeguard transactional data during communications on large private networks more effectively and securely than the existing solutions. [ABSTRACT FROM AUTHOR]

In recent times, the security of sensor networks, especially in the field of IoT, has become a priority. This article focuses on the security features of the Zigbee protocol in Xbee devices developed by Digi International, specifically in the Xbee 3 (XB3-24) devices. Using the TI LaunchXL-CC26X2R1 kit, we intercepted and analyzed packets in real-time using the Wireshark application. The study encompasses various stages of network formation, packet transmission and analysis of security key usage, considering scenarios as follows: without security, distributed security mode and centralized security mode. Our findings highlight the differences in security features of Xbee devices compared to the Zigbee protocol, validating and invalidating methods of establishing security keys, vulnerabilities, strengths, and recommended security measures. We also discovered that security features of the Xbee 3 devices are built around a global link key preconfigured therefore constituting a vulnerability, making those devices suitable for man-in-the-middle and reply attacks. This work not only elucidates the complexities of Zigbee security in Xbee devices but also provides direction for future research for authentication methods using asymmetric encryption algorithms such as digital signature based on RSA and ECDSA. [ABSTRACT FROM AUTHOR]

We present a linear-time, space and communication data-oblivious algorithm for securely merging two private, sorted lists into a single sorted, secret-shared list in the two party setting. Although merging two sorted lists can be done insecurely in linear time, previous secure merge algorithms all require super-linear time and communication. A key feature of our construction is a novel method to obliviously traverse permuted lists in sorted order. Our algorithm only requires black-box use of the underlying additively homomorphic cryptosystem and generic secure computation protocols for comparison and equality testing. [ABSTRACT FROM AUTHOR]

Protecting digital data, especially digital images, from unauthorized access and malicious activities is crucial in today's digital era. This paper introduces a novel approach to enhance image encryption by combining the strengths of the RSA algorithm, homomorphic encryption, and chaotic maps, specifically the sine and logistic map, alongside the self-similar properties of the fractal Sierpinski triangle. The proposed fractal-based hybrid cryptosystem leverages Paillier encryption for maintaining security and privacy, while the chaotic maps introduce randomness, periodicity, and robustness. Simultaneously, the fractal Sierpinski triangle generates intricate shapes at different scales, resulting in a substantially expanded key space and heightened sensitivity through randomly selected initial points. The secret keys derived from the chaotic maps and Sierpinski triangle are employed for image encryption. The proposed scheme offers simplicity, efficiency, and robust security, effectively safeguarding against statistical, differential, and brute-force attacks. Through comprehensive experimental evaluations, we demonstrate the superior performance of the proposed scheme compared to existing methods in terms of both security and efficiency. This paper makes a significant contribution to the field of digital image encryption, paving the way for further exploration and optimization in the future. [ABSTRACT FROM AUTHOR]

Fog computing accredits by utilizing the network edge while still rendering the possibility to interact with the cloud. Nevertheless, the features of fog computing are encountering several security challenges. The security of end users and/or fog servers brings a significant dilemma in implementing fog computing. The computational power of the resources constrains Internet of Things (IoT) devices in the fog-computing environment. Therefore, an attacker can easily attack. The traditional methods like attribute-based encryption (ABE) techniques are inappropriate for resource-constraint devices with protracted computing and limited computational capabilities. In this regard, we investigate a multiauthority ciphertext policy-attribute-based encryption (MA-CP-ABE) method that enables multiauthority attribute revocation and computation outsourcing. Moreover, the encryption and decryption processes of resource-constraint IoT devices are outsourced to the fog nodes. In this way, it also reduces the computational burden of the resource-constraint IoT devices. Hence, we propose MA-CP-ABE for encryption and decryption, attribute revocation and outsourcing by reducing the computational burden and securing the system. We compare the computational offloading approach with the existing techniques to prove that the proposed approach outperforms the existing approaches. The proposed method reduces the operation time for the encryption and decryption process. We outsource cryptography operations to the fog node, reducing the end user's computational cost. Eventually, simulated outcomes are used to assess the algorithm's computational cost. [ABSTRACT FROM AUTHOR]

In public-key cryptography, the RSA algorithm is an inevitable part of hardware security because of the ease of implementation and security. RSA Cryptographic algorithm uses many modular arithmetic operations that decide the overall performance of the architecture. This paper proposes VLSI architecture to implement an RSA public-key cryptosystem driven by the Residue Number System (RNS). Modular exponentiation in the RSA algorithm is executed by dividing the entire process into modular squaring and multiplication operations. Based on the RNS employment in modulo-exponential operation, two RSA architectures are proposed. A Verilog HDL code is used to model the entire RSA architecture and ported in Zynq FPGA (XC7Z020CLG484-1) for Proof of Concept (PoC). The Cadence Genus Synthesizer tool characterizes a system's performance for TSMCs standard Cell library. Partial RNS (Proposed-I)- and Fully RNS (Proposed-II)-based RSA architectures increase the operation speed by 13% and 35%, respectively, compared with the existing RSA. Even though there is an increase in parameters like area, power and PDP for a smaller key size, the improvement in area utilization and encryption/ decryption speed of RSA for a larger key size is evident from the analysis. [ABSTRACT FROM AUTHOR]

Over the last decade, millions of 4G and 5G-enabled mobile devices have become part of the Internet. Almost, all the applications have been shifted to smartphones. A person connects his smartphone to several other devices or remote servers for exchanging sensitive data. In this sense, security threats in terms of authentication, data confidentiality, and data integrity are increasing day by day for mobile devices. The asymmetric key cryptosystem is considered more secure, but it is heavyweight for smart devices on the basis of computation and communication costs. The symmetric key cryptosystem is considered lightweight for smart devices in terms of computation and communication overheads, but it is vulnerable to several attacks such as MITM attacks. Several symmetric key security systems have been proposed for smart devices but adopt complex mathematical procedures. Therefore, existing symmetric key security systems increase the computation and communication overheads. In this paper, we propose a lightweight and authentic symmetric key cryptosystem for resource-constrained mobile client–server environments. Our proposed cryptosystem consists of a lightweight symmetric session key exchange algorithm, mutual authentication service, and data confidentiality service, respectively. Moreover, we prove the robustness of our proposed cryptosystem with the help of informal and formal security analysis through the AVISPA tool. In addition, performance evaluation and comparisons with existing security systems show that our proposed cryptosystem is efficient, lightweight, secure, and most suitable for mobile computing. [ABSTRACT FROM AUTHOR]

This article proposes a new method to inject backdoors in RSA (the public-key cryptosystem invented by Rivest, Shamir, and Adleman) and other cryptographic primitives based on the integer factorization problem for balanced semi-primes. The method relies on mathematical congruences among the factors of the semi-primes based on a large prime number, which acts as a "designer key" or "escrow key". In particular, two different backdoors are proposed, one targeting a single semi-prime and the other one a pair of semi-primes. This article also describes the results of tests performed on a SageMath implementation of the backdoors. [ABSTRACT FROM AUTHOR]