Search

Data auditing permits data owners to confirm the reliability of their personal information without obtaining it from an unsafe cloud. Advertising cloud storage has widely adopted this characteristic. Data integrity is more difficult to maintain, and data through the cloud is not always secure. The ability to access data remotely through cloud storage makes it necessary to protect it against unauthorized access, hackers, and other malicious activity. In order to overcome these concerns, a hybrid Advanced Encryption Standard- Elliptic Curve Cryptography (AES-ECC) algorithm and Merkle Hash (MHT) Tree is developed. The user data is sent to the cloud service provider via blockchain for storage purposes. The key generation and encryption are carried out using a hybrid AES-ECC encryption technique, which is used to generate both private and public keys. The encrypted user file is then divided into several blocks. The tags for the split encrypted blocks are then generated using SHA256, which provides the hash value of each smaller file. Cloud Service Provider (CSP) constructs an MHT by employing generated hashtags to return the proof to user information after establishing hashtags for encrypted file blocks in the blockchain storage. Merkle hash tree is frequently employed to validate data integrity. Furthermore, the third-party auditor determines if the proofs generated by CSP match one from the user to check the tamper. The simulation analysis shows that the accuracy, encryption, decryption, key generation, and execution time reached for the proposed approach is 96%, 190 s, 124 s, 5.9 s, and 440 s. The proposed algorithm effectively validates data integrity and provides improved data security in blockchain environment. [ABSTRACT FROM AUTHOR]

This paper proposes a novel scheme for image encryption based on symmetric multimodal skew tent map. The proposed map exhibits good statistical properties, such as uniformed distribution, delta-like correlation function, and high complexity. Compared to previous works based on unimodal skew tent map, the proposed scheme increases the information rate of the cryptosystem and generates chaotic key stream, which leads to a better performance in terms of randomness and security robustness against different types of attacks like statistical attack, key brute force attack and differential attack. An extensive simulation campaign has evaluated the performance of the proposed methodology. The obtained results that indicate an effective encryption and decryption processes. [ABSTRACT FROM AUTHOR]

Cloud computing is a technology that holds great promise and has potential to revolutionize the healthcare sector. Many security and privacy issues are brought up by the cloud's centralization of data for both patients and healthcare professionals. There is a need for maintaining secrecy in communication in exchanging medical data between the sender and the receiver, which can be done by cryptography. This article presents a cryptographic algorithm (encryption and decryption) to have a secure communication of digital health care confidential data using DNA cryptography and Huffman coding. The interesting property is the cipher size obtained from our algorithm is equal to the size of the cipher obtained from the character set of given data. Security analysis is provided to show the security of data when stored and transmitted to the cloud. The cryptographic requirements, key space analysis, key and plain text sensitivity, sensitive score analysis, sensitivity and specificity, optimal threshold, randomness analysis, uniqueness of implementation, entropies of binary bits, DNA bases, DNA bases with Huffman code, Huffman encoded binary bits and cloud service provider's risk are analyzed. The method proposed is compared with other cryptographic methods and results that it is more secure and stronger than other methods. [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.)

Data and information secrecy during storage or transmission has been preserved through the use of cryptography. Consequently, cryptography studies have also progressed from traditional Caesar cipher to the existing cryptographic protocols depending on quantum computing, starting with the latest modular arithmetic-based cryptosystems. The strength of modular arithmetic ciphers lies in the fact that they are computationally difficult to break, but with the advent of quantum computing, even these issues can be cracked with in polynomial time. Research on post-quantum cryptography began in response to this danger, with the goal of creating post-quantum algorithms that are immune to quantum computing. However, cryptographic methods confront a number of other problems, including, but not limited to, availability, integrity, and vulnerability. Despite the researchers' successes, security is still a major issue for Quantum Computing. Because of its many advantages, cyberspace has quickly become the most common medium for disseminating information. Because of the exponential growth of science and technology, notably quantum computers, cyber security is now the top priority for the Internet and other wireless systems. The fundamental goal of this work is to create a Hybrid Quantum Cryptosystem that can be implemented in Wireless Body Sensor Networks. Using a series of comparisons with existing algorithms, we will determine how well our suggested hybrid algorithm operates in terms of key length, key generation time, decryption and encryption timings, and overall speed. The proposed approach attains 10.3 minimal rate of error, which outperforms the existing state-of-art techniques. [ABSTRACT FROM AUTHOR]

