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]

Wireless sensor networks (WSNs) are imperative to a huge range of packages, along with environmental monitoring, healthcare structures, army surveillance, and smart infrastructure, however they're faced with numerous demanding situations that impede their functionality, including confined strength sources, routing inefficiencies, security vulnerabilities, excessive latency, and the important requirement to keep Quality of Service (QoS). Conventional strategies generally goal particular troubles, like strength optimization or improving QoS, frequently failing to provide a holistic answer that effectively balances more than one crucial elements concurrently. To deal with those challenges, we advocate a novel routing framework that is both steady and power-efficient, leveraging an Improved Type-2 Fuzzy Logic System (IT2FLS) optimized by means of the Reptile Search Algorithm (RSA). This modern framework employs weighted ensemble clustering and matched ensemble choice techniques, facilitating strong cluster formation and resulting in a substantial 98% development in community lifetime, an 80% enhancement in packet delivery ratio (PDR), and a 45% reduction in average power consumption while as compared to current protocols. The IT2FLS model dynamically adapts routing selections by means of assessing key parameters, consisting of dynamic accept as true with factors, node power ranges, course delays, and energy consumption fees, whilst the RSA algorithm exceptional-tunes the bushy common sense club features to make certain most beneficial cluster head choice and reliable multi-hop communication paths. Additionally, our proposed technique complements secure routing by means of efficaciously counteracting the effects of compromised nodes, for this reason maintaining community integrity. Multiple test results show that RSA's enhanced IT2FLS system consistently outperforms new standards. It reduces end-to-end work by 25% and significantly increases productivity. These findings suggest that this robust routing model not only guarantees efficient data transmission and performance. But it also guarantees the stability of the overall network. This research contributes significantly to the WSN field by providing a comprehensive routing solution that integrates energy conservation, security, and QoS, ultimately extending the lifespan of WSNs and boosting confidence in critical applications, paving the way for implementation scenarios that require secure, low-power, and real-time data transmission. [ABSTRACT FROM AUTHOR]

Background: Modular multiplication for large numbers is especially important in cryptography algorithms such as RSA and elliptic curves. The Montgomery algorithm is the most famous and efficient one for calculating it. Hardware implementation for cryptography co-processors is better than software implementation in terms of speed and security. Many FPGA designs for the Montgomery multiplication algorithm was published based on hardware description languages like VERILOG and VHDL. This paper proposes the FPGA design and implementation using MATLAB HDL Coder. Results: The algorithm is modified such that it can fit any small/large FPGA by introducing scaling factor. The design is configurable in both modulus length and the scaling factor. This paper performs a comparison between the synthesizing results for different scales and for different modulus lengths. The synthesizing is performed up to 8K bit modulus length, and it can be increased easily. In this paper, implementation of different modulus lengths with different frequencies and with different area utilization can be easily achieved. The design utilizes different area resources for each configuration. The target is xc7vx330t-2ffg1157 Virtex-7 Xilinx FPGA. The maximum frequency is 80.81 MHz for 4096-bit modulus length with 8-bit data width and 2 for serialization factor. The minimum area utilization is achieved for minimum configurations, i.e., 1024-bit modulus length with 8-bit data width and for unity serialization factor. Conclusions: This paper proposes a scalable and configurable FPGA design for Montgomery multiplication co-processor-based HDL coder design. [ABSTRACT FROM AUTHOR]

With the development of economy, people's demand for high-quality and diversified educational resources increases. However, under the frequent occurrence of network attacks, data leakage and other events, network security and information security need to be solved urgently by the current online teaching platform. To this end, the research adopts Advanced Encryption Standard encryption algorithm and introduces Rivest-Shamir-Adleman to improve it, and applies it to construct an embedded online teaching platform, aiming to ensure user's personal information security. Experimentally, the decryption speed of the Advanced Encryption Standard-Rivest-Shamir-Adleman encryption algorithm stays around 100 ms when the number of bytes is below 60. When file size increasing, the encryption time of the proposed algorithm increases minimally. Also, the key generation time of the algorithm is always less than 1500 ms, and the average time taken to defend the online teaching platform against brute force attacks can be up to 232.1 ms. In addition, the research algorithm has the best scalability, the platform obfuscation is better, and the platform always has the lowest ciphertext bit count. In conclusion, it can be seen that the embedded online teaching platform of the study has the best confidentiality of user information, which guarantees the confidentiality and integrity of learners' personal information and teaching resources. Strong encryption technology provides solid security for the application of online education platforms, allowing educational innovation to take place in a more secure and controlled environment. [ABSTRACT FROM AUTHOR]

