Explore the vast range of titles available.

As the crime rates are increasing, the process of ensuring security has become one of the important demands in wide networks. There is always a chance by third-party to threatened the data privacy and security, which led to continued development the information security. Cryptography defined as the process of encoding or encoding data to make it incomprehensible using mathematical operations. DNA cryptography is a new branch of DNA computation that represents a new era of technology in security for data transfer over the internet. In this paper, a Novel Algorithm Based on DNA Cryptography and Combination with One Time Pad and Caesar cipher has been introduced. The output of the algorithm is the tested using National Institute of Standards and Technology (NIST) statistical test suite much time to check the strength of an algorithm with the encrypted text. The algorithm has shown promising results.

Researches in Artificial Intelligence (AI) have achieved many important breakthroughs, especially in recent years. In some cases, AI learns alone from scratch and performs human tasks faster and better than humans. With the recent advances in AI, it is natural to wonder whether Artificial Neural Networks will be used to successfully create or break cryptographic algorithms. Bibliographic review shows the main approach to this problem have been addressed throughout complex Neural Networks, but without understanding or proving the security of the generated model. This paper presents an analysis of the security of cryptographic algorithms generated by a new technique called Adversarial Neural Cryptography (ANC). Using the proposed network, we show limitations and directions to improve the current approach of ANC. Training the proposed Artificial Neural Network with the improved model of ANC, we show that artificially intelligent agents can learn the unbreakable One-Time Pad (OTP) algorithm, without human knowledge, to communicate securely through an insecure communication channel. This paper shows in which conditions an AI agent can learn a secure encryption scheme. However, it also shows that, without a stronger adversary, it is more likely to obtain an insecure one.

With the advent of 6G Narrowband IoT (NB-IoT) technology, IoT security faces inevitable challenges due to the application requirements of Massive Machine-Type Communications (mMTCs). In response, a 6G base station (gNB) and User Equipment (UE) necessitate increased capacities to handle a larger number of connections while maintaining reasonable performance during operations. To address this developmental trend and overcome associated technological hurdles, this paper proposes a hardware-accelerated and software co-designed mechanism to support streaming data transmissions and secure zero-trust inter-endpoint communications. The proposed implementations aim to offload processing efforts from micro-processors and enhance global system operation performance by hardware and software co-design in endpoint communications. Experimental results demonstrate that the proposed secure mechanism based on the use of non-repeating keys and implemented in FPGA, can save 85.61%, 99.71%, and 95.68% of the micro-processor’s processing time in key block generations, non-repeating checks, and data block transfers, respectively.

Internet of Things (IoT) is an emerging technology that consists of tiny sensors embedded with IoT devices used in e-Health, smart cities and assisted living. IoT devices are equipped with constrained power, memory, and computing capabilities, which creates new security challenges. By integrating sensors and wireless technologies, this cutting-edge technology automates numerous routine tasks in different domains. The main goal of advancing IoT in the existing healthcare system is to automate the monitoring of hospitals and patients’ health by spreading goodwill toward the IoT vision. IoT has gained popularity on practically all platforms that are available. This paper presents a remote patient health monitoring and diagnosis system that uses Message Queuing Telemetry Transport protocol (MQTT) and Internet of Things (IoT) devices with one time pad cryptography. The proposed plan offers end-to-end data secrecy for an IoT system using MQTT that enables e-health and mobility. Patients’ movements inside nursing homes and healthcare facilities are also managed safely without the need for periodic reconfigurations. Prior to communicating through the MQTT protocol, this secure crypto scheme encrypts the message on both the publisher and subscriber ends. According to the results, the proposed scheme is more efficient than delegation-based architecture in terms of security and lightweight communication. The proposed system established communication between patients and medical experts using IoT technologies to alleviate the hospital strain caused by congestion in medical treatment and enable an expressway of medical responses. According to our results the proposed scheme has low computational overhead compared to other solutions that use conventional encryption to guarantee robust protection against most of the IoT security attacks.