The proliferation of IoT devices has influenced end users in several aspects. Yottabytes (YB) of information are being produced in the IoT environs because of the ever-increasing utilization capacity of the Internet. Since sensitive information, as well as privacy problems, always seem to be an unsolved problem, even with best-in-class in-formation governance standards, it is difficult to bolster defensive security capabilities. Secure data sharing across disparate systems is made possible by blockchain technology, which operates on a decentralized computing paradigm. In the ever-changing IoT environments, blockchain technology provides irreversibility (immutability) usage across a wide range of services and use cases. Therefore, blockchain technology can be leveraged to securely hold private information, even in the dynamicity context of the IoT. However, as the rate of change in IoT networks accelerates, every potential weak point in the system is exposed, making it more challenging to keep sensitive data se-cure. In this study, we adopted a Multi-level Blockchain-based Secured Framework (M-BSF) to provide multi-level protection for sensitive data in the face of threats to IoT-based networking systems. The envisioned M-BSF framework incorporates edge-level, fog-level, and cloud-level security. At edge- and fog-level security, baby kyber and scaling kyber cryptosystems are applied to ensure data preservation. Kyber is a cryptosystem scheme that adopts public-key encryption and private-key decryption processes. Each block of the blockchain uses the cloud-based Argon-2di hashing method for cloud-level data storage, providing the highest level of confidentiality. Argon-2di is a stable hashing algorithm that uses a hybrid approach to access the memory that relied on dependent and independent memory features. Based on the attack-resistant rate (> 96%), computational cost (in time), and other main metrics, the proposed M-BSF security architecture appears to be an acceptable alternative to the current methodologies. [ABSTRACT FROM AUTHOR]

Let Fq be a finite field, where q is a power of a prime p such that p ≥ 5. Let α be a root of a monic polynomial of a minimal degree over Fq. In this paper, we will study elliptic curves over (Fq[α];+; *), where + is the usual addition and * represent a non-standard product law over Fq[α]. Using elliptic curves over this ring can result in a cryptographic method that is fast, simple and secure. [ABSTRACT FROM AUTHOR]

The performance of chaotic systems in generating signals is an essential factor in determining the security of cryptosystems. A new 3D chaotic system is designed based on Hénon and logistic mapping, called 3D Improve-Hénon and Logistic (3D-IHAL), to design a secure and reliable cryptosystem. The attractor phase diagram, Lyapunov exponent, and bifurcation diagram are used to evaluate the performance of 3D-IHAL. NIST tests the randomness of the sequences generated by 3D-IHAL. The results show that 3D-IHAL is suitable for cryptography because of its good dynamic characteristics. In the cryptosystem, the parameters and initial values of 3D-IHAL are generated by the Hash function, and 3D-IHAL generates the key stream required for the encryption phase. In the encryption phase, a hybrid cryptosystem is designed by two different encryption methods, mod and xor, which are used according to the position of the pixel value. Our algorithm is evaluated in public datasets. The evaluation results show that the horizontal, Queryvertical, and diagonal correlations of ciphertext are 0.00012, -0.00089, and -0.00055, respectively, and the information entropy is 7.9992. Compared with the existing algorithms, the proposed algorithm has better security. [ABSTRACT FROM AUTHOR]

The Fibonacci sequence is a well-known sequence of numbers with numerous applications in mathematics, computer science, and other fields. In recent years, there has been growing interest in studying Fibonacci-like sequences on elliptic curves. These sequences have a number of exciting properties and can be used to build new encryption systems. This paper presents a further generalization of the Fibonacci sequence defined on elliptic curves. We also describe an encryption system using this sequence which is based on the discrete logarithm problem on elliptic curves. [ABSTRACT FROM AUTHOR]

In this paper, a novel cryptosystem with just a multi-shuffling process which is highly interactive to differentiate initial conditions is developed. The proposed system replaces the fundamental and well known in cryptography, confusion–diffusion scheme, which uses two levels with just one confusion block. This algorithm is designed for protecting all personal or commercial data in real-time applications such as monitoring and transmission of multimedia information. The unique confusion stage has three-level shuffling processes, consisting of the flipping procedure, block shuffling, and permutation in a bit level. All of them were designed to drastically change data from a plain image to a cipher image. This not only destroys the relationship of adjacent pixels but also destroys patterns in the encryption process. The flipping procedure tries to combine parts of the image's top with the bottom and the right with the left. The selected columns and rows will change completely after this procedure due to the complement of each pixel being written during the process. The last levels use an automatically sliding window combined with a logistic sine wave and logistic map to drive the iteration of the cryptosystem and shuffle the position of pixels of the plain image as well as giving new statistical features to the image at the same time. The proposed algorithm was designed to be easily implemented by practitioners. Additionally, the main goal of the image encryption is to achieve an uncertain image that cannot be cracked. The results show that this novel cryptosystem with only the shuffling process is well performed and feasible to encrypt images with a high security level. Furthermore, the experimental analysis demonstrates the effectiveness and feasibility of the proposed encryption algorithm after being tested using the benchmark "Lena" image, "The Wonder woman" image, and the "Bruce Lee" image, the latter of which is completely different to the first one, statistically speaking. [ABSTRACT FROM AUTHOR]

