CN116561057A - Unified delivery and archiving application method for three-dimensional model - Google Patents

Abstract

The invention discloses a unified delivery and archiving application method of a three-dimensional model, which belongs to the field of management of the three-dimensional model, and by converting three-dimensional models generated by different types of software into unified file types corresponding to the same three-dimensional engine, not only can various three-dimensional model characteristic attributes be analyzed, a system can be assisted to collect more complete and accurate model information when uploading the model by a designer, but also the unified management and checking of the three-dimensional model in the systems corresponding to different business scenes can be directly provided for the staff needing to use the three-dimensional model, and the encryption management is carried out on the three-dimensional model, so that the safety of the three-dimensional model can be effectively ensured.

Description

Unified delivery and archiving application method for three-dimensional model

Technical Field

The invention belongs to the field of management of three-dimensional models, and particularly relates to a unified delivery and archiving application method of a three-dimensional model.

Background

The three-dimensional model refers to a digital model comprising three-dimensional geometry, positioning information and engineering physical attributes. The three-dimensional model provides an efficient and visual engineering data viewing mode, and design data or documents related to the model can be quickly searched and queried through the model.

With the development of the age and the progress of technology, three-dimensional designs have been gradually applied to various industries, but still have some problems which are difficult to solve. The traditional two-dimensional file system in the metallurgical industry is mature, but an effective management method for file management of a three-dimensional model is still lacking at present. This is because: the three-dimensional model has various data formats, the storage formats have no unified specification, the universality is weak, and the risk of unreadable data is possibly encountered. Such as: data exchange of heterogeneous CAD models has been a troublesome problem, and french, us, germany respectively propose SET format, VDFS format, IGES format, thereby forming a SET of product model data standards: STEP standard for data exchange of geometric figures, but archive systems generally do not have the technical ability to view multi-format three-dimensional models. And the information of the three-dimensional model is difficult to be completely transmitted to an archive system, and even if the STEP standard is proposed by European and American countries, about 50% of information can be saved after various three-dimensional models are converted. The re-supplementing and collecting of the lost information not only consumes a large amount of resources and has extremely high cost, but also is difficult to ensure the integrity and the readability of the data because of different design software and design styles.

Disclosure of Invention

Aiming at the defects in the prior art, the method for unified delivery and archiving application of the three-dimensional model solves the problems in the prior art.

In order to achieve the above purpose, the invention adopts the following technical scheme:

a method for unified delivery and archiving of applications for three-dimensional models, comprising:

acquiring a three-dimensional model original uploaded by a delivery user, and converting the three-dimensional model original into a light three-dimensional model in a unified format standardized by a system to obtain a first target three-dimensional model;

transmitting the first target three-dimensional model to a designated model analysis engine to obtain three-dimensional model characteristic attributes, and confirming or supplementing the three-dimensional model characteristic attributes obtained by analysis to obtain the first target three-dimensional model characteristic attributes;

respectively associating the three-dimensional model original, the first target three-dimensional model and the characteristic attribute of the first target three-dimensional model to obtain an association relation among the three;

storing the three-dimensional model original, the first target three-dimensional model, the characteristic attribute of the first target three-dimensional model and the association relation among the three into a data area corresponding to appointed delivery to finish delivery management of the three-dimensional model;

Encrypting the three-dimensional model original and the first target three-dimensional model respectively to obtain an encrypted three-dimensional model original, an encrypted first target three-dimensional model and a first encryption key, and correlating the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key to obtain a correlation relationship among the four;

storing the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the characteristic attribute of the first target three-dimensional model, the first encryption key and the association relation among the four into a data area corresponding to the archive, encrypting the first encryption key through a delivery user public key, and transmitting the encrypted first encryption key to equipment corresponding to the archive user to finish archiving management of the three-dimensional model; the association relationship is used for representing the relationship among the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key.

In one possible implementation, after encrypting the first encryption key by delivering the user public key, the method further includes:

receiving a three-dimensional model viewing instruction transmitted by an archive user, wherein the three-dimensional model viewing instruction comprises a first target three-dimensional model name and a second encryption key;

Searching a first target three-dimensional model matched with the target three-dimensional model name in a designated data area according to the first target three-dimensional model name, and acquiring a searching result, wherein the searching result comprises successful searching or unsuccessful searching;

when the searching result is that the searching is successful, matching the second encryption key corresponding to the name of the first target three-dimensional model with the first encryption key corresponding to the first target three-dimensional model obtained by searching to obtain a matching result, wherein the matching result comprises that the matching is successful or the matching is unsuccessful;

when the matching result is that the matching is successful, decrypting the first target three-dimensional model through the second encryption key, and loading the decrypted file through a specified three-dimensional engine to obtain a real-time loading picture, wherein the specified three-dimensional engine is arranged at a cloud or local;

when the appointed three-dimensional engine is arranged at the cloud, transmitting the real-time loading picture to equipment corresponding to the archive user for display through the Internet; when the appointed three-dimensional engine is arranged locally, the real-time loading picture is transmitted to equipment corresponding to the archive user for display through a data transmission line.

In one possible implementation manner, after the real-time loading image is transmitted to the device corresponding to the archive user through the internet for display or the real-time loading image is transmitted to the device corresponding to the archive user through the data transmission line for display, the method further includes:

Receiving a three-dimensional model adjustment instruction transmitted by an archive user, wherein the three-dimensional model adjustment instruction comprises an amplifying instruction, a shrinking instruction, a rotating instruction, an explosion view instruction, a splitting instruction, a structure deleting instruction, a structure adding instruction and a structure modifying instruction;

and adjusting the loaded first target three-dimensional model according to the three-dimensional model adjustment instruction, and synchronously updating the real-time loading picture.

In one possible embodiment, encrypting the three-dimensional model original and the first target three-dimensional model includes:

extracting the coordinate Z1 of each first vertex in the three-dimensional model original and the position W1 of each first vertex coordinate in the three-dimensional model original to obtain a first key parameter of each first vertex;

modifying the coordinates Z1 of each vertex in the three-dimensional model element to be null to obtain a first chaotic three-dimensional model;

forming first key parameters of each first vertex into a first plaintext M1, encrypting the first plaintext M1 to obtain encrypted first key parameters, and taking the encrypted first key parameters and a first chaotic three-dimensional model together as an encrypted file of a three-dimensional model original;

extracting the coordinate Z2 of each second vertex in the target three-dimensional model and the position W2 of each second vertex coordinate in the target three-dimensional model to obtain a second key parameter of each second vertex;

Modifying the coordinates Z2 of each vertex in the three-dimensional model element to be null to obtain a second chaotic three-dimensional model;

and forming a second plaintext M2 by the second key parameters of each second vertex, encrypting the second plaintext M2 to obtain encrypted second key parameters, and taking the encrypted second key parameters and the second chaotic three-dimensional model together as an encrypted file of the target three-dimensional model.

In one possible implementation, the first key parameters of each first vertex are formed into a first plaintext M1, and the first plaintext M1 is encrypted, including:

a1, initializing system parameters of a first chaotic mapper and a second chaotic mapper;

a2, forming first key parameters of each first vertex into a first plaintext M1, and uniformly dividing the first plaintext M1 into N first plaintext blocks according to a specified sequence length L, or dividing the first plaintext M1 into N-1 first plaintext blocks meeting the specified sequence length L and a first plaintext block not meeting the specified sequence length L; wherein, the first plaintext block which does not meet the specified sequence length L represents the remaining data which is less than the specified sequence length L after the first plaintext M1 is grouped in the direction from the beginning to the end;

a3, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to a specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext blocks by adopting the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the segmentation sequence of the first plaintext M1 to obtain an encrypted first key parameter; when the first plaintext M1 is divided into N-1 first plaintext blocks satisfying the predetermined sequence length L and a first plaintext block not satisfying the predetermined sequence length L, step A4 is entered;

A4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper;

a5, initializing a first counter t1=1 and a second counter t2=1;

a6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block;

a7, judging whether the first counter t1 is equal to N-1, if so, entering a step A8, otherwise, adding one to the count value of the first counter t1, and returning to the step A6;

a8, iterating the first chaotic mapper for G times to obtain a first key corresponding to a first plaintext block which does not meet the specified sequence length L;

a9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper; wherein G represents the number of bits of remaining data in a first plaintext block that does not satisfy the prescribed sequence length L;

a10, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block;

a11, judging whether the second counter t2 is equal to N-1, if so, entering a step A12, otherwise, adding one to the count value of the second counter t2, and returning to the step A10;

A12, iterating the second chaotic mapper for G times to obtain a second key corresponding to the first plaintext block which does not meet the specified sequence length L;

a13, binarizing a first key and a second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

a14, carrying out exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block;

a15, encrypting the ith first plaintext block according to a first encryption key corresponding to the ith first plaintext block aiming at the previous N-1 first plaintext blocks to obtain N-1 first ciphertext; i=1, 2, …, N-1;

a16, performing bitwise exclusive OR on the first encryption key corresponding to the first plaintext block which does not meet the specified sequence length L and the data in the first plaintext block which does not meet the specified sequence length L to obtain a first ciphertext corresponding to the first plaintext block which does not meet the specified sequence length L;

and A17, connecting the N-1 first ciphertexts and the first ciphertexts corresponding to the first plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted first key parameters.

In one possible implementation manner, the first chaotic mapper is:

wherein x is _n Representing a first chaotic variable, x _n+1 And (6) representing the updated first chaotic variable, and mu represents the control parameter of the first chaotic mapper.

In one possible implementation manner, the second chaotic mapper is:

y _n+1 =cos[k×arccos(y _n )]

wherein y is _n Representing a second chaotic variable, y _n+1 And representing the updated second chaotic variable, and k represents the control parameter of the second chaotic mapper.

In one possible implementation, initializing system parameters of the first chaotic mapper and the second chaotic mapper includes:

and acquiring the current time, calling a pseudo-random number generator to respectively generate an initial value of a first chaotic variable, an initial value of a second chaotic variable and a control parameter of a second chaotic mapper by taking the current time as a parameter, setting the control parameter of the first chaotic mapper as a preset value, and completing the initialization of the system parameters of the first chaotic mapper and the second chaotic mapper.

In a possible implementation manner, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext block by using the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the segmentation order of the first plaintext M1 to obtain an encrypted first key parameter, where the first key parameter includes:

A31, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to a specified sequence length L, iterating the first chaotic mapper for M+N times to obtain a first current value corresponding to the first chaotic mapper;

a32, initializing a first counter t1=1 and a second counter t2=1;

a33, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block;

a34, judging whether the first counter t1 is equal to N, if so, entering a step A35, otherwise, adding one to the count value of the first counter t1, and returning to the step A33;

a35, iterating the second chaotic mapper for M+N times to obtain a second current value corresponding to the second chaotic mapper;

a36, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block;

a37, judging whether the second counter t2 is equal to N, if so, entering a step A38, otherwise, adding one to the count value of the first counter t1, and returning to the step A36;

a38, binarizing the first key and the second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

A39, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block;

a310, encrypting the first plaintext block by adopting a first encryption key corresponding to the first plaintext block to obtain N first ciphertext;

and A311, connecting the N first ciphertexts according to the segmentation sequence to obtain the encrypted first key parameters.

In one possible implementation, the forming the second key parameter of each second vertex into the second plaintext M2 and encrypting the second plaintext M2 includes:

b1, initializing system parameters of a first chaotic mapper and a second chaotic mapper;

b2, forming second key parameters of each second vertex into second plaintext M2, and uniformly dividing the second plaintext M2 into N second plaintext blocks according to a specified sequence length L, or dividing the second plaintext M2 into N-1 second plaintext blocks meeting the specified sequence length L and a second plaintext block not meeting the specified sequence length L; wherein, the second plaintext block which does not meet the specified sequence length L represents the remaining data which is less than the specified sequence length L after the second plaintext M2 is grouped in the direction from the beginning to the end;

b3, when the second plaintext M2 is uniformly divided into N second plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each second plaintext block, encrypting the second plaintext blocks by adopting the first encryption key to obtain a second ciphertext, and connecting the second ciphertext according to the segmentation sequence of the second plaintext M2 to obtain an encrypted second key parameter; when the second plaintext M2 is divided into N-1 second plaintext blocks satisfying the predetermined sequence length L and one second plaintext block not satisfying the predetermined sequence length L, then step B4 is entered;

B4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper;

b5, initializing a first counter t1=1 and a second counter t2=1;

b6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 th second plaintext block;

b7, judging whether the first counter t1 is equal to N-1, if so, entering a step B8, otherwise, adding one to the count value of the first counter t1, and returning to the step B6;

b8, iterating the first chaotic mapper for G times to obtain a first key corresponding to a second plaintext block which does not meet the specified sequence length L;

b9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper; wherein G represents the number of bits of the remaining data in a second plaintext block that does not satisfy the prescribed sequence length L;

b10, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 th second plaintext block;

b11, judging whether the second counter t2 is equal to N-1, if so, entering a step B12, otherwise, adding one to the count value of the second counter t2, and returning to the step B10;

B12, iterating the second chaotic mapper for G times to obtain a second key corresponding to a second plaintext block which does not meet the specified sequence length L;

b13, binarizing the first secret key and the second secret key corresponding to the second plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the second plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

b14, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the second plaintext block;

b15, encrypting the ith second plaintext block according to the first encryption key corresponding to the ith second plaintext block aiming at the previous N-1 second plaintext blocks to obtain N-1 second ciphertext; i=1, 2, …, N-1;

b16, adopting the bitwise exclusive or of the first encryption key corresponding to the second plaintext block which does not meet the specified sequence length L and the data in the second plaintext block which does not meet the specified sequence length L to obtain a second ciphertext corresponding to the second plaintext block which does not meet the specified sequence length L;

and B17, connecting the N-1 second ciphertexts and the second ciphertexts corresponding to the second plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted second key parameters.

According to the unified delivery and archiving application method for the three-dimensional model, the three-dimensional model is converted into the file type corresponding to the same three-dimensional engine, unified management and check of the three-dimensional model are facilitated, encryption management is conducted on the three-dimensional model, safety of the three-dimensional model can be effectively guaranteed, all the three-dimensional models are stored after being converted into the same format, and tracing can be conducted when problems are found.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application.

Fig. 1 is a flowchart of a method for unified delivery and archiving applications of a three-dimensional model according to an embodiment of the present invention.

Specific embodiments thereof have been shown by way of example in the drawings and will herein be described in more detail. These drawings and the written description are not intended to limit the scope of the inventive concepts in any way, but to illustrate the concepts of the present application to those skilled in the art by reference to specific embodiments.

Description of the embodiments

The following description of the embodiments of the present invention is provided to facilitate understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and all the inventions which make use of the inventive concept are protected by the spirit and scope of the present invention as defined and defined in the appended claims to those skilled in the art.

Embodiments of the present invention are described in detail below with reference to the accompanying drawings.

As shown in fig. 1, a method for unified delivery and archiving of applications of a three-dimensional model includes:

s11, acquiring a three-dimensional model original uploaded by a delivery user, and converting the three-dimensional model original into a light three-dimensional model in a unified format standardized by a system to obtain a first target three-dimensional model.

Transmitting the first target three-dimensional model to a designated model analysis engine to obtain three-dimensional model characteristic attributes, and confirming or supplementing the three-dimensional model characteristic attributes obtained by analysis to obtain the first target three-dimensional model characteristic attributes.

The invention follows the traditional electronic delivery and archive management method, uploads the original copy and enters data, and performs archive application management.

Optionally, the parameters of the three-dimensional model are analyzed, after the analysis is completed, the three-dimensional model is converted into a lightweight model which can be used by a cloud three-dimensional engine, and the analyzed data, the lightweight model and the original file are structured and the object is stored.

S12, respectively associating the three-dimensional model original, the first target three-dimensional model and the characteristic attribute of the first target three-dimensional model to obtain an association relation among the three;

Storing the three-dimensional model original, the first target three-dimensional model, the characteristic attribute of the first target three-dimensional model and the association relation among the three into a data area corresponding to appointed delivery to finish delivery management of the three-dimensional model;

encrypting the three-dimensional model original and the first target three-dimensional model respectively to obtain an encrypted three-dimensional model original, an encrypted first target three-dimensional model and a first encryption key, and correlating the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key to obtain a correlation relationship among the four;

s13, storing the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the characteristic attribute of the first target three-dimensional model, the first encryption key and the association relation among the four into a data area corresponding to the file, encrypting the first encryption key through a delivery user public key, and transmitting the encrypted first encryption key to equipment corresponding to the user to finish archiving management of the three-dimensional model; the association relationship is used for representing the relationship among the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key.

When the original three-dimensional model sent by the delivery user is obtained, the public key of the delivery user is obtained at the same time, so that when the first encryption key is generated, the first encryption key used for managing the three-dimensional model can be prevented from being revealed by the public key of the delivery user for encryption and sending.

Alternatively, the first encryption key corresponding to the three-dimensional model element may be different from the first encryption key corresponding to the target three-dimensional model.

In one possible implementation, after encrypting the first encryption key by delivering the user public key, the method further includes:

and receiving a three-dimensional model viewing instruction transmitted by the archive user, wherein the three-dimensional model viewing instruction comprises a target three-dimensional model name and a second encryption key.

According to the target three-dimensional model name, searching a first target three-dimensional model matched with the target three-dimensional model name in the appointed data area, and obtaining a searching result, wherein the searching result comprises successful searching or unsuccessful searching.

And when the searching result is that the searching is successful, matching the second encryption key corresponding to the target three-dimensional model name with the first encryption key corresponding to the first target three-dimensional model obtained by searching to obtain a matching result, wherein the matching result comprises that the matching is successful or unsuccessful.

And when the matching result is that the matching is successful, decrypting the first target three-dimensional model through the second encryption key, loading the decrypted file through a specified three-dimensional engine to obtain a real-time loading picture, wherein the specified three-dimensional engine is arranged at the cloud or locally.

When the appointed three-dimensional engine is arranged at the cloud, the real-time loading picture is transmitted to equipment corresponding to the archive user through the Internet for display. When the appointed three-dimensional engine is arranged locally, the real-time loading picture is transmitted to equipment corresponding to the archive user for display through a data transmission line.

According to the embodiment, the display is provided based on the treasured cloud three-dimensional engine and the analyzed lightweight model, and the three-dimensional model can be searched according to the first target three-dimensional model and the first encryption key, so that archival staff can manage the three-dimensional model conveniently, and meanwhile, the storage safety of the three-dimensional model is guaranteed.

Because the first encryption key is private to the delivering user, when the delivering user displays the first encryption key, the delivering user can be considered as an authorized user, and the first target three-dimensional model corresponding to the first encryption key can be directly matched, decrypted and displayed.

In one possible implementation manner, after the real-time loading image is transmitted to the device corresponding to the archive user through the internet for display or the real-time loading image is transmitted to the device corresponding to the archive user through the data transmission line for display, the method further includes:

and receiving a three-dimensional model adjustment instruction transmitted by the archive user, wherein the three-dimensional model adjustment instruction comprises an amplifying instruction, a shrinking instruction, a rotating instruction, an explosion view instruction, a splitting instruction, a structure deleting instruction, a structure adding instruction and a structure modifying instruction.

And adjusting the loaded first target three-dimensional model according to the three-dimensional model adjustment instruction, and synchronously updating the real-time loading picture.

In one possible embodiment, encrypting the three-dimensional model original and the first target three-dimensional model includes:

and extracting the coordinate Z1 of each first vertex in the three-dimensional model original and the position W1 of each first vertex coordinate in the three-dimensional model original to obtain the first key parameters (Z1, W1) of each first vertex.

And modifying the coordinate Z1 of each vertex in the three-dimensional model element to be null to obtain a first chaotic three-dimensional model.

And forming a first plaintext M1 by the first key parameters (Z1 and W1) of each first vertex, encrypting the first plaintext M1 to obtain encrypted first key parameters, and taking the encrypted first key parameters and the first chaotic three-dimensional model together as an encrypted file of the three-dimensional model original.

And extracting the coordinate Z2 of each second vertex in the target three-dimensional model and the position W2 of each second vertex coordinate in the target three-dimensional model to obtain second key parameters (Z2, W2) of each second vertex.

And modifying the coordinate Z2 of each vertex in the three-dimensional model element to be null to obtain a second chaotic three-dimensional model.

And forming a second plaintext M2 by the second key parameters (Z2 and W2) of each second vertex, encrypting the second plaintext M2 to obtain encrypted second key parameters, and taking the encrypted second key parameters and the second chaotic three-dimensional model together as an encrypted file of the target three-dimensional model.

In one possible implementation, the first key parameters (Z1, W1) of each first vertex are combined into a first plaintext M1, and the first plaintext M1 is encrypted, including:

a1, initializing system parameters of the first chaotic mapper and the second chaotic mapper.

A2, forming first key parameters (Z1, W1) of each first vertex into a first plaintext M1, and uniformly dividing the first plaintext M1 into N first plaintext blocks according to a specified sequence length L, or dividing the first plaintext M1 into N-1 first plaintext blocks meeting the specified sequence length L and one first plaintext block not meeting the specified sequence length L. The first plaintext block that does not satisfy the predetermined sequence length L represents the remaining data that is less than the predetermined sequence length L after the first plaintext M1 is grouped in the head-to-tail direction.

In the present embodiment, the number of bits of each byte in the first plain text M1 is 8, the prescribed sequence length L is set to 128 bits, and the first plain text M1 is divided into a plurality of first plain text blocks of 128 bits according to the prescribed sequence length L, so that it can be encrypted.

The data of the first plaintext M1 may just be able to be divided into an integer number of plaintext blocks, or the number of data bits in the last plaintext block may be less than 128 bits at the time of division, so encryption is required in case of division.

A3, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext blocks by adopting the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the segmentation sequence of the first plaintext M1 to obtain an encrypted first key parameter. When the first plaintext M1 is divided into N-1 first plaintext blocks satisfying the predetermined sequence length L and one first plaintext block not satisfying the predetermined sequence length L, step A4 is entered.

And A4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper.

A5, initializing a first counter t1=1 and a second counter t2=1.

And A6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block.

A7, judging whether the first counter t1 is equal to N-1, if so, entering a step A8, otherwise, adding one to the count value of the first counter t1, and returning to the step A6.

And A8, iterating the first chaotic mapper for G times to obtain a first key corresponding to the first plaintext block which does not meet the specified sequence length L.

And A9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper. Where G represents the number of bits of the remaining data in the first plaintext block that does not satisfy the prescribed sequence length L.

A10, iterating L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block.

A11, judging whether the second counter t2 is equal to N-1, if so, entering a step A12, otherwise, adding one to the count value of the second counter t2, and returning to the step A10.

And A12, iterating the second chaotic mapper for G times to obtain a second key corresponding to the first plaintext block which does not meet the specified sequence length L.

A13, binarizing the first key and the second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block. Binarization means that the number greater than 0 is 1 and the number less than or equal to 0 is 0.

A14, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block.

A15, encrypting the ith first plaintext block according to a first encryption key corresponding to the ith first plaintext block aiming at the previous N-1 first plaintext blocks to obtain N-1 first ciphertext; i=1, 2, …, N-1.

A16, using the first encryption key corresponding to the first plaintext block which does not meet the specified sequence length L and the data in the first plaintext block which does not meet the specified sequence length L to carry out bitwise exclusive OR to obtain the first ciphertext corresponding to the first plaintext block which does not meet the specified sequence length L.

And A17, connecting the N-1 first ciphertexts and the first ciphertexts corresponding to the first plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted first key parameters.

Except for the first plaintext block that does not satisfy the prescribed sequence length L, the other plaintext blocks are each encrypted according to the corresponding first encryption key and using an encryption function in the AES (Advanced Encryption Standard ) algorithm.

In this embodiment, a decryption method is provided, which is opposite to an encryption method, specifically:

when the first key parameters (Z1, W1) of each first vertex form the first plaintext M1, the lengths corresponding to each first key parameter (Z1, W1) may be recorded, so as to obtain the length record data.

When the first plaintext M1 is just divided into N plaintext blocks, the first ciphertext is divided into N ciphertext blocks, and the N plaintext blocks are obtained by decrypting the first ciphertext block with a decryption function in the AES algorithm according to a first encryption key corresponding to the first plaintext block, and after the N plaintext blocks are connected, the first plaintext M1 is recovered.

According to the length record data, the first plaintext M1 is divided into a plurality of first key parameters (Z1, W1), so that the coordinate Z1 of the first vertex can be restored to the first chaotic three-dimensional model according to the position W1 in the first key parameters (Z1, W1), and a three-dimensional model element is obtained.

And when the data in the last plaintext block is less than 129 bits, decrypting the first N-1 ciphertext blocks by adopting a decryption function in an AES algorithm according to a first encryption key corresponding to the first plaintext block to obtain N-1 plaintext blocks, and performing exclusive OR operation on the first ciphertext corresponding to the first plaintext block which does not meet the specified sequence length L and the first ciphertext corresponding to the first plaintext block which does not meet the specified sequence length L to obtain the first plaintext block which does not meet the specified sequence length L. The plaintext blocks are connected according to a segmentation sequence to obtain a first plaintext M1, and at this time, the first plaintext M1 can be segmented into a plurality of first key parameters (Z1, W1) according to length record data, so that the coordinate Z1 of the first vertex can be restored to the first chaotic three-dimensional model according to the position W1 in the first key parameters (Z1, W1), and a three-dimensional model element is obtained.

In one possible implementation, the first chaotic mapper is:

wherein x is _n Representing a first chaotic variable, x _n+1 And (6) representing the updated first chaotic variable, and mu represents the control parameter of the first chaotic mapper.

In one possible implementation, the second chaotic mapper is:

y _n+1 =cos[k×arccos(y _n )]

wherein y is _n Representing a second chaotic variable, y _n+1 And representing the updated second chaotic variable, and k represents the control parameter of the second chaotic mapper.

In one possible implementation, initializing system parameters of the first chaotic mapper and the second chaotic mapper includes:

and acquiring the current time, calling a pseudo-random number generator to respectively generate an initial value of a first chaotic variable, an initial value of a second chaotic variable and a control parameter of a second chaotic mapper by taking the current time as a parameter, setting the control parameter of the first chaotic mapper as a preset value, and completing the initialization of the system parameters of the first chaotic mapper and the second chaotic mapper.

In a possible implementation manner, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext block by using the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the segmentation order of the first plaintext M1 to obtain an encrypted first key parameter, where the first key parameter includes:

A31, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to the specified sequence length L, iterating the first chaotic mapper for M+N times to obtain a first current value corresponding to the first chaotic mapper.

A32, initialize the first counter t1=1 and the second counter t2=1.

A33, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block.

A34, judging whether the first counter t1 is equal to N, if so, entering a step A35, otherwise, adding one to the count value of the first counter t1, and returning to the step A33.

A35, iterating the second chaotic mapper for M+N times to obtain a second current value corresponding to the second chaotic mapper.

A36, iterating L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block.

A37, judging whether the second counter t2 is equal to N, if so, entering the step A38, otherwise, adding one to the count value of the first counter t1, and returning to the step A36.

A38, binarizing the first key and the second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block. Binarization means that the number greater than 0 is 1 and the number less than or equal to 0 is 0.

A39, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block.

And A310, encrypting the first plaintext blocks by adopting first encryption keys corresponding to the first plaintext blocks to obtain N first ciphertexts.

And A311, connecting the N first ciphertexts according to the segmentation sequence to obtain the encrypted first key parameters.

In one possible implementation, the second key parameters (Z2, W2) of each second vertex are combined into a second plaintext M2, and the second plaintext M2 is encrypted, including:

b1, initializing system parameters of the first chaotic mapper and the second chaotic mapper.

B2, forming second plaintext M2 by second key parameters (Z2, W2) of each second vertex, and uniformly dividing the second plaintext M2 into N second plaintext blocks according to the specified sequence length L, or dividing the second plaintext M2 into N-1 second plaintext blocks meeting the specified sequence length L and one second plaintext block not meeting the specified sequence length L. The second plaintext block that does not satisfy the predetermined sequence length L represents the remaining data that is less than the predetermined sequence length L after the second plaintext M2 is grouped in the head-to-tail direction.

And B3, when the second plaintext M2 is uniformly divided into N second plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each second plaintext block, encrypting the second plaintext blocks by adopting the first encryption key to obtain a second ciphertext, and connecting the second ciphertext according to the segmentation sequence of the second plaintext M2 to obtain an encrypted second key parameter. When the second plaintext M2 is divided into N-1 second plaintext blocks satisfying the predetermined sequence length L and one second plaintext block not satisfying the predetermined sequence length L, step B4 is entered.

And B4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper.

B5, initializing the first counter t1=1 and the second counter t2=1.

And B6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 th second plaintext block.

And B7, judging whether the first counter t1 is equal to N-1, if so, entering a step B8, otherwise, adding one to the count value of the first counter t1, and returning to the step B6.

And B8, iterating the first chaotic mapper for G times to obtain a first key corresponding to the second plaintext block which does not meet the specified sequence length L.

And B9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper. Where G represents the number of bits of the remaining data in the second plaintext block that does not satisfy the prescribed sequence length L.

And B10, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 th second plaintext block.

B11, judging whether the second counter t2 is equal to N-1, if so, entering a step B12, otherwise, adding one to the count value of the second counter t2, and returning to the step B10.

And B12, iterating the second chaotic mapper for G times to obtain a second key corresponding to a second plaintext block which does not meet the specified sequence length L.

And B13, binarizing the first key and the second key corresponding to the second plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the second plaintext block. Binarization means that the number greater than 0 is 1 and the number less than or equal to 0 is 0.

And B14, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the second plaintext block.

B15, encrypting the ith second plaintext block according to the first encryption key corresponding to the ith second plaintext block aiming at the previous N-1 second plaintext blocks to obtain N-1 second ciphertext; i=1, 2, …, N-1.

And B16, performing bitwise exclusive OR on the first encryption key corresponding to the second plaintext block which does not meet the specified sequence length L and the data in the second plaintext block which does not meet the specified sequence length L to obtain a second ciphertext corresponding to the second plaintext block which does not meet the specified sequence length L.

And B17, connecting the N-1 second ciphertexts and the second ciphertexts corresponding to the second plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted second key parameters.

In this embodiment, when the second plaintext M2 is uniformly divided into N second plaintext blocks according to the specified sequence length L, the first encryption key corresponding to each second plaintext block is directly obtained, the second plaintext block is encrypted by using the first encryption key to obtain a second ciphertext, and the second ciphertext is connected according to the segmentation order of the second plaintext M2, so as to obtain encrypted second key parameters, including:

and B31, when the second plaintext M2 is uniformly divided into N second plaintext blocks according to the specified sequence length L, iterating the first chaotic mapper for M+N times to obtain a first current value corresponding to the first chaotic mapper.

B32, initializing the first counter t1=1 and the second counter t2=1.

And B33, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 th second plaintext block.

And B34, judging whether the first counter t1 is equal to N, if so, entering a step B35, otherwise, adding one to the count value of the first counter t1, and returning to the step B33.

And B35, iterating the second chaotic mapper for M+N times to obtain a second current value corresponding to the second chaotic mapper.

And B36, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t2 th second plaintext block.

And B37, judging whether the second counter t2 is equal to N, if so, entering a step B38, otherwise, adding one to the count value of the first counter t2, and returning to the step B36.

And B38, binarizing the first key and the second key corresponding to the second plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the second plaintext block. Binarization means that the number greater than 0 is 1 and the number less than or equal to 0 is 0.

And B39, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the second plaintext block.

And B310, respectively encrypting the second plaintext blocks by adopting the first encryption keys corresponding to the second plaintext blocks to obtain N second ciphertext.

And B311, connecting the N second ciphertexts according to the segmentation sequence to obtain encrypted second key parameters.

According to the unified delivery and archiving application method for the three-dimensional model, the three-dimensional model is converted into the file type corresponding to the same three-dimensional engine, so that file staff can conveniently manage and check the unified file type, encryption management is carried out on the three-dimensional model, the safety of the three-dimensional model can be effectively ensured, all the three-dimensional models are stored after being converted into the same format, and tracing can be carried out when problems are found.

It should be noted that any method using the inventive concept should be within the scope of the present invention. Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains.

It is to be understood that the invention is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims (10)

1. A method for unified delivery and archiving of applications for a three-dimensional model, comprising:

acquiring a three-dimensional model original uploaded by a user, and converting the three-dimensional model original into a light three-dimensional model in a unified format standardized by a system to obtain a first target three-dimensional model;

transmitting the first target three-dimensional model to a designated model analysis engine to obtain three-dimensional model characteristic attributes, and confirming or supplementing the three-dimensional model characteristic attributes obtained by analysis to obtain the first target three-dimensional model characteristic attributes;

Respectively associating the three-dimensional model original, the first target three-dimensional model and the characteristic attribute of the first target three-dimensional model to obtain an association relationship among the three;

storing the three-dimensional model original, the first target three-dimensional model, the characteristic attribute of the first target three-dimensional model and the association relation among the three into a data area corresponding to appointed delivery to finish delivery management of the three-dimensional model;

encrypting the three-dimensional model original and the first target three-dimensional model respectively to obtain an encrypted three-dimensional model original, an encrypted first target three-dimensional model and a first encryption key, and correlating the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key to obtain a correlation relationship among the four;

storing the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the characteristic attribute of the first target three-dimensional model, the first encryption key and the association relation among the four into a data area corresponding to the archive, encrypting the first encryption key through a delivery user public key, and transmitting the encrypted first encryption key to equipment corresponding to archive management to finish the archive management of the three-dimensional model; the association relationship is used for representing the relationship among the encrypted three-dimensional model original, the encrypted first target three-dimensional model, the first target three-dimensional model characteristic attribute and the first encryption key.

2. The three-dimensional model delivery archive management method of claim 1, wherein encrypting the first encryption key with the delivery user public key further comprises:

receiving a three-dimensional model viewing instruction transmitted by an archive user, wherein the three-dimensional model viewing instruction comprises a first target three-dimensional model name and a second encryption key;

searching a first target three-dimensional model matched with the target three-dimensional model name in a designated data area according to the target three-dimensional model name, and acquiring a searching result, wherein the searching result comprises successful searching or unsuccessful searching;

when the searching result is that the searching is successful, matching the second encryption key corresponding to the target three-dimensional model name with the first encryption key corresponding to the first target three-dimensional model obtained by searching to obtain a matching result, wherein the matching result comprises that the matching is successful or the matching is unsuccessful;

when the matching result is that the matching is successful, decrypting the first target three-dimensional model through the second encryption key, and loading the decrypted file through a specified three-dimensional engine to obtain a real-time loading picture, wherein the specified three-dimensional engine is arranged at a cloud or local;

when the appointed three-dimensional engine is arranged at the cloud, transmitting the real-time loading picture to equipment corresponding to the archive user for display through the Internet; when the appointed three-dimensional engine is arranged locally, the real-time loading picture is transmitted to equipment corresponding to the archive user for display through a data transmission line.

3. The three-dimensional model delivery archive management method of claim 2, wherein after transmitting the real-time loading picture to the device corresponding to the archive user for display through the internet or transmitting the real-time loading picture to the device corresponding to the archive user for display through the data transmission line, further comprising:

receiving a three-dimensional model adjustment instruction transmitted by an archive user, wherein the three-dimensional model adjustment instruction comprises an amplifying instruction, a shrinking instruction, a rotating instruction, an explosion view instruction, a splitting instruction, a structure deleting instruction, a structure adding instruction and a structure modifying instruction;

and adjusting the loaded first target three-dimensional model according to the three-dimensional model adjustment instruction, and synchronously updating the real-time loading picture.

4. The three-dimensional model delivery archive management method of claim 2, wherein encrypting the three-dimensional model master and the first target three-dimensional model comprises:

extracting the coordinate Z1 of each first vertex in the three-dimensional model original and the position W1 of each first vertex coordinate in the three-dimensional model original to obtain a first key parameter of each first vertex;

modifying the coordinates Z1 of each vertex in the three-dimensional model element to be null to obtain a first chaotic three-dimensional model;

Forming first key parameters of each first vertex into a first plaintext M1, encrypting the first plaintext M1 to obtain encrypted first key parameters, and taking the encrypted first key parameters and a first chaotic three-dimensional model together as an encrypted file of a three-dimensional model original;

extracting the coordinate Z2 of each second vertex in the target three-dimensional model and the position W2 of each second vertex coordinate in the target three-dimensional model to obtain a second key parameter of each second vertex;

modifying the coordinates Z2 of each vertex in the three-dimensional model element to be null to obtain a second chaotic three-dimensional model;

and forming a second plaintext M2 by the second key parameters of each second vertex, encrypting the second plaintext M2 to obtain encrypted second key parameters, and taking the encrypted second key parameters and the second chaotic three-dimensional model together as an encrypted file of the target three-dimensional model.

5. The three-dimensional model delivery archive management method of claim 4 wherein composing the first key parameters of each first vertex into a first plaintext M1 and encrypting the first plaintext M1 comprises:

a1, initializing system parameters of a first chaotic mapper and a second chaotic mapper;

A2, forming first key parameters of each first vertex into a first plaintext M1, and uniformly dividing the first plaintext M1 into N first plaintext blocks according to a specified sequence length L, or dividing the first plaintext M1 into N-1 first plaintext blocks meeting the specified sequence length L and a first plaintext block not meeting the specified sequence length L; wherein, the first plaintext block which does not meet the specified sequence length L represents the remaining data which is less than the specified sequence length L after the first plaintext M1 is grouped in the direction from the beginning to the end;

a3, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to a specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext blocks by adopting the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the segmentation sequence of the first plaintext M1 to obtain an encrypted first key parameter; when the first plaintext M1 is divided into N-1 first plaintext blocks satisfying the predetermined sequence length L and a first plaintext block not satisfying the predetermined sequence length L, step A4 is entered;

a4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper;

A5, initializing a first counter t1=1 and a second counter t2=1;

a6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block;

a7, judging whether the first counter t1 is equal to N-1, if so, entering a step A8, otherwise, adding one to the count value of the first counter t1, and returning to the step A6;

a8, iterating the first chaotic mapper for G times to obtain a first key corresponding to a first plaintext block which does not meet the specified sequence length L;

a9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper; wherein G represents the number of bits of remaining data in a first plaintext block that does not satisfy the prescribed sequence length L;

a10, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block;

a11, judging whether the second counter t2 is equal to N-1, if so, entering a step A12, otherwise, adding one to the count value of the second counter t2, and returning to the step A10;

a12, iterating the second chaotic mapper for G times to obtain a second key corresponding to the first plaintext block which does not meet the specified sequence length L;

A13, binarizing a first key and a second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

a14, carrying out exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block;

a15, encrypting the ith first plaintext block according to a first encryption key corresponding to the ith first plaintext block aiming at the previous N-1 first plaintext blocks to obtain N-1 first ciphertext; i=1, 2, …, N-1;

a16, performing bitwise exclusive OR on the first encryption key corresponding to the first plaintext block which does not meet the specified sequence length L and the data in the first plaintext block which does not meet the specified sequence length L to obtain a first ciphertext corresponding to the first plaintext block which does not meet the specified sequence length L;

and A17, connecting the N-1 first ciphertexts and the first ciphertexts corresponding to the first plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted first key parameters.

6. The three-dimensional model delivery archive management method of claim 5 wherein the first chaotic mapper is:

，

Wherein x is _n Representing a first chaotic variable, x _n+1 And (6) representing the updated first chaotic variable, and mu represents the control parameter of the first chaotic mapper.

