Search

Due to the similar characteristics of chaotic systems and cryptography, public key encryption algorithms based on chaotic systems are worth in-depth research and have high value for the future. Chebyshev polynomials have good properties and are often used in the design of public key algorithms. This paper improves the Bose Multi-Chaotic Public Key Cryptographic Algorithm (BMPKC) by applying Chebyshev polynomials. The proposed algorithm (CMPKC- k i ) introduces the selective coefficient k i based on the properties of Chebyshev polynomials, allowing the special functions that need to be negotiated in the original system to be freely and randomly chosen as Chebyshev polynomials, and can also be expanded to m levels. The improved cryptographic algorithm also utilizes chaotic hash functions and logistic mapping to generate pseudo-random sequences and overcomes shortcomings of the Bose algorithm by iteratively iterating the selected Chebyshev polynomials based on the number of 0s or 1s in the pseudo-random sequence, thus providing better security. Analysis and software testing results indicate that this algorithm has strong robustness against brute force attacks, achieving a higher attack time for breaking the private key compared to the CEPKC, BMPKC, and CMPKC algorithms. Compared to the CMPKC algorithm, our proposal algorithm achieves better performance in the encryption and decryption phases. Furthermore, we combine this Multi-Chaotic System Key Exchange Protocol with the Advanced Encryption Standard (AES) algorithm, while providing a demonstration, offering more possibilities for practical applications of this system. [ABSTRACT FROM AUTHOR]

Steganography is a technique for hiding secret messages while sending and receiving communications through a cover item. From ancient times to the present, the security of secret or vital information has always been a significant problem. The development of secure communication methods that keep recipient-only data transmissions secret has always been an area of interest. Therefore, several approaches, including steganography, have been developed by researchers over time to enable safe data transit. In this review, we have discussed image steganography based on Discrete Cosine Transform (DCT) algorithm, etc. We have also discussed image steganography based on multiple hashing algorithms like the Rivest–Shamir–Adleman (RSA) method, the Blowfish technique, and the hash-least significant bit (LSB) approach. In this review, a novel method of hiding information in images has been developed with minimal variance in image bits, making our method secure and effective. A cryptography mechanism was also used in this strategy. Before encoding the data and embedding it into a carry image, this review verifies that it has been encrypted. Usually, embedded text in photos conveys crucial signals about the content. This review employs hash table encryption on the message before hiding it within the picture to provide a more secure method of data transport. If the message is ever intercepted by a third party, there are several ways to stop this operation. A second level of security process implementation involves encrypting and decrypting steganography images using different hashing algorithms. [ABSTRACT FROM AUTHOR]

This research aims to establish a secure system for key exchange by using post-quantum cryptography (PQC) schemes in the classic channel of quantum key distribution (QKD). Modern cryptography faces significant threats from quantum computers, which can solve classical problems rapidly. PQC schemes address critical security challenges in QKD, particularly in authentication and encryption, to ensure the reliable communication across quantum and classical channels. The other objective of this study is to balance security and communication speed among various PQC algorithms in different security levels, specifically CRYSTALS-Kyber, CRYSTALS-Dilithium, and Falcon, which are finalists in the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization project. The quantum channel of QKD is simulated with Qiskit, which is a comprehensive and well-supported tool in the field of quantum computing. By providing a detailed analysis of the performance of these three algorithms with Rivest–Shamir–Adleman (RSA), the results will guide companies and organizations in selecting an optimal combination for their QKD systems to achieve a reliable balance between efficiency and security. Our findings demonstrate that the implemented PQC schemes effectively address security challenges posed by quantum computers, while keeping the the performance similar to RSA. [ABSTRACT FROM AUTHOR]

Blockchain technology has evolved from its origins in cryptocurrencies to become a fundamental component of secure digital interactions across diverse sectors, including healthcare, finance, and public administration. This article delves into the theoretical and practical applications of cryptography within blockchain networks, emphasizing key cryptographic functions, algorithms, and protocols such as RSA, elliptic curve cryptography (ECC), and SHA-256. It scrutinizes the use of digital signatures for transaction verification and the crucial role of hash functions in ensuring data integrity. Additionally, the article presents practical examples of symmetric and asymmetric encryption methods, underscoring their significance in maintaining privacy and security. The study also highlights the emerging challenges posed by quantum computing and explores ongoing research in post-quantum cryptography. Furthermore, it provides insights into the advancements in cryptographic techniques essential for the robustness of decentralized networks. By linking theoretical frameworks with practical implementations, this article aims to offer a comprehensive understanding of the cryptographic security measures pivotal for the future of blockchain technology. [ABSTRACT FROM AUTHOR]

