Decryption Process Research Articles

Secure Drone Communications using MQTT protocol

With the revolutionary change in emerging technologies, the usage of drones or unmanned aerial vehicles (UAV) has exponentially increased in different sectors like Industry, healthcare, military, agriculture, real estate, manufacturing, logistics, energy and many more utilities. This rapid growth creates a concern for the secure communication between the internal communication modules and the ground based computer system used for controlling the UAV. Intruder can hack into the device and attack the internal communication device with the injection of the malicious code which can lead to the malfunction of the aircraft. Security issues related to the communication between the internal modules of the drone and the ground based computer system is of major concern and is crucial. UAVs have to operate in constrained networks with limited bandwidth. In such a constrained environment MQTT protocol can be an excellent protocol. No cryptographic techniques are used to retain the simplicity and the light weight of the MQTT protocol. This contributes for the large scope for emerging with new solutions in the protection issues of MQTT communications. This paper mainly focuses on Armstrong number encryption standard algorithm for providing a computationally simple yet a secure and strong algorithm for UAVs encryption and decryption process on the communication links using MQTT protocol.

Hierarchical Threshold Multi-Key Fully Homomorphic Encryption

Fully Homomorphic Encryption (FHE) supports computation on encrypted data without the need for decryption, thereby enabling secure outsourcing of computing to an untrusted cloud. Subsequently, motivated by application scenarios where private information is offered by different data owners, Multi-Key Fully Homomorphic Encryption (MKFHE) and Threshold Fully Homomorphic Encryption (ThFHE) were successively introduced. However, both MKFHE and ThFHE have some limitations: MKFHE requires the participation of all members during the decryption process and does not support decryption using a subset of members, while ThFHE requires pre-fixed participants and does not support dynamic joining or exiting.To address these limitations, in this paper, we propose a new notion called Hierarchical Threshold Multi-key Fully Homomorphic Encryption (HTM-FHE), which combines the features of MKFHE and ThFHE, incorporating the advantages of both. Then we provide the first construction of HTM-FHE based on lattice, denoted as HTM-TFHE. Our scheme can evaluate a binary gate on ciphertexts encrypted under different groups’ public keys followed by a bootstrapping procedure. The semantic and simulation security of HTM-TFHE is proven under the LWE assumption. Furthermore, HTM-TFHE supports fine-grained access control for encrypted data, which provides benefits in practical applications.

A Modified Key Generation Algorithm to Rebalanced-RSA and RPower-RSA

The RSA cryptosystem, introduced by Rivest, Shamir, and Adleman [1], is a widely renowned public-key encryption method. Over the years, researchers have proposed numerous variants of RSA, with the goal of enhancing its efficiency by reducing computation costs in encryption or decryption processes [2]. This paper provides a comprehensive summary of the RSA algorithm and its variants, focusing on techniques aimed at improving the speed of the RSA cryptosystem. Additionally, categorizes these variants into two classes and presents two new modified key generation algorithms for the Rebalanced-RSA and the RPower-RSA. The proposed key generation algorithm improves the encryption process compared to the original variants and achieves a more balanced computing effort for both encryption and decryption.

SAMFL: Secure Aggregation Mechanism for Federated Learning with Byzantine-robustness by functional encryption

Federated learning (FL) enables collaborative model training without sharing private data, thereby potentially meeting the growing demand for data privacy protection. Despite its potentials, FL also poses challenges in achieving privacy-preservation and Byzantine-robustness when handling sensitive data. To address these challenges, we present a novel Secure Aggregation Mechanism for Federated Learning with Byzantine-Robustness by Functional Encryption (SAMFL). Our approach designs a novel dual-decryption multi-input functional encryption (DD-MIFE) scheme, which enables efficient computation of cosine similarities and aggregation of encrypted gradients through a single ciphertext. This innovative scheme allows for dual decryption, producing distinct results based on different keys, while maintaining high efficiency. We further propose TF-Init, integrating DD-MIFE with Truth Discovery (TD) to eliminate the reliance on a root dataset. Additionally, we devise a secure cosine similarity calculation aggregation protocol (SC2AP) using DD-MIFE, ensuring privacy-preserving and Byzantine-robust FL secure aggregation. To enhance FL efficiency, we employ single instruction multiple data (SIMD) to parallelize encryption and decryption processes. Concurrently, to preserve accuracy, we incorporate differential privacy (DP) with selective clipping of model layers within the FL framework. Finally, we integrate TF-Init, SC2AP, SIMD, and DP to construct SAMFL. Extensive experiments demonstrate that SAMFL successfully defends against both inference attacks and poisoning attacks, while improving efficiency and accuracy compared to existing methods. SAMFL provides a comprehensive integrated solution for FL with efficiency, accuracy, privacy-preservation, and robustness.