Abstract With the increasing rise of distributed system technologies, one of the most pressing problems facing the digital world is ensuring the security of sensitive and confidential data during transport and storage, which is also regarded as one of the most critical difficulties facing cloud computing. Numerous techniques exist for enhancing data security in the cloud computing storage environment. Encryption is the most important method of data protection. Consequently, several accessible encryption strategies are utilized to provide security, integrity, and authorized access by employing modern cryptographic algorithms. Cloud computing is an innovative paradigm widely accepted as a platform for storing and analysing user data. The cloud is accessible via the internet, exposing the data to external and internal threats. Cloud Service Providers (CSPs) must now implement a secure architecture to detect cloud intrusions and safeguard client data from hackers and attackers. This paper combines Stochastic Gradient Descent long short-term memory (SGD-LSTM) and Blow Fish encryption to detect and prevent unauthorized cloud access. User registration, intrusion detection, and intrusion prevention are the three phases of the planned system. The SGD-LSTM classifier predicts cloud data access and prevents unauthorized cloud access. In the data access phase, cloud data access is managed by authenticating the authorized user with the Blowfish encryption algorithm. Comparing the proposed classifier to existing classifiers demonstrates that it detects abnormal access accurately. The experimental outcomes enhanced data security, which can be utilized to protect cloud computing applications. The experimental results of the suggested SGD-LSTM algorithm indicated a high level of protection, as well as a considerable improvement in security and execution speed when compared to algorithms that are often used in cloud computing.

Based on the combination of quaternion numbers, residual matrices, and chaotic attractors, a new cryptosystem is proposed for multimedia processing files such as images and audio. The key employed in this encryption schema consists of an image with a wide and sensitive range, obtained from the Julia Quaternion set rendered using a computational tool. Due to the use of quaternion matrices mixing the information between RGB layers and audio samples was possible, whereas using XOR operation and residual matrices modulus 257, added high sensitivity to small perturbations during encryption, key preparation and decryption processes, to such an extent that a minimal change in the image or in the audio leads to a totally different encryption result. The use of dynamic programming also reduced the processing time for matrix operations on the ℤ 257 ring. To corroborate security of the algorithm, different tests were performed, including the National Institute of Standards and Technology test obtaining different indicators that were compared with other scientific references of similar works, finding behavioral patterns in accordance with those referenced works. [ABSTRACT FROM AUTHOR]

Image encryption has attracted much interest as a robust security solution for preventing unauthorized access to critical image data. Medical picture encryption is a crucial step in many cloud-based and healthcare applications. In this study, a strong cryptosystem based on a 2D chaotic map and Jigsaw transformation is presented for the encryption of medical photos in private Internet of Medical Things (IoMT) and cloud storage. A disorganized three-dimensional map is the foundation of the proposed cipher. The dispersion of pixel values and the permutation of their places in this map are accomplished using a nonlinear encoding process. The suggested cryptosystem enhances the security of the delivered medical images by performing many operations. To validate the efficiency of the recommended cryptosystem, various medical image kinds are used, each with its unique characteristics. Several measures are used to evaluate the proposed cryptosystem, which all support its robust security. The simulation results confirm the supplied cryptosystem's secrecy. Furthermore, it provides strong robustness and suggested protection standards for cloud service applications, healthcare, and IoMT. It is seen that the proposed 3D chaotic cryptosystem obtains an average entropy of 7.9998, which is near its most excellent value of 8, and a typical NPCR value of 99.62%, which is also near its extreme value of 99.60%. Moreover, the recommended cryptosystem outperforms conventional security systems across the test assessment criteria. [ABSTRACT FROM AUTHOR]

Chaos-based cryptosystems are considered a secure mode of communication due to their reliability. Chaotic maps are associated with the other domains to construct robust encryption algorithms. There exist numerous encryption schemes in the literature based on chaotic maps. This work aims to propose an attack on a recently proposed hyper-chaotic map-based cryptosystem. The core notion of the original algorithm was based on permutation and diffusion. A bitlevel permutation approach was used to do the permutation row-and column-wise. The diffusion was executed in the forward and backward directions. The statistical strength of the cryptosystem has been demonstrated by extensive testing conducted by the author of the cryptosystem. This cryptanalysis article investigates the robustness of this cryptosystem against a chosen-plaintext attack. The secret keys of the cryptosystem were retrieved by the proposed attack with 258 chosen-plain images. The results in this manuscript suggest that, in addition to standard statistical evaluations, thorough cryptanalysis of each newly suggested cryptosystem is necessary before it can be used in practical application. Moreover, the data retrieved is also passed through some statistical analysis to compare the quality of the original and retrieved data. The results of the performance analysis indicate the exact recovery of the original data. To make the cryptosystem useful for applications requiring secure data exchange, a few further improvement recommendations are also suggested. [ABSTRACT FROM AUTHOR]

