NARSKCA: Novel and robust symmetric key cryptography algorithm

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.

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.

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

In the recent days people use a variety of online software applications to move data from one location to another. To secure personal data from hackers, software or applications use cryptographicbased algorithms. The encryption and decryption processes are the foundation of the cryptographic algorithm, which will be carried out with the help of a key. Cryptographic algorithms employ automatic key generation that starts with the user’s password, whereas another generating key directly interprets the password. A symmetric algorithm uses the same key for both encryption and decryption. For key generation, symmetric algorithms use a second or subsidiary method. The password is protected using this key generation process from various key attacks. The key generation algorithm functions as an interpreter, transforming a password from a human-readable form to a machine-readable form. An increase in permutations and combinations helps to protect the password; additional characteristics are being added to the algorithm. To get around the restricted key bit size, this paper proposed the KEY SECURE-KEY (KSKEY) algorithm. However, increasing the key size is not a suitable way to encrypt data because multi-core processors in modern microprocessors are significantly increasing processingspeed.

The RC-5 algorithm is an algorithm with the encryption method using the symmetric method and processing in the form of a cipher block, the same keywords are used for the encryption and decryption processes. The testing and analysis phase consists of a). Testing the execution time of the key generation process (set up key) b). Testing the success of the encryption and decryption process on the client-server integration method c). Testing the success of the encryption and decryption process using the file operation method d). Comparison of overhead/file size before and after passing through the system. The testing phase and execution time analysis are carried out when using the file operation method where the test will be divided into 3 parts, namely the execution time for the key setup process, the encryption process, and the decryption process. Testing the success of the encryption and decryption process on the client-server integration method is divided into 2 parts, namely testing the encryption process and the decryption process. In testing the encryption process, the characters that will be sent to the server will be encrypted first with a key to becoming a ciphertext in the form of integer data. The test results obtained are 1). The execution time for key generation (set up key) is very fast, around 9-10 ns. 2). In the encryption and decryption process, the execution time depends on the size of the plaintext file. The larger the plaintext file size, the longer the execution time. Where for a file with a size of 1 kb requires an execution time of 50.6 ms in the encryption process. 3). There is no difference between the size of the file before entering encryption and after decryption. Where for files with a size of 500 bytes before entering the encryption process, a file of 500 bytes will be generated from the decryption process.

(Cryptography Advanced Encryption Standard (AES) for File Document Encryption). Advanced Encryption Standard (AES) is a cryptographic algorithms as a standard symmetric key encryption algorithm that used in current time. AES 128 has 1 blok plaintext with 128 bit sized, where in the process of cryptographic algorithms, first the plaintext is converted into hexadecimal-sized 4 x 4 matrices called the state, where each element of state has 1 byte size. The process of encryption on AES is the transformation towards the state repeatedly in the 10th round. Each round of AES requires one key result of the key generation using 2 basic transformation, i.e. substitution and transformation. AES encryption using 4 transformation by the following sequence: subbytes, shiftrows, mixcolumns, and addroundkey. On the other hand, the process of decryption is using the inverse of all the basic transformation of AES algorithm, except addroundkey. Therefore, the sequence of transformation on the decription is invshiftrows, invsubbytes, invmixcolumns, and addroundkey. In the data text, the encryption process is initiated with convertion the data text into ASCII code in hexadecimal numbers that are molded into the matrix 4 x 4 bytes. Next, do some basic transformation such as subbytes, shiftrows, mixcolumns, and addroundkey. However, when performing the transformation, the processed data on every trasformation is in the form of binary data obtained from the hexadecimal matrix. AES 128 bit cryptography have room 2128 keys which is a tremendous value and is considered secure to use to avoid the brute force attack.

A new LabVIEW simulation design was applied to provide a comparison study among several types of the most common symmetric and asymmetric encryption algorithms. Also, the comparison with advanced encryption package program was made. The results showed that the new LabVIEW simulation design had advantages in several points, where the evaluated time required for the encryption and decryption processes will be lesser than it values using advanced encryption package program.In this work, the symmetric encryption algorithms were used: AES (Advanced Encryption Standard), DES (Data Encryption Standard), 3DES (Triple Data Encryption Standard) and RC2 (Rivest Cipher) algorithms, while the asymmetric encryption algorithm used was the RSA (Rivest-Shamir-Aldeman) algorithm. The comparison had been achieved using different sizes of text files with different key sizes. The final results proved that the LabVIEW simulation design is better than the Advanced Encryption Package because it increased the algorithm’s performance by 65% in terms of speed and throughput, and for the algorithms’ comparison, the final results showed the effectiveness of AES algorithm over the other algorithms in terms of speed and throughput for the encryption and decryption processes.

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.

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.

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.

