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 this study, we present a novel voice recognition service developed on the Raspberry Pi 4 model B platform, leveraging the fast Fourier transform (FFT) for efficient speech-to-digital signal conversion. By integrating the hidden Markov model (HMM) and artificial neural network (ANN), our system accurately reconstructs speech input. We further fortify this service with dual-layer encryption using the Rivest-Shamir-Adleman (RSA) and advanced encryption standard (AES) methods, achieving encryption and decryption times well suited for real-time applications. Our results demonstrate the system's robustness and efficiency: speech processing within 1.2 to 1.9 seconds, RSA 2048-bit encryption in 2 to 6 milliseconds, RSA decryption in 6 to 10 milliseconds, and AES-GCM 256-bit encryption and decryption in approximately 2.6 to 3 seconds. [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]

The act of implementing specific measures to ensure the security of cryptographic keys within an organization is referred to as key management. Securing communication in a decentralized IoT network presents many challenges due to the abundance of devices and the dynamic nature of the network. For this purpose, A Decentralized lightweight group key management (DLGKM) system is proposed in this paper, that leverages fuzzy logic and Crossover boosted Particle Swarm Optimization (CPSO) named FLCPSO-KM to enhance decisions and settle disputes in IoT environments. DLGKM system uses fuzzy logic and CPSO in decision-making and dispute resolution, this allows for qualitative and quantitative optimization, leading to reliable outcomes. The system provides a lightweight and effective solution for secure communication in a decentralized IoT network. It employs a Crossover-boosted particle swarm optimization (PSO) algorithm for secure key revocation from unauthorized devices, ensuring the security of the network and resources. Overall, the proposed DLGKM system provides an effective and efficient solution for secure communication in a decentralized IoT network. The advantages of utilizing fuzzy logic and CPSO in the system include enhanced decision-making and the ability to solve key revocation issues, thus minimizing communication and computational overheads. The proposed approach was compared to existing approaches such as Blockchain-Based Distributed Key Management Architecture (BDKMA), Cognitive Key Management Technique (CKMT), Healthcare Key Management Approach (HCKM), and Hash-Based Key Management Mechanism (AHKM) based on metrics such as security, encryption and decryption time, computational time, throughput, and fitness value. The proposed approach achieved greater efficiency with 98.7% security, encryption, and decryption time of 0.2 s and 0.3 s, throughput of 250 bits per second, and fitness values ranging from 0 to 1 respectively. [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]

Shor's factorization algorithm (SFA) aims at finding the non-trivial factor of a given composite number, but the algorithm does not always work. In some cases, it has to call back to the beginning of the algorithm to make recalculation. After the analysis of the principle of SFA and the characteristics of RSA public-key cryptography with a series of data calculations, it can be concluded that the random value selected by the algorithm is closely related to whether the obtained period is effective. Therefore, a new optimized scheme is proposed to tackle with this defect from two perspectives: (a) When the a value is a perfect square, the algorithm can be completed with an odd cycle r. (b) When the period r obtained by the randomly selected a value is a multiple of 3 , the algorithm can be completed by modifying the decomposition method to relax the requirements for the period without affecting the complexity of the algorithm. Due to the limitations of hardware in applying the quantum algorithms, the classical algorithm is applied to simulate quantum algorithms to test the success rate of decomposition of some composite numbers. The result indicates the effectiveness of the improved algorithm, which significantly reduces the probability of repeated operations to save the quantum circuit resources. [ABSTRACT FROM AUTHOR]

Steganography is a technique for hiding secret messages while sending and receiving communications through a cover item. From ancient times to the present, the security of secret or vital information has always been a significant problem. The development of secure communication methods that keep recipient-only data transmissions secret has always been an area of interest. Therefore, several approaches, including steganography, have been developed by researchers over time to enable safe data transit. In this review, we have discussed image steganography based on Discrete Cosine Transform (DCT) algorithm, etc. We have also discussed image steganography based on multiple hashing algorithms like the Rivest–Shamir–Adleman (RSA) method, the Blowfish technique, and the hash-least significant bit (LSB) approach. In this review, a novel method of hiding information in images has been developed with minimal variance in image bits, making our method secure and effective. A cryptography mechanism was also used in this strategy. Before encoding the data and embedding it into a carry image, this review verifies that it has been encrypted. Usually, embedded text in photos conveys crucial signals about the content. This review employs hash table encryption on the message before hiding it within the picture to provide a more secure method of data transport. If the message is ever intercepted by a third party, there are several ways to stop this operation. A second level of security process implementation involves encrypting and decrypting steganography images using different hashing algorithms. [ABSTRACT FROM AUTHOR]