Bergman (1974) found that for any prime number p, the endomorphism ring End(Zp x Zp²) is a semilocal ring which has p5 elements and can not be embedded in matrices over any commutative ring. Later on, Climent et al. (2011) found that each element of endomorphism ring End(Zp x Zp²) can be identified as a two by two matrix of Ep where the first and the second row entries belong to Zp and Zp² respectively. By this characterization, Long D. T., Thu D. T., and Thuc D. N. constructed a new RSA variant based on End(Zp x Zp²) (2013). In this paper, we state the characteristic of the endomorphism ring End (Zp² x Zp) and the RSA analogue cryptosystem based on it. [ABSTRACT FROM AUTHOR]

This paper introduces a new chaotic jerk system with three cubic nonlinear terms. The stability properties of the three equilibrium points of the proposed jerk system are analyzed in detail. We show that the three equilibrium points of the new chaotic jerk system are unstable and deduce that the jerk system exhibits self-excited chaotic attractors. The bifurcation structures of the proposed jerk system are investigated numerically, showing period-doubling, periodic windows and coexisting bifurcations. An electronic circuit design of the proposed jerk system is designed using PSPICE. As an engineering application, a new image-encryption approach based on the new chaotic jerk system is presented in this research work. Experimental results demonstrate that the suggested encryption mechanism is effective with high plain-image sensitivity and the reliability of the proposed chaotic jerk system for various cryptographic purposes. [ABSTRACT FROM AUTHOR]

The significance of data security has become more critical due to the ever-changing goals and capabilities of attackers. As a result, many cryptosystems employing diverse approaches are being developed to safeguard sensitive data. A Substitution box (S-box) plays a vigorous role in modern cryptosystems because of its credence for inducing confusion during the encryption process and ultimately protecting the data. Currently, chaotic maps are being developed and widely employed to yield S-Boxes as the use of chaotic maps aids in the randomness and resistance to mitigate many cryptanalytic attacks. In this paper, a novel chaotic map and an inventive systematic search method are proposed for the generation of key-dependent dynamic and highly nonlinear S-boxes. A variety of standard cryptographic tests such as fixed-point analysis, nonlinearity (NL), strict avalanche criterion (SAC), bit independence criterion (BIC), linear probability (LP), differential probability (DP), etc.) are applied to assess and analyze the cryptographic strengths of S-boxes generated using the proposed method. The findings from experimental and comparative analyses show that the proposed S-box provides stronger and better cryptographic features (no fixed point, no opposite fixed point, average NL = 111.75, SAC offset = 0.0000, BIC-NL = 103.9, LP = 0.125, and DP = 0.039) than many of the existing S-boxes studies presented in recent years. Hence, the proposed S-box construction technique has a lot of potential and genuine prospects for its utilization in cryptographic applications to protect sensitive data from attackers.

Abstract: In this work, we'll develop a novel text message steganography concept. In the proposed system, in fact, there is no hiding process in the cover-image, but the image is very important in retrieving the plaintext after it has been encrypted. The suggested system depends on comparing the bits of message, want to be hidden, with bits of the cover image, if they are similar then the index of the similar bit is recoded. After finishing all the message text, we obtain a list of indices, these indices are encrypted. Lastly, the image and the encrypted indices are being send to the receiver part. This style means no hiding be done in the image cover. The cover-images are shown before and after the acts of the proposed stego-system to prove that’s no effects have done in the cover-images.

