A study and analysis on symmetric cryptography

This paper analyzes the computer security of systems and importance of the digital signature and hashing message algorithm. The proposed digital signature algorithm gives a new technology for producing effective output of digital signature as a result the signing 1 and verifying of signatures are very fast compared to earlier ones. To improve the security and authentication of sending data, this method uses "Message Digest", "IDEA" and "GOST" 2 algorithms. The new message digest algorithm is to provide high security, to transfer data by combination of digital signature algorithm and symmetric key cryptography algorithm. The new hashing algorithm proposed creates a unique digital fingerprint along with symmetric key encryption generated IDEA and GOST algorithms 3,4 . The receiver used the symmetric key and hashing algorithm to form a signature. If this message digest match with the sender digests the message the content will be decrypted and read by sender.

Nowadays, a large number of digital data are transmitted worldwide using wireless communications. Therefore, data security is a significant task in communication to prevent cybercrimes and avoid information loss. The Advanced Encryption Standard (AES) is a highly efficient secure mechanism that outperforms other symmetric key cryptographic algorithms using message secrecy. However, AES is efficient in terms of software and hardware implementation, and numerous modifications are done in the conventional AES architecture to improve the performance. This research article proposes a significant modification to the AES architecture’s key expansion section to increase the speed of producing subkeys. The fork–join model of key expansion (FJMKE) architecture is developed to improve the speed of the subkey generation process, whereas the hardware resources of AES are minimized by avoiding the frequent computation of secret keys. The AES-FJMKE architecture generates all of the required subkeys in less than half the time required by the conventional architecture. The proposed AES-FJMKE architecture is designed and simulated using the Xilinx ISE 5.1 software. The Field Programmable Gate Arrays (FPGAs) behaviour of the AES-FJMKE architecture is analysed by means of performance count for hardware resources, delay, and operating frequency. The existing AES architectures such as typical AES, AES-PNSG, AES-AT, AES-BE, ISAES, AES-RS, and AES-MPPRM are used to evaluate the efficiency of AES-FJMKE. The AES-FJMKE implemented using Spartan 6 FPGA used fewer slices (i.e., 76) than the AES-RS.

In the present work the authors have introduced a new advanced symmetric key cryptographic method called NJJSAA. The authors introduced new bit manipulation method for data encryption and decryption of any file. Nath et al already developed some symmetric key methods[1,2,3,4] where they have used some randomized key matrix for encryption and decryption methods. In the present work the authors have used a bit manipulation method which include bit exchange, right shift and XOR operation on the incoming bits. To exchange bits the authors used a randomized key matrix of size (16x16) using the method developed by Nath et al(1). The present method allows the multiple encryption and multiple decryption. To initiate the encryption process a user has to enter a text-key which may be maximum of 16 characters long. From the text-key the authors have calculated randomization number and the encryption number. The method used was developed by Nath et al(1). A slight change in the text-key will change the randomization number and the encryption number quite a lot. Multiple encryption using bit exchange, bit right shift and XOR operations makes the system very secured. The present method is a block cipher method and it can be applied to encrypt data in sensor network or in mobile network. The advantage of the present method is that one can apply this method on top of any other standard algorithm such as DES, AES or RSA. The method is suitable to encrypt any large or small file. There is a scope to further enhance the present method of encryption.

There are many protocols proposed for protecting Radio Frequency Identification (RFID) system privacy and security. A number of these protocols are designed for protecting long-term security of RFID system using symmetric key or public key cryptosystem. Others are designed for protecting user anonymity and privacy. In practice, the use of RFID technology often has a short lifespan, such as commodity check out, supply chain management and so on. Furthermore, we know that designing a long-term security architecture to protect the security and privacy of RFID tags information requires a thorough consideration from many different aspects. However, any security enhancement on RFID technology will jack up its cost which may be detrimental to its widespread deployment. Due to the severe constraints of RFID tag resources (e.g., power source, computing power, communication bandwidth) and open air communication nature of RFID usage, it is a great challenge to secure a typical RFID system. For example, computational heavy public key and symmetric key cryptography algorithms (e.g., RSA and AES) may not be suitable or over-killed to protect RFID security or privacy. These factors motivate us to research an efficient and cost effective solution for RFID security and privacy protection. In this paper, we propose a new effective generic binary tree based key agreement protocol (called BKAP) and its variations, and show how it can be applied to secure the low cost and resource constraint RFID system. This BKAP is not a general purpose key agreement protocol rather it is a special purpose protocol to protect privacy, un-traceability and anonymity in a single RFID closed system domain.

In this research paper, a novel and strong symmetric key cryptography algorithm is proposed. NARSKCA is based on several symmetric cryptographic algorithms. NARSKCA is very simple that uses character converting algorithm, Fibonacci Number Series, Lucas Number series and bitwise XOR. In NARSKCA, 32 files are shared-secret files plays a vital role in this Proposed Algorithm. The Sub-keys are generated from those 32 shared-secret files which are useful in different rounds of Encryption and Decryption Process. The most important feature is the calculation of the final key from the Sub-Keys for each Text-Block. Key Generation, encryption/decryption schemes of NARSKCA are fast and difficult to predict by Cryptanalysts.

Variable Length Cumulative Key Size and Seed Based Symmetric Key Cryptographic Algorithm Using Composite 3-D Transposition Substitution and Chaining Technique

Now a day digital information is very easy to process, but it allows unauthorized users to access this information. To protect this information from unauthorized access, Advanced Encryption Standard (AES) is one of the most frequently used symmetric key cryptography algorithm. Main objective of this paper is to implement fast and secure AES algorithm on reconfigurable platform. In this paper, AES algorithm is designed with the aim to achieve less power consumption and high throughput. Keys are generated using MATLAB and remaining algorithm is designed using Xilinx SysGen, implemented on Nexys4 and simulated using Simulink. Synthesis result shows that it consumes 121 slice registers and its operating frequency is 1102.536 MHz. Throughput of the overall system is 14.1125 Gbps.