Design of decryption process for advanced encryption standard algorithm in system-on-chip

Design of decryption process for advanced encryption standard algorithm in system-on-chip

Implementation of the Caesar Chiper Method in Cryptography for Message Data Security

Data security in the digital era is a very important aspect, especially in maintaining the confidentiality and integrity of information transmitted over the network. One of the classic cryptographic methods that is often used to secure messages is the Caesar Cipher. This method uses a simple substitution technique, where each letter in the message is shifted a certain number of steps in the alphabet. This research discusses the implementation of the Caesar Cipher method as a basic solution for message data security. Although this algorithm is relatively easy to implement and understand, the Caesar Cipher has weaknesses, mainly due to its fixed shifting pattern making it vulnerable to brute force attacks or frequency analysis. Through testing and implementation, this research shows how Caesar Cipher works in the encryption and decryption process, and evaluates its effectiveness in protecting messages from unauthorized access. The results show that this method, although less powerful than modern algorithms, can still be used for certain scenarios that do not require a high level of security. On the other hand, the weaknesses underscore the importance of developing and using more complex cryptographic methods to protect more sensitive information in today's digital era.

Securing the Future: Shifting to Post-Quantum Cryptography Amidst Quantum Threats

Current cryptographic systems, heavily reliant on classical algorithms, are increasingly vulnerable to the formidable capabilities of quantum computing. Notably, quantum algorithms such as Shors and Grovers pose profound threats by accelerating decryption processes, which could soon make existing cryptosystems ineffective. This paper stresses the critical need and complexity of shifting to Post-Quantum Cryptography (PQC) to safeguard encrypted communications against these emerging quantum threats. It outlines the timeline of the National Institute of Standards and Technologys (NIST) efforts in standardizing PQC, elucidating the significant challenges and the essential nature of adopting these new standards. While NIST provides structured guidance, transitioning to PQC presents substantial risks and difficulties, particularly in terms of organizational adaptation and the technical overhaul required. The discourse further explores the tangible implications of quantum advancements on both symmetric and asymmetric key cryptography, highlighting the potential vulnerabilities and the increased risk of security breaches. The paper underscores the imperative for immediate action in initiating the transition towards robust PQC systems, given the rapid development and anticipated deployment of quantum computing technologies capable of decrypting currently secure information. This transition is not merely a technical upgrade but a crucial strategic move to preemptively counteract quantum threats, ensuring the continued confidentiality and integrity of sensitive data across various sectors.

THE IMPLEMENTATION OF RSA ALGORITHM IN TEXT MESSAGES ENCRYPTION AND DECRYPTION

In terms of texting, especially in such an ultramodern period of time, precisely 4.0 Industry, one of its topmost challenge or problems faced is related to security. Thousands, if not, hundred thousands of crime are committed through text message hacking because text communication could contain plenitude of particular personal informations, similar as passwords, ID number, phone number, etc. Cryptography from the Discrete Mathematics field is one of the best option to cover the data contained in text messages, hence, as time passed by, it is developed into RSA Algorithm; encryption and decryption key. Anyone who possess the wrong key will still be able to get the message, but the encrypted version would be far different from the real one.. The conversation covers basic topics such the decryption process—which reverses this process using a private key—and the encryption process—which converts plaintext into ciphertext by means of a public key. using means of prime numbers in key generation using RSA, data confidentiality is facilitated, therefore allowing only those with the suitable private key to decode the messages. Different cases show how well RSA protects personal data sent across networks, therefore stressing its importance in enhancing safe digital communication. Using a public key, the encryption process transforms plaintext into ciphertext therefore only those with the corresponding private key can decode the message. RSA creates safe, asymmetric key pairs by means of a mathematical approach involving prime numbers, therefore impeding attackers' access into the system. Emphasizing RSA's relevance in maintaining communications safe in email, mobile, and online apps, practical examples show how effectively the algorithm performs for encrypting and decryption of text messages. The paper then discusses how difficult RSA computation is and emphasizes how much security is truly enhanced by employing big prime values. This paper emphasizes the need of RSA for safeguarding digital communications and establishing a safe environment for data flow in modern digital systems.