This research delves into the concerns raised by numerous researchers regarding the security of Baptista’s chaotic cryptosystem. The paper scrutinizes two fundamental issues in the Baptista algorithm: the imperfect distribution of chaotic data and the constraints of a single attractor. To address these issues, we propose a novel approach that leverages Parrondo’s paradox to switch between two chaotic attractors and integrates a more robust logistic map into the Baptista algorithm by introducing additional parameters to the secret key. The two innovative methods, Superior Baptista and alternated Superior Baptista cryptosystems, are proposed to yield improved chaotic data or two new chaotic attractors. Therefore, the security features of the cryptosystem are enhanced by increasing the number of system iterations used for encryption. Experimental evaluations show that the Superior Baptista Algorithm required iteration counts up to 2,823, while the Alternated variant reached 86,556 iterations for specific characters, significantly improving randomness and diffusion. Furthermore, the entropy values of these algorithms are calculated 67.35% and 42.86% higher than those of the Baptista algorithm, respectively. These findings demonstrate the superiority of the proposed cryptosystems over the base algorithm.

Securing digital medical images is increasingly becoming a major concern due to the rapid growth of the amount of medical images transferred over a network and stored on the web servers. However, the enormous size of multimedia and the huge volume of exchanging medical images have motivated the development of low computational complexity methods. This paper presents a lightweight selective encryption scheme to encrypt the edge maps of medical images. The edge map is firstly extracted by an edge detection method. Then, a chaotic map is used to generate a large key space. We propose a one-time pad algorithm to respectively encrypt the significant detected image blocks. The experimental results have proven that the proposed encryption scheme provides an acceptable percentage of encrypted image data. It can also effectively perform image encryption and decryption in a lightweight manner, which makes the scheme a good candidate for real time applications. Moreover, the security analysis demonstrates that our scheme has a robust resistance against various security attacks.

The huge improvement in the field of data innovation and the web presentation to a surge of infringement to go around and take data, the earnest requirement for the development of information assurance advancements and information encryption procedures. A new Programmatic OTP Algorithm using an unsystematic key generation for ciphering plaintext presented in this paper. This method, based on create randomly a number (n) called add number, where the plaintext characters converted to a binary form and splits into equal parts according to n value with 2n ciphering keys generated. The keys will be distributed on these parts to get ciphered text. Accordingly, one of these keys its generation number will be set for all different n’s. The different n’s occurred Consecutively to the number of characters consist the plain message unlike the traditional OTP algorithm. This method characterized by a facility that the same generated key can produce different ciphering text using 2n probability. The proposed methodology has been proved as perfect ciphering method compared with OTP using statistical tests

In quantum key distribution (QKD), public discussion over the authenticated classical channel inevitably leaks information about the raw key to a potential adversary, which must later be mitigated by privacy amplification. To limit this leakage, a one-time pad (OTP) has been proposed to protect message exchanges in various settings. Building on the security proof of Tomamichel and Leverrier, which is based on a non-asymptotic framework and considers the effects of finite resources, we extend the analysis to the OTP-protected scheme. We show that when the OTP key is drawn from the entropy pool of the same QKD session, the achievable quantum key rate is identical to that of the reference protocol with unprotected error-correction exchange. This equivalence holds for a fixed security level, defined via the diamond distance between the real and ideal protocols modeled as completely positive trace-preserving maps. At the same time, the proposed approach reduces the computational requirements: for non-interactive low-density parity-check codes, the encoding problem size is reduced by the square of the syndrome length, while privacy amplification requires less compression. The technique preserves security, avoids the use of QKD keys between sessions, and has the potential to improve performance.

Following an in-depth analysis of one-dimensional chaos, a randomized selective autoencoder neural network (AENN), and coupled chaotic mapping are proposed to address the short period and low complexity of one-dimensional chaos. An improved method is proposed for synchronizing keys during the transmission of one-time pad encryption, which can greatly reduce the usage of channel resources. Then, a joint encryption model based on randomized AENN and a new chaotic coupling mapping is proposed. The performance analysis concludes that the encryption model possesses a huge key space and high sensitivity, and achieves the effect of one-time pad encryption. Experimental results show that this model is a high-security joint encryption model that saves secure channel resources and has the ability to resist common attacks, such as exhaustive attacks, selective plaintext attacks, and statistical attacks.

In this paper, a secure quantum proxy group signature (QPGS) scheme based on three-qubit entangled states is proposed. The three-qubit entangled state functions as a quantum channel, conserving entanglement resources more effectively than similar papers that have been proposed. The properties of proxy signature and group signature are satisfied at the same time. In this scheme, quantum one-time pad (QOTP) methods and eavesdropping detection techniques with quantum properties are adopted. In addition, the security analysis of this scheme shows that our scheme has unforgeability and undeniability as well as resistance to some existing attacks. The QPGS has the potential to be used in scenarios where representative signatures of group members are required, and privacy protection is needed.