With increasing data transmission and the escalating risks of data theft, the demand for fast and robust encryption algorithms has intensified. The Rivest Shamir Adleman (RSA) algorithm is a widely used asymmetric cryptographic solution for secure data communication. However, the computational resources required for encryption and decryption processes can become significant, particularly as the volume of data increases. This research paper proposes a dynamic approach to enhance the RSA algorithm tailored explicitly for large-scale data encryption and decryption. The proposed method involves storing the encrypted value of repeated elements, aiming to optimize performance. To evaluate the efficacy of this approach, extensive experiments were conducted on various datasets comprising paragraphs of different sizes. The experiments involved encrypting and decrypting paragraphs containing 10, 50, 100, 200, 500, 1000, and 10,000 words. Comparative analyses were performed against existing RSA, El Gamal, and AES algorithms. Results indicate that the proposed dynamic RSA approach consistently outperforms traditional RSA in terms of encryption time, decryption time, and total execution time across all tested paragraph sizes. The regression analysis revealed stark differences between the two approaches. The regression line for traditional RSA exhibited a significantly steeper slope 1.75 and a substantially higher intercept 1001.42 compared to the proposed dynamic RSA approach, which demonstrated a lower slope 0.0113 and a much smaller intercept 28.58. These findings underscore the superior scalability and efficiency of the proposed dynamic RSA approach over traditional RSA, particularly in handling larger volumes of data while maintaining lower computational overheads. [ABSTRACT FROM AUTHOR]

Big data, cloud computing and other hot areas are the use of personal information, but in the process of using this data, a large number of improper behavior is used to steal personal information. Most of the encryption algorithms in common use nowadays are based on ones that are no longer absolutely secure, such as RSA attacked by factorization, elliptic curves attacked by Pollard's lambda algorithm, and symmetric encryption algorithms attacked by collisions. In this paper, an integrated encryption and compression algorithm is designed, firstly, the data is transformed into the form of matrix, and the Jordan decomposition is used for preliminary compression and encryption from the two-dimensional point of view, and then based on the sparsity of matrix vectors, the compression-aware technique is used for compressing the set of key vectors, and the ciphertext group J produced by Jordan decomposition (which is a string of numbers with matrix diagonal length base √2 N), as well as the set of key vectors Y and the intermediate value Θ produced by compression awareness are obtained in the end. This sidesteps the common algorithms that have already been breached and is able to combine better encryption performance with compression performance while being innovative. [ABSTRACT FROM AUTHOR]

In the face of advancing quantum computing capabilities posing significant threats to current cryptographic protocols, the need for post-quantum cryptography has become increasingly urgent. This paper presents a comprehensive analysis of the performance of various post-quantum cryptographic algorithms specifically applied to digital signatures. It focuses on the implementation and performance analysis of selected algorithms, including CRYSTALS-Dilithium, Falcon, and SPHINCS+, using the liboqs library. Performance tests reveal insights into key pair generation, file signing, and signature verification processes. Comparative tests with the well-known and popular RSA algorithm highlight the trade-offs between security and time efficiency. The results can help to select secure and efficient ciphers for specific 5G/6G services. [ABSTRACT FROM AUTHOR]

Advances in quantum computers may pose a significant threat to existing public-key encryption methods, which are crucial to the current infrastructure of cyber security. Both RSA and ECDSA, the two most widely used security algorithms today, may be (in principle) solved by the Shor algorithm in polynomial time due to its ability to efficiently solve the discrete logarithm problem, potentially making present infrastructures insecure against a quantum attack. The National Institute of Standards and Technology (NIST) reacted with the post-quantum cryptography (PQC) standardization process to develop and optimize a series of post-quantum algorithms (PQAs) based on difficult mathematical problems that are not susceptible to being solved by Shor's algorithm. Whilst high-powered computers can run these PQAs efficiently, further work is needed to investigate and benchmark the performance of these algorithms on lower-powered (constrained) devices and the ease with which they may be integrated into existing protocols such as TLS. This paper provides quantitative benchmark and handshake performance data for the most recently selected PQAs from NIST, tested on a Raspberry Pi 4 device to simulate today's IoT (Internet of Things) devices, and provides quantitative comparisons with previous benchmarking data on a range of constrained systems. CRYSTALS-Kyber and CRYSTALS-Dilithium are shown to be the most efficient PQAs in the key encapsulation and signature algorithms, respectively, with Falcon providing the optimal TLS handshake size. [ABSTRACT FROM AUTHOR]