This paper presents a novel key generation algorithm for Rebalanced-RSA and RPowerRSA that accelerates encryption and decryption processes by utilizing smaller modular exponents. Subsequently, two of these variants are modified by altering the key generation process. A theoretical analysis of all variants, including the proposed modifications, demonstrates that these key generation algorithms improve the encryption process compared to the original variants, and since the encryption key size and one of the decryption key sizes are approximately equal in length, they achieve a more balanced computational effort between encryption and decryption. [ABSTRACT FROM AUTHOR]

In today's fast-evolving technological environment, ensuring confidentiality is of utmost importance. Cryptography stands as a critical discipline in safeguarding information from unauthorized access. It employs various encryption algorithms to secure data effectively. As digital threats evolve, there's a growing demand for unconventional encryption methods to counter traditional cyber-attacks. This paper introduces innovative encryption algorithms leveraging special graphs and public key cryptography techniques, enhancing security through modular arithmetic properties and enabling more robust communication safeguards. A partition V1, V2, . . ., Vk of the vertex set V is called a chromatic partition of G if each Vi, 1 = i = k is an independent set of G. The minimum order of a chromatic partition of G is called chromatic number X(G). A chromatic partition of G is called an ordered partition if |V1| = β0 and |Vi| = β0(V − ∪i j=1Vj). The order of a minimum ordered chromatic partition of G is called ordered chromatic number χ1(G). It is immediate that χ1(G) ≥ χ(G). In this paper we extend Nordhaus Gaddum results to ordered chromatic number. [ABSTRACT FROM AUTHOR]

Lately, image encryption has stand out as a highly urgent demand to provide high security for digital images against use and unauthorized distribution. A lot of existing researches use chaotic systems, symmetric or asymmetric schemes for image encryption, but cryptosystem based on one encryption technique only, faces many challenges like weak security and low complexity. Therefore, incorporating two or more different ciphering methods yields a secure and efficient algorithm to protect image information. In this work, a new image cryptosystem is suggested by joining zigzag scan technique, RSA algorithm and chaotic systems. These three security factors introduce Triple Incorporated Ciphering stages system (TIC). Initially, the plaintext image is divided into 8 × 8 non-overlapping blocks, then the odd blocks are isolated from the even blocks. After that, a new modified zigzag scan in two different directions is adopted for shuffling pixels in the odd and even blocks. This operation effectively enhances the shuffling degree. Next, the RSA algorithm is utilized after combining the scrambled blocks in one matrix. Finally, chaotic systems are implemented on the resultant encrypted matrix to complete the ciphering process. The chaos is implemented in two steps; confusion and diffusion. Duffing map is exploited in the confusion stage, whereas Lu system is adopted on the shuffled matrix in the ¨ diffusion stage. The simulation results show the superiority of TIC in both security and attacks robustness compared to other cryptographic algorithms. Therefore, TIC can be exploited in real-time communication systems for secure image transmission. [ABSTRACT FROM AUTHOR]

End-to-End Encryption (E2EE) plays an essential role in safeguarding user privacy and protecting sensitive data across various communication platforms, including messaging applications, email services, and Internet of Things (IoT) devices. This paper presents a Hybrid Cryptography-Based E2EE method implemented on a Software Defined Networking (SDN) infrastructure, to strengthen bidirectional data security between hosts and IoT devices via the non-secure Message Queuing Telemetry Transport (MQTT) port. By addressing the threat of Man-in-the-Middle (MitM) attacks, the proposed system ensures that only authorized users can decrypt transmitted messages. This paper thoroughly analyzes the implementation and advantages of our Hybrid Cryptography-Based E2EE method by comparing RSA and ECC encryption techniques. ECC-256 is favored for key generation, owing to its high efficiency and speed, measured at 0.4009 ms. Additionally, through a comparison of RSA, AES, and ChaCha20 algorithms, AES-256 emerges as the optimal encryption choice, demonstrating the fastest encryption and decryption times for publishing 0.2758 ms and 0.1781 ms, respectively and for subscribing, with encryption at 0.2542 ms and decryption at 0.1577 ms. Along with its minimal packet size and low resource consumption, our proposed Hybrid Cryptography-Based E2EE method, implemented on SDN infrastructure, validate it's effectiveness in securing digital communications within SDN environments compared to existing solutions. [ABSTRACT FROM AUTHOR]