With the increasing rise of distributed system technologies, one of the most pressing problems facing the digital world is ensuring the security of sensitive and confidential data during transport and storage, which is also regarded as one of the most critical difficulties facing cloud computing. Numerous techniques exist for enhancing data security in the cloud computing storage environment. Encryption is the most important method of data protection. Consequently, several accessible encryption strategies are utilized to provide security, integrity, and authorized access by employing modern cryptographic algorithms. Cloud computing is an innovative paradigm widely accepted as a platform for storing and analysing user data. The cloud is accessible via the internet, exposing the data to external and internal threats. Cloud Service Providers (CSPs) must now implement a secure architecture to detect cloud intrusions and safeguard client data from hackers and attackers. This paper combines Stochastic Gradient Descent long short-term memory (SGD-LSTM) and Blow Fish encryption to detect and prevent unauthorized cloud access. User registration, intrusion detection, and intrusion prevention are the three phases of the planned system. The SGD-LSTM classifier predicts cloud data access and prevents unauthorized cloud access. In the data access phase, cloud data access is managed by authenticating the authorized user with the Blowfish encryption algorithm. Comparing the proposed classifier to existing classifiers demonstrates that it detects abnormal access accurately. The experimental outcomes enhanced data security, which can be utilized to protect cloud computing applications. The experimental results of the suggested SGD-LSTM algorithm indicated a high level of protection, as well as a considerable improvement in security and execution speed when compared to algorithms that are often used in cloud computing. [ABSTRACT FROM AUTHOR]

In the present work, we propose a new approach to secure waveforms for data transmission in software defined radio (SDR) based communication systems. For more precision, SDR implementation and validation, using Universal software radio peripherals (USRPs) B210 platforms, of a chaos‐based cryptosystem is used for securing transmitted multimedia data such as text, image, and video. For this, new GNU‐radio companion (GRC) blocks are developed and integrated in the GRC software environment to use effectively our solution. In this context, we have integrated GRC block for the Lorenz chaotic generator which generates chaotic signals. These signals are then used to generate the encryption keys by inserting a dedicated GRC block. The latest and largest development GRC block concerns the proposed solution for the chaotic synchronization problem, which is a challenge when applying chaotic systems to secure data transmission. The implemented chaotic cryptosystem is based on one time pad cipher, knowing that it's the most suitable for chaos‐based cryptography. The obtained results of the security analysis of the proposed cryptosystem validate its robustness. In fact, the generated encryption keys deemed robust after passing through two statistical tests batteries namely, NIST and DIEHARD. In addition, a good result is obtained by a large security evaluation of the encrypted data through several metrics, which are compared to some previous works. Finally, we have experimentally validated a secure waveform between two USRPs platforms for different types of data information like text, image, and video. Furthermore, a graphical communication interface is designed to guarantee easy access and broad flexible applicability of the developed solution. [ABSTRACT FROM AUTHOR]

Image encryption techniques protect private images from unauthorized access while they are being transmitted. Previously used confusion and diffusion processes are risky and time-consuming. Therefore, finding a solution to this problem has become necessary. In this paper, we propose a new image encryption scheme that combines the Intertwining Logistic Map (ILM) and Orbital Shift Pixels Shuffling Method (OSPSM). The proposed encryption scheme applies a technique for confusion inspired by the rotation of planets around their orbits. We linked the technique of changing the positions of planets around their orbits with the shuffling technique of pixels and combined it with chaotic sequences to disrupt the pixel positions of the plain image. First, randomly selected pixels from the outermost orbit are rotated to shift the pixels in that orbit, causing all pixels in that orbit to change their original position. This process is repeated for each orbit until all pixels have been shifted. This way, all pixels are randomly scrambled on their orbits. Later on, the scrambled pixels are converted into a 1D long vector. The cyclic shuffling is applied using the key generated by the ILM to a 1D long vector and reshaped into a 2D matrix. Then, the scrambled pixels are converted into a 1D long vector to apply cyclic shuffle using the key generated by the ILM. After that, the 1D long vector is converted into a 2D matrix. For the diffusion process, using ILM generates a mask image, which is then XORed with the transformed 2D matrix. Finally, a highly secure and unrecognizable ciphertext image is obtained. Experimental results, simulation analysis, security evaluation, and comparison with existing image encryption schemes show that it has a strong advantage in defending against common attacks, and the operating speed of this encryption scheme also performs excellently in practical image encryption applications. [ABSTRACT FROM AUTHOR]

Nowadays, medical enterprises are gradually attracted to store their data in the cloud paradigm and distribute the data between the authorized person due to the enormous growth of cloud computing and big data. However, the rapid growth of these systems has faced some crucial challenges such as data privacy and security. Presently, different cryptography techniques are used in a large amount of data processing and storage, but it is not suitable for the security of big data over cloud-based data transmission. Thus, this article presents the novel African Buffalo-based Elapid Crypto Model (AB-ECM) method for monitoring and securing the data while transferring it to the receiver. Here, the large amount of data from the cloud is compressed by the two-stage compression approach. Then, the system's security has been enhanced by the auditing phase; if the secret key of both auditing stages in the sender and receiver is the same, then only the data is decrypted. The execution of this secure process is done in the MATLAB Platform. The simulation consequences of the proposed system have been compared with the conventional methods in terms of confidential rate, data transfer rate, encryption time, resource usage, and decryption time. The comparison shows that the developed model has attained the finest security function over the existing techniques. [ABSTRACT FROM AUTHOR]