In wireless sensor networks, ensuring data confidentiality and integrity is paramount, particularly in sensitive environments. However, existing encryption methods encounter challenges, including key maintenance in symmetric encryption and lower security levels in asymmetric encryption. To address these issues, this paper proposes a novel security protocol employing a hybrid encryption approach, combining both symmetric (AES) and asymmetric (RSA) cryptographic techniques. The protocol introduces a two-phase cryptographic technique utilizing AES for robust encryption in Phase 1 and RSA for efficient key management in Phase 2. Experimental results demonstrate enhanced efficiency in encryption, decryption, and total execution time compared to existing algorithms, marking a significant advancement in cryptographic protocols for improved security in data transmission and management. Key contributions include the division of plaintext for simplified cryptographic processing, AES encryption for Phase 1, RSA encryption for Phase 2, and a seamless decryption process ensuring data integrity and security against attacks. [ABSTRACT FROM AUTHOR]

Summary: Communicating large amounts of data requires an encryption solution that ensures fast and secure data transfer. Unfortunately, it faced privacy and security issues, resulting in higher power consumption, data scarcity, energy, diversity, data reliability, low security, and packet loss in the communication process. The goal of this research is to ensure data transfer while conserving energy and protecting data transmission in WSNs. Therefore, this paper proposes a multipath routing protocol using the HGSPSO algorithm, which is a combination of hybrid gravitational search algorithm (HGSA) and particle swarm optimization (PSO), to securely transmit data from one node to another node under public and private key cryptography. The PSO approach is utilized to resolve the energy hole problem by selecting the cluster head in the sink coverage area. The RSA can be employed for data encryption, data decryption, key generation, and sharing. The metrics like acceleration constants and inertial weights are used for the HGSPSO algorithm. The result of this implementation demonstrated that the scheme had a low energy consumption of 36%, a maximum packet delivery ratio (PDR) of 96%, a higher throughput rate of 88%, and a low packet loss of 39%. [ABSTRACT FROM AUTHOR]

The connected digital environment generates massive amounts of data that must be protected from unauthorized disclosure. Technological advancements and the creative techniques attackers use can exacerbate data security breaches. Security protocols and cryptographic algorithms are the two components of information security, the last being information security's basis and fundamental technology. The cryptographic conception will improve and assure security while also protecting network resources that are exchanged. The goal of this study is to demonstrate the few encryption algorithms that are used to encrypt data on an unsecured network. This research presents a new hybrid encryption strategy for encrypting data. MRDAES encrypts data using Rivest, Shamir, Adleman (RSA), Diffie Hellman (DH), and the Advanced Encryption System. The data will be encoded in two stages: the first by producing the encoded data using the XOR function, and the second by using AES to encode data and obtain the final result to be shared with intended reception with high-security complexity compared to other methods in terms of performance and avalanche effect. The proposed study examines the three most widely used cryptographic symmetric and asymmetric algorithms, RSA, Diffie-Hellman, and AES, and how they operate and impact security and complexity when integrated into a unified hybrid (MRDAES) computation with the proper adjustments. The study also presents an approach for increasing data security while minimizing the number of mathematical equations and obtaining high-security complexity while slightly increasing execution time with chosen large random prime numbers. The results indicate that the new hybrid technique (MRDAES) has more efficient performance and avalanche effect inputs with a minor increase in execution time. The proposed approach MRDAES produced more advanced complexity than classical RSA existing methods and others. According to avalanche effect data, the proposed technique provides better results with a higher percentage than existing algorithms on modified RSA Random Bit Insertion Algorithm (RBMRSA) and classical Rivest, Shamir, and Adleman (RSA). The proposed approach enhances the avalanche effect by 88% compared to 48% achieved by an RBMRSA, with a 40% increase and 87.80% compared to RSA. [ABSTRACT FROM AUTHOR]