Recent research is focused on the exploitation of DNA-based molecules for data encryption due to their high capacity to store larger volumes of data and lower computation requirements [1, 2]. This study proposes a Hybrid Image Encryption method (HIE) that convolves DNA sequence encoding with the Rivest-Shamir-Adleman (RSA) algorithm to enhance the security of image encryption. The proposed scheme uses small prime numbers to encrypt the image, which is then encoded as a DNA sequence. Subsequently, the encrypted DNA sequence is stored in a physical medium. The encrypted DNA sequence can then be decrypted using the RSA algorithm and the corresponding private key to recover the original image. The results show that using small prime numbers for RSA encryption of an image and encoding it as a DNA sequence can enhance security and reduce computational time. [ABSTRACT FROM AUTHOR]

The main aim of this research is to provide a methodical review of secure frameworks in IoT using blockchain technology. Because of its decentralized security and resistance to attacks, blockchain has emerged as a possible solution to the growing need for secure data transmission in IoT. The work also gives comprehensive look at several algorithms comprising FIEO, Consensus algorithm, RSA asymmetric key algorithm and hash algorithms; and relative frameworks like Ethereum, CoSMOS, Hyperledger Fabric, and RTS-DELM system model. The assessment and analysis were made with reference to the following parameters, which embraced the parametric evaluation of these methodologies. Aided by the analysis of various frameworks, the paper assesses opportunities and dimensions, and in doing so, covers new issues and solutions with analysis in detail. Additional recommendations for the enhancement of IoT devices on blockchain based quality and performance are also outlined. In sum, this research contributes towards the identification of secure frameworks using blockchain technology in IoT systems and provides valuable information regarding future opportunities in this kind of industry. [ABSTRACT FROM AUTHOR]

Information security and confidentiality are burning issues in today's digitally connected world. Encryption is considered a fast-moving trend in this reference. Although we see rigorous enhancements in the development of information security tools, storage and retrieval, enormous challenges still occur due to unsecured transmission channels, hacking tools and the ubiquity of the Internet. This paper proposes a new cryptography mechanism for secure data transmission and retrieval using a signed graph, its adjacency matrix and the RSA algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we aimed to develop a trusted secured routing Ad-hoc ondemand distance vector (AODV) protocol to fight against blackhole attacks within the wireless body area network (WBAN). The trusted secure routing protocol incorporates a routing strategy based on trust value to detect malicious nodes based on their trust value, a routing technique based on node residual energy to select the node with the highest residual energy during the communication process, and a hybrid cryptography algorithm that merges the Affine cipher with the modified RSA cipher algorithm to secure communication against malevolent biomedical sensor attacks. Simulation outcomes demonstrate that the suggested protocol outperforms the traditional AODV routing protocol in all evaluation metrics, including data rate, energy consumption, and packet delivery ratio. Its main strength is that it considers several factors, like illegitimate medical sensor detection, efficient network energy use, and secure data transmission, unlike similar secured routing protocols. Furthermore, the hybrid cipher algorithm improves the effectiveness and increases the security level of sensitive data compared to traditional cipher algorithms such as the Affine cipher and the RSA cipher. [ABSTRACT FROM AUTHOR]

