The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

Grain [11] is a lightweight stream cipher proposed by M. Hell, T. Johansson, and W. Meier to the eSTREAM call for stream cipher proposals of the European project ECRYPT [5]. Its 160-bit internal state is divided into a LFSR and an NFSR of length 80 bits each. A filtering boolean function is used to derive each keystream bit from the internal state. By combining linear approximations of the feedback function of the NFSR and of the filtering function, it is possible to derive linear approximation equations involving the keystream and the LFSR initial state. We present a key recovery attack against Grain which requires 2 43 computations and 2 38 keystream bits to determine the 80-bit key.

Cryptanalysis of Grain

Chaos-based cryptography, since its inception, has become a widely published subject. Despite the vast amount of contributions in the area, its applications in real-world scenarios are minimal as compared to conventional cryptography. Chaotic maps have been used in the design of cryptosystems because they depict desirable characteristics such as pseudorandomness, complexity, and sensitivity to parameter changes. Despite these characteristics being analogous to cryptographic requirements, the resulting chaos-based cryptosystems are usually difficult to analyze, inefficient, and have reproducibility issues. In this paper, we highlight some of the problems which deter the practical application of chaos-based cryptosystems. We show that recently published work in reputable journals still do not address these problems and remain only of academic interest. We also perform experiments to depict some of the implementation issues of digital chaos that need to be taken into consideration when designing chaos-based algorithms. We then discuss a number of possible solutions that can be explored to overcome these problems.

Implementation and practical problems of chaos-based cryptography revisited

Chaotic systems implemented by artificial neural networks are good candidates for data encryption. In this manner, this paper introduces the cryptographic application of the Hopfield and the Hindmarsh-Rose neurons. The contribution is focused on finding suitable coefficient values of the neurons to generate robust random binary sequences that can be used in image encryption. This task is performed by evaluating the bifurcation diagrams from which one chooses appropriate coefficient values of the mathematical models that produce high positive Lyapunov exponent and Kaplan-Yorke dimension values, which are computed using TISEAN. The randomness of both the Hopfield and the Hindmarsh-Rose neurons is evaluated from chaotic time series data by performing National Institute of Standard and Technology (NIST) tests. The implementation of both neurons is done using field-programmable gate arrays whose architectures are used to develop an encryption system for RGB images. The success of the encryption system is confirmed by performing correlation, histogram, variance, entropy, and Number of Pixel Change Rate (NPCR) tests.

/pdf/chaotic-image-encryption-using-hopfield-and-hindmarsh-rose-5g3j5f91hh.pdf

Chaotic Image Encryption Using Hopfield and Hindmarsh–Rose Neurons Implemented on FPGA

Symmetry plays an important role in nonlinear system theory. In particular, it offers several methods by which to understand and model the chaotic behavior of mathematical, physical and biological systems. This study examines chaotic behavior in the field of information security. A novel method is proposed to improve the performance of chaos-based substitution box structures. Substitution box structures have a special role in block cipher algorithms, since they are the only nonlinear components in substitution permutation network architectures. However, the substitution box structures used in modern block encryption algorithms contain various vulnerabilities to side-channel attacks. Recent studies have shown that chaos-based designs can offer a variety of opportunities to prevent side-channel attacks. However, the problem of chaos-based designs is that substitution box performance criteria are worse than designs based on mathematical transformation. In this study, a postprocessing algorithm is proposed to improve the performance of chaos-based designs. The analysis results show that the proposed method can improve the performance criteria. The importance of these results is that chaos-based designs may offer opportunities for other practical applications in addition to the prevention of side-channel attacks.

A Novel Method for Performance Improvement of Chaos-Based Substitution Boxes

A chaotic system and two Nonlinear Feadback Shift Registers (NFSRs) are used to generate a new stream cipher in this paper. This design can be used for efficient encryption in resource-constrained devices or environments. The chaotic system is quantified and integrated with two NFSRs based on the technology of Field Programmable Gate Array (FPGA). Many analyses are made from the angle of entropy in order to verify the cryptographic characteristics of the stream cipher, and National Institute of Standards and Technology (NIST) statistical test is completed to analyze the cipher. The test results show that the stream cipher here has good cryptographic characteristics.

A New Lightweight Stream Cipher Based on Chaos

The logistic chaotic system, as a classical complex phenomenon of nonlinear dynamic systems, has received extensive attention in the field of secure communication. It is generally believed that the characteristics of chaos are suitable for the needs of encryption systems. In this paper, a multi-scale entropy theory analysis and statistical analysis are carried out on the chaotic sequences produced by different parameters and different initial values of logistic systems. According to the simulation results, the complexity of the chaotic system represented by the logistic system is mainly decided by parameter μ. Not all characteristic parameters of the chaotic system depend on the initial values. It is possible to make a reasonable estimation and prediction of the chaotic system from a macroscopic level. A variance estimation method for the parameter μ is proposed and applied to a logistic system and to another chaotic system, which is equally effective.

Chunyuan Liu

Papers

A New Lightweight Stream Cipher Based on Chaos

Research about the Characteristics of Chaotic Systems Based on Multi-Scale Entropy