With the rapid evolution of telecommunication technologies, new means to share patients' medical images have consistently developed, leading to changes in their protection strategies. Consequently, researchers are paying attention to increasing security and privacy of sensitive medical images. However, brute-force, geometric and non-geometric attacks and unlawful manipulation have occurred in recent years. This paper attempts to propose a robust and hybrid encryption approach using improved Vigenere cipher and RSA that helps enhance security and integrity in medical images and protect sensitive data. The medical images come from different modalities such as X-ray, CT and MRI. The traditional public and private keys for the RSA algorithm is enhanced by adding a second key to the medical image. The second key and RSA keys are used to encode and decode the image which makes the decryption process considerably more difficult with correct key combinations. By incorporating the second key, the proposed approach addresses the challenges related to confidentiality and security in medical image transmission. Therefore, the proposed approach shows promising results in enhancing security and providing good performance of image encryption/decryption processes. [ABSTRACT FROM AUTHOR]

CRYSTALS-Dilithium and Falcon are digital signature algorithms based on cryptographic lattices, which are considered secure even if large-scale quantum computers will be able to break conventional public-key cryptography. Both schemes have been selected for standardization in the NIST Post-Quantum competition. In this work, we present a RISC-V HW/SW codesign that aims to combine the advantages of software and hardware implementations, i.e., flexibility and performance. It shows the use of flexible hardware accelerators, which have been previously used for Public-Key Encryption (PKE) and Key-Encapsulation Mechanism (KEM), for Post-Quantum signatures. It is optimized for Dilithium as a generic signature scheme but also accelerates applications that require fast verification of Falcon's compact signatures. We provide a comparison with previous works showing that for Dilithium and Falcon, cycle counts are significantly reduced, such that our design is faster than previous software implementations or other HW/SW codesigns. In addition to that, we present a compact Globalfoundries 22nm ASIC design that runs at 800 MHz. By using hardware acceleration, energy consumption for Dilithium is reduced by up to 92.2%, and up to 67.5% for Falcon's signature verification. [ABSTRACT FROM AUTHOR]

Secure transmission of images over wireless communications systems can be done using RSA, the most known and efficient cryptographic algorithm, and OFDMA, the most preferred signal processing choice in wireless communications. This paper aims to investigate the performance of OFDMA system for wireless transmission of RSA-based encrypted images. In fact, the performance of OFDMA systems; based on different signal processing techniques, such as, discrete sine transforms (DST) and discrete cosine transforms (DCT), as well as the conventional discrete Fourier transforms (DFT) are tested for wireless transmission of gray-scale images with/without RSA encryption. The progress of transmitting the image is carried by firstly, encrypting the image with RSA algorithm. Then, the encrypted image is modulated with DFT-based, DCT-based, and DST-based OFDMA systems. After that, the modulated images are transmitted over a wireless multipath fading channel. The reverse operations will be carried at the receiver, in addition to the frequency domain equalization to overcome the channel effect. Exhaustive numbers of scenarios are performed for study and investigation of the performance of the different OFDMA systems in terms of PSNR and MSE, with different subcarriers mapping and modulation techniques, is done. Results indicate that the ability of different OFDMA systems for wireless secure transmission of images. However, the DCT-OFDMA system showed superiority over the DST-OFDMA and the conventional DFT-OFDMA systems. [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.)

In cryptography, we use different methods to hide information and make sure it's safe when shared. This keeps hackers from getting at it. The RSA cryptosystem is a way to protect messages that uses two different keys. In this paper, a new method is suggested. It includes changing messages into hexadecimal values and then turning them into decimals. Public and private keys are generated based on the input of message's length, adding an increase of complexity to enhance the security of the cryptosystem. The proposed algorithm uses two different keys to encrypt and decrypt each character, this makes the cryptosystem increasing the difficultly for attackers trying to hack it. A comparison is made between the proposed algorithm and the original RSA, using NIST tests and measuring the running time of key generation, encoding, and decoding operations. The results show that the new algorithm provides a secure transmitting of data. The proposed algorithm enhances security over the standard RSA algorithm by using hexadecimal conversion, multiple keys, dual key encryption per one-character, increased randomness, and a more advanced cryptography method, offering improved resistance against attacks and protecting data. [ABSTRACT FROM AUTHOR]