In order to ensure reliable and secure image exchange, chaotic systems are often considered for their good performance in information security. In this work, we first propose an extended version of a chaotic tent map (TM)—the multiparametric 1D tent map (MTM). The latter contains six control parameters defined over an unlimited range. These parameters strongly influence the MTM output when they are slightly modified by ∓ 10 − 13 , which makes MTM stronger than the existing TM and other 1D chaotic maps in terms of security key space. Then, this paper proposes a simple, yet powerful method to make uniform the distribution of chaotic sequence values, making the latter suitable for use in cryptosystems. Next, a new image cryptosystem is introduced based on MTM and parallel computing. This computing mode is incorporated to boost the security level of our scheme and to speed up its runtime. Indeed, in only one running round, our encryption scheme generates a security key of space equal to 10 78 × n with n indicating the number of the available CPU cores. Therefore, the suggested scheme achieves a good trade-off between safety and efficiency. The results of the performed comparisons and numerical experiments indicate on the one hand that MTM exhibits good chaotic characteristics in comparison to its original version. On the other hand, the suggested cryptosystem demonstrates good strength against various kinds of attacks (brute force, statistical, classical, noise, differential, etc.). Furthermore, comparison with similar schemes indicate that the proposed scheme is competitive in terms of execution time and superior in terms of security level. [ABSTRACT FROM AUTHOR]

Blockchain technology is playing a major role in the process of providing security to the data of different kinds of applications. This technology is considered the verified document of every transaction. Proof of Low Infringement and Plagiarism is a consensus mechanism designed to revolutionize heavy identity, asset tracking, and academic participation. Research articles and innovations are not encouraged across the globe due to a lack of funding, overpriced publication rates (it costs an average of $1000 to publish an academic journal in the USA), no transparency in infringement data, and an overwhelming number of middlemen taking part in citation costs. To that end, we propose a new cryptosystem that incorporates a newly proposed cryptographic system to provide security for research articles while online plagiarism checking. The proposed system uses the SHA-256 hash function and AES for securing the data. In addition, an existing cryptographic algorithm called Elliptic Curve Cryptography with Diffie-Hellman (EC(DH)2) is also applied to enhance the data security level. The experimental results suggest that any attempt to plagiarize the research article that is submitted is an interruption of the instructions. The transmission of a research article is also encrypted by applying cryptographic rules and security mechanisms such that no one can access or modify the submitted research article. Even the reviewer of the research article is not able to make any changes to the article because by doing such activity, the system gives an alarm message about the violation to the administrator. The experiments are conducted to prove the efficiency and effectiveness of the cryptosystem. [ABSTRACT FROM AUTHOR]

Optical correlators are efficient optical systems that have gained a wide range of applications both in image recognition and encryption, due to their special properties that benefit from the optoelectronic setup instead of an all-electronic one. This paper presents, to the best of our knowledge, the most extensive review of optical correlators to date. The main types are overviewed, together with their most frequent applications in the newest contributions, ranging from security uses in cryptosystems, to medical and space applications, femtosecond pulse detection and various other image recognition proposals. The paper also includes a comparison between various optical correlators developed recently, highlighting their advantages and weaknesses, to gain a better perspective towards finding the best solutions in any specific domain where these devices might prove highly efficient and useful. [ABSTRACT FROM AUTHOR]

Cryptography system gives security services ability to protect information from people who are authorized to use it. This research introduces elevated information security system via hybrid of new expand Rivest Shamir Adleman (RSA) and data encryption standard (DES) cryptosystem using appropriate standard lgorithms. An Expand Algorithm (ERSA) algorithm Key cryptosystem based on nth large prime number system was introduced. Then a hybrid between the Expand Algorithm (ERSA) with Data Encryption Standard (DES) was applied using four randomly selected variables, each generated from large factor of "N" prime numbers. The information undergoes a cypher text-decryption process which provides strong security and uphold high information confidentiality and integrity of data. Results showed that the use of ERSA and DES algorithm reduced the key generation period and its complexity analysis of encryption and decryption are stronger, unlike the application of traditional RSA algorithm. [ABSTRACT FROM AUTHOR]

