Cryptographic Algorithms Research Articles

An approach for encrypting images using a four-dimensional logistic map

Encrypting image transmission has been one of the most complex challenges with communication technology ever. Millions of people utilize and share photographs via the internet for personal and professional purposes. One approach to secure picture transfer over the network is to use encryption techniques to transform the original picture into an unreadable or garbled version. Several novel and encouraging possibilities for creating secure Image data encryption techniques are presented by cryptographic algorithms grounded in chaotic logistic theory. Developing a foolproof method for encrypting both black-and-white and color image is the primary focus of this work. Both grayscale and color images can be encrypted using the keys generated by combining the chaotic logistic with the image's density in the first stage of the proposed system's encryption process. The original image can then be recovered in the second stage, which is the inverse of the encryption process. Two publicly available standard grayscale and color photographs were analyzed to evaluate the suggested approach. Peak signal-to-noise ratio (PSNR), unified average changing intensity (UACI), and number of pixels change rate (NPCR) were found to be 6.6268, 51.3011, and 100, respectively, according to the test findings.

A TYPE OF POST–QUANTUM CRYPTOGRAPHIC ALGORITHM

The article proposes a type of post–quantum cryptographic algorithm based on hash function and One–Time Pad cipher. Due to inheriting a property called “perfect secrecy” of the One-Time Pad cipher, the algorithms constructed according to the method proposed here can resist various types of attacks with the help of quantum computers. In addition to high security, algorithms of this type also have the ability to authenticate the origin and integrity of the encrypted messages. On the other hand, the one-time key for encryption/decryption is established for each individual message while the management and distribution of the shared secret key between the sender/encryptor and receiver/decryptor is performed similar to symmetric – key cryptosystems being applied in practice.

Communication security of intelligent information service platform combining AES and ECC algorithms

ABSTRACT The rapid progress of information technology has made the status of information service platforms increasingly prominent in social operations. However, their communication security is also facing unprecedented challenges. In response to the issues of insufficient security and efficiency in traditional encryption algorithms, this study combines advanced encryption standard algorithms with elliptic curve cryptography algorithms to generate encryption key pairs through elliptic curve cryptography algorithms. It utilizes advanced encryption standard algorithms to generate symmetric keys, and then encrypts the keys of the advanced encryption standard using the public key of the elliptic curve cryptography algorithm. Based on this, it implements advanced encryption standard encryption on data and designs a hybrid encryption algorithm. The results showed that the throughput of this method was 4000bit/s, with a delay of 550 m, which is higher than other algorithms, proving its high efficiency in processing data. The average bit change of the ciphertext in the hybrid encryption algorithm was 55.8 bits, with a range of bit changes of [69.3, 82.7], which is significantly higher than other algorithms, proving its high security. The designed algorithm has significant benefits in communication security of information service platforms and plays an important role in promoting the development of future network security defense technology.

Scheme of construction of nonlinear polycryptosystem cryptographic protocols

The paper highlights the ways of constructing nonlinear encryption systems and proposes a scheme for constructing a nonlinear polycryptosystem cryptographic protocol that performs encryption of data blocks by various cryptographic systems in a pseudo-random sequence. Using the proposed scheme allows you to build a cryptographic protocol using ready-made and proven encryption systems, without making any changes to their design. The pseudo-random alternation of cryptosystems in the encryption process is based on a cryptographically strong gamma expansion algorithm, which increases the nonlinearity of encryption and improves the general cryptographically strong of systems. The article considered the structure of cryptosystems based on nonlinear cryptographic primitives, developed a model of the deployment process of modifiers of nonlinear cryptographic systems, and formed a general scheme of the structure of nonlinear cryptographic protocols using one or more different cryptosystems, provided they meet the specified requirements. The advantages of the proposed scheme are great flexibility, scalability, and the possibility of applying the highlighted concept both at the level of cryptographic algorithms or their fragments and at the level of cryptosystems and cryptographic protocols. The proposed solutions allow simple and effective improvement of existing cryptographic systems or their separate algorithms and are promising for further research.

Chinese Remainder Theorem-Based Encoding of Text to Point Elliptic Curve Cryptography