Wireless Sensor Networks are installed in hostile areas. The security issues in wireless sensor networks are very important. Getting secure links between nodes is a challenging problem in WSNs. They are more vulnerable to security attacks than wired networks. In order to protect the sensitive data in WSN can be protected using secret keys to encrypt the exchanged messages between communicating nodes. Key management is essential for many security services such as confidentiality and authentication. The symmetric or asymmetric key cryptography or Trusted-server schemes are used to solve this problem. Asymmetric key cryptography increases network security but it increases computational, memory, and energy overhead. Symmetric key cryptography provides less security and it is efficient key management scheme. Trusted server schemes use key management server. Because there is usually no trusted infrastructure it is not very suitable for sensor networks. In this paper, we have proposed Mobile Agent (MA) Based Key Distribution (MAKD). In MAKD, Mobile Agents are used for dissemination of public keys and update of shared keys. Each sensor node constructs different symmetric keys with its neighbors, and communication security is achieved by data encryption and mutual authentication with these keys. Simulation results show that MAKD is scalable and with less communication overhead.

As public key cryptographic operations are computationally expensive; it motivates a careful examination of the reasons of its usage and looking for symmetric key alternatives. In this paper, we present comparisons between public key and symmetric key cryptography in protecting storage and take some other factors, such as security, cost and environment etc. into consideration. At first, the comparisons between public key and symmetric key cryptography is presented. Then, the security services that some famous storage systems provide and some symmetric key alternatives are discussed. We give the comparisons of some practice storage systems and trade off some other parameters. Finally, some general conclusions are made about the secure storage systems for system designers.

In the current digital era, the security of information has become a fundamental aspect of system development. Cryptography, especially symmetric key algorithms, plays a key role in protecting data confidentiality. This research presents the development of a modern cryptographic application based on the Data Encryption Standard (DES), implemented using the Python programming language. The system is equipped with a graphical user interface (GUI) developed using Tkinter, allowing users to easily encrypt and decrypt text data. In addition to DES, the application also includes educational features such as RSA encryption and SHA-256 hashing to enhance users' understanding of various cryptographic techniques. The development process follows a prototyping method, from initial analysis to implementation and testing. Several functional tests were conducted using various text inputs, and results showed that the application successfully performed accurate encryption and decryption. Furthermore, the GUI interface provides an intuitive user experience, making it suitable as a learning tool in educational environments. This research contributes to the field of computer security by offering an open, accessible tool for understanding classical encryption methods and promoting awareness of basic data protection strategies in software applications.

Ensuring data security is an essential priority to be put forward once there will be a digital transmission between any two or more targeted audience. Hence, the objective of this paper was to propose a better data security model for a protective information exchange on the internet with steganographic and cryptographic algorithms. Three cryptographic symmetric key encryption algorithm (RC6, Rijndael and TwoFish) and four steganographic carrier object (Image, audio, text and video) were considered. Data obtained show that Rijndael (AES) takes less encipherment and decipherment time compare to RC6 and TwoFish in cryptographic symmetric key encryption algorithm, while image carrier achieves better Peak-Signal-to-Noise Ratio if related to audio, video and text steganography. This research suggests the use of Advanced Encryption Standard and image steganography for efficient information interchange on the internet.

Security of data stored on computers is now an absolute requirement, because every data has a high enough value for the user, reader and owner of the data itself. To prevent misuse of the data by other parties, data security is needed. Data security is the protection of data in a system against unauthorized authorization, modification, or destruction. The science that explains the ways of securing data is known as cryptography, while the steps in cryptography are called critical algorithms. At this time, there are many cryptographic algorithms whose keys are weak especially the symmetric key algorithm because they only have one key, the key for encryption is the same as the decryption key so it needs to be modified so that the cryptanalysts are confused in accessing important data. The cryptographic method of Word Auto Key Encryption (WAKE) is one method that has been used to secure data where in this case the writer wants to maximize the encryption key and description of the WAKE algorithm that has been processed through key formation. One way is to apply the algebraic pascal triangle method to maximize the encryption key and description of the WAKE algorithm, utilizing the numbers contained in the columns and rows of the pascal triangle to make shifts on the encryption key and the description of the WAKE algorithm.Keywords: Cryptography, WAKE, pascal

To collect the data and transmit them on the base station is the main task of the sensor nodes in wireless sensor networks (WSNs). This transmission requires a specific routing algorithm. To prolong the network lifetime, sensor nodes need a secure load-balancing route. In this paper, we investigate the facts of ensuring secure sensed data in a balanced energy network backbone, and propose energy-efficient secure path algorithm (ESPA) for WSNs. It is a process of ensuring sensed data authenticity and integrity under a well-structured energy-efficient routing. To overcome the limitation caused by the symmetric key cryptography algorithms for securing data in WSNs, we proposed a mechanism for checking data integrity in a balanced energy network backbone. On this basis, we use the combined version of distance energy aware routing and a checking data integrity method for WSNs. ESPA provides a better performance in maximizing the network lifetime.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

Distributed computing infrastructure’s data storage subsystems are usually physically scattered among several nodes and logically shared among several users and (local) administrators. It is therefore necessary to provide users with adequate mechanisms and tools for information and data security management, especially in large scale systems since the complexity of the problem increases with the number of users and the amounts of data. In this chapter we propose a solution based on a lightweight cryptography algorithm combining the strong and highly secure asymmetric cryptography technique (RSA) with the symmetric cryptography (AES). We describe a possible implementation of our solution going into details of all the algorithms and the mechanisms specified.