The RSA cryptosystem has been a cornerstone of modern public key infrastructure; however, recent advancements in quantum computing and theoretical mathematics pose significant risks to its security. The advent of fully operational quantum computers could enable the execution of Shor's algorithm, which efficiently factors large integers and undermines the security of RSA and other cryptographic systems reliant on discrete logarithms. While Grover's algorithm presents a comparatively lesser threat to symmetric encryption, it still accelerates key search processes, creating potential vulnerabilities. In light of these challenges, there has been an intensified focus on developing quantum-resistant cryptography. Current research is exploring cryptographic techniques based on error-correcting codes, lattice structures, and multivariate public key systems, all of which leverage the complexity of NP-hard problems, such as solving multivariate quadratic equations, to ensure security in a post-quantum landscape. This paper reviews the latest advancements in quantum-resistant encryption methods, with particular attention to the development of robust trapdoor functions. It also provides a detailed analysis of prominent multivariate cryptosystems, including the Matsumoto–Imai, Oil and Vinegar, and Polly Cracker schemes, alongside recent progress in lattice-based systems such as Kyber and Crystals-DILITHIUM, which are currently under evaluation by NIST for potential standardization. As the capabilities of quantum computing continue to expand, the need for innovative cryptographic solutions to secure digital communications becomes increasingly critical. [ABSTRACT FROM AUTHOR]

Currently, vector map encryption algorithms predominantly rely on symmetric key encryption, which poses significant risks due to potential key leakage. On the other hand, existing asymmetric encryption algorithms, although offering enhanced key security, require the conversion of data into integer form before encryption, which can compromise the precision and accuracy of the original vector map data. To address these issues, this paper introduces a novel asymmetric lossless encryption algorithm for vector maps based on the RSA algorithm. The proposed algorithm begins by dynamically selecting the integer part of the coordinate values from the vector map. These selected values are then encrypted asymmetrically using RSA, ensuring both security and data integrity. To further enhance the encryption process, SHA-512 is employed to generate a key for a chaotic system. This chaotic system is subsequently used to reorganize the point coordinates of the already encrypted vector map, achieving a one-map, one-ciphertext encryption model. Experimental results demonstrate that the proposed algorithm is capable of encrypting and lossless decrypting various types of vector maps without any data distortion. Furthermore, the algorithm is versatile and can be applied to other types of geospatial data, including 3D point clouds and oblique photography 3D models, making it a robust solution for a wide range of geospatial encryption needs. [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]

Despite the development of numerous cryptographic algorithms over the last decade to ensure greater security for the users, the cyberattack forms are still advancing, which creates a challenge for the research community to build more efficient infrastructure. It motivates us to design more advanced algorithms based on a set of matrices that form a group under matrix multiplication, meaning they satisfy the group axioms of closure, associativity, identity, and irreversibility. Specifically, this study explores the application of three cryptographic algorithms on a special linear group of matrices over a ring of integers modulo m. The first algorithm relies on the RSA key exchange algorithm, which we modify to a special linear group. The second is an asymmetric RSA variant of a cryptographic algorithm defined on the co-adjoint orbit of element K belonging to a special linear group. All matrices from the orbit of matrix K have the same order and can be easily encrypted and decrypted by a pair of secret asymmetric cryptographic keys. We apply the Kronecker product of non-Abelian groups to construct an energy-efficient cryptographic algorithm with possible application on sensor networks. Due to the multiplicative property of the Kronecker product, both the encryption and decryption can be performed in parallel over the matrices of low degree. The third one is another RSA variant of a symmetric cryptographic algorithm, which can be encoded with a special linear group to significantly increase its complexity at the stage of non-negative matrix factorization. To encrypt a given set of numbers, we write it in a matrix form with a secret sequence of generators. As a result, the decryption relies on solving a simple system of nonlinear equations. Security of the algorithm lies in its complexity, aimed at building a correct sequence of generators necessary for encryption.

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]

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]

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]

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]

In the digital age, securing data and ensuring communication confidentiality are paramount, highlighting the crucial role of public key cryptography. Traditional algorithms like RSA, while secure, have limitations due to their long key lengths and computational intensity, making them less suitable for resource-constrained environments. Elliptic Curve Cryptography (ECC) is favored for its compact keys and strong security but faces new challenges with quantum computing. To address this, we introduce Enhanced Elliptic Curve Cryptography (EECC), an algorithm that enhances security and efficiency. EECC uses secure elliptic curves, an advanced random number generator, optimized key lengths, and quantum-resistant mechanisms to fortify against quantum threats. Both theoretical analysis and empirical tests show EECC's effectiveness in thwarting attacks and improving encryption and decryption speeds, affirming its value in modern secure communications and data protection. [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]