As cyberattacks are getting more complex and sophisticated, stringent, multi-layered security measures are required. Existing approaches often rely on tokenization or encryption algorithms, both of which have drawbacks. Previous attempts to ensure data security have primarily focused on tokenization techniques or complex encryption algorithms. While these methods work well on their own, they have proven vulnerable to sophisticated cyberattacks. This research presents new ways to improve data security in digital storage and communication systems. We solve data security issues by proposing a multi-level encryption strategy that combines double encryption technology along with tokenization. The first step in the procedure is a byte-level byte-pair encoding (BPE) tokenizer, which tokenizes the input data and adds a layer of protection to make it unreadable. After tokenization, data is encrypted using Rivest-Shamir-Adleman (RSA) to create a strong initial level of security. To further enhance security, data encrypted with RSA has an additional layer of encryption applied using the advanced encryption standard (AES) method. This article describes how this approach is implemented in practice and shows how it is effective in protecting data at a higher level than single-layer encryption or tokenization systems. [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]

Wireless Sensor Networks (WSN) when simulated for implementations use Mobile Sinks (MS) which are vulnerable to unauthorized attacks. Existing works do not ensure attacker node identifications making prevention of attacks during initial iterations would a difficult task. Neighbour node selections based on their node information alone can increase the possibility of intrusions. The detection of an attacker node in the initial stages reduces information loss and increases authentication. In continuation to this statement a TNF (Trust based Node Filtering) technique which assigns trust values to nodes is introduced in this work. This proposal is an authentication scheme against replication attacks. Neighbour nodes which cannot be trusted are not considered for authentication processes thus ensuring guaranteed data transmissions. Malicious nodes are detected using a FIS (Fuzzy Inference Systems) with the proposed CFNIS (Customizable Fuzzy- Neuro Inference System). Nodes are also classified as being in normal or attacking node. Secure Key generations are performed using RSA and Elgamal algorithm and a honey pot server controls authentications. CFNIS simulation showed higher security against replication attacks. [ABSTRACT FROM AUTHOR]

The modified RSA provides high efficiency against attacks and, as a result, it is considered the ideal choice for many applications. In this paper, we introduce an alternative to the modified RSA key encryption system called TPRSA, based on Tri-Cartesian algebra and polynomials, by modifying the mathematical structure of text encryption and decryption keys to obtain a high level of security. [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]

Blockchain technology has evolved from its origins in cryptocurrencies to become a fundamental component of secure digital interactions across diverse sectors, including healthcare, finance, and public administration. This article delves into the theoretical and practical applications of cryptography within blockchain networks, emphasizing key cryptographic functions, algorithms, and protocols such as RSA, elliptic curve cryptography (ECC), and SHA-256. It scrutinizes the use of digital signatures for transaction verification and the crucial role of hash functions in ensuring data integrity. Additionally, the article presents practical examples of symmetric and asymmetric encryption methods, underscoring their significance in maintaining privacy and security. The study also highlights the emerging challenges posed by quantum computing and explores ongoing research in post-quantum cryptography. Furthermore, it provides insights into the advancements in cryptographic techniques essential for the robustness of decentralized networks. By linking theoretical frameworks with practical implementations, this article aims to offer a comprehensive understanding of the cryptographic security measures pivotal for the future of blockchain technology. [ABSTRACT FROM AUTHOR]

With increasing data transmission and the escalating risks of data theft, the demand for fast and robust encryption algorithms has intensified. The Rivest Shamir Adleman (RSA) algorithm is a widely used asymmetric cryptographic solution for secure data communication. However, the computational resources required for encryption and decryption processes can become significant, particularly as the volume of data increases. This research paper proposes a dynamic approach to enhance the RSA algorithm tailored explicitly for large-scale data encryption and decryption. The proposed method involves storing the encrypted value of repeated elements, aiming to optimize performance. To evaluate the efficacy of this approach, extensive experiments were conducted on various datasets comprising paragraphs of different sizes. The experiments involved encrypting and decrypting paragraphs containing 10, 50, 100, 200, 500, 1000, and 10,000 words. Comparative analyses were performed against existing RSA, El Gamal, and AES algorithms. Results indicate that the proposed dynamic RSA approach consistently outperforms traditional RSA in terms of encryption time, decryption time, and total execution time across all tested paragraph sizes. The regression analysis revealed stark differences between the two approaches. The regression line for traditional RSA exhibited a significantly steeper slope 1.75 and a substantially higher intercept 1001.42 compared to the proposed dynamic RSA approach, which demonstrated a lower slope 0.0113 and a much smaller intercept 28.58. These findings underscore the superior scalability and efficiency of the proposed dynamic RSA approach over traditional RSA, particularly in handling larger volumes of data while maintaining lower computational overheads. [ABSTRACT FROM AUTHOR]