The Cloud computing is a repository that stores massive amounts of data that is accessible online. There are many security and data privacy concerns threatening cloud computing services, especially through key sharing. So, there is an important need to improve security algorithms. An electrocardiogram (ECG) measures heart performance and detects arrhythmias. Nowadays, they are used for identification because they vary from one person to another. Therefore, securing an ECG signal is important. Homomorphic encryption (HE) is a security solution that processes encrypted data without decryption. HE supplies the same raw data results. In this paper, to enhance security and maintain data privacy while getting rid of sharing key restrictions, a new fully homomorphic encryption algorithm with an advanced encryption standard (FHEAES) is proposed to encode the ECG signals. This is accomplished by proposing the evaluation process to be appended to an AES algorithm as an additional security layer, which performs a variety of mathematical operations homomorphically on the encrypted data without decrypting it, instead of the original data. The evaluation process is proposed to be a linear polynomial function with variable values to enhance security. A Pan and Tompkins algorithm is used to process ECG signals. Then, the FHEAES algorithm was used for encoding the ECG signal. At last, ECG signals were classified for further diagnosis. According to the findings, FHEAES will take 1.078950 x 1033 years to break or hack. This is due to the using of the proposed three encryption keys to make it harder to break. Also, the FHEAES algorithm has 95.8% accuracy in classification and 100% accuracy in decryption (recovering the original signal). When compared to other algorithms, it is nearly 6 times and 3 times faster during encryption and decryption, respectively. This is because it is proposed to be based on computationally lightweight matrix operations, making it perfect to address the noise that arises from any FHE scheme. Thus, FHEAES provides superior security and privacy while computing and is solid against attacks. [ABSTRACT FROM AUTHOR]

The Fibonacci sequence is a well-known sequence of numbers with numerous applications in mathematics, computer science, and other fields. In recent years, there has been growing interest in studying Fibonacci-like sequences on elliptic curves. These sequences have a number of exciting properties and can be used to build new encryption systems. This paper presents a further generalization of the Fibonacci sequence defined on elliptic curves. We also describe an encryption system using this sequence which is based on the discrete logarithm problem on elliptic curves.

Cryptography system gives security services ability to protect information from people who are authorized to use it. This research introduces elevated information security system via hybrid of new expand Rivest Shamir Adleman (RSA) and data encryption standard (DES) cryptosystem using appropriate standard lgorithms. An Expand Algorithm (ERSA) algorithm Key cryptosystem based on nth large prime number system was introduced. Then a hybrid between the Expand Algorithm (ERSA) with Data Encryption Standard (DES) was applied using four randomly selected variables, each generated from large factor of “N” prime numbers. The information undergoes a cypher text-decryption process which provides strong security and uphold high information confidentiality and integrity of data. Results showed that the use of ERSA and DES algorithm reduced the key generation period and its complexity analysis of encryption and decryption are stronger, unlike the application of traditional RSA algorithm.

Internet of things (IoT) provides several applications such as intelligent urban transportation, smart factory, and smart health. In such systems, the transmitted data are important and must be secured to prevent destructive and unauthorized access to critical data. Indeed, existing IoT solutions come with conventional cryptographic techniques such as AES, RSA, and DES. However, some of these algorithms are no longer reliable and others require significant resources in terms of energy, memory, and computing power, making them unsuitable for IoT nodes that may have limited resources. To address these challenges, this paper develops a new lightweight and efficient cryptosystem to secure IoT communications. The proposed cryptosystem is composed of a chaos-based random generator, confusion, and diffusion blocks. Through a use case, the experimental results, at implementation and statistical levels, demonstrate good performances. The implementation results in the Mbed microcontroller NXP LPC1768 include low memory usage, fast encryption and decryption speed, and low energy consumption. The statistical results confirm the robustness of the proposed cryptosystem against many attacks according to the NIST test, key size, key sensitivity, information entropy, and statistical histogram analysis. Compared to related works, this paper proposes an enhanced lightweight cryptosystem with optimized confusion–diffusion layers that can be implemented in different resource-constrained hardware boards. Moreover, the proposed solution does not make any assumptions about the data types to be used in IoT networks. It is open to any type (sensing value, text, voice, image, etc.). These features guarantee the potential use of the proposed cryptosystem in many real-world applications. [ABSTRACT FROM AUTHOR]

With the development of information technology, big data has had a positive impact on the development of various industries. All kinds of digital data trading platforms have been established accordingly. However, when the original data buyer illegally distributes the digital data that he has bought through the data trading platform, the copyright protection problem arises. Watermarking protocols designed for tracing illegal distributors when unauthorized copies are found provide good solutions for the above problem. Classic buyer-seller watermarking protocols are designed for two-party transaction models, not fit for the data trading platform-based tripartite transaction model. In this paper, the author proposes a TTP (Trusted Third Party) watermarking protocol based on visual cryptography for the tripartite transaction model. As far as we know, our proposed scheme is the first watermarking protocol for tripartite transaction models. Besides, by introducing computation-cheap visual cryptography, our scheme provides a good balance between some contradictory requirements, such as security versus efficiency. Through the security analysis, it can be found that the proposed scheme can solve the problems reported in the existing literatures and achieves several improvements over other schemes. [ABSTRACT FROM AUTHOR]

