Search

Aiming at the problem that the image information is easy to be stolen, modified and deleted in the process of information transmission, a new improved hyper Chen chaotic system is constructed, which is combined with the two-dimensional Chebyshev-Sine chaotic system, and a new image encryption algorithm is proposed. Firstly, Arnold transformation was performed on the pixel coordinates of the plaintext image. Secondly, the hyper chaotic sequence is used to diffuse the scrambled image. Finally, the chaotic sequence generated by the two-dimensional Chebyshev-Sine chaotic mapping is used to divide the image into block s and then diffuse and scramble the image to obtain the final encrypted image. The experimental results show that the algorithm has large key space,and can resist multiple malicious attacks effectively, with sufficient security. [ABSTRACT FROM AUTHOR]

Based on the (t^n) threshold scheme,a new algorithm based on finite field GF(28) for confidential file decomposition, partitioning and recovery is proposed： The consecutive t bytes in secret files are divided into a group, and the ((一1) degree polynomials on the GF (28) field are constructed tn groups. Each group of polynomials generates n different points and stores them in n files; When it is necessary to reproduce confidential documents, at least t files are selected from n files and the data with the same serial number are extracted. The (一1) polynomial is reconstructed by Lagrange interpolation,and then t data of confidential documents are obtained to restore confidential documents. Calculation examples and pro­gramming experiments show that this scheme is reasonable and feasible. Compared with the traditional secret sharing method based on interpolating polynomials ? the proposed method improves the operation efficiency and is more suitable for large file data [ABSTRACT FROM AUTHOR]

According to the present situation of the two-dimensional code′s information security, a two-dimensional code encryption algorithm based on the improved AES and RSA algorithm is proposed in this paper. The algorithm encrypts before QR code encoding, which means it encrypts the plaintext information, using the improved AES symmetrical encryption algorithm to encrypt the plaintext information, then using the RSA asymmetric encryption algorithm to encrypts the improved AES algorithm′s parameters to generate the parameter ciphertext. Finally, the information ciphertext and the parameter ciphertext are spliced to generate two-dimensional code and transmit it in the network channel. This algorithm is characterized by the improvement of the key expansion and column obfuscation transformation of AES algorithm, and optimized of the RSA decryption algorithm with the Chinese remainder theorem, which reduces the running time of the algorithm and improves the algorithm′s security. This algorithm is efficient and easy to implement, combined with the advantages of the two algorithms, it can effectively manage the key and protect the security of the information. It has certain generalization and practical value. [ABSTRACT FROM AUTHOR]

With the advent of multi-core era and people′s need for data security, it has become even more important to design a parallel encryption algorithm based on a multi-core platform. By combining hyperelliptic curve encryption with a multi-core multithreading framework, a hyper-elliptic curve parallel encryption scheme based on a multi-core and multi-threaded platform is designed, and the performance of the encryption scheme is theoretically analyzed. In the experimental test, the files with the file size of 100~600 Kare encrypted in parallel. The time spent on encryption is summarized by changing the number of threads, the number of CPU cores, and the size of the encrypted data. The experimental results show that the data is processed in an 8-core 8-threaded framework. Parallel encryption processing, parallel speed up to 7. 87. [ABSTRACT FROM AUTHOR]