Implementing the Grover algorithm in homomorphic encryption schemes

We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of T+T† gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains three qubits. The T+T†-gate complexity of Grover's algorithm is also analyzed in order to show that any Grover circuit can be evaluated homomorphically in an efficient manner. We discuss how to apply these QHE schemes to allow for the efficient homomorphic evaluation of any Grover circuit composed of n qubits using n−2 extra ancilla qubits. We also show how the homomorphic evaluation of the special case where there is only one marked item can be implemented using an algorithm that makes the decryption process more efficient compared with the standard Grover algorithm. Published by the American Physical Society 2024

Secure authentication and encryption via diffraction imaging-based encoding and vector decomposition

Abstract Traditional optical encryption systems have security risks due to their linearity and usually encounter problems such as the heavy burden of key transmission and storage. This paper proposes a novel security-enhanced optical image authentication and encryption framework that combines diffractive imaging-based encryption with the vector decomposition algorithm (VDA). Chaotic random phase masks (CRPMs) are used to encrypt data for authentication via VDA, and a pair of complementary binary matrix keys are utilized to extract information from the encrypted data to generate ciphertext. During the authentication and decryption processes, a sparse reference image is reconstructed from the ciphertext for verification. If the authentication is successful, image decryption can be executed using a key-assisted phase retrieval algorithm. The employment of nonlinear VDA, an additional layer of authentication, and the use of CRPMs and binary matrix keys enhance security and address key burden concerns. Simulation results demonstrate the feasibility, effectiveness, and security of the scheme.

A fuzzy activation function based zeroing neural network for dynamic Arnold map image cryptography

As an effective method for time-varying problems solving, zeroing neural network (ZNN) has been frequently applied in science and engineering. In order to improve its performances in practical applications, a fuzzy activation function (FAF) is designed by introducing the fuzzy logic technology, and a fuzzy activation function based zeroing neural network (FAF-ZNN) model for fast solving time-varying matrix inversion (TVMI) is proposed. Rigorous mathematical analysis and comparative simulation experiments with other models guarantee its superior convergence and robustness to noises. In addition, based on the proposed FAF-ZNN model, a new dynamic Arnold map image cryptography algorithm is designed. Specifically, in the new dynamic image encryption, a dynamic key matrix is introduced, and the FAF-ZNN model is applied to fast compute the inversion of the dynamic key matrix for the dynamic Arnold map image cryptography decryption process. The effectiveness of the dynamic image encryption algorithm is verified by experiment results, which enhances the security of existing image encryption algorithms.

Hybridized data encoding based encryption and Diffie Hellman decryption for security enhancement

Information security is extremely important because the modification and interception of the data can lead to loss of data integrity, confidentiality, and availability. The encryption process is a critical component of classic standard encryption techniques such as advanced encryption, standard block ciphers, and data encryption standards. The traditional algorithm requires increased power consumption and memory. Therefore, there is a need to develop an efficient cryptographic operation to promote better security. The encryption process is performed using the Hybridized Data Encoding (HDE) model. Here, the optimal keys can be selected using the Chaotic Coati optimization algorithm (ChCoA). The decryption process can be performed using the Enhanced Diffie Hellman algorithm (EDHA). The resulting achievements will include effective encryption and decryption algorithms that together strengthen data security, facilitate secure data exchange, and provide superior protection against data vulnerabilities. By implementing the proposed work in the Matlab working platform, the performances in terms of encryption time, decryption time, processing time and throughput are analyzed. The proposed model achieved a throughput of 249.1093 (kb/s) and a processing time of 0.55 (sec).

Super Encryption Feal Algorithm and Base64 Algorithm Image File Security

In the rapidly advancing digital era, image file security has become a critical issue, especially with the increasing risks of data breaches and attacks on digital files. This study aims to enhance the security of image files by implementing a combination of two cryptographic algorithms: Fast Data Encipherment Algorithm- 4 (FEAL-4) and Base64. FEAL-4 is a symmetric encryption algorithm known for its high speed and processing efficiency, while Base64 is used for encoding binary data into ASCII format to ensure safer transmission. This research develops a super encryption system that integrates these two algorithms to protect the integrity and confidentiality of image files, particularly for BMP, JPEG, and PNG formats. The implementation was carried out using the Visual Basic programming language. The results of the study show that the combination of FEAL-4 and Base64 algorithms significantly enhances the security of image files, with a high success rate in the encryption and decryption processes.