Digital image is digital pictures on a two-dimensional plane which consists of pixels, where every pixels has Red, Green, Blue (RGB) with varying intensity depending on the image. In this thesis digital image is encrypted using hybrid algorithm Vigenere and RSA. Vigenere algorithm is a symmetric key algorithm which is a variety from Caesar algorithm where the similarity is in both of them are based on shifting the index of alphabet letters. RSA algorithm are based on the difficulty of factorizing large numbers that have 2 and only 2 factors (Prime numbers). The encryption process starts with getting the RGB intensity of each pixels from the image, then the RGB values are encrypted using Vigenere algorithm, after that RSA Algorithm encrypt those values, the values of RSA Algorithm encryption are limited so the value can be within the intervals of RGB values and the after limitation the values after being limited become the RGB values in the encrypted image. The decryption process is the inverse of encryption process, which enables the encrypted image to become the initial image before encryption. The program for encrypting and decrypting image are made using Java programming language with Netbeans IDE 8.2 software. The result of this implementation on image file donbass.jpg with the length of Vigenere key of 5 those are k1=144, k2=166 , k3=38 , k4=204 , k5=98, and RSA Algorithm keys are n=2201, e=1139, d=59, the results from the encrypted image is a visually very different image from the initial image. While in the decryption process, the encrypted image is able to be decrypted back to the initial image.

Technology is advancing day-to-day. For a better and faster technology, information security is a must. This requires data authentication at the execution levels. Cryptography is a useful tool through which secure data independency can be established. It uses two basic operations namely encryption and decryption for secure data communication. A large number of cryptographic techniques have been proposed and implemented so far. In this paper, we have surveyed some of the proposed mechanisms based on Symmetric Key Cryptography and have made a basic comparison study among them. The basic features, advantages, drawbacks and applications of various Symmetric Key Cryptography algorithms have been mentioned in this paper.

In the present work the authors have introduced an integrated symmetric key cryptographic method DJMNA which combine two independent methods (i) Modified Generalized Vernam Cipher (MGVC) method and (ii) DJSA method which is an extension of MSA method. The Generalized Vernam Cipher algorithm extends text encryption to any type of data encryption. This is done by using ASCII code of all characters (0-255). This modified version of Generalized Vernam Cipher uses “feedback” effect and also reverses the file while encryption. This makes the encryption process very hard to decrypt by using any brute force method. It was found that the encrypted text has huge difference for similar plaintexts having minor difference even for the same text-key. From this text key two randomized matrices are generated. The elements of this matrix decides the order of application of DJSA and MGVC methods.

In today’s world of technology, Data has been playing an imperative role in many different technical areas. Data confidentiality, integrity and data security over Internet from different media and applications has greater challenges tasks. Data generation from multimedia and IoT data is the biggest Big Data in Internet now. When sensitive and confidential data are counterfeit by attacks this lead to serious countermeasures to security and privacy. Data Encryption is the mechanism to forestall this issue. At present, many encryption techniques are used for multimedia and IoT but when there is massive data are developed it incur more computational challenge. This paper design and propose new coherent encryption algorithm which holds issue of IoT and multimedia big data. The proposed system can cause a strong cryptographic effect without hold much memory and easy performance analysis. Handling huge data with the help GPU is included in the proposed system to enhance the data processing more efficiently. The proposed algorithm is compared with other symmetric cryptographic algorithms like AES, DES, 3-DES, RC6 and MARS based on architecture, flexibility, scalability, security level and also based on computational Running time, Throughput for both encryption and decryption process. Avalanche effect is also calculated for proposed system with 54.2%. The proposed framework holds to secure the multimedia against real-time attacks.

Encryption and decryption are the two most important complex methods for achieving security in any type of smart devices and systems/machines through transport layer security protocol (TLS). The symmetric key algorithms are the significant method for encrypting and decrypting the data/information using block cipher or stream cipher which is used for TLS protocol. The primary symmetric key block cipher algorithm used in TLS is Advanced Encryption standard (AES) and it provides security based on the key bits used in AES operation. The TLS protocol provides confidentiality(C), integrity (I) and Authenticity (A) in a single pass communication that is Authentication Encryption and Authentication Data (AEAD) between web browser and web server. It uses well known TLS cipher suite AES-GCM (Galois Counter mode) which is commonly used in TLS1.2. Suppose AES-NI hardware acceleration is not available in smart devices like tablets it causes performance issues in smart devices using TLS 1.2 protocol. If the smart device does not possess AES-NI, it can use software for running AES-GCM but it takes a lot of time for encryption/decryption of information, ergo causing the battery performance in smart devices. The newer symmetric Stream cipher CHACHA20-POLY1305 provides AEAD for securing the communication in smart devices thus reducing the battery cycles which is used for TLS 1.3. The paper discusses the pros and cons of AES-GCM authentication encryption used in TLS 1.2.