One of the most crucial requirements in this digital age is data security. The number of data usage increased drastically now a days, but how far the data is secured is the very big problem, though we have enough cryptographic algorithms for securing real time applications, but the level of the security against modern attacks is not determined. Elliptic Curve based Cryptography (ECC) is the most important cryptographic algorithm for confidentiality and authentication, providing high security level with small length keys when compared to other asymmetric algorithms like RSA, Diffie-Hellman, etc. The real time system usage of ECC is very less due to computational complexity. So, to increase the real time system usage we propose the novel method of combining the ECC with the Chinese Remainder Theorem (CRT), to reduce the larger values to the smaller one, so that the complexity of constructing ECC points can be reduced nearly 40% when compared to the existing ECC based algorithms. Also, its proved that the level of security getting increased and can be used as the fundamental component in real time communication system.

A Retina-inspired Sampling Method for Coding and Compression for Enhancement Image Based on Discrete Double Density Wavelet Transformer

The retina, a layer of light-sensitive tissue on the inner surface of the eye, is what allows for vision. That propose to design and analytically examine an image quantizer coding that is inspired by the way the retina manages and compresses visual features based on past studies. Retina-inspired coding is a new cipher algorithm which is very promising. Comparing the Double-Density Discrete Wavelet Transform (DDDWT) to earlier traditional approaches, it is more difficult but also produces excellent results. This efficient coding is credited to a streamlined account that, by the way, deals with 2-D and 3-D pictures, transformation matrices, and the conversion of the number DDWT as if via matrix multiplication. Naturally, this code makes a lot of interesting points of view available. In this proposal, we'll try to show how various theoretical model extensions can be applied to applications in video surveillance, information technology, and neuroscience. Therefore, that believe that using a multidisciplinary approach will help system achieve objectives. This strategy would apply signal processing methods with data from neurophysiology. There are hoping that our efforts will result in some innovative new coding algorithms. The proposed codes will be implemented in MATLAB for ease of experimentation. To implement this code more successfully, a low-level programming language is required. Index Terms— DDDWT, Retina-inspired, Coding.

Post-Quantum Secure Identity-Based Signature Scheme with Lattice Assumption for Internet of Things Networks.

The Internet of Things (IoT) plays an essential role in people's daily lives, such as healthcare, home, traffic, industry, and so on. With the increase in IoT devices, there emerge many security issues of data loss, privacy leakage, and information temper in IoT network applications. Even with the development of quantum computing, most current information systems are weak to quantum attacks with traditional cryptographic algorithms. This paper first establishes a general security model for these IoT network applications, which comprises the blockchain and a post-quantum secure identity-based signature (PQ-IDS) scheme. This model divides these IoT networks into three layers: perceptual, network, and application, which can protect data security and user privacy in the whole data-sharing process. The proposed PQ-IDS scheme is based on lattice cryptography. Bimodal Gaussian distribution and the discrete Gaussian sample algorithm are applied to construct the fundamental difficulty problem of lattice assumption. This assumption can help resist the quantum attack for information exchange among IoT devices. Meanwhile, the signature mechanism with IoT devices' identity can guarantee non-repudiation of information signatures. Then, the security proof shows that the proposed PQ-IDS can obtain the security properties of unforgeability, non-repudiation, and non-transferability. The efficiency comparisons and performance evaluations show that the proposed PQ-IDS has good efficiency and practice in IoT network applications.

Search for high-probability differential characteristics of the lightweight block cipher algorithm present with non-standard substitution blocks

The development of the Internet of Things and the associated devices has made it necessary to establish and implement encryption standards to ensure secure data transmission. These standards need to be comply with fundamental encryption principles and cater to devices with limited computational resources. As a result, lightweight cryptography has emerged as a distinct field within cryptography. The PRESENT block cipher algorithm is a lightweight encryption algorithm designed for deployment in resource-constrained devices. It requires comprehensive and ongoing vulnerability analysis against both known and novel cryptanalysis methods. This work extensively investigates the PRESENT block cipher algorithm, examining its components, operational principles, and key scheduling algorithm. This study analyses existing research on the algorithm with regards to contemporary cryptanalysis methods. Differential cryptanalysis was selected as the method of choice. The requirements for constructing S-boxes, as set forth by the algorithm developers, are reviewed. Two alternative S-boxes are formulated and presented based on these requirements. The paper presents a methodology for identifying high-probability differential characteristics for the PRESENT algorithm, using a substitute substitution block that differs from the one proposed by the developers. The research reports on the encryption algorithm PRESENT, using alternative substitution blocks, and evaluates its resistance to differential cryptanalysis. The text presents the results of applying the methodology for searching differential characteristics to the substituted blocks in the PRESENT algorithm. A comparative analysis is made between the results obtained through the differential characteristic search methodology for the PRESENT algorithm with alternative substitution blocks and the known results for this algorithm.