A lightweight BRLWE-based post-quantum cryptosystem with side-channel resilience for IoT security

The rapid advancement of quantum computing poses a significant threat to conventional cryptographic systems, particularly in the context of Internet of Things (IoT) security. This paper introduces PQ-IoTCrypt, a lightweight post-quantum cryptosystem for resource-constrained IoT devices. PQ-IoTCrypt builds upon the binary ring learning with errors problem, incorporating optimizations for efficient implementation on 8-bit microcontrollers commonly found in IoT environments. We introduce a symmetric discrete uniform distribution and streamlined polynomial arithmetic to reduce computational overhead while maintaining a high-security level. Additionally, we present a comprehensive power side-channel analysis framework for lattice-based post-quantum cryptography, demonstrating PQ-IoTCrypt's resilience against various side-channel attacks, including advanced ciphertext selection criteria, IoT-optimized template creation, and a hierarchical chosen-ciphertext attack methodology tailored for IoT deployments. Experimental results show that PQ-IoTCrypt achieves a 9.9% reduction in total encryption time compared to the next best baseline at the 256-bit security level while requiring significantly fewer ciphertexts for successful attacks. PQ-IoTCrypt demonstrates superior performance in key generation, encryption, and decryption processes, with times reduced by 12.7 %, 9.1 %, and 9.2 %, respectively, compared to the closest competitor. This work contributes to the standardization efforts of post-quantum IoT security and offers valuable insights for real-world deployment of quantum-resistant cryptography in resource-limited settings.

Self-Invertible Key on Cipher Polygraphic Polyfunction with Eigen Matrix based IMIE

Hill Cipher’s System and its modifications are still practiced mainly in sending a secret message involving images. One drawback that the recipient of the message is trying to overcome is to get the decryption key from the cipher text to plain text during the decryption process. Previous studies have proven that using self-invertible keys can reduce the computation cost to obtain this key. This paper generates a self-invertible matrix based on Integer-Entry Matrix with all Integer Eigenvalues (IMIE). Subsequently, we executed it into Cipher Polygraphic Polyfunction Cryptosystem and observed the effect.

Secret Key Extraction using Keyloggers

The application of keylogger technology for secret key extraction within a message-sending system is presented with practical example of its implementation in real-world scenarios. Keyloggers, designed to capture keystrokes, are repurposed to intercept cryptographic key input during the process of message encryption and decryption. By deploying keyloggers in a controlled environment, the sensitive cryptographic keys can be extracted from user interactions with the messaging application. The integration of keylogger tools with the messaging system includes technical details of their deployment and the methodologies used to capture and analyze keystrokes associated with cryptographic operations.

Diffractive Optical Encryption Systems Based on Multiple Wavelengths and Multiple Distances

Coherent diffractive imaging is an optical methodology that encodes information about an object within the diffraction intensity. Here, we introduce a diffractive optical encryption system that utilizes multiple wavelengths and multiple distances, significantly expanding the size of the secret key space and enhancing the overall security of the system by incorporating these parameters as keys. The system adopts single optical path design, compact structure and is easy to implement, overcoming the disadvantage of single key space of traditional encryption system. This system can encrypt images into a series of diffraction intensity maps (i.e., ciphertexts), and exhibits a high sensitivity to minor variations in wavelength or distance during the process of decryption, showing excellent anti-cracking ability. Furthermore, the system also has considerable robustness, ensuring that the information still can be effectively recovered even in instances of partial loss. Numerical simulation results are presented to demonstrate feasibility and effectiveness of the proposed method. Our study provides novel concepts and methodologies to the advancement of optical encryption technology, while also offering significant technical assistance to the domain of information security.

Quantum-based PRNG for image encryption: a comprehensive study