In the recent era, the high speed networking technologies plays a vital role in Internet of Vehicles (IoV) is increasingly prevalent in numerous real-time applications. In IoV network, the communication between different vehicles are rapidly increased by sharing essential information such as traffic conditions, pathways, vehicle details, and position which enables to enhancing traffic safety and optimizing vehicle efficiency. The secure exchange of highly sensitive IoT network details among the vehicles is of paramount importance. Establishing robust security measures is essential to safeguard the integrity and confidentiality of this critical data exchange mechanism. The proposed model introduces a novel approach that leverages both steganography and encryption techniques to bolster the confidentiality and integrity of sensitive information exchanged among the vehicles in the IoV network. Initially, the sensitive information undergoes encryption using the Improved RSA (IRSA) algorithm. Subsequently, the data bits within the encrypted messages are subjected to binary flipping, and these altered bits are then embedded into a cover image using Pixel Value Differencing (PVD) and Pixel Value Indicator (PVI) steganography methods. This triple-layered security approach ensures the confidentiality and integrity of shared information in IoV, bolstering the security of sensitive messages and providing superior imperceptibility along with a high embedding capacity. The Experimental results shows that the proposed method produces an average PSNR of 41.5862 dB for 512x512 images and an embedding capacity of 1,028,455 bits, suitable for secret messages of 31,982 characters in size compare to the various existing methods.

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]

Protecting sensitive data is crucial in the age of widespread data digitalization and cloud-based services. This paper proposes a unique hybrid encryption algorithm deployed and tested over the cloud platform. The algorithm is reinforced with the robust cryptographic combination of Advanced Encryption Standard (AES) and Rivest-Shamir-Adleman (RSA). By utilizing the inherent benefits of symmetric and asymmetric encryption, the algorithm aims to improve the efficiency and security of data at rest and data being transmitted in a cloud-based environment. When tested on varied-length files and large data, the proposed algorithm encrypts the data securely and quickly. Various attacks including brute force, cryptanalysis were performed in the deployed environment to test the efficiency and effectiveness of the algorithm. It is observed that the algorithm outperformed Diffie-Hellman algorithm in terms of speed of encryption and data security with a factor of 6%. The algorithm's robustness against different security risks and its flexibility in changing cloud situations through an extensive examination is proven. The results not only highlight the hybrid approach's efficacy but also support its possible use in practical applications, therefore launching a new wave of robust cloud-based data management systems. [ABSTRACT FROM AUTHOR]

The Rivest-Shamir-Adleman (RSA) method is commonly used to ensure secure data transmission. However, RSA's encryption and decoding methods need significant processing resources, which can strain computing capacity. To address this issue, we offer a parallel implementation of the RSA algorithm based on OpenMP, a popular shared-memory parallelism API. A series of trials show that our parallel implementation outperforms its sequential equivalent in terms of execution times. Our investigation focuses primarily on the achieved speedup on a multi-core CPU, with an examination of how thread count affects the performance of our parallel solution. This study demonstrates the power of parallel computing in optimizing the RSA method for speedier data transmission. [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]

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]

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]

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]

In arbitrary arithmetic computation and computational science, multiplying large integers is a widely used operation. Numerous cryptographic techniques involve operations on extremely large subsets of the integer numbers, including the Diffie-Hellman key exchange, RSA, ECC, and others. These techniques employ safe message encryption, decryption, and key exchange using security keys with a size of at least 1024 bits. Exponentiation and multiplication are necessary in order to carry out encryption, decryption, and key exchange. The Karatsuba algorithm is a fast and efficient method for multiplying large numbers, that reduces the number of multiplications from four to three at each recursive step. In this paper, we conduct a comprehensive assessment of the Karatsuba algorithm's performance when applied to both sequential and parallel contexts. We utilize the power of Nvidia Graphics Processing Unit (GPU) with Compute Unified Device Architecture (CUDA) programming to gauge the speedup of the parallel implementation and processor configurations. The speedup achieved by the Karatsuba algorithm running on Nvidia GPU CUDA platform over the sequential is 30.12. There exists an improvement in performance by making use of available GPU cores. The findings emphasize the potential advantages of parallelization in reducing the overall computation time. [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]