Modern Encryption Research Articles

An Encryption Algorithm for End-to-End Secure Data Transmission in MANET

Encryption is of prime importance when confidential data is transmitted over wireless network. Numerous encryption algorithms like AES, DES, RC4 and others are available for the same. The most widely accepted algorithm is AES algorithm. We have proposed a new algorithm based on the concept used by Rijmen and Daemen (Rijndael algorithm), the founders of AES algorithm. The proposed algorithm encrypts and decrypts two 128 bits data simultaneously i.e. 256 bits data, thus providing strong encryption accompanied with complex processing. The proposed Feistal algorithm uses various invertible, self-invertible, and non-invertible components of modern encryption ciphers and key generation same as that of AES. This algorithm provides a secure, fast, and strong encryption of the data. There is a huge amount of confusion and diffusion of the data during encryption which makes it very difficult for an attacker to interpret the encryption pattern and the plain text form of the encrypted data. The proposed algorithm is also resistant to Brute-Force and pattern attacks. This algorithm proves particularly useful while transmitting confidential data over a Bluetooth or wifi network. This algorithm is implemented in the Application layer of the device. The details of implementation are given in the article. General Terms Security Algorithm, Symmetric Key Encryption, MANET.

An Encryption Algorithm for Secure Data Transmission

Encryption is of prime importance when confidential data is transmitted over the network. Varied encryption algorithms like AES, DES, RC4 and others are available for the same. The most widely accepted algorithm is AES algorithm. We have proposed a new algorithm based on the concept used by Rijmen and Daemen (Rijndael algorithm), the founders of AES algorithm. The proposed algorithm encrypts and decrypts two 128 bits data simultaneously i.e. 256 bits data, thus providing strong encryption accompanied with complex processing. The proposed Feistal algorithm uses various invertible, self-invertible, and non-invertible components of modern encryption ciphers and key generation same as that of AES. This algorithm provides a secure, fast, and strong encryption of the data. There is a huge amount of confusion and diffusion of the data during encryption which makes it very difficult for an attacker to interpret the encryption pattern and the plain text form of the encrypted data. The proposed algorithm is also resistant to Brute-Force and pattern attacks.

모바일 단말에 적합한 고속 스트림 암호 MS64

In this paper, we proposed fast stream cipher MS64 for use mobile that it is secure, fast, and easy to implement software. The proposed algorithm use the fast operating 213-bit arithmetic shift register(ASR) to generate a binary sequence and produce 64-bit stream cipher by using simple logical operation in non linear transform. MS64 supports 128-bit key in encryption algorithm and satisfy with the safety requirement in modern encryption algorithm. In simulation result shows that MS64 is faster than a 32-bit stream cipher SSC2 in the speed of operation with small usage of memory thus MS64 can be used for mobile devices with fast ciphering.

Penerapan Visual Basic for Application (VBA) Sebagai Alat Bantu Ajar Enkripsi dan Dekripsi DES

The DES encryption/decryption algorithm is quite a popular algorithm due to ease in learning. Calculations for DES using binary numbers however are very difficult, including 16 rounds required for a full encode. Teaching DES encryption manually is difficult since it requires a long time. It also requires high accuracy for the 64-bit binary numbers, the possibility of mistakes are very high. Besides, the students cannot perform self-check, whether the given task is done correctly. Application of Excel and VBA is used to facilitate observation, comparison, and understanding the DES algorithm. The result is a teaching model using DES for modern encryption.

Using digital logic circuit simulation to build demonstrations of IT concepts

This paper describes using an open source, freely available logic simulation package to build visualizations to teach IT concepts. The first visualization is of an XOR based, symmetric encryption/decryption process. While it is not the actual process used in modern encryption, it illustrates concepts that are used in encryption/decryption and are often used in IT, particularly in computer and Internet technology to protect files and secure transactions. While actual encryption would be over a much larger word size and use several passes in the encryption process, this tool clearly illustrates the basics of the process. A second visualization shows Hexadecimal numbers with their binary and decimal counterparts. These are important concepts in understanding how bit patterns can represent many different things within a computer. The flexibility of these visualizations is shown by a small circuit addition that can add ASCII characters to this display. Building these visualizations could be done with many different software tools; however, using a logic simulator for some visualizations has the advantages of being easy and also providing insight into the logic of the process that are being visualized.

Multi-objective optimisation of bijective s-boxes

In this paper we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to generate bijective s-boxes with the best known tradeoffs among the considered criteria. The s-boxes found are suitable for use directly in modern encryption algorithms.

Fast Searches with Nuclear Magnetic Resonance Computers

If a computer could be built from quantum elements, which can exist in superpositions of many states rather than the 1s and 0s of conventional binary logic, then important hard problems could be solved rapidly. One example is the prime number factorization problem at the heart of modern encryption: given the product of two large primes, find the primes themselves. Another important problem is exhaustive search: given an unstructured list of items, quickly find the one that satisfies a certain property. A pair of Research Commentaries in this issue discuss some important new results in which simple quantum computers have been constructed with liquids probed by nuclear magnetic resonance techniques. The first, by L. K. Grover of Bell Labs, describes the theoretical situation and the implementation of an algorithm that he designed for exhaustive search. The second, by J. A. Jones of Oxford University, UK, discusses the recent experimental approaches to quantum computing with nuclear magnetic resonance.

The Advantages of Superposition

If a computer could be built from quantum elements, which can exist in superpositions of many states rather than the 1s and 0s of conventional binary logic, then important hard problems could be solved rapidly. One example is the prime number factorization problem at the heart of modern encryption: Given the product of two large primes, find the primes themselves. Another important problem is exhaustive search: Given an unstructured list of items, quickly find the one that satisfies a certain property. A pair of Research Commentaries in this issue discuss some important new results in which simple quantum computers have been constructed with liquids probed by nuclear magnetic resonance techniques. The first, by L. K. Grover of Bell Labs, describes the theoretical situation and the implementation of an algorithm that he designed for exhaustive search. The second, by J. A. Jones of Oxford University, UK, discusses the recent experimental approaches to quantum computing with nuclear magnetic resonance.