Cryptographic Algorithm Designed by Extracting Brainwave Patterns

A new authentication method based on EEG signal is proposed here. Biometric features such as fingerprint scanning, facial recognition, iris scanning, voice recognition, and even brainwave patterns can be used for authentication methods. Brainwave patterns, also known as brain biometrics, can be captured using technologies like electroencephalography (EEG) to authenticate a user based on their unique brain activity. This method is still in the research phase and is not yet commonly used for authentication purposes. Extracting EEG features for authentication typically involves signal processing techniques to analyze the brainwave patterns. Here, a method based on statistics for extracting EEG features is designed to extract meaningful information and patterns from the brainwave data for various applications, including authentication, brain–computer interface systems, and neurofeedback training.

A Novel Secure S-box Design Methodology Based on FPGA and SHA-256 Hash Algorithm for Block Cipher Algorithms

A Novel Secure S-box Design Methodology Based on FPGA and SHA-256 Hash Algorithm for Block Cipher Algorithms

Research on Fault Attacks of Lightweight Cryptographic Algorithms

Fault attacks exploit fault injection techniques to compromise cryptographic systems, compromising device operations and leaking secret keys. Lightweight block cipher algorithms are suitable for resource-constrained environments, ensuring security while reducing hardware and software overhead. This paper summarizes the current research status of fault attacks on some lightweight cryptographic algorithms, including block ciphers, stream ciphers, etc. These studies are crucial for addressing system vulnerabilities, protecting personal privacy, and enhancing the stability of embedded systems. The aim of this paper is to provide comprehensive references for cryptographers, assisting in selecting suitable algorithms and defense strategies.

High – Speed and Low Area-Efficient VLSI Architecture of Three-Operand Binary Adder

Three-operand binary adder is the basic functional unit to perform the modular arithmetic in various cryptography and Pseudo Random Bit Generator (PRBG) algorithms and also used in many applications. Carry Save Adder (CS3A) is the widely used technique to perform the three- operand addition. In carry save adder at final stage uses ripple carry adder which will cause large critical path delay. Moreover, a parallel prefix two-operand adder such as Han-Carlson Adder (HCA) can also be used for three-operand addition that significantly reduces the critical path delay with more area complexity. Hence, a new high-speed and area-efficient adder architecture is proposed using pre-compute bitwise addition followed by carry prefix computation logic to perform the three-operand binary addition that consumes substantially less area and less delay. The effectiveness of the proposed method is designed using Xilinx ISE 14.7

IMPLEMENTATION OF AES AND SHA-3 CRYPTOGRAPHY ALGORITHMS IN SECURING USER SENSITIVE DATA ON THE ARTESIAN WATER BILL PAYMENT TRANSACTION WEBSITE

Transacting online is something that is familiar to almost everyone in the digital era. The presence of digital transactions brings convenience in carrying out trading activities, but the use of the internet in creating easy transactions with several challenges in the form of hacking. In order to realize secure transactions, the level of protection on digital transaction service provider sites must be made as strong as possible to prevent digital attacks. Therefore, a protection system for user payment data on one of the transaction websites was created by applying the AES and SHA-3 cryptographic algorithm methods. The AES algorithm method was chosen because its implementation is not complicated but has proven its security, while SHA-3 is used to create unique keys from user passwords with the latest hash technology, so that the data encryption and decryption process becomes more protected because it uses the secret key of each user but not directly. The application of cryptographic algorithms will provide additional protection for the security of nominal user transaction data from cyber attacks so that the data. This research will produce a cryptography program flow with the Python programming language and examples of encryption and hash process results during program execution.

A hybrid encryption approach for efficient and secure data transmission in IoT devices

Security is a crucial concern in the Internet of Things (IoT) ecosystem. Due to IoT devices' constrained processing and storage resources, providing reliable security solutions is challenging. Encryption is one of the most commonly used techniques to secure user data against unauthorized access. Therefore, it is essential to develop encryption solutions that have minimal impact on the performance of IoT devices. This study introduces a hybrid encryption approach that combines symmetric blowfish encryption with asymmetric elliptic curves. Blowfish encryption is used to encrypt large volumes of data, which could otherwise affect the execution time.In contrast, elliptic curve cryptography is utilized to ensure the security of the private key, which has a small size and does not increase the execution time significantly. The suggested approach provides advantages of both asymmetric and symmetric encryption methods, leading to an improvement in throughput and a reduction in execution time. The proposed approach was evaluated, yielding promising results in comparison to other cryptographic algorithms. The results show the optimization of more than 15% in the execution time and the efficiency increase by the proposed solution. This improvement represents security with the least impact on processing resources.