We consider a new class of square Fibonacci (q+1)x(q+1)-matrices in public key cryptography. This extends previous cryptography using generalized Fibonacci matrices. For a given integer q, a (q+1)x(q+1) binary matrix Mq is a matrix which nonzero entries are located either on the super diagonal or on the last row of the matrix. In this article, we have proposed a modified public key cryptography using such matrices as key in Hill cipher and key agreement for encryption-decryption of terms of Mq-matrix. In this scheme, instead of exchanging the whole key matrix, only a pair of numbers needed to be exchanged, which reduces the time complexity as well as the space complexity of the transmission and has a large key space. [ABSTRACT FROM AUTHOR]

As a typical representative of the public key cryptosystem, RSA has attracted a great deal of cryptanalysis since its invention, among which a famous attack is the small private exponent attack. It is well-known that the best theoretical upper bound for the private exponent d that can be attacked is d ≤ N 0.292 , where N is a RSA modulus. However, this bound may not be achieved in practical attacks since the lattice constructed by Coppersmith method may have a large enough dimension and the lattice-based reduction algorithms cannot work so well in both efficiency and quality. In this paper, we propose a new practical attack based on the binary search for the most significant bits (MSBs) of prime divisors of N and the Herrmann-May's attack in 2010. The idea of binary search is inspired by the discovery of phenomena called "multivalued-continuous phenomena", which can significantly accelerate our attack. Together with several carefully selected parameters according to our exact and effective numerical estimations, we can improve the upper bound of d that can be practically achieved. More specifically, without the binary search method, we successfully attack RSA with a 1024-bit-modulus N when d ≤ N 0.285 . Moreover, by our new method, we can implement a successful attack for a 1024-bit-modulus RSA when d ≤ N 0.292 and for a 2048-bit-modulus RSA when d ≤ N 0.287 in about a month. We believe our method can provide some inspiration to practical attacks on RSA with mainstream-size moduli. [ABSTRACT FROM AUTHOR]

RSA is a well-known cryptosystem in Modern Cryptography and its efficiency is based on the hardness of the Integer Factorization problem. The algorithm is shown to be vulnerable to several attacks in a number of special scenarios with assumptions. In this paper, the strength of RSA is investigated if the primes in the modulus are close and the same modulus is used for two instances. The attack is highly efficient compared to other known attacks which are only concentrated on either closeness of the primes or the same modulus used for two or more instances. This attack examines the closeness of the primes chosen whenever the RSA system is used for two instances with the same modulus. The LLL algorithm is used to obtain the bound, and the bound is highly efficient compared to other known attacks. [ABSTRACT FROM AUTHOR]

Protecting digital data, especially digital images, from unauthorized access and malicious activities is crucial in today's digital era. This paper introduces a novel approach to enhance image encryption by combining the strengths of the RSA algorithm, homomorphic encryption, and chaotic maps, specifically the sine and logistic map, alongside the self-similar properties of the fractal Sierpinski triangle. The proposed fractal-based hybrid cryptosystem leverages Paillier encryption for maintaining security and privacy, while the chaotic maps introduce randomness, periodicity, and robustness. Simultaneously, the fractal Sierpinski triangle generates intricate shapes at different scales, resulting in a substantially expanded key space and heightened sensitivity through randomly selected initial points. The secret keys derived from the chaotic maps and Sierpinski triangle are employed for image encryption. The proposed scheme offers simplicity, efficiency, and robust security, effectively safeguarding against statistical, differential, and brute-force attacks. Through comprehensive experimental evaluations, we demonstrate the superior performance of the proposed scheme compared to existing methods in terms of both security and efficiency. This paper makes a significant contribution to the field of digital image encryption, paving the way for further exploration and optimization in the future. [ABSTRACT FROM AUTHOR]

Fog computing accredits by utilizing the network edge while still rendering the possibility to interact with the cloud. Nevertheless, the features of fog computing are encountering several security challenges. The security of end users and/or fog servers brings a significant dilemma in implementing fog computing. The computational power of the resources constrains Internet of Things (IoT) devices in the fog-computing environment. Therefore, an attacker can easily attack. The traditional methods like attribute-based encryption (ABE) techniques are inappropriate for resource-constraint devices with protracted computing and limited computational capabilities. In this regard, we investigate a multiauthority ciphertext policy-attribute-based encryption (MA-CP-ABE) method that enables multiauthority attribute revocation and computation outsourcing. Moreover, the encryption and decryption processes of resource-constraint IoT devices are outsourced to the fog nodes. In this way, it also reduces the computational burden of the resource-constraint IoT devices. Hence, we propose MA-CP-ABE for encryption and decryption, attribute revocation and outsourcing by reducing the computational burden and securing the system. We compare the computational offloading approach with the existing techniques to prove that the proposed approach outperforms the existing approaches. The proposed method reduces the operation time for the encryption and decryption process. We outsource cryptography operations to the fog node, reducing the end user's computational cost. Eventually, simulated outcomes are used to assess the algorithm's computational cost. [ABSTRACT FROM AUTHOR]

