Strong Cryptographic Algorithms Research Articles

Message Encryption in Digital Images using the Zhang LSB Imange Method

Message encryption in digital images using the Zhang LSB Image method is a steganography technique that utilizes the Least Significant Bit (LSB) method to hide secret messages in the last bit of the image pixel. This method allows the use of images as a medium to convey hidden messages. The encryption process involves two main stages, namely message encryption and message hiding in an image. Message encryption is carried out using strong cryptographic algorithms to secure the authenticity and confidentiality of messages. Then, the encrypted message is inserted into the last bit of the image pixel using the LSB method. This is done by modifying the last bit value of the pixel so that the change is not visually visible to the human eye. To recover the original message, the message recovery process involves extracting the last bit of the modified image pixel and decrypting the message using the appropriate key. The Zhang LSB Image method is a steganography technique that is relatively simple but effective in hiding messages in digital images.

A Good Result for Blowfish Image Encryption Based on Stepic

Information security is important in the era of evolving communications. Security methods are needed to protect data. Strong cryptographic algorithms, such as Blowfish, developed by Bruce Schneier in 1993, offer fast and reliable encryption. Blowfish uses 64 bit blocks and key lengths between 32 and 443 bits. This algorithm is famous for its robustness and encryption speed, with a Feistel Network structure and 16 rounds. This research implements Blowfish with Python and integrates it with steganography to insert secret data in digital images. Evaluation involves metrics such as Mean Squared Error (MSE), Peak-Signal-to-Noise Ratio (PSNR), Average Visibility (AVA), Uniform Average Change Intensity (UACI), and Percentage Pixel Change Value (NPCR) to measure quality and reliability encryption and decryption process by Blowfish.

Strengthening Cloud Security: A Comprehensive Review of Modern Cryptography Methods and Emerging Trends

To protect data and communication in cloud environments, this article examines the foundations, methods, and protocols of cryptography in the context of cloud computing. Asymmetric and symmetric key cryptography is introduced, with a focus on the difficulties in key distribution and the significance of strong cryptographic algorithms. The paper discusses several cloud cryptography strategies, demonstrating their value in enabling safe data sharing and compute outsourcing while maintaining secrecy. These techniques covered include homomorphic encryption, proxy re-encryption, attribute-based encryption, and searchable encryption. The relevance of cryptographic protocols for cloud security in terms of authentication, access control, and data sharing is examined. Examples include SSL/TLS for secure communication and KMIP for key management. Furthermore, the paper highlights privacy-preserving computation techniques and the usage of cryptographic standards and frameworks provided by NIST, CSA, and TCG in ensuring secure cryptographic practices. The paper concludes by addressing current challenges and future directions, including performance optimization, trust in cloud providers, and post-quantum cryptography, to enhance the security of data in cloud computing

Application of Factorial and Binomial Identities in Information, Cybersecurity and Machine Learning

This paper presents application of the binomial and factorial identities and expansions that are used in artificial intelligence, machine learning, and cybersecurity. The factorial and binomial identities can be used as methodological advances for various algorithms and applications in information and computational science. Cybersecurity is the practice of protecting the computing systems, communication networks, data and programs from cyber-attacks. Its objective is to reduce the risk of cyber-attacks and protect against the unauthorized exploitation of systems and networks. For this purposes, we need a strong cryptographic algorithms like RSA algorithm and Elliptic Curve Cryptography. In this connection, computing and combinatorial techniques based on factorials and binomial distributions are developed for the researchers who are working in artificial intelligence and cybersecurity.

Development of the Advanced Encryption Standard.

Strong cryptographic algorithms are essential for the protection of stored and transmitted data throughout the world. This publication discusses the development of Federal Information Processing Standards Publication (FIPS) 197, which specifies a cryptographic algorithm known as the Advanced Encryption Standard (AES). The AES was the result of a cooperative multiyear effort involving the U.S. government, industry, and the academic community. Several difficult problems that had to be resolved during the standard's development are discussed, and the eventual solutions are presented. The author writes from his viewpoint as former leader of the Security Technology Group and later as acting director of the Computer Security Division at the National Institute of Standards and Technology, where he was responsible for the AES development.