A new fast public key cryptosystem is proposed, which is based on two dissimilar number-theoretic hard problems, namely the simultaneous chaotic maps (CM) problem and quadratic residue (QR) problem. The adversary has to solve the two hard problems simultaneously to recover the plaintext according to their knowledge about the public keys and the cipher-text. Cryptographic quadratic residue and chaotic system are employed to enhance the security of our cryptosystem scheme. The encryption, and decryption are discussed in details. Several security attacks are proposed to illustrate the system shield through chaotic maps and quadratic residue problems. The performance analysis of the proposed scheme show a much improved performance over existing techniques. [ABSTRACT FROM AUTHOR]

Image encryption is an interesting research topic, especially in medical images. This is due to the importance of security when storing and transmitting digital images. This study proposes an image encryption procedure that combines several methods such as chaotic-hash scrambling to perform the confusion process, combined hash functions, block-based substitution, dynamic bit shifting based on Josephus sequences, and diffusion with logistic maps to obtain strong encryption against various attacks. Based on the test results implemented on medical images, standard images, and special images. The proposed encryption procedure is proven to have resistance to statistical and differential attacks which have been measured by several measuring tools such as histogram analysis, chi-square, entropy, correlation coefficient, NPCR, UACI, avalanche effect, PSNR, and SSIM. In addition, it also has enough key space to withstand brute force attacks. [ABSTRACT FROM AUTHOR]

Medical imaging is essential in modern healthcare as it enables accurate diagnosis, planning of therapies, and monitoring of various medical problems. The security and integrity of medical images have become of utmost importance due to the growing dependence on digital imaging technologies. Zero-watermarking is a technique used in digital image processing where the watermark is not embedded into the medical image instead, a key is generated for security purposes to achieve the information process. In the context of medical images, preserving visual fidelity and diagnostic accuracy is of utmost importance, making zero-watermarking an attractive approach for safeguarding sensitive healthcare data. This paper proposes a zero-watermarking system that utilizes the Frensnelet Transform and Spiking Cortical Model (FT-SCM) for extracting image features and enhancing the system's resilience against various attacks. The proposed system uses FT-SCM techniques to generate a perceptual hash of size 1 × 64. The proposed cryptosystem is used to encrypt the watermark for better security. Later, the encrypted watermark and perceptual hash are merged to create a zero-watermark image (key). The proposed system yields an average PSNR , SSIM , and NC values of 57.07 dB, 0.99, and 0.75, respectively, which demonstrates an improved performance from the state-of-the-art zero-watermarking approaches. Also, the proposed cryptosystem is analysed and compared using security metrics. Security assessments demonstrate the proposed image cryptosystem approach's efficiency, security, and realizability because of key generation in the confusion and diffusion process, which gives a chaotic nature compared to state-of-the-art approaches encryption methods. • We proposed a new method to improve the watermark image security during encryption. • We proposed a novel FT-SCM hash generation technique. • We introduced a novel Zero-Watermarking System using FT-SCM hash and encryption. • The proposed zero-watermarking system is robust against double and multiple attacks. • The system handles colour, grayscale, and binary watermarks to boost robustness. [ABSTRACT FROM AUTHOR]

In this paper a new encryption system has been designed and implemented for real-time speech transmission to reduce bandwidth requirements, increase security and minimize residual intelligibility. To guarantee robustness and lightweight computation, the developed cryptosystem has been carried out in the wavelet transform domain based on a hyperchaotic model to generate mask and permutation keys. The cryptographic system has been designed using a hardware-software (HW/SW) co-design approach by developing several IP-cores in a relatively short development time. The performances and security evaluation of the system have been validated through simulation results followed by an experimental validation through the implementation of an encrypted speech signal transmission between two low cost Nexys-4 DDR FPGA platforms, operating in real-time for both wired and wireless communications. Compared to similar works, high performances have been obtained in terms of bandwidth efficiency due to the use of DWT, limited area of FPGA resources, low power consumption and high security level with a large keyspace that is sufficient to resist against brute force attacks. The designed system can be a very useful solution for many real-time secure integrated voice communication systems, multiple communication purposes, military, professional or personal high level of conversations security. • A novel chaos-based cryptosystem in the four level DWT transform domain is proposed. • Codesign FPGA implementation of a optimized architecture providing good performances. • Experimental encrypted speech communication validation using Artix-7 FPGA platforms. [Display omitted] [ABSTRACT FROM AUTHOR]