Electronic commerce(E-commerce) transactions require secure communication to protect sensitive information such as credit card numbers, personal identification, and financial data from unauthorized access and fraud. Encryption using public key cryptography is essential to ensure secure electronic commerce transactions. RSA and Rabin cryptosystem algorithms are widely used public key cryptography techniques, and their security is based on the assumption that it is computationally infeasible to factorize the product of two large prime numbers into its constituent primes. However, existing variants of RSA and Rabin cryptosystems suffer from issues like high computational complexity, low speed, and vulnerability to factorization attacks. To overcome the issue, this article proposes a new method that introduces the concept of fake-modulus during encryption. The proposed method aims to increase the security of the Rabin cryptosystem by introducing a fake-modulus during encryption, which is used to confuse attackers who attempt to factorize the public key. The fake-modulus is added to the original modulus during encryption, and the attacker is unable to distinguish between the two. As a result, the attacker is unable to factorize the public key and cannot access the sensitive information transmitted during electronic commerce transactions. The proposed method's performance is evaluated using qualitative and quantitative measures. Qualitative measures such as visual analysis and histogram analysis are used to evaluate the proposed system's quality. To quantify the performance of the proposed method, the entropy of a number of occurrences for the pixels of cipher text and differential analysis of plaintext and cipher text is used. When the proposed method's complexity is compared to a recent variant of the Rabin cryptosystem, it can be seen that it is more complex to break the proposed method—represented as O (ɲ ×   τ)   which is higher than Rabin-P ( O (ɲ)) algorithms. [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

Cryptography algorithms are an essential tool for protecting sensitive data and communications. They can be compared based on several criteria. The paper compares some of the traditional AES, RSA and SHA with lightweight Speck, Simon and Clefia cryptography algorithms based on key size, block size, rounds and security. It is worth noting that the choice of algorithm depends on the specific use case and the level of security. In general, traditional algorithms may be more appropriate for applications that require high levels of security, while lightweight algorithms may be more suitable for resource-constrained environments. [ABSTRACT FROM AUTHOR]

There are many ways to ensure data security, one of the classic way but still effective is to use encryption. Encryption itself has two techniques or algorithms: symmetric-key (also called secret-key) and asymmetric-key encryption (also called public key). In this paper, we proposed an analysis of two algorithm of encryption: RSA and AES algorithm in term of securing digital data. The method used in this research are: RSA and AES analysis, then retrieving the result. The two algorithm is deeply and thoroughly analyzed to discover the effectiveness to secure the data. The Technological Readiness Level (TKT) is at level 6, which means demonstration of a model or prototype or the analysis result of a system or subsystem or a study in a relevant environment. The result concluded that the application of the AES encryption algorithm is more optimal than RSA encryption in digital data security. Because the encryption and decryption process of using the AES algorithm is faster, although the difference in testing time of the two encryption algorithms is not too significant. The entropy value of 4.96 in AES encryption is greater than that of RSA proving that the even distribution of characters in the chiper text code does not accumulate on certain characters so that it will be difficult to attack using frequency analysis.

In the field of cryptography, many algorithms rely on the computation of modular multiplicative inverses to ensure the security of their systems. In this study, we build upon our previous research by introducing a novel sequence, (z j) j ≥ 0 , that can calculate the modular inverse of a given pair of integers (a , n) , i.e., a − 1 ; m o d , n . The computational complexity of this approach is O (a) , which is more efficient than the traditional Euler's phi function method, O (n , ln , n) . Furthermore, we investigate the properties of the sequence (z j) j ≥ 0 and demonstrate that all solutions of the problem belong to a specific set, I , that only contains the minimum values of (z j) j ≥ 0 . This results in a reduction of the computational complexity of our method, especially when a ∼ n and it also opens new opportunities for discovering closed-form solutions for the modular inverse. [ABSTRACT FROM AUTHOR]

Steganography is the practice of hiding data, such as images, videos, or text, within a cover image without it being detectable by the human eye. Several factors, such as the capacity, security, and robustness of the technique, are essential when transferring information using this method. In this study, we propose a new approach to image steganography that improves the Least Significant Bit (LSB) technique by utilizing images of 24 bits in each pixel. Improving the capacity and security of LSB-based steganography requires a combination of techniques, such as indirect embedding, embedding in multiple channels, and applying cryptographic and compression techniques. This approach conducts by encrypting each compressed secret message bit with the most significant bit of the red channel and then saving the output bit (hidden bit) in the least significant bit of the (green/blue) channel according to the row value (odd/ even). To further security, the suggested approach uses multi-level encryption; employs RSA to encrypt the secret message before applying the Huffman compression and encrypting the hidden bit by (XOR/XNOR) in the embedding method based on the row value of the pixel. Meanwhile, it is planned to use the Huffman coding technique to shorten the length of the encrypted message that will be inserted in the cover image. For the color photos in this work, the standard images were acquired from a standard dataset (USC-SIPI). The suggested approach performs better when measured in terms of mean square error (MSE), peak signalto- noise ratio (PSNR), and comparison to findings from related prior efforts. [ABSTRACT FROM AUTHOR]

Today in this modern and digital world, people need privacy and security during digital communication of their secret information. Cryptographic techniques provide methods for secure digital communication. In this paper, we have proposed a secret message sharing algorithm using finite state machine and recurrence relation to enhance the security level of the messages which is being sent between sender and receiver. The proposed new cryptographic encryption and decryption algorithm has been implemented using Moore machine which is a type of finite state automaton and two recurrence matrices namely Fibonacci numbers and Mersenne numbers. The importance of these algorithms is that, we can send information securely through the communication channel using them. The efficiency of the proposed algorithm has been analyzed and the analysis shows high level cryptographic protection during digital communication. In these algorithms we have used multiple set of keys to encipher the original message and its inverse to decipher it again and the authenticity of algorithms is assured because these algorithms have different levels of security which enhance the chances to keep our data or information confidential and secure for long time. There are many states in Moore machine to calculate the appropriate output. In every state it takes a new recurrence relation which depends upon the input. To compute the output, we apply mathematical operation which is our cipher text. At each level we have number of cipher text which increases the data security. [ABSTRACT FROM AUTHOR]

The amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge. The problem is not with the quantity of data but how to secure the data by ensuring its confidentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non-linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C#, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution time of a cryptographic algorithm but rather the size of the security key. [ABSTRACT FROM AUTHOR]

Copyright of Techno.com is the property of Universitas Dian Nuswantoro, Fakultas Ilmu Komputer 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.)

Different encryption methods that emerged with the development of cryptology have different advantages and disadvantages in terms of speed and security level. The importance of cryptography in this position is to reveal the advantages of encryption techniques by using them at the right time. In other words, the time of use and their management are as important as the strength of encryption algorithms. In this part hybrid encryption schemes come into play. Hybrid encryption schemes provide safer and faster data transmission by using the advantages of different encryption schemes on appropriate time. In this study, the reasons for the emergence of hybrid encryption schemes will be examined and the new hybrid encryption scheme will be mentioned. The new hybrid architecture consists of the implementation of the new encryption scheme and RSA, which is one of the asymmetric encryption schemes. [ABSTRACT FROM AUTHOR]

Cloud and Internet of things application are growing day by day. Most of the organization are using the cloud storage services for own application. IOT application are building under the 5G wireless communication technologies. Security is the major concern for data security and safety. The basic techniques start from using the watermarking with advancement of the cryptography algorithm. Most of the online and cloud application are using the cryptography-based data security. The most common and high secure cryptography algorithms are AES, RSA, Hash etc. This paper presents the cryptography techniques and challenges for the security in cloud data storage for IOT applications. [ABSTRACT FROM AUTHOR]

This paper focuses on analyzing the performance of various encryption algorithms, namely RSA, ECC, and DSA, in terms of encrypting and decrypting sensitive data. Encryption is crucial for ensuring the security of data, and there are two types of encryption algorithms: Symmetric key and Asymmetric-key encryption. RSA is highly secure but has high computation time, whereas ECC provides equivalent security with lower computing power and battery usage. The study compares the implementation and analysis of DES, 3DES, AES, RSA, ECC, and DSA, highlighting their strengths and weaknesses. The paper aims to provide a comprehensive comparison of these cryptographic techniques, including their performances, to assist in selecting the most appropriate algorithm for specific applications. [ABSTRACT FROM AUTHOR]