Design and Implementation of a Strong and Secure Lightweight Cryptographic Hash Algorithm using Elliptic Curve Concept: SSLHA-160

Cryptographic hash function assumes a fundamental job in numerous pieces of cryptographic algorithm and conventions, particularly in authentication, non-repudiation and information trustworthiness administrations. A cryptographic hash work takes a commitment of optional tremendous size message and conveys a fixed little size hash code as a yield. In the proposed work SSLHA-160 (a strong and secure lightweight cryptographic hash algorithm), each 512-digit square of a message is first diminished to 256-bit. A cryptographic hash work takes a contribution of discretionary enormous size message and delivers a fixed little size hash code as a yield. In the proposed work SSLHA-160 (A strong and secure lightweight cryptographic hash algorithm), each 512- digit square of a message is first diminished to 256-bit and afterward partitioned into eight equivalent block of 32 pieces each and each 32-cycle block is additionally separated into two sub-block of 16-piece each. These two sub-blocks go about as two purposes of an elliptic curve, which are utilized for computing another point which is of 16 pieces. The new point esteems are thusly handled to produce message digest. SSLHA-160 is easy to develop, simple to actualize and displays solid torrential slide impact (avalanche), when contrasted with SHA1, RIPEMD160 and MD5.

Построение функции генерации криптографически стойких псевдослучайных последовательностей на базе алгоритма шифрования «Кузнечик»

Purpose: increasing the cryptographic strength level of the pseudo-random sequence generation function based on the «Kuznechik» encryption algorithm. Research methods: methods for constructing pseudo-random sequence generators using a strong cryptographic algorithm as a generation function in accordance with the recommendations of NIST SP 800-90. Methods of probability theory and mathematical statistics (statistical hypothesis testing, Pearson’s criterion), methods for estimating the entropy of a random process. Results: а method for development of the main component of the deterministic generator – the function for generating pseudo-random sequences based on the «Kuznechik» encryption algorithm (Russian encryption standard GOST R 34.12-2015) due to a number of the original algorithm modifications is proposed. Features of the algorithm allow to use it in a mode that combines the advantages of the well-known encryption modes of block ciphers (OFB and CTR encryption modes). A procedure for generating round keys and other modifications of the algorithm that increase its security while maintaining its performance have been developed and implemented. The generator operation was evaluated on the basis of the statistical properties of the output sequences (NIST SP 800-22 tests), Pearson’s χ2 criterion, and min-entropy (NIST 800-90B tests). According to the characteristics mentioned above, the proposed generation function is comparable with the reference version based on GOST 34.12-2015 «Kuznechik», but exceeds it in terms of security.

A Deep Learning-based Cryptocurrency Price Prediction Scheme for Financial Institutions

A cryptocurrency is a network-based digital exchange medium, where the records are secured using strong cryptographic algorithms such as Secure Hash Algorithm 2 (SHA-2) and Message Digest 5 (MD5). It uses blockchain technology to make the transactions secure, transparent, traceable, and immutable. Due to these properties, the cryptocurrencies have gained popularity in almost all the sectors especially in financial sectors. Though, cryptocurrencies are getting recognition form the approval bodies, but still, the uncertainty and dynamism in their prices risk the investments substantially. Cryptocurrency price prediction has become a trending research topic globally. Many machine learning and deep learning algorithms such as Gated Recurrent Unit (GRU), Neural Networks (NN), and Long short-term memory (LSTM) have been used by the researchers to predict and analyze the factors affecting the cryptocurrency prices. In this paper, a LSTM and GRU-based hybrid cryptocurrency prediction scheme is proposed, which focuses on only two cryptocurrencies, namely Litecoin and Monero. The results depict that the proposed scheme accurately predicts the prices with high accuracy, revealing that the scheme can be applicable in various cryptocurrencies price predictions.

Penerapan Algoritma CAST-128 pada Proses Enkripsi dan Dekripsi Teks

Encoding was first made using a classic algorithm. This algorithm builds its security on the confidentiality of the algorithm used. However, this algorithm is inefficient when used to communicate with many people because the algorithm is still very simple and still very easy to solve, so important information or data that you want to keep secret can be easily discovered by other people or people who are not responsible. CAST-128 is a cryptographic algorithm that is said to be similar to the DES algorithm which uses 16 rounds of feistel network as one of its strengths. Where in the process of encryption and decryption of text CAST-128 uses a 64-bit block length and key lengths of up to 128 bits. For information, the CAST-128 algorithm is referred to as one of the strong cryptographic algorithms against various types of cryptanalysis, including differential and linear attacks. With the application of the CAST-128 algorithm in the process of encrypting and decrypting text, it will be more difficult to decode text encoded by people who do not know the key so as to create more security than the encoded text. So when the text wants to be sent or transferred to the flashdisk will be more confidential.

StealthDB: a Scalable Encrypted Database with Full SQL Query Support

Abstract Encrypted database systems provide a great method for protecting sensitive data in untrusted infrastructures. These systems are built using either special-purpose cryptographic algorithms that support operations over encrypted data, or by leveraging trusted computing co-processors. Strong cryptographic algorithms (e.g., public-key encryptions, garbled circuits) usually result in high performance overheads, while weaker algorithms (e.g., order-preserving encryption) result in large leakage profiles. On the other hand, some encrypted database systems (e.g., Cipherbase, TrustedDB) leverage non-standard trusted computing devices, and are designed to work around the architectural limitations of the specific devices used. In this work we build StealthDB – an encrypted database system from Intel SGX. Our system can run on any newer generation Intel CPU. StealthDB has a very small trusted computing base, scales to large transactional workloads, requires minor DBMS changes, and provides a relatively strong security guarantees at steady state and during query execution. Our prototype on top of Postgres supports the full TPC-C benchmark with a 30% decrease in the average throughput over an unmodified version of Postgres operating on a 2GB unencrypted dataset.

Secure Protocol and IP Core for Configuration of Networking Hardware IPs in the Smart Grid

Nowadays, the incorporation and constant evolution of communication networks in the electricity sector have given rise to the so-called Smart Grid, which is why it is necessary to have devices that are capable of managing new communication protocols, guaranteeing the strict requirements of processing required by the electricity sector. In this context, intelligent electronic devices (IEDs) with network architectures are currently available to meet the communication, real-time processing and interoperability requirements of the Smart Grid. The new generation IEDs include an Field Programmable Gate Array (FPGA), to support specialized networking switching architectures for the electric sector, as the IEEE 1588-aware High-availability Seamless Redundancy/Parallel Redundancy Protocol (HSR/PRP). Another advantage to using an FPGA is the ability to update or reconfigure the design to support new requirements that are being raised to the standards (IEC 61850). The update of the architecture implemented in the FPGA can be done remotely, but it is necessary to establish a cyber security mechanism since the communication link generates vulnerability in the case the attacker gains physical access to the network. The research presented in this paper proposes a secure protocol and Intellectual Property (IP) core for configuring and monitoring the networking IPs implemented in a Field Programmable Gate Array (FPGA). The FPGA based implementation proposed overcomes this issue using a light Layer-2 protocol fully implemented on hardware and protected by strong cryptographic algorithms (AES-GCM), defined in the IEC 61850-90-5 standard. The proposed secure protocol and IP core are applicable in any field where remote configuration over Ethernet is required for IP cores in FPGAs. In this paper, the proposal is validated in communications hardware for Smart Grids.

A practical, secure, and auditable e-voting system

A cryptographic electronic voting system is proposed, to replace the conventional voting methods, which are widely used in most developing countries in the Middle East and North Africa (MENA) region. The proposed e-voting system is based on the concept of Prêt à Voter, which is a paper ballot e-voting scheme. Mixnet based e-voting schemes such as Prêt à Voter use mix servers to create anonymous channels. These schemes have some shortcomings; Mixnets need complex protocols for generating and maintaining shared mix keys, as well as for mixing and proving correctness of the shuffles. Moreover, Mixnets are complex to implement on a large scale. Mixnets are also vulnerable to corrupt or faulty mix servers as well. The proposed e-voting scheme eliminates the need for anonymous channels to anonymize the votes in Mixnet based e-voting schemes, yet provides comparable level of security and vote anonymity with less system complexity. The proposed e-voting scheme uses paper ballots, due to its familiarity among the public, but with strong cryptographic algorithms with proven security features, to provide enhanced level of ballot secrecy, verifiability and security. The proposed scheme is simple, secure, practical, and auditable. Security evaluation is conducted based on the critical and desirable properties of e-voting to support the claimed aspects. Threat analysis of the proposed e-voting system had been conducted to prove its resistance to well-known attacks on e-voting schemes and systems. A proof of concept implementation and simulation of the proposed e-voting scheme was developed to elucidate its efficiency, practicality, and scalability. The research proposal has the potential to be deployed as a trustworthy e-voting system, to replace the conventional voting methods in developing countries.

Improved Classical Cipher for Healthcare Applications

E-health is rapidly picking up the gear and providing lots of services. It facilitates novel solutions for the problems suffered by the aged people as well as the people affected with chronic diseases. Apart from the above services, it devotes much interest in personal fitness. The healthcare system makes use of wearable wireless sensors which are implanted in patients, allow the monitoring of the health status at all time. The data collected from the patients transmitted through the network to the clinic or the doctor for a detailed diagnosis. Since healthcare applications are dealing with highly sensitive data, strong cryptographic algorithms should be incorporated for providing confidentiality. However, due to the computational and energy limitations of wireless devices we are forced to implement light weight ciphers which are computationally feasible in achieving confidentiality. This paper proposes a variant of hill cipher having two key matrices to add extra security to health related data.

Comparative Analysis of Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptography

Authenticated key agreement protocol must put in a nutshell of competent and strong cryptographic algorithm which is ensure confidentiality and integrity of message. Key Agreement Protocol using Elliptic Curve Cryptography provide significant development in cryptography to protect integrity, user anonymity and confidentiality of data than RSA, DSA. To examine, at a fundamental level, the environment of existing key agreement protocol. So that improved elliptic curve cryptosystem addressing implementation of secure key agreement protocol with greater security. To study network security tools in order to establish key agreement between two party or multi party communications various techniques and algorithms for implementation elliptic curve cryptosystem are discussed. Therefore suggested protocol can apply on wireless network to condense the security, performance requirement and cost of computation.

An Empirical Evaluation of Security Indicators in Mobile Web Browsers

Mobile browsers are increasingly being relied upon to perform security sensitive operations. Like their desktop counterparts, these applications can enable SSL/TLS to provide strong security guarantees for communications over the web. However, the drastic reduction in screen size and the accompanying reorganization of screen real-estate significantly changes the use and consistency of the security indicators and certificate information that alert users of site identity and the presence of strong cryptographic algorithms. In this paper, we perform the first measurement of the state of critical security indicators in mobile browsers. We evaluate ten mobile and two tablet browsers, representing over 90% of the market share, against the recommended guidelines for web user interface to convey security set forth by the World Wide Web Consortium (W3C). While desktop browsers follow the majority of guidelines, our analysis shows that mobile browsers fall significantly short. We also observe notable inconsistencies across mobile browsers when such mechanisms actually are implemented. We show where and how these failures on mobile browsers eliminate clues previously designed for, and still present in, desktop browsers to detect attacks such as phishing and man-in-the-middle. Finally, we offer advice on where current standards are unclear or incomplete.

Security Analysis and Modification of Classical Encryption Scheme

Objectives: Computer security is all about the study of cyber attacks with a view to defend against them. Cryptography is considered to be a class of science by using the special art of transforming information in a protected way such that it can overcome the attacks. There is an immense requirement of strong cryptographic algorithms in order to withstand against the various attacks. Methods: The Kerchoff’’s Principle states that the encryption and decryption algorithms are always available to anyone. The security of the cipher against any sort of attack should be depends only on the secrecy of the key. There comes the play of cryptanalysis. It is art of breaking the keys by identifying the vulnerabilities existing in the systems. This paper deals with the classical encryption schemes and their cryptanalysis. The cryptanalysis for various encryption schemes differs a lot. Various cryptanalysis like statistical analysis, frequency analysis, trial and error (brute force) are carried out in this work. Findings: The classical encryption schemes such as caesar cipher, shift cipher, vigenere cipher, affine cipher and hill cipher are discussed in the paper. A detailed analysis about the security of the above mentioned ciphers are explored. Among the ciphers it is identified that if the key varies for each plaintext to be encrypted provides added security. But the worst is the management of the huge key space. A modified algorithm is proposed which can provide a better security using simple computations. In this approach lots of keys are used but generated from a single key by using simple shift and EXOR operation. In the main stream only one key need to be exchanged between the communication entities and for that exchange we can make use of the public key cryptosystem. Application: Cryptography is considered to be an ineluctable field in era of communication. Cryptographic algorithms acts as an underpinning for lots of applications such as Anonymous Remailers, Digital Signatures, Secured Money transactions etc.Keywords: Additive Cipher, Monoalphabetic Cipher, Multiplicative Cipher, Polyalphabetic Cipher

State Machine-Based Security Fusion for Resource-Constrained Environments

A growing range of devices has difficulty in implementing strong cryptographic algorithms. Radio frequency IDs and sensors, for instance, generally lack the processing power and memory to perform these operations in an efficient and timely manner. Recently, a new paradigm in security, called security fusion, was introduced for resource-constrained environments. In this approach, strong security properties are synthesized from weaker point-to-point properties, thereby minimizing the resource requirements at each node without compromising system-level security. In this paper, we describe a state machine-based architecture and pertinent protocols to realize security fusion. Furthermore, we analyze these protocols for their security capabilities.

Chaos-based selective encryption for H.264/AVC

Encryption techniques are usually employed to maintain the secrecy of the video streams transmitted via a public network. However, full encryption using strong cryptographic algorithms is usually not necessary if the purpose is to destroy the commercial value by preventing pleasant viewing. For this purpose, selective encryption is preferred as its operating efficiency is higher. Here, a chaos-based selective encryption scheme implemented on the H.264/AVC standard is proposed. The scheme employs multiple Rényi chaotic maps to generate a pseudorandom bit sequence which is used to mask the selected H.264/AVC syntax elements. It provides sufficient protection against full reconstruction while keeping the format compliance property so as not to cause decoding error without the key. The operating efficiency is high due to the low computational complexity of the Rényi chaotic map, as justified by the simulation results using video clips at various resolutions. Moreover, the security analyses show that the proposed algorithm is highly sensitive to the secret key and possesses good perceptual security.

A new untraceable off-line electronic cash system

Digital content transactions through e-commerce will grow tremendously in the coming years. In this respect, well-designed electronic payment schemes and high-quality digital contents are two critical factors. Untraceable electronic cash schemes make it possible for customers to pay the e-cash to the merchants through communication networks under privacy protection. Therefore, there is a need to invent new electronic payment protocols with strong cryptographic algorithms that will eventually replace present day paper-based cash schemes. There have been two types of electronic cash schemes, namely on-line and off-line. In general off-line schemes are more efficient than on-line ones. The two fundamental issues with any off-line electronic cash scheme have been the detection of double-spending and provision of anonymity. This paper proposes a new untraceable off-line electronic cash scheme which can maintain anonymity and double spender detection and possesses strong fraud control capabilities. Moreover, the proposed scheme attaches expiration date to coins so that the banking system can manage its databases more efficiently. The scheme is based on cryptographic techniques such as ElGamal and blind signatures. The coins produced by the scheme can be transferred through computer networks into storage devices and vice versa so that portability is assured.

Guest Editors' Introduction: Security and Trust in Embedded-Systems Design

Security and trust have become important considerations in the design of virtually all modern embedded systems. The requirements of secure and trusted design are unique: Secure design emphasizes information leakage (or prevention thereof) and dependable behavior. Even strong cryptographic algorithms are of little use if the underlying processor can be tricked into releasing cryptographic keys. This leads to unique design techniques such as design and implementation of boundaries for logical and physical protection, design of protected storage and secure-computing primitives, runtime measurement and reporting of security properties, and implementation of side-channel-resistant hardware and software. Eventually, the embedded-system designer must cope with security as yet another requirement in addition to existing functional requirements, performance, power, and cost. This special issue presents six articles that address various critical aspects of secure embedded-systems design.