CN110138555A - A kind of encryption and decryption method of FBX format threedimensional model - Google Patents
A kind of encryption and decryption method of FBX format threedimensional model Download PDFInfo
- Publication number
- CN110138555A CN110138555A CN201910421963.1A CN201910421963A CN110138555A CN 110138555 A CN110138555 A CN 110138555A CN 201910421963 A CN201910421963 A CN 201910421963A CN 110138555 A CN110138555 A CN 110138555A
- Authority
- CN
- China
- Prior art keywords
- encryption
- hashed values
- new
- threedimensional model
- keyword
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Power Engineering (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses the encryptions and decryption method of a kind of FBX format threedimensional model, more particularly to threedimensional model field, including encrypting module and deciphering module, 1) encryption method of the encrypting module is as follows: step S101, reading original FBX format threedimensional model file；Step S102, copyright holder inputs passage key, by md5 encryption, generates 4 sections of 32 hashed values.The present invention provides a kind of encryption and decryption approaches of easy to use, efficient FBX format threedimensional model, using this encrypting and decrypting method, go out the coal addition position of the random data of model file by preset cipher key calculation, by the coal addition position for changing the random data of the adjustable model file of key, to while holding decryption method high-efficient advantage, the safety for improving algorithm is not easy to be cracked, and threedimensional model decipherment algorithm complexity is lower.
Description
Technical field
The present invention relates to threedimensional model technical field, it is more particularly related to a kind of FBX format threedimensional model
Encryption and decryption method.
Background technique
FBX format threedimensional model file is a kind of now widely used threedimensional model file.FBX format threedimensional model text
Part itself is in a kind of unprotect state, when these files are placed on network or are installed on client computer with system, appoints
What user all can be read and modify these threedimensional model files, or these threedimensional models are used for other application, thus
Shortage gives suitable protecting to the achievement of designer or the assets of owner.
Existing threedimensional model guard method is usually the point coordinate for passing through object face element in transformation threedimensional model, makes not award
The user of power can not correctly obtain initial three-dimensional object.This method usually requires to become by complicated matrix after model load
Calculating is changed to carry out model reduction, its decryption method takes a long time for large-scale three dimensional model, has larger impact to system performance.
Summary of the invention
In order to overcome the drawbacks described above of the prior art, the embodiment of the present invention provides a kind of adding for FBX format threedimensional model
Close and decryption method, the present invention is by the defect for above-mentioned threedimensional model time slot scrambling, for FBX format threedimensional model file
The characteristics of, by key, one section of random data is added in multiple specific positions of model file, it is adjustable by changing key
The random data of model file and the position of addition, this method are ensuring that cryptographic security is higher and threedimensional model decipherment algorithm is multiple
Miscellaneous degree is lower.
To achieve the above object, the invention provides the following technical scheme: a kind of encryption and decryption of FBX format threedimensional model
Method, including encrypting module and deciphering module；
1) encryption method of the encrypting module is as follows:
Step S101, original FBX format threedimensional model file is read；
Step S102, copyright holder inputs passage key, by md5 encryption, generates 4 sections of 32 hashed values；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the first 8 corresponding decimal number VN1 of 32 hashed values of paragraph 1 as deviant, finds VP1 backward
Rear 24 data sequences of 32 hashed values of paragraph 1 are added, if Vertices is not deposited in the position VP1N of number N1 after VP1N
, then directly encryption terminate；
Step S104, the file position of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 is set, if PolygonVertexIndex exists, takes the first 8 corresponding decimal number PN1 conducts of the 2nd section of 32 hashed values
Deviant finds the position PP1N that PP1 counts up PN1, and rear 24 data sequences of the 2nd section of 32 hashed values are added after PP1N
Column, if PolygonVertexIndex is not present, directly encryption terminates；
Step S105, the document location EP1 that keyword Edges the 1st time appearance is found by binary search, if Edges
In the presence of taking the first 8 corresponding decimal number EN1 of the 3rd section of 32 hashed values as deviant, find EP1 and count up EN1
Rear 24 data sequences of the 3rd section of 32 hashed values are added in position EP1N after EP1N, if Edges is not present, directly encrypt
Terminate；
Step S106, the document location of keyword GeometryVersion the 1st time appearance is found by binary search
GP1 takes the first 8 corresponding decimal number GN1 of the 4th section of 32 hashed values as offset if GeometryVersion exists
Value, finds the position GP1N that GP1 counts up GN1, and rear 24 data sequences of the 4th section of 32 hashed values are added after GP1N,
If GeometryVersion is not present, directly encryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed values, takes new 32 hashed values
Preceding 8 corresponding decimal number VN2 find the position VP2N that VP2 counts up VN2 as deviant, are added after VP2N new
Rear 24 data sequences of 32 hashed values, if Vertices is not present, directly encryption terminates；
Step S108, the file position of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 is set, if PolygonVertexIndex exists, becomes 32 new hash for the 2nd section 32 hashed value ring shift lefts 8
Value, takes first 8 corresponding decimal number PN2 of new 32 hashed values as deviant, finds the position that PP2 counts up PN2
Rear 24 data sequences of new 32 hashed values are added, if PolygonVertexIndex is not present, directly in PP2N after PP2N
Connecing encryption terminates；
Step S109, the document location EP2 that keyword Edges the 2nd time appearance is found by binary search, if Edges
In the presence of becoming 32 new hashed values for the 3rd section 32 hashed value ring shift lefts 8, take preceding 8 correspondences of new 32 hashed values
Decimal number EN2 as deviant, find the position EP2N that EP2 counts up EN2, new 32 hashed values be added after EP2N
Rear 24 data sequences, if Edges is not present, directly encryption terminate；
Step S110, the document location of keyword GeometryVersion the 2nd time appearance is found by binary search
GP2 becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8 if GeometryVersion exists, and takes new
First 8 corresponding decimal number GN2 of 32 hashed values find the position GP2N that GP2 counts up GN2 as deviant,
Rear 24 data sequences of new 32 hashed values are added after GP2N, if GeometryVersion is not present, directly encryption is tied
Beam；
Step S111, the rest may be inferred, until searched for all keyword Vertices, PolygonVertexIndex,
Edges and GeometryVersion, the ciphering process for completing threedimensional model file add to generate new threedimensional model file
Close end；
2) decryption method of the deciphering module is as follows:
Step S101, the new threedimensional model file is propagated by network or other physics modes；
Step S102, when needing using the threedimensional model file, new model file can be restored according to 4 sections of 32 hashed values
At the FBX format threedimensional model file of standard；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the first 8 corresponding decimal number VN1 of 32 hashed values of paragraph 1 as deviant, finds VP1 backward
The position VP1N of number N1, deletes 24 data sequences after VP1, if Vertices is not present, directly decryption terminates；
Step S104, the file position of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 is set, if PolygonVertexIndex exists, takes the first 8 corresponding decimal number PN1 conducts of the 2nd section of 32 hashed values
Deviant finds the position PP1N that PP1 counts up PN1N, 24 data sequences is deleted after PP1, if
PolygonVertexIndex is not present, then directly decryption terminates；
Step S105, the document location EP1 that keyword Edges the 1st time appearance is found by binary search, if Edges
In the presence of taking the first 8 corresponding decimal number EN1 of the 3rd section of 32 hashed values as deviant, find EP1 and count up EN1
Position EP1N deletes 24 data sequences after EP1N, if Edges is not present, directly decryption terminates；
Step S106, the document location of keyword GeometryVersion the 1st time appearance is found by binary search
GP1 takes the first 8 corresponding decimal number GN1 of the 4th section of 32 hashed values as offset if GeometryVersion exists
Value, finds the position GP1N that GP1 counts up GN1,24 data sequences is deleted after GP1N, if GeometryVersion
It is not present, then directly decryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed values, takes new 32 hashed values
Preceding 8 corresponding decimal number VN2 find the position VP2N that VP2 counts up N2,24 are deleted after VP2N as deviant
Position data sequence, if Vertices is not present, directly encryption terminates；
Step S108, the file position of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 is set, if PolygonVertexIndex exists, becomes 32 new hash for the 2nd section 32 hashed value ring shift lefts 8
Value, takes first 8 corresponding decimal number PN2 of new 32 hashed values as deviant, finds the position that PP2 counts up PN2
PP2N deletes 24 data sequences after PP2N, if PolygonVertexIndex is not present, directly encryption terminates；
Step S109, the document location EP2 that keyword Edges the 2nd time appearance is found by binary search, if Edges
In the presence of becoming 32 new hashed values for the 3rd section 32 hashed value ring shift lefts 8, take preceding 8 correspondences of new 32 hashed values
Decimal number EN2 as deviant, find the position EP2N that EP2 counts up EN2,24 data sequences deleted after EP2N
Column, if Edges is not present, directly encryption terminates；
Step S110, the document location of keyword GeometryVersion the 2nd time appearance is found by binary search
GP2 becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8 if GeometryVersion exists, and takes new
First 8 corresponding decimal number GN2 of 32 hashed values find the position GP2N that GP2 counts up GN2 as deviant,
24 data sequences are deleted after GP2N, if GeometryVersion is not present, directly encryption terminates；
Step S111, the rest may be inferred, until searched for all keyword Vertices, PolygonVertexIndex,
Edges and GeometryVersion completes the decrypting process of threedimensional model file, is reduced into the FBX format threedimensional model of standard
File, decryption terminate.
In a preferred embodiment, the encrypting module is installed on copyright owner's computer, using the encryption
Method encrypts the FBX format threedimensional model file of standard, generates new threedimensional model encryption file.
In a preferred embodiment, the deciphering module is built in all software systems of copyright owner, or with
The mode of dll dynamic link library is installed along on user computer with threedimensional model encryption file.
In a preferred embodiment, 4 sections of 32 hashed values of encryption and decryption are used for built in die-filling piece of the decryption, it can
Threedimensional model encryption file is decrypted, the FBX threedimensional model file of standard is reduced into.
Technical effect and advantage of the invention:
1, the present invention uses this encrypting and decrypting method, goes out adding for the random data of model file by preset cipher key calculation
Enter position, the coal addition position of the random data by changing the adjustable model file of key, thus keeping decryption method effect
While rate high advantage, the safety of algorithm is improved, is not easy to be cracked, and threedimensional model decipherment algorithm complexity is lower；
2, encryption and decryption approaches provided by the invention are easy to use, provide a kind of efficient FBX format threedimensional model,
Solve the problems, such as that FBX format threedimensional model secrecy and existing FBX format threedimensional model encrypting and decrypting method are complicated, the time is multiple
The high problem of miscellaneous degree.
Detailed description of the invention
Fig. 1 is encryption method flow chart of the invention.
Fig. 2 is decryption method flow chart of the invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
A kind of encryption and decryption method of FBX format threedimensional model according to shown in Fig. 1-2, including encrypting module and decryption
Module；
The encrypting module is installed on copyright owner's computer, three-dimensional using FBX format of the encryption method to standard
Model file is encrypted, and new threedimensional model encryption file is generated；
The deciphering module is built in all software systems of copyright owner, or in a manner of dll dynamic link library, with three
Dimension module encryption file is installed along on user computer；
It is used for 4 sections of 32 hashed values of encryption and decryption built in die-filling piece of the decryption, file can be encrypted to threedimensional model and carried out
Decryption, is reduced into the FBX threedimensional model file of standard.
Below to a preferred embodiment of the present invention will be described in detail:
1) encryption method of the encrypting module is as follows:
Step S101, certain original FBX format threedimensional model file, comprising keyword Vertices,
PolygonVertexIndex, Edges and GeometryVersion each 2 times；
Step S102, copyright holder inputs passage " threedimensional model encryption " by md5 encryption, generates 4 sections 32
Hashed value is a2dd4015 74e8f21e 5ca68ec7 8084d214 (hexadecimal representation)；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the corresponding decimal number 162 of preceding 8 a2 (hexadecimal representation) of 32 hashed values of paragraph 1 as inclined
Shifting value finds the position VP1N that VP1 counts up 162, and rear 24 data sequences of 32 hashed values of paragraph 1 are added after VP1N
Dd4015 (hexadecimal representation), if Vertices is not present, directly encryption terminates；
Step S104, the file position of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 is set, if PolygonVertexIndex exists, takes preceding 8 74 (hexadecimal representations) of the 2nd section of 32 hashed values corresponding
Decimal number 116 is used as deviant, finds the position PP1N that PP1 counts up 116, and the 2nd section of 32 hash are added after PP1N
Rear 24 data sequence e8f21e (hexadecimal representation) of value directly encrypt if PolygonVertexIndex is not present
Terminate；
Step S105, the document location EP1 that keyword Edges the 1st time appearance is found by binary search, if Edges
In the presence of taking the corresponding decimal number 92 of preceding 8 5c of the 3rd section of 32 hashed values as deviant, find 92 and count up EN1
Rear 24 data sequence a68ec7 of the 3rd section of 32 hashed values are added, if Edges is not present, directly in position EP1N after EP1N
Connecing encryption terminates；
Step S106, the document location of keyword GeometryVersion the 1st time appearance is found by binary search
GP1 takes preceding 8 80 corresponding decimal numbers 128 of the 4th section of 32 hashed values as offset if GeometryVersion exists
Value, finds the position GP1N that GP1 counts up 128, and rear 24 data sequences of the 4th section of 32 hashed values are added after GP1N
84d214, if GeometryVersion is not present, directly encryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed value dd4015a2, takes new 32
The corresponding decimal number 221 of preceding 8 dd of hashed value is used as deviant, finds the position VP2N that VP2 counts up 221,
Rear 24 data sequence 4015a2 of new 32 hashed values are added after VP2N, if Vertices is not present, directly encryption terminates；
Step S108, the file position of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 is set, if PolygonVertexIndex exists, becomes 32 new hashed values for the 2nd section 32 hashed value ring shift lefts 8
E8f21e74 takes the corresponding decimal number 232 of preceding 8 e8 of new 32 hashed values as deviant, finds PP2 and count up 232
The position PP2N of position, is added rear 24 data sequence f21e74 of new 32 hashed values after PP2N, if
PolygonVertexIndex is not present, then directly encryption terminates；
Step S109, the document location EP2 that keyword Edges the 2nd time appearance is found by binary search, if Edges
In the presence of becoming 32 new hashed value a68ec75c for the 3rd section 32 hashed value ring shift lefts 8, take new 32 hashed values
The corresponding decimal number 166 of preceding 8 a6 is used as deviant, finds the position EP2N that EP2 counts up 166, is added after EP2N
Rear 24 data sequence 8ec75c of new 32 hashed values, if Edges is not present, directly encryption terminates；
Step S110, the document location of keyword GeometryVersion the 2nd time appearance is found by binary search
GP2 becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8 if GeometryVersion exists
84d21480 takes preceding 8 84 corresponding decimal numbers 132 of new 32 hashed values as deviant, finds GP2 and count up 132
The position GP2N of position, is added rear 24 data sequence d21480 of new 32 hashed values, if GeometryVersion after GP2N
It is not present, then directly encryption terminates；
Step S111, the rest may be inferred, until searched for all keyword Vertices, PolygonVertexIndex,
Edges and GeometryVersion, the ciphering process for completing threedimensional model file add to generate new threedimensional model file
Close end；
2) decryption method of the deciphering module is as follows:
Step S101, the new threedimensional model file is propagated by network or other physics modes；
It step S102, can be according to 4 sections of 32 hashed value a2dd401574e8f21e when needing using the threedimensional model file
New model file is reduced into the FBX format threedimensional model file of standard by 5ca68ec7 8084d214 (hexadecimal representation)；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the first 8 corresponding decimal numbers 162 of 32 hashed values of paragraph 1 as deviant, finds VP1 backward
Number 162 position VP1N delete 24 data sequences after VP1N, if Vertices is not present, directly decryption terminates；
Step S104, the file position of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 is set, if PolygonVertexIndex exists, takes first 8 corresponding 116 conducts of decimal number of the 2nd section of 32 hashed values
Deviant finds the position PP1N that PP1N counts up 116,24 data sequences is deleted after PP1, if
PolygonVertexIndex is not present, then directly decryption terminates；
Step S105, the document location EP1 that keyword Edges the 1st time appearance is found by binary search, if Edges
In the presence of taking the first 8 corresponding decimal numbers 92 of the 3rd section of 32 hashed values as deviant, find the position that EP1 counts up 92
EP1N is set, 24 data sequences are deleted after EP1N, if Edges is not present, directly decryption terminates；
Step S106, the document location of keyword GeometryVersion the 1st time appearance is found by binary search
GP1 takes the first 8 corresponding decimal numbers 128 of the 4th section of 32 hashed values as offset if GeometryVersion exists
Value, finds the position GP1N that GP1 counts up 128,24 data sequences is deleted after GP1N, if GeometryVersion
It is not present, then directly decryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed value dd4015a2, takes new 32
First 8 corresponding decimal numbers 221 of hashed value are used as deviant, the position VP2N that VP2 counts up 221 are found, in VP2N
After delete 24 data sequences, if Vertices is not present, directly encryption terminate；
Step S108, the file position of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 is set, if PolygonVertexIndex exists, becomes 32 new hashed values for the 2nd section 32 hashed value ring shift lefts 8
E8f21e74 takes first 8 corresponding decimal numbers 232 of new 32 hashed values as deviant, finds PP2 and count up 232
Position PP2N, 24 data sequences are deleted after PP2N, if PolygonVertexIndex is not present, directly encryption knot
Beam；
Step S109, the document location EP2 that keyword Edges the 2nd time appearance is found by binary search, if Edges
In the presence of becoming 32 new hashed value a68ec75c for the 3rd section 32 hashed value ring shift lefts 8, take new 32 hashed values
Preceding 8 corresponding decimal numbers 166 are used as deviant, find the position EP2N that EP2 counts up 166, delete after EP2N
24 data sequences, if Edges is not present, directly encryption terminates；
Step S110, the document location of keyword GeometryVersion the 2nd time appearance is found by binary search
GP2 becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8 if GeometryVersion exists
84d21480 takes first 8 corresponding decimal numbers 132 of new 32 hashed values as deviant, finds GP2 and count up 132
Position GP2N, 24 data sequences are deleted after GP2N, if GeometryVersion is not present, directly encryption terminate；
Step S111, the rest may be inferred, until searched for all keyword Vertices, PolygonVertexIndex,
Edges and GeometryVersion completes the decrypting process of threedimensional model file, is reduced into the FBX format threedimensional model of standard
File, decryption terminate.
The several points that should finally illustrate are: firstly, in the description of the present application, it should be noted that unless otherwise prescribed and
It limits, term " installation ", " connected ", " connection " shall be understood in a broad sense, can be mechanical connection or electrical connection, be also possible to two
Connection inside element, can be directly connected, and "upper", "lower", "left", "right" etc. are only used for indicating relative positional relationship, when
The absolute position for being described object changes, then relative positional relationship may change；
Secondly: the present invention discloses in embodiment attached drawing, relates only to the structure being related to the embodiment of the present disclosure, other knots
Structure, which can refer to, to be commonly designed, and under not conflict situations, the same embodiment of the present invention and different embodiments be can be combined with each other；
Last: the foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, all in the present invention
Spirit and principle within, any modification, equivalent replacement, improvement and so on, should be included in protection scope of the present invention it
It is interior.
Claims (4)
1. a kind of encryption and decryption method of FBX format threedimensional model, it is characterised in that: including encrypting module and deciphering module；
1) encryption method of the encrypting module is as follows:
Step S101, original FBX format threedimensional model file is read；
Step S102, copyright holder inputs passage key, by md5 encryption, generates 4 sections of 32 hashed values；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the first 8 corresponding decimal number VN1 of 32 hashed values of paragraph 1 as deviant, finds VP1 backward
Rear 24 data sequences of 32 hashed values of paragraph 1 are added, if Vertices is not deposited in the position VP1N of number N1 after VP1N
, then directly encryption terminate；
Step S104, the document location of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 takes the first 8 corresponding decimal number PN1 of the 2nd section of 32 hashed values as inclined if PolygonVertexIndex exists
Shifting value finds the position PP1N that PP1 counts up PN1, and rear 24 data sequences of the 2nd section of 32 hashed values are added after PP1N
Column, if PolygonVertexIndex is not present, directly encryption terminates；
Step S105, the document location EP1 of keyword Edges the 1st time appearance is found by binary search, if Edges exists,
It takes the first 8 corresponding decimal number EN1 of the 3rd section of 32 hashed values as deviant, finds the position that EP1 counts up EN1
Rear 24 data sequences of the 3rd section of 32 hashed values are added in EP1N after EP1N, if Edges is not present, directly encryption is tied
Beam；
Step S106, the document location GP1 of keyword GeometryVersion the 1st time appearance is found by binary search, if
GeometryVersion exists, and takes the first 8 corresponding decimal number GN1 of the 4th section of 32 hashed values as deviant, finds
GP1 counts up GN1 position GP1N, and rear 24 data sequences of the 4th section of 32 hashed values are added after GP1N, if
GeometryVersion is not present, then directly encryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed values, takes new 32 hashed values
Preceding 8 corresponding decimal number VN2 find the position VP2N that VP2 counts up VN2 as deviant, are added after VP2N new
Rear 24 data sequences of 32 hashed values, if Vertices is not present, directly encryption terminates；
Step S108, the document location of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 becomes 32 new hashed values for the 2nd section 32 hashed value ring shift lefts 8 if PolygonVertexIndex exists,
It takes first 8 corresponding decimal number PN2 of new 32 hashed values as deviant, finds the position that PP2 counts up PN2
Rear 24 data sequences of new 32 hashed values are added, if PolygonVertexIndex is not present, directly in PP2N after PP2N
Connecing encryption terminates；
Step S109, the document location EP2 of keyword Edges the 2nd time appearance is found by binary search, if Edges exists,
Become 32 new hashed values for the 3rd section 32 hashed value ring shift lefts 8, takes first 8 corresponding ten of new 32 hashed values
System number EN2 finds the position EP2N that EP2 counts up EN2 as deviant, after new 32 hashed values are added after EP2N
24 data sequences, if Edges is not present, directly encryption terminates；
Step S110, the document location GP2 of keyword GeometryVersion the 2nd time appearance is found by binary search, if
GeometryVersion exists, and becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8, takes new 32 to dissipate
First 8 corresponding decimal number GN2 of train value find the position GP2N that GP2 counts up GN2, after GP2N as deviant
Rear 24 data sequences of new 32 hashed values are added, if GeometryVersion is not present, directly encryption terminates；
Step S111, the rest may be inferred, until having searched for all keyword Vertices, PolygonVertexIndex, Edges
And GeometryVersion, the ciphering process of threedimensional model file is completed, so that new threedimensional model file is generated, encryption knot
Beam；
2) decryption method of the deciphering module is as follows:
Step S101, the new threedimensional model file is propagated by network or other physics modes；
Step S102, when needing using the threedimensional model file, new model file can be reduced into mark according to 4 sections of 32 hashed values
Quasi- FBX format threedimensional model file；
Step S103, the document location VP1 of keyword Vertices the 1st time appearance is found by binary search, if
Vertices exists, and takes the first 8 corresponding decimal number VN1 of 32 hashed values of paragraph 1 as deviant, finds VP1 backward
The position VP1N of number N1, deletes 24 data sequences after VP1, if Vertices is not present, directly decryption terminates；
Step S104, the document location of keyword PolygonVertexIndex the 1st time appearance is found by binary search
PP1 takes the first 8 corresponding decimal number PN1 of the 2nd section of 32 hashed values as inclined if PolygonVertexIndex exists
Shifting value finds the position PP1N that PP1 counts up PN1N, 24 data sequences is deleted after PP1, if
PolygonVertexIndex is not present, then directly decryption terminates；
Step S105, the document location EP1 of keyword Edges the 1st time appearance is found by binary search, if Edges exists,
It takes the first 8 corresponding decimal number EN1 of the 3rd section of 32 hashed values as deviant, finds the position that EP1 counts up EN1
EP1N deletes 24 data sequences after EP1N, if Edges is not present, directly decryption terminates；
Step S106, the document location GP1 of keyword GeometryVersion the 1st time appearance is found by binary search, if
GeometryVersion exists, and takes the first 8 corresponding decimal number GN1 of the 4th section of 32 hashed values as deviant, finds
GP1 counts up GN1 position GP1N, and 24 data sequences are deleted after GP1N, if GeometryVersion is not present,
Then directly decryption terminates；
Step S107, the document location VP2 of keyword Vertices the 2nd time appearance is found by binary search, if
Vertices exists, and the hashed value ring shift left 8 of paragraph 1 32 is become 32 new hashed values, takes new 32 hashed values
Preceding 8 corresponding decimal number VN2 find the position VP2N that VP2 counts up N2,24 are deleted after VP2N as deviant
Position data sequence, if Vertices is not present, directly encryption terminates；
Step S108, the document location of keyword PolygonVertexIndex the 2nd time appearance is found by binary search
PP2 becomes 32 new hashed values for the 2nd section 32 hashed value ring shift lefts 8 if PolygonVertexIndex exists,
It takes first 8 corresponding decimal number PN2 of new 32 hashed values as deviant, finds the position that PP2 counts up PN2
PP2N deletes 24 data sequences after PP2N, if PolygonVertexIndex is not present, directly encryption terminates；
Step S109, the document location EP2 of keyword Edges the 2nd time appearance is found by binary search, if Edges exists,
Become 32 new hashed values for the 3rd section 32 hashed value ring shift lefts 8, takes first 8 corresponding ten of new 32 hashed values
System number EN2 finds the position EP2N that EP2 counts up EN2,24 data sequences is deleted after EP2N as deviant,
If Edges is not present, directly encryption terminates；
Step S110, the document location GP2 of keyword GeometryVersion the 2nd time appearance is found by binary search, if
GeometryVersion exists, and becomes 32 new hashed values for the 4th section 32 hashed value ring shift lefts 8, takes new 32 to dissipate
First 8 corresponding decimal number GN2 of train value find the position GP2N that GP2 counts up GN2, after GP2N as deviant
24 data sequences are deleted, if GeometryVersion is not present, directly encryption terminates；
Step S111, the rest may be inferred, until having searched for all keyword Vertices, PolygonVertexIndex, Edges
And GeometryVersion, the decrypting process of threedimensional model file is completed, the FBX format threedimensional model file of standard is reduced into,
Decryption terminates.
2. the encryption and decryption method of a kind of FBX format threedimensional model according to claim 1, it is characterised in that: described
Encrypting module is installed on copyright owner's computer, is carried out using FBX format threedimensional model file of the encryption method to standard
Encryption generates new threedimensional model encryption file.
3. the encryption and decryption method of a kind of FBX format threedimensional model according to claim 1, it is characterised in that: described
Deciphering module is built in all software systems of copyright owner, or in a manner of dll dynamic link library, encrypts text with threedimensional model
Part is installed along on user computer.
4. the encryption and decryption method of a kind of FBX format threedimensional model according to claim 1, it is characterised in that: described
4 sections of 32 hashed values for being used for encryption and decryption built in die-filling piece are decrypted, file can be encrypted to threedimensional model and be decrypted, be reduced into mark
Quasi- FBX threedimensional model file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910421963.1A CN110138555B (en) | 2019-05-21 | 2019-05-21 | Encryption and decryption method for FBX format three-dimensional model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910421963.1A CN110138555B (en) | 2019-05-21 | 2019-05-21 | Encryption and decryption method for FBX format three-dimensional model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110138555A true CN110138555A (en) | 2019-08-16 |
| CN110138555B CN110138555B (en) | 2020-11-20 |
Family
ID=67571981
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910421963.1A Active CN110138555B (en) | 2019-05-21 | 2019-05-21 | Encryption and decryption method for FBX format three-dimensional model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110138555B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040202326A1 (en) * | 2003-04-10 | 2004-10-14 | Guanrong Chen | System and methods for real-time encryption of digital images based on 2D and 3D multi-parametric chaotic maps |
| US20150134962A1 (en) * | 2013-11-08 | 2015-05-14 | MustBin Inc. | Bin enabled data object encryption and storage apparatuses, methods and systems |
| CN104780161A (en) * | 2015-03-23 | 2015-07-15 | 南京邮电大学 | Searchable encryption method supporting multiple users in cloud storage |
| CN104836862A (en) * | 2015-06-04 | 2015-08-12 | 成都果豆数字娱乐有限公司 | Intelligent terminal data storage method |
| CN105187192A (en) * | 2015-09-08 | 2015-12-23 | 广州六米网络科技有限公司 | Three-dimensional secret code encryption algorithm |
| CN105488360A (en) * | 2015-11-27 | 2016-04-13 | 北京印刷学院 | Anti-fake processing method and device of three-dimensional model file with fbx format postfix |
| CN105512522A (en) * | 2015-11-27 | 2016-04-20 | 北京印刷学院 | Anti-counterfeiting processing method and device for three-dimensional model file with suffix in 3ds format |
| CN106789049A (en) * | 2017-03-24 | 2017-05-31 | 中国人民解放军国防科学技术大学 | A kind of three-dimensional constellation rotation encryption method based on radio channel characteristic |
| CN107454142A (en) * | 2017-06-29 | 2017-12-08 | 北京邮电大学 | Non- the obstruction content buffering method and device of a kind of content router |
-
2019
- 2019-05-21 CN CN201910421963.1A patent/CN110138555B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040202326A1 (en) * | 2003-04-10 | 2004-10-14 | Guanrong Chen | System and methods for real-time encryption of digital images based on 2D and 3D multi-parametric chaotic maps |
| US20150134962A1 (en) * | 2013-11-08 | 2015-05-14 | MustBin Inc. | Bin enabled data object encryption and storage apparatuses, methods and systems |
| CN104780161A (en) * | 2015-03-23 | 2015-07-15 | 南京邮电大学 | Searchable encryption method supporting multiple users in cloud storage |
| CN104836862A (en) * | 2015-06-04 | 2015-08-12 | 成都果豆数字娱乐有限公司 | Intelligent terminal data storage method |
| CN105187192A (en) * | 2015-09-08 | 2015-12-23 | 广州六米网络科技有限公司 | Three-dimensional secret code encryption algorithm |
| CN105488360A (en) * | 2015-11-27 | 2016-04-13 | 北京印刷学院 | Anti-fake processing method and device of three-dimensional model file with fbx format postfix |
| CN105512522A (en) * | 2015-11-27 | 2016-04-20 | 北京印刷学院 | Anti-counterfeiting processing method and device for three-dimensional model file with suffix in 3ds format |
| CN106789049A (en) * | 2017-03-24 | 2017-05-31 | 中国人民解放军国防科学技术大学 | A kind of three-dimensional constellation rotation encryption method based on radio channel characteristic |
| CN107454142A (en) * | 2017-06-29 | 2017-12-08 | 北京邮电大学 | Non- the obstruction content buffering method and device of a kind of content router |
Non-Patent Citations (2)
| Title |
|---|
| SAMIRA BADER: "Design of a 3D Virtual World to Implement a Logical Access Control Mechanism", 《2017 IEEE/ACS 14TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS》 * |
| 李红岩: "基于超混沌系统的三维网格模型几何保留加密算法", 《现代电子技术 》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110138555B (en) | 2020-11-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI750223B (en) | Blockchain encrypted radio frequency chip storage design method | |
| KR101369748B1 (en) | Method for encrypting datas and appatus therefor | |
| CN105324956B (en) | The method and apparatus of encrypting plaintext data | |
| CN106878013B (en) | File encryption and decryption method and device | |
| CN108959978A (en) | The generation of key and acquisition methods and device in equipment | |
| CN104660590B (en) | A kind of file encryption secure cloud storage scheme | |
| CN102063598A (en) | Data encryption and decryption methods and devices | |
| CN102306262A (en) | Data encryption method and data encryption system | |
| CN102355352A (en) | Data confidentiality and integrity protection method | |
| WO2017033843A1 (en) | Searchable cryptograph processing system | |
| CN102541762A (en) | Data protector for external memory and data protection method | |
| CN111984985A (en) | HDL source code encryption method based on FPGA hardware system | |
| CN104954362B (en) | The encryption and decryption approaches and its device of sequence number | |
| CN106656500A (en) | Encryption device and method | |
| JP2004350007A (en) | Encryption system | |
| CN102270182B (en) | Encrypted mobile storage equipment based on synchronous user and host machine authentication | |
| CN101479774B (en) | Cipher processing apparatus, data converting method, data converting program, recording medium and integrated circuit | |
| CN110138555A (en) | A kind of encryption and decryption method of FBX format threedimensional model | |
| CN108809889B (en) | Data deterministic deletion method based on data block random position negation | |
| CN112134701B (en) | Encryption method capable of repudiating editing of sensitive keywords | |
| EP3832945B1 (en) | System and method for protecting memory encryption against template attacks | |
| CN111314053B (en) | Data encryption and decryption method | |
| CN111314052B (en) | Data encryption and decryption method | |
| CN103491384A (en) | Encrypting method and device of video and decrypting method and device of video | |
| CN100359494C (en) | Electronic file characters internal code transformation encryption method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |