A parallel graph encryption method based on an easy-to-octyl structure

Abstract

The invention discloses a parallel graph encryption method based on an easy-to-octyl structure. The parallel graph encryption method comprises the following steps: S1, obtaining to-be-encrypted graphdata I stored in a graph structure form from a storage system; S2, correspondingly generating a key vector K for the to-be-encrypted graph data I through a random vector generator; S3, performing graph structure identification on the to-be-encrypted graph data I to obtain a graph structure type of the to-be-encrypted graph data I; and S4, according to the graph structure type obtained in the stepS3, constructing a corresponding graph encryption algorithm based on the easy-to-octyl model, encrypting the to-be-encrypted graph data I according to the corresponding key vector K, and outputting anencrypted graph file E. The method has the beneficial effects that the image can be encrypted efficiently, safely and flexibly, and the efficiency is higher due to parallel encryption. Requirements of reversibility, diversity, high efficiency, randomness, diffusivity and the like required by graph encryption can be met.

Description

technical field [0001] The invention relates to the technical field of graph encryption, in particular to a parallel graph encryption method based on an easy symplectic structure. Background technique [0002] Graph is a mathematical structure composed of vertices and edges, which has a wide range of applications in the research of physics, chemistry, biology, engineering, computer science and social science. In addition, a large amount of scientific research and engineering data are also stored in the form of graphs. If these scientific research or engineering data involve confidential information, they should be encrypted before communication and storage. Therefore, graph encryption has important application value. [0003] According to different structures, graphs can be divided into many types, combining figure 1 It can be seen that the most common one-dimensional structure, matrix structure and tree structure: Among them: one-dimensional structure is the most basic g...

AI Technical Summary

Problems solved by technology

[0007] (2) Diversity: The structures of trees and general graphs are richer and more complex than matrix structures, and encryption must adapt to graph data of any structure;

[0021] However, the Yi Xin model cannot be directly used for the encryption of general graphs, which is determined by the nature of the encryption and the graph itself:

Images