Modern Encryption Research Articles

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.