Summary: The present scenario witnesses "the second quantum revolution," which has enabled the development of revolutionary novel quantum tools. Quantum computing endeavors to establish higher computing standards that can potentially solve complex structures. Post‐quantum cryptography (PQC) has emerged as one of the new domains of cryptography, which is resilient to quantum attacks owing to the revolution in quantum computing. To ensure quantum security, the lattice‐based cryptosystem (LB‐cryptosystem) is one of the promising tools of PQC to address quantum‐based threats. The traditional security algorithms, such as RSA and Diffie–Hellman (DH), are strong enough to resist present security threats. However, it has been predicted that quantum technologies have the capability to break the security of most traditional algorithms whose security is based on prime factorization and DH‐type hard problems. Therefore, research is currently focused on addressing the security and privacy threats by using LB‐cryptosystems to secure various applications, organizations' data, and information infrastructure in the quantum era. The purpose of this article is to investigate recent advances in LB‐cryptosystems that may allow the design of secure models for smart‐grid networks (SGNs) against existing and future quantum attacks. SGNs have been explored as the bi‐directional assimilation of communication in terms of electricity generation, transmission, allocation, and utilization. This survey provides a comprehensive overview of LB‐cryptosystems, as well as their potential applications in securing SGNs. Lastly, the article summarizes the various PQC primitives, NIST selected algorithms, open‐source tools along with their packages, and various PQC industrial initiatives, and also compares traditional cryptographic schemes with other PQC. [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]

In recent times, blockchain-based data auditing protocols have emerged as a cutting-edge area of study. Nevertheless, a conspicuous dearth of a generic framework upon which to ground such protocols is evident. This study introduces a pioneering and all-encompassing framework, designated as "Blockchain-assisted On-chain Auditing for Off-chain Storage" (BA2OC). The BA2OC framework operates without the reliance on a predefined auditor for the auditing process or a centralized verifier for the verification of on-chain auditing. It is conceivable that BA2OC forms the cornerstone of public data auditing protocols underpinned by blockchain technology. This framework bestows evidence of data ownership, ensures data integrity, facilitates public verification, supports batch verification, and bolsters the security against cyber threats through the utilization of cryptographic tools. The analysis underscores the comprehensive nature of the BA2OC framework, which positions it as the linchpin of blockchain-based public auditing protocols. Following a parametric evaluation of the BA2OC framework, this study takes into account real-world considerations, such as the utilization of the RSA cryptosystem and Android-based smartphones, to proffer a concrete protocol. The investigation further demonstrates that the BA2OC framework minimizes communication overhead while maintaining operational efficiency. [ABSTRACT FROM AUTHOR]

Fog computing provides a suitable development for real-time processing in the Internet of Things (IoT). Attribute-based encryption (ABE) is the main method to control data access in fog computing. A residue number system (RNS) can speed up multiplication and exponential operations by converting very large integers to small integers. This paper proposes a fine-grained lightweight access control scheme using ABE modified with RNS properties (RNS-ABE) with fog computing. Decryption is implemented with the Chinese remainder theorem (CRT), and a new access structure based on the CRT secret sharing scheme is also introduced. Security of the proposed scheme proved based on RNS properties and the complicated problem of factoring a very large integer into its large prime factors, like RSA encryption. The time cost comparison shows that the total encryption and decryption time of our scheme is more efficient than the lightweight schemes with the underlying operation of bilinear pairing. [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]

In wireless sensor networks, ensuring data confidentiality and integrity is paramount, particularly in sensitive environments. However, existing encryption methods encounter challenges, including key maintenance in symmetric encryption and lower security levels in asymmetric encryption. To address these issues, this paper proposes a novel security protocol employing a hybrid encryption approach, combining both symmetric (AES) and asymmetric (RSA) cryptographic techniques. The protocol introduces a two-phase cryptographic technique utilizing AES for robust encryption in Phase 1 and RSA for efficient key management in Phase 2. Experimental results demonstrate enhanced efficiency in encryption, decryption, and total execution time compared to existing algorithms, marking a significant advancement in cryptographic protocols for improved security in data transmission and management. Key contributions include the division of plaintext for simplified cryptographic processing, AES encryption for Phase 1, RSA encryption for Phase 2, and a seamless decryption process ensuring data integrity and security against attacks. [ABSTRACT FROM AUTHOR]