Quantum computing, grounded in the principles of quantum mechanics, has ushered in a new era of intriguing possibilities and fresh scientific insights. In this document, we present an innovative algorithm tailored for the encryption and decryption of images. This algorithm harnesses the quasi-probability values extracted from each state within the quantum system, represented as | ψ 〉 . These numerical values are seamlessly integrated with conventional data to facilitate image encryption and decryption processes. Our methodology undergoes comprehensive validation and evaluation through extensive simulations performed on the IBM Qiskit Aer simulator. We subject the generated numerical sequence to rigorous statistical scrutiny using the NIST SP 800-22 suite, ensuring its authenticity and reliability. Employing a quantum system comprising 3 qubits and uniform rotation gates, our algorithm produces a dataset consisting of 41,943,040 binary digits. Additionally, we conduct a thorough assessment encompassing both visual and statistical analyses to ascertain the effectiveness and robustness of our proposed algorithm. Furthermore, we emphasize the critical importance of achieving a quasi-probability error rate of 10 − 6 for real-world implementation, highlighting the practical viability and scalability of our approach. Through comparative analysis and meticulous examination of correlation patterns, our study provides invaluable insights into the distinctive characteristics and efficacy of our encryption scheme.

A robust algorithm for authenticated health data access via blockchain and cloud computing.

In modern healthcare, providers increasingly use cloud services to store and share electronic medical records. However, traditional cloud hosting, which depends on intermediaries, poses risks to privacy and security, including inadequate control over access, data auditing, and tracking data origins. Additionally, current schemes face significant limitations such as scalability concerns, high computational overhead, practical implementation challenges, and issues with interoperability and data standardization. Unauthorized data access by cloud providers further exacerbates these concerns. Blockchain technology, known for its secure and decentralized nature, offers a solution by enabling secure data auditing in sharing systems. This research integrates blockchain into healthcare for efficient record management. We proposed a blockchain-based method for secure EHR management and integrated Ciphertext-Policy Attribute-Based Encryption (CP-ABE) for fine-grained access control. The proposed algorithm combines blockchain and smart contracts with a cloud-based healthcare Service Management System (SMS) to ensure secure and accessible EHRs. Smart contracts automate key management, encryption, and decryption processes, enhancing data security and integrity. The blockchain ledger authenticates data transactions, while the cloud provides scalability. The SMS manages access requests, enhancing resource allocation and response times. A dual authentication system confirms patient keys before granting data access, with failed attempts leading to access revocation and incident logging. Our analyses show that this algorithm significantly improves the security and efficiency of health data exchanges. By combining blockchain's decentralized structure with the cloud's scalability, this approach significantly improves EHR security protocols in modern healthcare setting.

VISUAL CRYPTOGRAPHY WITH COLOR IMAGE ENCRYPTION VIA IMPROVED ELLIPTIC CURVE CRYPTOGRAPHY (ECC) AND OTP GENERATION: SELF-IMPROVED GOLD RUSH OPTIMIZATION ALGORITHM FOR OPTIMAL KEY GENERATION

Visual Cryptography is a cryptographic technique that involves encrypting images in such a way that decryption can be performed visually without the need for complex computations. This technique holds significant importance in secure image sharing, as it ensures that sensitive visual information remains confidential during transmission. Recognizing this significance, a novel approach named Self-Improved Gold Rush Optimization (SIGRO)-based Visual Cryptography has been proposed in this research. This approach encompasses two main phases: Embedding and Extraction. It involves encrypting three original images and two secret images using various encryption techniques such as Random grid-based secret image sharing, Extended Visual Cryptography Scheme (EVCS), and Kronecker product-based encryption, along with the integration of security measures like Modified HMAC-based One-Time Password generation technique (MHOTP) for Improved Elliptic Curve Cryptography (IECC)-based encryption and Baker's map-based encryption. In Kronecker product-based encryption stage, the SIGRO algorithm is utilized to generate optimal keys for encryption purposes. The SIGRO algorithm is proposed as a well-versed approach than the conventional Gold Rush Optimization (GRO) algorithm, incorporating three key enhancements. These enhancements significantly contribute to the efficacy and reliability of the SIGRO algorithm in generating optimal keys for Kronecker product-based encryption. Furthermore, the IECC-based encryption utilizes the MHOTP generation technique, where the OTPs generated by this technique serve as the keys for this encryption stage, enhancing the ECC algorithm into an IECC algorithm. The decryption process involves reversing the steps applied during various encryption stages. This proposed approach's significance lies in its ability to enhance security through a combination of encryption methods and security measures.