Efficiency and Security Evaluation of Lightweight Cryptographic Algorithms for Resource-Constrained IoT Devices.

The IoT has become an integral part of the technological ecosystem that we all depend on. The increase in the number of IoT devices has also brought with it security concerns. Lightweight cryptography (LWC) has evolved to be a promising solution to improve the privacy and confidentiality aspect of IoT devices. The challenge is to choose the right algorithm from a plethora of choices. This work aims to compare three different LWC algorithms: AES-128, SPECK, and ASCON. The comparison is made by measuring various criteria such as execution time, memory utilization, latency, throughput, and security robustness of the algorithms in IoT boards with constrained computational capabilities and power. These metrics are crucial to determine the suitability and help in making informed decisions on choosing the right cryptographic algorithms to strike a balance between security and performance. Through the evaluation it is observed that SPECK exhibits better performance in resource-constrained IoT devices.

Analysis of Cybersecurity Vulnerabilities in Mobile Payment Applications

Skepticism about security of mobile payment applications has plagued user adoption of such platforms in some countries. Software developers have generally de-emphasized core principles guiding delivering safe mobile applications since for mobile payment applications, movement of monetary value is their priority. We find in surveyed literature that this situation is prevalent in low economy/low financial inclusion countries. Selected were 50 Fintech and traditional banks m-payment applications in both high and lower economic and technological advancement (high E&T apps and lower E&T apps respectively) countries in Africa. This work may have significance in finance or economy, but it is mainly to unravel cybersecurity concerns. The analyses (static and dynamic) of the applications targeted top ten vulnerabilities on 2023 Common Weakness Enumeration (CWE) and Open Worldwide Application Security Project (OWASP) lists. The study employed Mobile Security Framework (MobSF) as the primary tool for both Android and iOS application while Automated Security Risk Assessment (AUSERA) tool was used to validate the vulnerabilities reported by MobSF. Results show that traditional m-payment apps were generally more secure than Fintech m-payment apps. In the later category, vulnerabilities under information leakage and cryptography category were the most prevalent. On the average, no marked difference was observed in security performance between high E&T apps and lower E&T apps. Incorrect default permission, cleartext storage of sensitive information, use of risky cryptographic algorithm, use of insufficiently random values and information exposure were the most prevalent vulnerabilities. Conversely, insecure implementation of SSL and trusting all certificates or accepting self-signed certificates had fewest occurrences. Poor code quality was the highest source of security vulnerabilities in the study. Declining statistics of SMS leakage in recent studies was confirmed in this work. The most implemented security measure was certificate pinning for preventing or detecting man-in-the-middle attack.

BPS-V: A blockchain-based trust model for the Internet of Vehicles with privacy-preserving

The trust system is widely used to prevent malicious behaviors, and it is a key element for vehicles to establish interactions in the Internet of Vehicles (IoV). Nevertheless, trust and privacy remain unresolved concerns stemming from the distinctive features of the IoV. The IoV must thwart malicious attackers from spreading false data while ensuring that the vehicle’s evaluation data is not leaked, which is of utmost importance. In this paper, we propose a blockchain-based trust model (BPS-V), which supports ciphertext computation of trust evaluation data submitted by different vehicles. Design a cooperative update method for vehicle trust, which utilizes an improved distributed two-trapdoor public-key cryptography algorithm to achieve cooperative computing of trust and reduce the risk of privacy leakage of evaluation data. On this basis, BPS-V introduces blockchain sharding technology to realize cross-domain storage and sharing of the trust. Simulation results show that our scheme can effectively protect the privacy of evaluation data and maintain a high detection rate and low false alarm rate in different road environments. Compared with traditional schemes, BPS-V can improve the efficiency of trust updates and the detection of malicious vehicles by 9.5% and 32%.

Effective Identification and Authentication of Healthcare IoT Using Fog Computing with Hybrid Cryptographic Algorithm