In the present time of increasing digital communication, the images are widely used over the multimedia networks for sharing of information. At the same time to ensure the security of images during transmission of data becomes a great challenge for cryptographers. In this paper, a new multi-phases image encryption algorithm based on the RSA cryptosystem and modified random matrix affine cipher (MRMAC) is proposed. The Chen's hyperchaotic system and Arnold cat map are used to create more distraction from the relationship between the original image and ciphered image. The Chen's hyperchaotic system is used for diffusion, whereas the Arnold cat map is used for increasing the confusion among pixels. In this proposed algorithm the image ciphering is carried out in different phases. Firstly the given image is encrypted using RSA algorithm with large primes. Secondly, in modified RMAC, random blocks of random entries using Chen's hyperchaotic system are generated and are diffused with image pixels using bitwise XOR operation. Also, we create confusion of pixels within these diffused blocks, and confusion of blocks as well using parameters of MRMAC. The randomness in the algorithm is improved using MRMAC is advantage against differential attacks. Further, the Arnold cat map is used to enhance the level of confusion. Since, it is tremendously difficult to factorize the product of large prime numbers, therefore, the security of data in RSA algorithm increases tremendously. For the proper decryption of ciphered images, one must have exact values of keys and their correct order. It is impossible to guess the decrypted image even with a very small change in a single key. The results obtained in statistical and security analysis shows that the proposed algorithm has a huge key space, extreme security and key sensitivity, which proves that scheme is efficient and highly secure. [ABSTRACT FROM AUTHOR]

A blockchain is a decentralized digital network system consisting of multiple blocks connected in a chain. Each block comprises multiple transactions and is linked to the previous block through its hash value. The hash values are calculated using the active transactions within each block and the hash value of the preceding block. A positive impact can be made by combining blockchain technology with the healthcare sector. The consensus mechanism is the key protocol for implementing agreements in the blockchain. This paper proposes a combined RSA (Rivest–Shamir–Adleman) cryptography algorithm with a novel consensus protocol IPBFT (Improved Practical Byzantine Fault Tolerance) in the Hyperledger Fabric platform, for a patient-centered approach using blockchain technology in the healthcare sector. It ensures the reliability and integrity of transactions and prevents malicious nodes from disrupting the network. The Hyperledger Fabric platform is used to provide transparency, security, and trust in the blockchain. Performance metrics such as latency, throughput, scalability, and comparative analysis for the proposed algorithm Improved Practical Byzantine Fault Tolerance (IPBFT) and existing Practical Byzantine Fault Tolerance (PBFT) algorithms have been evaluated to achieve enhanced results. The proposed algorithm solves many problems associated with existing Practical Byzantine Fault Tolerance solutions and improves efficiency and security in the healthcare sector. [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]

We introduce a novel image encryption and decryption algorithm for multiple images incorporating multiple parameter fractional discrete cosine transform (MPFrDCT), 3D Arnold transform and RSA cryptosystem. Before encryption, the images are changed into their indexed formats by removing their color maps. The indexed formats of the images are taken as the red, green and blue channel of an RGB image. Firstly, the RGB image is taken as the input of 3D Arnold transform. The 3D Arnold transform not only dislocates the pixel positions, but also changes the pixel values. Mathematically, the 3D map performs both permutation as well as substitution. The distorted image is now encrypted using RSA cryptosystem which is a public key cryptosystem. The RSA cryptosystem makes the image secure in public domain as the hard problem is the factorization of large primes which is unbreakable. Lastly, the domain of the encrypted image is changed to frequency domain using MPFrDCT. If the secret keys are known to an unauthorized person, the encryption algorithm is still secure as the security of the presented cryptosystem depends upon the secret keys and the arrangements of the secret keys. The proposed image encryption algorithm is storage efficient. The statistical and simulation analysis are conducted to evaluate the robustness of the presented encryption and decryption processes. [ABSTRACT FROM AUTHOR]

Summary: Communicating large amounts of data requires an encryption solution that ensures fast and secure data transfer. Unfortunately, it faced privacy and security issues, resulting in higher power consumption, data scarcity, energy, diversity, data reliability, low security, and packet loss in the communication process. The goal of this research is to ensure data transfer while conserving energy and protecting data transmission in WSNs. Therefore, this paper proposes a multipath routing protocol using the HGSPSO algorithm, which is a combination of hybrid gravitational search algorithm (HGSA) and particle swarm optimization (PSO), to securely transmit data from one node to another node under public and private key cryptography. The PSO approach is utilized to resolve the energy hole problem by selecting the cluster head in the sink coverage area. The RSA can be employed for data encryption, data decryption, key generation, and sharing. The metrics like acceleration constants and inertial weights are used for the HGSPSO algorithm. The result of this implementation demonstrated that the scheme had a low energy consumption of 36%, a maximum packet delivery ratio (PDR) of 96%, a higher throughput rate of 88%, and a low packet loss of 39%. [ABSTRACT FROM AUTHOR]

The article concentrates on exploring the issue of privacy‐preserving sliding mode consensus of multi‐agent systems (MASs) with disturbance. An encryption and decryption algorithm has been proposed to address data security and privacy issues during data transmission. To optimize network resource allocation, a dynamic event‐triggering mechanism has been introduced, which reduces the number of encrypted data while saving the computation cost. The consensus performance based on the sliding mode control strategy is achieved when the reachability of the slide‐mode surface is guaranteed, and then the slide‐mode controller is developed. Finally, an empirical demonstration through a numerical example validates the efficacy of the proposed strategy. [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]