7. The three-dimensional model delivery archive management method of claim 6 wherein the second chaotic mapper is:

y _n+1 =cos[k×arccos(y _n )]，

wherein y is _n Representing a second chaotic variable, y _n+1 And representing the updated second chaotic variable, and k represents the control parameter of the second chaotic mapper.

8. The three-dimensional model delivery archive management method of claim 7, wherein initializing system parameters of the first chaotic mapper and the second chaotic mapper comprises:

and acquiring the current time, calling a pseudo-random number generator to respectively generate an initial value of a first chaotic variable, an initial value of a second chaotic variable and a control parameter of a second chaotic mapper by taking the current time as a parameter, setting the control parameter of the first chaotic mapper as a preset value, and completing the initialization of the system parameters of the first chaotic mapper and the second chaotic mapper.

9. The three-dimensional model delivery archive management method of claim 8, wherein when the first plaintext M1 is uniformly divided into N first plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each first plaintext block, encrypting the first plaintext block by using the first encryption key to obtain a first ciphertext, and connecting the first ciphertext according to the division sequence of the first plaintext M1 to obtain the encrypted first key parameter, including:

A31, when the first plaintext M1 is uniformly divided into N first plaintext blocks according to a specified sequence length L, iterating the first chaotic mapper for M+N times to obtain a first current value corresponding to the first chaotic mapper;

a32, initializing a first counter t1=1 and a second counter t2=1;

a33, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 st first plaintext block;

a34, judging whether the first counter t1 is equal to N, if so, entering a step A35, otherwise, adding one to the count value of the first counter t1, and returning to the step A33;

a35, iterating the second chaotic mapper for M+N times to obtain a second current value corresponding to the second chaotic mapper;

a36, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 st first plaintext block;

a37, judging whether the second counter t2 is equal to N, if so, entering a step A38, otherwise, adding one to the count value of the first counter t1, and returning to the step A36;

a38, binarizing the first key and the second key corresponding to the first plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the first plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

A39, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the first plaintext block;

a310, encrypting the first plaintext block by adopting a first encryption key corresponding to the first plaintext block to obtain N first ciphertext;

and A311, connecting the N first ciphertexts according to the segmentation sequence to obtain the encrypted first key parameters.

10. The three-dimensional model delivery archive management method of claim 8 wherein composing the second key parameters of each second vertex into a second plaintext M2 and encrypting the second plaintext M2 comprises:

b1, initializing system parameters of a first chaotic mapper and a second chaotic mapper;

b2, forming second key parameters of each second vertex into second plaintext M2, and uniformly dividing the second plaintext M2 into N second plaintext blocks according to a specified sequence length L, or dividing the second plaintext M2 into N-1 second plaintext blocks meeting the specified sequence length L and a second plaintext block not meeting the specified sequence length L; wherein, the second plaintext block which does not meet the specified sequence length L represents the remaining data which is less than the specified sequence length L after the second plaintext M2 is grouped in the direction from the beginning to the end;

B3, when the second plaintext M2 is uniformly divided into N second plaintext blocks according to the specified sequence length L, directly obtaining a first encryption key corresponding to each second plaintext block, encrypting the second plaintext blocks by adopting the first encryption key to obtain a second ciphertext, and connecting the second ciphertext according to the segmentation sequence of the second plaintext M2 to obtain an encrypted second key parameter; when the second plaintext M2 is divided into N-1 second plaintext blocks satisfying the predetermined sequence length L and one second plaintext block not satisfying the predetermined sequence length L, then step B4 is entered;

b4, iterating the first chaotic mapper for M+N-1 times to obtain a first current value corresponding to the first chaotic mapper;

b5, initializing a first counter t1=1 and a second counter t2=1;

b6, iterating for L times based on a first current value corresponding to the first chaotic mapper to obtain a first key corresponding to the t1 th second plaintext block;

b7, judging whether the first counter t1 is equal to N-1, if so, entering a step B8, otherwise, adding one to the count value of the first counter t1, and returning to the step B6;

b8, iterating the first chaotic mapper for G times to obtain a first key corresponding to a second plaintext block which does not meet the specified sequence length L;

B9, iterating the second chaotic mapper for M+G times to obtain a second current value corresponding to the second chaotic mapper; wherein G represents the number of bits of the remaining data in a second plaintext block that does not satisfy the prescribed sequence length L;

b10, iterating for L times based on a second current value corresponding to the second chaotic mapper to obtain a second key corresponding to the t1 th second plaintext block;

b11, judging whether the second counter t2 is equal to N-1, if so, entering a step B12, otherwise, adding one to the count value of the second counter t2, and returning to the step B10;

b12, iterating the second chaotic mapper for G times to obtain a second key corresponding to a second plaintext block which does not meet the specified sequence length L;

b13, binarizing the first secret key and the second secret key corresponding to the second plaintext block to obtain a first binary sequence and a second binary sequence corresponding to the second plaintext block; the binarization represents that the number greater than 0 is 1, and the number less than or equal to 0 is 0;

b14, performing exclusive OR on the first binary sequence and the second binary sequence to obtain a first encryption key corresponding to the second plaintext block;

b15, encrypting the ith second plaintext block according to the first encryption key corresponding to the ith second plaintext block aiming at the previous N-1 second plaintext blocks to obtain N-1 second ciphertext; i=1, 2, …, N-1;

B16, adopting the bitwise exclusive or of the first encryption key corresponding to the second plaintext block which does not meet the specified sequence length L and the data in the second plaintext block which does not meet the specified sequence length L to obtain a second ciphertext corresponding to the second plaintext block which does not meet the specified sequence length L;

and B17, connecting the N-1 second ciphertexts and the second ciphertexts corresponding to the second plaintext blocks which do not meet the specified sequence length L according to the segmentation sequence to obtain encrypted second key parameters.