Copyright of InfoM is the property of Belgrade University, Faculty of Organizational Science 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.)

Advances in quantum computing have urged the need for cryptographic algorithms that are low-power, lowenergy, and secure against attacks that can be potentially enabled. For this post-quantum age, different solutions have been studied. Code-based cryptography is one feasible solutionwhose hardware architectures have become the focus of research in the NIST standardization process and has been advanced to the final round (to be concluded by 2022-2024). Nevertheless, although these constructions, e.g., McEliece and Niederreiter public key cryptography, have strong error correction properties, previous studies have proved the vulnerability of their hardware implementations against faults product of the environment and intentional faults, i.e., differential fault analysis. It is previously shown that depending on the codes used, i.e., classical or reduced (using either quasi-dyadic Goppa codes or quasi-cyclic alternant codes), flaws in error detection could be observed. In this work, efficient fault detection constructions are proposed for the first time to account for such shortcomings. Such schemes are based on regular parity, interleaved parity, and two different cyclic redundancy checks (CRC), i.e., CRC-2 and CRC-8. Without losing the generality, we experiment on the McEliece variant, noting that the presented schemes can be used for other code-based cryptosystems. We perform error detection capability assessments and implementations on field-programmable gate array Kintex-7 device xc7k70tfbv676-1 to verify the practicality of the presented approaches. To demonstrate the appropriateness for constrained embedded systems, the performance degradation and overheads of the presented schemes are assessed. [ABSTRACT FROM AUTHOR]

One of the critical goals of advanced cryptography is to protect data privacy. Although protecting sensitive data has always been essential, it has become much more due to the widespread use of cloud services. Conventional encryption schemes have one drawback: data must be decrypted before processing. Best practices have long recommended that data must be secured at rest and in motion when using public cloud services, i.e., we need encryption at the storage as well as at processing levels. Homomorphic encryption is an advanced cryptographic approach in which the processing of encrypted data is possible. In this paper, we have presented the insights required for understanding homomorphic encryption approaches. We examined and compared two partial homomorphic techniques, RSA and Pallier algorithm based on efficiency, base method, and homomorphic property. [ABSTRACT FROM AUTHOR]

Encryption of data is translating data to another shape or symbol which enables people only with an access to the secret key or a password that can read it. The data which are encrypted are generally referred to as cipher text, while data which are unencrypted are known plain text. Entropy can be used as a measure which gives the number of bits that are needed for coding the data of an image. As the values of pixel within an image are dispensed through further gray-levels, the entropy increases. The aim of this research is to compare between CAST-128 with proposed adaptive key and RSA encryption methods for video frames to determine the more accurate method with highest entropy. The first method is achieved by applying the "CAST-128" and the second is achieved by applying the "RSA ". CAST-128 utilizes a pair of sub-keys for each round as a quantum of five bits that was utilized as a key of rotation for each round and a quantum of 32 (bits) was utilized as a key of masking into a round. The proposed adaptive 128-bits key can be extracted from the main diagonal of each frame before encryption. RSA is a public-key cryptographic technique which can be known as (asymmetric) cryptography. An asymmetry of a key depends on factoring a product of two big prime values. A comparison was applied on several videos and the results showed that CAST-128 method proved the highest degree of entropy even if the frames have lots of distorted data or unclear image pixels. For example, the entropy value of a sample of a girl video is 2581.921 when using CAST-128, while it is 2271.329 when using the RSA; also the entropy value of a sample of a scooter video is 2569.814 when using the CAST-128, while it is 2282.844 when using RSA. [ABSTRACT FROM AUTHOR]

With the fast development of blockchain technology in the latest years, its application in scenarios that require privacy, such as health area, have become encouraged and widely discussed. This paper presents an architecture to ensure the privacy of health-related data, which are stored and shared within a blockchain network in a decentralized manner, through the use of encryption with the RSA, ECC, and AES algorithms. Evaluation tests were performed to verify the impact of cryptography on the proposed architecture in terms of computational effort, memory usage, and execution time. The results demonstrate an impact mainly on the execution time and on the increase in the computational effort for sending data to the blockchain, which is justifiable considering the privacy and security provided with the architecture and encryption. [ABSTRACT FROM AUTHOR]