Currently, Internet of Things (IoT)-based cloud systems face several problems such as privacy leakage, failure in centralized operation, managing IoT devices, and malicious attacks. The data transmission between the cloud and healthcare IoT needs trust and secure transmission of Electronic Health Records (EHRs). IoT-enabled healthcare equipment is seen in hospitals that have been implementing the technology for many years. Nonetheless, medical agencies fail to consider the security risk associated with healthcare IoT devices, which are readily compromised and cause potential threats to authentication and encryption procedures. Existing cloud computing methods like homomorphic encryption and the elliptic curve cryptography are unable to meet the security, identity, authentication, and security needs of healthcare IoT devices. The majority of conventional healthcare IoT algorithms lack secure data transmission. Therefore, fog computing is introduced to overcome the problems of IoT device verification, authentication, and identification for scalable and secure transmission of data. In this research manuscript, fog computing includes a hybrid mathematical model: Elliptic Curve Cryptography (ECC) and Proxy Re-encryption (PR) with Enhanced Salp Swarm Algorithm (ESSA) for IoT device verification, identification, and authentication of EHRs. ESSA is incorporated into the PR algorithm to determine the optimal key size and parameters of the PR algorithm. Specifically, in the ESSA, a Whale Optimization Algorithm (WOA) is integrated with the conventional Salp Swarm Algorithm (SSA) to enhance its global and local search processes. The primary objective of the proposed mathematical model is to further secure data sharing in the real time services. The extensive experimental analysis shows that the proposed model approximately reduced 60 Milliseconds (ms) to 18 milliseconds of processing time and improved 25% to 3% of reliability, compared to the traditional cryptographic algorithms. Additionally, the proposed model obtains a communication cost of 4260 bits with a memory usage of 680 bytes in the context of security analysis.

Symmetry-Enabled Resource-Efficient Systolic Array Design for Montgomery Multiplication in Resource-Constrained MIoT Endpoints

In today’s TEST interconnected world, the security of 5G Medical IoT networks is of paramount concern. The increasing number of connected devices and the transmission of vast amounts of data necessitate robust measures to protect information integrity and confidentiality. However, securing Medical IoT edge nodes poses unique challenges due to their limited resources, making the implementation of cryptographic protocols a complex task. Within these protocols, modular multiplication assumes a crucial role. Therefore, careful consideration must be given to its implementation. This study focuses on developing a resource-efficient hardware implementation of the Montgomery modular multiplication algorithm over GF(2l), which is a critical operation in cryptographic algorithms. The proposed solution introduces a bit-serial systolic array layout with a modular structure and local connectivity between processing elements. This design, inspired by the principles of symmetry, allows for efficient utilization of resources and optimization of area and delay management. This makes it well-suited for deployment in compact Medical IoT edge nodes with limited resources. The suggested bit-serial processor structure was evaluated through ASIC implementation, which demonstrated substantial improvements over competing designs. The results showcase an average area reduction of 24.5% and significant savings in the area–time product of 26.2%.

Performance Evaluation of Laguerre Transform and Neural Network-based Cryptographic Techniques for Network Security

As the world evolves day by day with new technologies, there is a need to design a secure network in such a way that intruders and unauthorized persons should not have access to the network as well as information regarding the personnel in any firm. In this study, a new cryptographic technique for securing data transmission based on the LaplaceLaguerre polynomial (LLP) is developed and compared to an existing auto-associative neural network technique (AANNT).The performance of the LLPT and AANNT was tested with some selected files in a MATLAB environment and the results obtained provided comparative information (in respect of AANNT versus LLPT) as follows: encryption time (1.67 ms versus 3.9931s), decryption time (1.833 ms versus 2.1172s), throughput (26.2975 Kb/s versus 0.01098 Kb/s), memory consumption (3.349 KB versus 15.958 KB). From the compared results, it shows that AANNT offers a faster processing time, higher throughput, and takes up less memory space than the LLPT. However, cryptanalysis of the AANNT is possible if the network's weight and design are known; hence, the technique is unreliable for ensuring the data integrity and confidentiality of encrypted data. The proposed LLP cryptographic algorithm is designed to provide a higher security level by making the LLP algorithm computationally tedious to invert using the standard Laplace transform inversion method. When compared to the AANN-based cryptographic technique, cracking the algorithm to uncover the encryption key takes time. This shows the strength and robustness of the proposed LLP cryptographic algorithm against attacks, as well as its suitability for solving the problem of data privacy and security when compared to the AANN-based cryptographic algorithm.