[go: up one dir, main page]

CN118784208B - Subway vehicle-mounted PIS information safety transmission system based on block chain technology - Google Patents

Subway vehicle-mounted PIS information safety transmission system based on block chain technology Download PDF

Info

Publication number
CN118784208B
CN118784208B CN202411239884.6A CN202411239884A CN118784208B CN 118784208 B CN118784208 B CN 118784208B CN 202411239884 A CN202411239884 A CN 202411239884A CN 118784208 B CN118784208 B CN 118784208B
Authority
CN
China
Prior art keywords
value
chaotic
gray value
sequence
polynomial corresponding
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.)
Active
Application number
CN202411239884.6A
Other languages
Chinese (zh)
Other versions
CN118784208A (en
Inventor
王可心
王靖文
刘富文
王昆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jilin Beilian Display Technology Co ltd
Original Assignee
Jilin Beilian Display Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jilin Beilian Display Technology Co ltd filed Critical Jilin Beilian Display Technology Co ltd
Priority to CN202411239884.6A priority Critical patent/CN118784208B/en
Publication of CN118784208A publication Critical patent/CN118784208A/en
Application granted granted Critical
Publication of CN118784208B publication Critical patent/CN118784208B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/001—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using chaotic signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • 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/002—Countermeasures against attacks on cryptographic mechanisms
    • 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/44—Secrecy systems
    • H04N1/448—Rendering the image unintelligible, e.g. scrambling

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Multimedia (AREA)
  • Train Traffic Observation, Control, And Security (AREA)
  • Emergency Alarm Devices (AREA)

Abstract

The invention belongs to the technical field of safe transmission, and particularly relates to a subway vehicle-mounted PIS information safe transmission system based on a block chain technology, which comprises the following steps: the first module, the second module, the third module and the fourth module are used for forming a plaintext sequence by all gray values obtained after the I frame images in the train monitoring video information are scrambled, setting a polynomial for each gray value and each run length, and encrypting the plaintext sequence according to the polynomial corresponding to the gray value and the run length, wherein any data point in the polynomial corresponding to the gray value is used as an encryption result of the gray value, an intersection point of the polynomial corresponding to the first gray value and the polynomial corresponding to the second gray value in the gray value pair is used as an encryption result of the gray value pair, and an intersection point of the polynomial corresponding to the run length equal to the length of the gray value sequence and the polynomial corresponding to the gray value is used as an encryption result of the gray value sequence. The invention can resist statistical analysis attack and enhance the transmission safety of the monitoring video information of the vehicle group.

Description

Subway vehicle-mounted PIS information safety transmission system based on block chain technology
Technical Field
The invention relates to the technical field of safe transmission. More particularly, the invention relates to a subway vehicle-mounted PIS information safety transmission system based on a blockchain technology.
Background
The subway vehicle-mounted PIS (Passenger Information System) information system is a comprehensive platform integrating subway operation information and multimedia services. In normal operation, it provides real-time information such as train schedule, arrival information, announcement, etc. to passengers, and in emergency, it issues important information such as evacuation guidance preferentially. The system utilizes advanced multimedia network technology and blockchain technology to ensure the rapid and accurate transmission of information, and provides clear and visual display for passengers through stations and vehicle-mounted display terminals.
The method and the system can help an operation center to monitor the running state of the train in real time and timely find and solve faults and abnormal conditions by transmitting the vehicle-mounted data, and in order to ensure the transmission safety of the vehicle-mounted data, the vehicle-mounted data comprises vehicle-mounted running data information and vehicle-mounted monitoring video information, wherein the vehicle-mounted running data information is numerical data, the vehicle-mounted monitoring video information is image data, the vehicle-mounted running data information is encrypted through a dynamic information encryption algorithm such as an RSA encryption algorithm, but the encryption algorithm is not suitable for directly encrypting large-block data such as images, and the calculation cost is very high.
The chaotic mapping function is suitable for encrypting the images with large data quantity and strong correlation, but the encryption method only scrambles the positions of the pixel points, only can destroy the strong correlation of the images, and does not destroy the statistical characteristics of the images, at the moment, the encryption result of the monitoring video information of the train set cannot resist the statistical analysis attack, and the transmission safety is poor.
Disclosure of Invention
In order to solve the technical problems that the conventional chaotic mapping function only scrambles the positions of pixel points in an image, only can damage the strong correlation of the image, and does not damage the statistical characteristics of the image, so that the encryption result of the vehicle group monitoring video information cannot resist the statistical analysis attack, and the transmission safety is poor, the invention provides the scheme in the following aspects.
The invention provides a subway vehicle-mounted PIS information safety transmission system based on a blockchain technology, which comprises a first module, a second module and a third module, wherein the first module is used for generating three chaotic sequences according to a chaotic mapping function and three secret keys; the second module is used for scrambling all pixel points in the I frame image in the monitoring video information of the vehicle group through the first chaotic sequence, and forming a plaintext sequence by the gray values of all the scrambled pixel points; the third module is used for setting a polynomial for each gray value and each run length in a preset range, wherein the polynomial consists of a plurality of single expressions, the times of each single expression are second chaotic values in a second chaotic sequence, and the coefficients of each single expression are third chaotic values in a third chaotic sequence; a fourth module, configured to encrypt each gray value in the plaintext sequence in order according to the gray value and the polynomial corresponding to the run length to obtain an encryption result of the plaintext sequence, where when the gray value is greater than the next gray value of the gray value, the gray value is used as an object to be encrypted, any one of the polynomials corresponding to the gray value is used as an encryption result of the object to be encrypted, when the gray value is less than the next gray value of the gray value, the gray value and the next gray value of the gray value form a gray value pair, the gray value pair is used as the object to be encrypted, the intersection point of the polynomials corresponding to the first gray value and the second gray value of the gray value pair is used as an encryption result of the object to be encrypted, when the gray value is equal to the next gray value of the gray value, a plurality of gray values equal and continuous to the gray value form a gray value sequence, the gray value sequence is used as the object to be encrypted, and taking the intersection point of the polynomial corresponding to the run length equal to the length of the gray value sequence and the polynomial corresponding to the gray value as an encryption result of the object to be encrypted.
Preferably, the setting of a polynomial for each gray value and each run length in a preset range includes sequentially obtaining polynomials corresponding to each object in order with all gray values and all run lengths in a preset range as objects, including determining the number of single polynomials constituting the polynomials corresponding to the objects according to the magnitude relation of a plurality of second chaos values adjacent to each other in the second chaos sequenceFront in the second chaotic sequenceThe second chaos values are respectively used as the frontNumber of single item type number of times, item 1The individual term being a constant term, i.e. the firstThe number of times of the single item is equal to 0, and the front part in the third chaotic sequenceThe third chaos value is used as the coefficient of each single item respectivelyDeleting the second chaos value from the second chaos sequence, and thenThe third chaotic value is deleted from the third chaotic sequence.
Preferably, the number of the single expressions of the polynomials corresponding to the constituent objects is determined according to the magnitude relation of the adjacent second chaos values in the second chaos sequenceThe method comprises the following steps of responding to the magnitude relation of the first 3 second chaos values in the second chaos sequence: the number of single expressions constituting the polynomial corresponding to the object ;、、The first 3 second chaos values in the second chaos sequence are respectively represented by the 1 st second chaos value, the 2 nd second chaos value and the 3 rd second chaos value, and the magnitude relation responding to the first 3 second chaos values in the second chaos sequence is as follows: And is also provided with The number of single expressions constituting the polynomial corresponding to the objectThe magnitude relation in response to the first 2 second chaotic values in the second chaotic sequence is: the number of single expressions constituting the polynomial corresponding to the object 。
Preferably, the polynomial corresponding to the object is specifically: Wherein, the method comprises the steps of, A dependent variable representing a polynomial corresponding to the object,An argument representing a polynomial corresponding to the object,Representing the first polynomial of the objectThe number of individual items is one,Represents the firstCoefficient of single item, and,Representing the third chaotic sequenceA third chaotic value is obtained, and the third chaotic value,Represent the firstNumber of times of single item, and,Representing the first in the second chaotic sequenceA second chaos value is obtained for the second signal,Represent the firstIndividual coefficients, and,Representing the third chaotic sequenceAnd a third chaos value.
Preferably, the method further comprises the steps of taking an intersection point of polynomials corresponding to any two gray values and an intersection point of polynomials corresponding to each gray value and polynomials corresponding to each run length as target data points, responding to the existence of the intersection point between the polynomials corresponding to the first gray value and the polynomials corresponding to the second gray value in the gray value pair, and at least two target data points (including the intersection point) identical to the intersection point exist in all the target data points, or no intersection point exists between the polynomials corresponding to the first gray value and the polynomials corresponding to the second gray value in the gray value pair, taking any one data point of the polynomials corresponding to the first gray value in the gray value pair as an encryption result of the first gray value, taking any one data point of the polynomials corresponding to the second gray value in the gray value pair as an encryption result of the second gray value, and forming the encryption result of the first gray value and the encryption result of the second gray value into the encryption result of the object to be encrypted.
Preferably, the method further comprises the steps of dividing the intersection point of polynomials corresponding to any two gray values and the intersection point of polynomials corresponding to each gray value and polynomials corresponding to each run length into a plurality of gray value subsequences, and in response to the existence of the intersection point between the polynomials corresponding to the run lengths equal to the lengths of the gray value subsequences and the polynomials corresponding to the gray values, and the existence of at least two target data points (including the intersection point) identical to the intersection point in all target data points, or the absence of the intersection point between the polynomials corresponding to the run lengths equal to the lengths of the gray value sequence and the polynomials corresponding to the gray values, dividing the gray value sequence into a plurality of gray value subsequences, requiring the sum of the lengths of all gray value subsequences to be equal to the lengths of the gray value subsequences, and the polynomials corresponding to the gray values exist, and the polynomials corresponding to the gray values do not exist in all target data points except for the intersection point, encrypting the result is achieved by encrypting the result.
Preferably, the three secret keys are obtained by randomly generating 3 different initial values in a value range [0,1] of an initial value of a one-dimensional Logistic chaotic mapping function, randomly generating 3 different parameters in a value range (3.57,4) of parameters, forming a first secret key by the 1 st initial value and the 1 st parameter, forming a second secret key by the 2 nd initial value and the 2 nd parameter, and forming a third secret key by the 3 rd initial value and the 3 rd parameter.
Preferably, the method for acquiring the first chaotic sequence comprises the steps of taking a first key as an initial value and a parameter of a one-dimensional Logistic chaotic mapping function, and iterating the one-dimensional Logistic chaotic mapping functionNext, obtainA first number of the values of the first number,Representing the length of the I-frame image,Representing the width of the I frame image, then the first chaotic sequenceFirst chaos value,The range of the values is as follows,Representation acquisitionA first number of the values of the first number,Representing a rounding down.
Preferably, the second chaotic sequence acquisition method comprises the steps of taking a second secret key as an initial value and a parameter of a one-dimensional Logistic chaotic mapping function, and iterating the one-dimensional Logistic chaotic mapping functionNext, obtainA second number of the values of the first number,Representing a preset value, and then the first chaotic sequence is in the second chaotic sequenceSecond chaos value,The range of the values is as follows,Representation acquisitionA second number of the values of the first number,A polynomial representing the decimal point with the significant digits preserved,Representing the numerical valueAfter the decimal point of (1) significant digits remain.
Preferably, the method for acquiring the third chaotic sequence comprises the steps of taking a third secret key as an initial value and a parameter of a one-dimensional Logistic chaotic mapping function, and iterating the one-dimensional Logistic chaotic mapping functionNext, obtainThird numerical value, then the third chaotic sequence is the thirdThird chaos value,The range of the values is as follows,Representation acquisitionA third number of the values of the first and second values,A polynomial representing the decimal point with the significant digits preserved,Representing the numerical valueAfter the decimal point of (1) significant digits remain.
The invention has the beneficial effects that:
In the encryption process of the plaintext sequence, corresponding gray values, gray value pairs and gray value sequences are used as objects to be encrypted according to the size relation of adjacent gray values, and the number of the objects to be encrypted is different due to different distribution conditions of the size relation of the adjacent gray values in different plaintext sequences, so that the lengths of the finally obtained encryption results of different plaintext sequences are different, meanwhile, any data point in a polynomial corresponding to the gray values is used as the encryption result of the objects to be encrypted, so that the encryption results of the same gray values in the plaintext sequence are also different, the statistical characteristics of the encryption results of the plaintext sequence are changed compared with the statistical characteristics of the I-frame images in the monitoring video information of the train set, and at the moment, the encryption results of the I-frame images can resist statistical analysis attacks, so that the transmission safety of the monitoring video information of the train set is enhanced.
Drawings
The above, as well as additional purposes, features, and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description when read in conjunction with the accompanying drawings. In the drawings, embodiments of the invention are illustrated by way of example and not by way of limitation, and like reference numerals refer to similar or corresponding parts and in which:
FIG. 1 schematically illustrates a system block diagram of a subway vehicle-mounted PIS information secure transmission system based on a blockchain technology in the present invention;
fig. 2 schematically shows an I-frame image in the car group monitoring video information;
fig. 3 schematically shows a gray-scale histogram of an I-frame image in the car group monitoring video information;
fig. 4 schematically shows a scrambled image of an I-frame image in the car group monitoring video information;
fig. 5 schematically shows a gray-scale histogram of a scrambled image of an I-frame image in the car group monitoring video information.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.
The method and the system can help an operation center to monitor the running state of the train in real time and timely find and solve faults and abnormal conditions by transmitting the vehicle-mounted data, the vehicle-mounted data comprise vehicle-mounted running data information and vehicle-mounted monitoring video information, the vehicle-mounted running data information is numerical data, the vehicle-mounted monitoring video information is image-type data, the vehicle-mounted running data information is encrypted through a dynamic information encryption algorithm such as an RSA encryption algorithm, but the encryption algorithm is not suitable for directly encrypting large-block data such as images, the calculation cost is very high, and the chaotic mapping function is suitable for encrypting images with large data quantity and strong correlation.
The method comprises the steps of collecting train monitoring video information through video monitoring equipment, dividing the train monitoring video information into an I frame image, a P frame image and a B frame image through H.264 coding, wherein the H.264 coding is a video compression processing technology, three frame images are defined in an H.264 protocol, the completely coded I frame image, the P frame image which is generated by referring to a previous I frame and only comprises difference part coding and the B frame image which is generated by referring to a previous I frame and a previous and next frame coding, wherein the I frame image is a core image which completely retains the train monitoring video information, therefore, the I frame image is required to be encrypted, so that the transmission safety of the train monitoring video information in vehicle-mounted data is ensured, and the gray value range of pixel points in the I frame image is [0,255].
The invention provides a subway vehicle-mounted PIS information safety transmission system based on a block chain technology. As shown in fig. 1, the system for securely transmitting PIS information on board a subway based on a blockchain technology includes a first module 101, a second module 102, a third module 103, and a fourth module 104, which will be described in detail below.
A first module 101, configured to generate three chaotic sequences according to the chaotic mapping function and the three keys.
It should be noted that, the chaotic mapping function has pseudo-randomness, sensitivity to initial conditions, aperiodicity and long-term unpredictability, and is often used as a key generator.
Specifically, the value range of the initial value of the one-dimensional Logistic chaotic mapping function is [0,1], the value range of the parameter is (3.57,4), 3 different initial values are randomly generated in the value range of the initial value of the one-dimensional Logistic chaotic mapping function [0,1], 3 different parameters are randomly generated in the value range of the parameter (3.57,4), the 1 st initial value and the 1 st parameter form a first key, the 2 nd initial value and the 2 nd parameter form a second key, and the 3 rd initial value and the 3 rd parameter form a third key.
The key is agreed by both the subway vehicle-mounted PIS information system and the data center control system, and the key is not required to be transmitted when the vehicle-mounted data is transmitted, so that the security of the key is improved, and the transmission security of the vehicle-mounted data is further improved.
Further, the first secret key is used as an initial value and a parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iteratedNext, obtainA first number of the values of the first number,Representing the length of the I-frame image,Representing the width of the I frame image, and the total number of all pixel points in the I frame image is equal toAnd then the first chaotic sequence is the firstFirst chaos value,The range of the values is as follows,Representation acquisitionA first number of the values of the first number,Representing a rounding down.
Further, the second secret key is used as an initial value and a parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iteratedNext, obtainA second number of the values of the first number,Representing a preset value, the number of integers in the preset range being equal toThe number of kinds of all gray values is equal toAnd then the first chaotic sequence is in the second chaotic sequenceSecond chaos value,Representation acquisitionA second number of the values of the first number,A polynomial representing the decimal point with the significant digits preserved,Representing the numerical valueAfter the decimal point of (1) significant digits remain.
Wherein the preset range is,Representing a preset value which can be set according to actual application scenes and requirements, wherein the value range of the preset value is as followsAnd is an integer, the present invention sets the preset value to 10.
Further, all integers within a predetermined range are taken as run lengths, and therefore, the number of kinds of all run lengths is equal to,Representing a preset value.
Further, the third secret key is used as an initial value and a parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iteratedNext, obtainThird numerical value, then the third chaotic sequence is the thirdThird chaos value,The range of the values is as follows,Representation acquisitionA third number of the values of the first and second values,A polynomial representing the decimal point with the significant digits preserved,Representing the numerical valueAfter the decimal point of (1) significant digits remain.
In other embodiments, other chaotic mapping functions may be used to construct a key and generate a chaotic sequence, such as a Henon chaotic mapping function, a Sine chaotic mapping function, a Kent chaotic mapping function, a Tent chaotic mapping function, and the like.
The second module 102 is configured to scramble all the pixels in the I-frame image in the monitoring video information of the vehicle group through the first chaotic sequence, and form the gray values of all the scrambled pixels into a plaintext sequence.
Specifically, the first chaotic sequence is used as a step sequence, all pixel points in an I frame image in the monitoring video information of the vehicle group are scrambled through step-variable Joseph traversal, and gray values of all the scrambled pixel points form a plaintext sequence.
It should be noted that, the scrambling is performed on the I-frame image by using the variable step length joseph traversal, so that the relevance between the pixels in the I-frame image is broken, and the originally adjacent pixels become no longer adjacent, so that the strong relevance between the pixels in the I-frame image is broken.
The gray level histogram of the I-frame image is shown in fig. 3, the scrambled image is shown in fig. 4, the gray level histogram of the scrambled image is shown in fig. 5, and the statistical characteristics of the scrambled image are identical to those of the image before scrambling (I-frame image).
It should be noted that, the chaotic mapping function is suitable for encrypting the I-frame image with large data volume and strong correlation, but the encryption method only scrambles the positions of the pixels, only can destroy the strong correlation of the image, and does not destroy the statistical characteristics of the image, at this time, the encryption result of the monitoring video information of the train set cannot resist the statistical analysis attack, and the transmission security is poor.
A third module 103, configured to set a polynomial for each gray value and each run length according to the second chaotic sequence and the third chaotic sequence.
Specifically, all gray values and all run lengths are taken as objects, polynomials corresponding to the objects are sequentially obtained according to the sequence, the polynomials are composed of a plurality of single expressions, the times of each single expression are the second chaotic values in the second chaotic sequence, and the coefficients of each single expression are the third chaotic values in the third chaotic sequence.
Further, for any one object, the specific method for obtaining the polynomial corresponding to the object comprises the steps of determining the number of single expressions constituting the polynomial corresponding to the object according to the magnitude relation of a plurality of adjacent second chaos values in the second chaos sequenceFront in the second chaotic sequenceThe second chaos values are respectively used as the frontNumber of single item type number of times, item 1The individual term being a constant term, i.e. the firstThe number of times of the single item is equal to 0, and the front part in the third chaotic sequenceThe third chaos value is used as the coefficient of each single item respectivelyDeleting the second chaos value from the second chaos sequence, and thenThe third chaotic value is deleted from the third chaotic sequence.
Determining the number of single expressions constituting the polynomial corresponding to the object according to the magnitude relation of a plurality of adjacent second chaos values in the second chaos sequenceComprising:
1. the magnitude relation in response to the first 3 second chaotic values in the second chaotic sequence is: the number of single expressions constituting the polynomial corresponding to the object That is, the polynomial corresponding to the object is composed of 4 singletons;、、 Respectively representing a1 st second chaotic value, a2 nd second chaotic value and a 3 rd second chaotic value in the second chaotic sequence.
2. The magnitude relation in response to the first 3 second chaotic values in the second chaotic sequence is: And is also provided with The number of single expressions constituting the polynomial corresponding to the objectThat is, the polynomial corresponding to the object is composed of 3 single expressions.
3. The magnitude relation in response to the first 2 second chaotic values in the second chaotic sequence is: the number of single expressions constituting the polynomial corresponding to the object That is, the polynomial corresponding to the object is composed of 2 single expressions.
Further, the polynomial corresponding to the object is specifically:
;
Wherein, A dependent variable representing a polynomial corresponding to the object,An argument representing a polynomial corresponding to the object,Representing the first polynomial of the objectThe number of individual items is one,Represents the firstCoefficient of single item, and,Representing the third chaotic sequenceA third chaotic value is obtained, and the third chaotic value,Represent the firstNumber of times of single item, and,Representing the first in the second chaotic sequenceA second chaos value is obtained for the second signal,The number of single expressions constituting the polynomial corresponding to the object is expressed,Represent the firstIndividual coefficients, and,Representing the third chaotic sequenceThird chaos value, theThe individual term is a constant term, and therefore, the firstThe number of individual terms equals 0.
It should be noted that, according to the magnitude relation of the adjacent second chaos values in the second chaos sequence, the invention determines the number of single expressions forming the polynomial corresponding to the object, and the number of single expressions in the polynomials of different objects is different, so that the coefficients and times of the single expressions selected from the second chaos sequence and the third chaos sequence are also different, the complexity of the polynomials of different objects is increased, the difficulty of cracking the polynomials of all objects is further improved, and the capability of the encryption result of the monitoring video information of the vehicle group against statistical analysis attack is improved.
And a fourth module 104, configured to encrypt each gray value in the plaintext sequence according to the polynomial corresponding to the gray value and the polynomial corresponding to the run length, so as to obtain an encryption result of the plaintext sequence.
Specifically, each gray value in the plaintext sequence is sequentially encrypted according to a polynomial corresponding to the gray value and a polynomial corresponding to the run length, so as to obtain an encryption result of the plaintext sequence, specifically:
1. When the gray value is larger than the next gray value of the gray value, the gray value is taken as an object to be encrypted, any data point in a polynomial corresponding to the gray value is taken as an encryption result of the object to be encrypted, and the special explanation is needed that the data point which is the encryption result of the object to be encrypted cannot be a target data point.
The target data point comprises an intersection point of polynomials corresponding to any two gray values and an intersection point of polynomials corresponding to each gray value and polynomials corresponding to each run length.
In the process of encrypting the plaintext sequence, any data point in the polynomial corresponding to the gray value is used as an encryption result of the object to be encrypted, so that the encryption result of the same gray value in the plaintext sequence is also different, the statistical characteristic of the encryption result of the plaintext sequence is changed compared with the statistical characteristic of the I frame image in the monitoring video information of the train set, at the moment, the encryption result of the I frame image can resist statistical analysis attack, and the transmission safety of the monitoring video information of the train set is enhanced.
2. When the gray value is smaller than the next gray value of the gray value, the gray value and the next gray value of the gray value form a gray value pair, the gray value pair is taken as an object to be encrypted, and the intersection point of the polynomial corresponding to the first gray value and the polynomial corresponding to the second gray value in the gray value pair is taken as an encryption result of the object to be encrypted.
And in response to the fact that no intersection point exists between the polynomial corresponding to the first gray value and the polynomial corresponding to the second gray value in the gray value pair, taking any data point in the polynomial corresponding to the first gray value in the gray value pair as an encryption result of the first gray value, taking any data point in the polynomial corresponding to the second gray value in the gray value pair as an encryption result of the second gray value, and forming the encryption result of the first gray value and the encryption result of the second gray value into an encryption result of an object to be encrypted.
And in response to the existence of an intersection point between the polynomial corresponding to the first gray value and the polynomial corresponding to the second gray value in the gray value pair and the existence of at least two target data points (including the intersection point itself) which are the same as the intersection point, at the moment, taking any one data point in the polynomial corresponding to the first gray value in the gray value pair as an encryption result of the first gray value, taking any one data point in the polynomial corresponding to the second gray value in the gray value pair as an encryption result of the second gray value, and forming the encryption result of the first gray value and the encryption result of the second gray value into an encryption result of an object to be encrypted.
It should be noted that the data points as the encryption result of the first gradation value and the encryption result of the second gradation value cannot be target data points.
3. When the gray value is equal to the next gray value of the gray value, a plurality of gray values which are equal and continuous with the gray value form a gray value sequence, the gray value sequence is taken as an object to be encrypted, and the intersection point of a polynomial corresponding to the length of the gray value sequence and a polynomial corresponding to the gray value is taken as an encryption result of the object to be encrypted.
In response to the fact that no intersection point exists between a polynomial corresponding to a run length equal to the length of the gray value sequence and a polynomial corresponding to the gray value, splitting the gray value sequence into a plurality of gray value subsequences, requiring that the sum of the lengths of all the gray value subsequences is equal to the length of the gray value sequence, the polynomial corresponding to the run length equal to the length of each gray value subsequence and the polynomial corresponding to the gray value have an intersection point, and no target data point identical to the intersection point except the intersection point exists in all target data points, at the moment, taking the intersection point of the polynomial corresponding to the run length equal to the length of each gray value subsequence and the polynomial corresponding to the gray value as an encryption result of each gray value subsequence, and forming the encryption result of all the gray value subsequences into the encryption result of the object to be encrypted.
In response to the existence of an intersection point between a polynomial corresponding to a run length equal to the length of the gray value sequence and a polynomial corresponding to the gray value, and at least two target data points (including the intersection point itself) identical to the intersection point exist in all target data points, at this time, the gray value sequence is split into a plurality of gray value subsequences, the sum of the lengths of all the gray value subsequences is required to be equal to the length of the gray value sequence, and the intersection point exists between the polynomial corresponding to the run length equal to the length of each gray value subsequence and the polynomial corresponding to the gray value, and no target data point identical to the intersection point exists in all the target data points except for the intersection point itself, at this time, the intersection point of the polynomial corresponding to the run length equal to the length of each gray value subsequence and the polynomial corresponding to the gray value is taken as the encryption result of each gray value subsequence, and the encryption result of all the gray value subsequences is combined into the encryption result of the object to be encrypted.
In the process of encrypting the plaintext sequence, the corresponding gray value, gray value pairs and gray value sequences are used as objects to be encrypted according to the magnitude relation of the adjacent gray values, and the quantity of the objects to be encrypted is different due to the fact that the magnitude relation of the adjacent gray values in different plaintext sequences is different, so that the lengths of the finally obtained encryption results of different plaintext sequences are different, the statistical characteristics of the encryption results of the plaintext sequences are changed compared with the statistical characteristics of the I-frame images in the monitoring video information of the train set, at the moment, the encryption results of the I-frame images can resist statistical analysis attacks, and the transmission safety of the monitoring video information of the train set is enhanced.
Further, the subway vehicle-mounted PIS information system sends encryption results of all plaintext sequences, all P frame images and all B frame images to the data center control system, the data center control system decrypts the encryption results of the plaintext sequences according to keys agreed by both parties to obtain all I frame images of the vehicle group monitoring video information, and decodes all I frame images, all P frame images and all B frame images through H.264 coding to obtain the vehicle group monitoring video information.
In the description of the present specification, the meaning of "a plurality", "a number" or "a plurality" is at least two, for example, two, three or more, etc., unless explicitly defined otherwise.
While various embodiments of the present invention have been shown and described herein, it will be obvious to those skilled in the art that such embodiments are provided by way of example only. Many modifications, changes, and substitutions will now occur to those skilled in the art without departing from the spirit and scope of the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed in practicing the invention.

Claims (9)

1.基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，包括：1. The subway vehicle PIS information security transmission system based on blockchain technology is characterized by including: 第一模块，用于根据混沌映射函数和三个密钥，生成三个混沌序列；The first module is used to generate three chaotic sequences according to the chaotic mapping function and three keys; 第二模块，用于通过第一混沌序列，对车组监控视频信息中的I帧图像中所有像素点进行置乱，将置乱后的所有像素点的灰度值组成明文序列；The second module is used to scramble all the pixels in the I frame image in the vehicle group monitoring video information through the first chaotic sequence, and form a plaintext sequence with the gray values of all the scrambled pixels; 第三模块，用于给每种灰度值和预设范围内的每种游程长度分别设置一个多项式，所述多项式由多个单项式组成，各单项式的次数是第二混沌序列中的第二混沌值，各单项式的系数是第三混沌序列中的第三混沌值，将所有灰度值和预设范围内的所有游程长度作为对象，按照顺序依次获得各对象对应的多项式，包括：根据第二混沌序列中相邻的多个第二混沌值的大小关系，确定组成对象对应的多项式的单项式的数量L；将第二混沌序列中前L-1个第二混沌值分别作为前L-1个单项式的次数，第L个单项式为常数项，第L个单项式的次数等于0；将第三混沌序列中前L个第三混沌值分别作为各单项式的系数；将前L-1个第二混沌值从第二混沌序列中删除，将前L个第三混沌值从第三混沌序列中删除；The third module is used to set a polynomial for each gray value and each run length within a preset range, the polynomial is composed of multiple monomials, the degree of each monomial is the second chaotic value in the second chaotic sequence, the coefficient of each monomial is the third chaotic value in the third chaotic sequence, all gray values and all run lengths within the preset range are taken as objects, and the polynomials corresponding to each object are obtained in sequence, including: according to the size relationship of multiple adjacent second chaotic values in the second chaotic sequence, the number L of monomials constituting the polynomial corresponding to the object is determined; the first L-1 second chaotic values in the second chaotic sequence are respectively used as the degrees of the first L-1 monomials, the Lth monomial is a constant term, and the degree of the Lth monomial is equal to 0; the first L third chaotic values in the third chaotic sequence are respectively used as the coefficients of each monomial; the first L-1 second chaotic values are deleted from the second chaotic sequence, and the first L third chaotic values are deleted from the third chaotic sequence; 第四模块，用于根据灰度值以及游程长度对应的多项式，按照顺序依次对明文序列中的各灰度值进行加密，获得明文序列的加密结果，包括：The fourth module is used to encrypt each gray value in the plaintext sequence in sequence according to the gray value and the polynomial corresponding to the run length to obtain the encryption result of the plaintext sequence, including: 当该灰度值大于该灰度值的下一个灰度值时，将该灰度值作为待加密对象，将该灰度值对应的多项式中任一数据点作为待加密对象的加密结果；When the gray value is greater than the next gray value of the gray value, the gray value is used as the object to be encrypted, and any data point in the polynomial corresponding to the gray value is used as the encryption result of the object to be encrypted; 当该灰度值小于该灰度值的下一个灰度值时，将该灰度值以及该灰度值的下一个灰度值组成一个灰度值对，将该灰度值对作为待加密对象，将该灰度值对中第一个灰度值对应的多项式和第二个灰度值对应的多项式的交点作为待加密对象的加密结果；When the gray value is less than the next gray value of the gray value, the gray value and the next gray value of the gray value are combined into a gray value pair, the gray value pair is used as the object to be encrypted, and the intersection of the polynomial corresponding to the first gray value and the polynomial corresponding to the second gray value in the gray value pair is used as the encryption result of the object to be encrypted; 当该灰度值等于该灰度值的下一个灰度值时，将与该灰度值相等且连续的多个灰度值组成一个灰度值序列，将该灰度值序列作为待加密对象，将与该灰度值序列的长度相等的游程长度对应的多项式和该灰度值对应的多项式的交点作为待加密对象的加密结果。When the grayscale value is equal to the next grayscale value of the grayscale value, multiple grayscale values that are equal to and continuous with the grayscale value are combined into a grayscale value sequence, and the grayscale value sequence is used as the object to be encrypted. The intersection of the polynomial corresponding to the run length equal to the length of the grayscale value sequence and the polynomial corresponding to the grayscale value is used as the encryption result of the object to be encrypted. 2.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述根据第二混沌序列中相邻的多个第二混沌值的大小关系，确定组成对象对应的多项式的单项式的数量L，包括：2. According to the subway vehicle PIS information security transmission system based on blockchain technology in claim 1, it is characterized in that the number L of monomials of the polynomial corresponding to the constituent object is determined according to the size relationship of the adjacent multiple second chaotic values in the second chaotic sequence, including: 响应于第二混沌序列中的前3个第二混沌值的大小关系为：D21＞D22>D23，则组成该对象对应的多项式的单项式的数量L＝4；D21、D22、D23分别表示第二混沌序列中的第1个第二混沌值、第2个第二混沌值和第3个第二混沌值；In response to the magnitude relationship of the first three second chaotic values in the second chaotic sequence being: D2 1 >D2 2 >D2 3 , the number of monomials constituting the polynomial corresponding to the object is L=4; D2 1 , D2 2 , and D2 3 represent the first second chaotic value, the second second chaotic value, and the third second chaotic value in the second chaotic sequence, respectively; 响应于第二混沌序列中的前3个第二混沌值的大小关系为：D21＞D22且D22≤D23，则组成该对象对应的多项式的单项式的数量L＝3；In response to the relationship between the first three second chaotic values in the second chaotic sequence being: D2 1 >D2 2 and D2 2 ≤D2 3 , the number of monomials constituting the polynomial corresponding to the object is L=3; 响应于第二混沌序列中的前2个第二混沌值的大小关系为：D21≤D22，则组成该对象对应的多项式的单项式的数量L＝2。In response to the relationship between the first two second chaotic values in the second chaotic sequence being: D2 1 ≤D2 2 , the number of monomials constituting the polynomial corresponding to the object is L=2. 3.根据权利要求2所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述该对象对应的多项式具体为：3. According to the subway vehicle PIS information security transmission system based on blockchain technology in claim 2, it is characterized in that the polynomial corresponding to the object is specifically: 其中，y表示该对象对应的多项式的因变量，x表示该对象对应的多项式的自变量，表示该对象对应的多项式的第r个单项式，ar表示第r个单项式的系数，且ar＝D3r，D3r表示第三混沌序列中的第r个第三混沌值，γr表示第r个单项式的次数，且γr＝D2r，D2r表示第二混沌序列中的第r个第二混沌值，aL表示第L个单项式的系数，且aL＝D3L，D3L表示第三混沌序列中的第L个第三混沌值。Among them, y represents the dependent variable of the polynomial corresponding to the object, and x represents the independent variable of the polynomial corresponding to the object. represents the r-th monomial of the polynomial corresponding to the object, a r represents the coefficient of the r-th monomial, and a r =D3 r , D3 r represents the r-th third chaotic value in the third chaotic sequence, γ r represents the degree of the r-th monomial, and γ r =D2r, D2 r represents the r-th second chaotic value in the second chaotic sequence, a L represents the coefficient of the L-th monomial, and a L =D3 L , D3 L represents the L-th third chaotic value in the third chaotic sequence. 4.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，获得所述待加密对象的加密结果，还包括：4. According to the subway vehicle PIS information security transmission system based on blockchain technology in claim 1, it is characterized in that obtaining the encryption result of the object to be encrypted also includes: 将任意两种灰度值对应的多项式的交点以及各灰度值对应的多项式和各游程长度对应的多项式的交点，作为目标数据点；The intersection of the polynomials corresponding to any two gray values and the intersection of the polynomial corresponding to each gray value and the polynomial corresponding to each run length are taken as target data points; 响应于该灰度值对中第一个灰度值对应的多项式和第二个灰度值对应的多项式之间存在交点，且所有目标数据点中存在至少两个和该交点相同的目标数据点，所述和该交点相同的目标数据点包括该交点自身，或者该灰度值对中第一个灰度值对应的多项式和第二个灰度值对应的多项式之间不存在交点，则将该灰度值对中第一个灰度值对应的多项式中任一数据点作为第一个灰度值的加密结果，将灰度值对中第二个灰度值对应的多项式中任一数据点作为第二个灰度值的加密结果，将第一个灰度值的加密结果和第二个灰度值的加密结果组成待加密对象的加密结果。In response to the existence of an intersection between the polynomial corresponding to the first grayscale value in the grayscale value pair and the polynomial corresponding to the second grayscale value, and the existence of at least two target data points identical to the intersection among all target data points, the target data points identical to the intersection including the intersection itself, or the absence of an intersection between the polynomial corresponding to the first grayscale value in the grayscale value pair and the polynomial corresponding to the second grayscale value, any data point in the polynomial corresponding to the first grayscale value in the grayscale value pair is used as the encryption result of the first grayscale value, any data point in the polynomial corresponding to the second grayscale value in the grayscale value pair is used as the encryption result of the second grayscale value, and the encryption result of the first grayscale value and the encryption result of the second grayscale value are combined to form the encryption result of the object to be encrypted. 5.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，获得所述待加密对象的加密结果，还包括：5. According to the subway vehicle PIS information security transmission system based on blockchain technology in claim 1, it is characterized in that obtaining the encryption result of the object to be encrypted also includes: 将任意两种灰度值对应的多项式的交点以及各灰度值对应的多项式和各游程长度对应的多项式的交点，作为目标数据点；The intersection of the polynomials corresponding to any two gray values and the intersection of the polynomial corresponding to each gray value and the polynomial corresponding to each run length are taken as target data points; 响应于与该灰度值序列的长度相等的游程长度对应的多项式和该灰度值对应的多项式之间存在交点，且所有目标数据点中存在至少两个和该交点相同的目标数据点，所述和该交点相同的目标数据点包括该交点自身，或者与该灰度值序列的长度相等的游程长度对应的多项式和该灰度值对应的多项式之间不存在交点，将该灰度值序列拆分为多个灰度值子序列，要求所有灰度值子序列的长度之和等于该灰度值序列的长度，且与各灰度值子序列的长度相等的游程长度对应的多项式和该灰度值对应的多项式都存在交点，且所有目标数据点中除了该交点自身不存在和该交点相同的目标数据点，将与各灰度值子序列的长度相等的游程长度对应的多项式和该灰度值对应的多项式的交点作为各灰度值子序列的加密结果，将所有灰度值子序列的加密结果组成待加密对象的加密结果。In response to the existence of an intersection between a polynomial corresponding to a run length equal to the length of the gray value sequence and a polynomial corresponding to the gray value, and at least two target data points identical to the intersection exist among all target data points, the target data points identical to the intersection include the intersection itself, or there is no intersection between a polynomial corresponding to a run length equal to the length of the gray value sequence and a polynomial corresponding to the gray value, the gray value sequence is split into multiple gray value subsequences, requiring that the sum of the lengths of all gray value subsequences is equal to the length of the gray value sequence, and that a polynomial corresponding to a run length equal to the length of each gray value subsequence and a polynomial corresponding to the gray value both have an intersection, and that among all target data points, there is no target data point identical to the intersection except the intersection itself, the intersection of a polynomial corresponding to a run length equal to the length of each gray value subsequence and a polynomial corresponding to the gray value is used as an encryption result of each gray value subsequence, and the encryption results of all gray value subsequences constitute the encryption result of the object to be encrypted. 6.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述三个密钥的获取方法为：6. According to the subway vehicle PIS information security transmission system based on blockchain technology according to claim 1, it is characterized in that the method for obtaining the three keys is: 在一维Logistic混沌映射函数的初始值的取值范围[0,1]内随机产生3个不同的初始值，在参数的取值范围(3.57,4]内随机产生3个不同的参数，将第1个初始值和第1个参数组成第一密钥，将第2个初始值和第2个参数组成第二密钥，将第3个初始值和第3个参数组成第三密钥。Three different initial values are randomly generated within the value range [0,1] of the initial value of the one-dimensional Logistic chaotic mapping function, and three different parameters are randomly generated within the value range (3.57,4] of the parameter. The first initial value and the first parameter form a first key, the second initial value and the second parameter form a second key, and the third initial value and the third parameter form a third key. 7.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述第一混沌序列的获取方法，包括：7. According to the subway vehicle PIS information security transmission system based on blockchain technology according to claim 1, it is characterized in that the method for obtaining the first chaotic sequence includes: 将第一密钥作为一维Logistic混沌映射函数的初始值和参数，将一维Logistic混沌映射函数迭代M×N+30次，获得M×N+30个第一数值，M表示I帧图像的长度，N表示I帧图像的宽度；则第一混沌序列中第i个第一混沌值i的取值范围为[1，M×N]，d1i+30表示获得i+30个第一数值，表示向下取整。The first key is used as the initial value and parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iterated M×N+30 times to obtain M×N+30 first values, where M represents the length of the I-frame image and N represents the width of the I-frame image; then the i-th first chaotic value in the first chaotic sequence is The value range of i is [1, M×N], and d1 i+30 means obtaining the i+30 first values. Indicates rounding down. 8.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述第二混沌序列的获取方法，包括：8. According to the subway vehicle PIS information security transmission system based on blockchain technology in claim 1, it is characterized in that the method for obtaining the second chaotic sequence comprises: 将第二密钥作为一维Logistic混沌映射函数的初始值和参数，将一维Logistic混沌映射函数迭代3×[256+(F-1)]+30次，获得3×[256+(F-1)]+30个第二数值，F表示预设数值；则第二混沌序列中第k个第二混沌值D2k＝round(3×d2k+30，1)，k的取值范围为[1，3×[256+(F-1)]]，d2k+30表示获得k+30个第二数值，round( )表示小数点后保留有效数字的多项式，round(3×d2k+30，1)表示数值3×d2k+30的小数点后保留1位有效数字。The second key is used as the initial value and parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iterated 3×[256+(F-1)]+30 times to obtain 3×[256+(F-1)]+30 second numerical values, where F represents a preset numerical value; then the k-th second chaotic value D2 k in the second chaotic sequence is round(3×d2 k+30 ,1), the value range of k is [1,3×[256+(F-1)]], d2 k+30 represents obtaining k+30 second numerical values, round( ) represents a polynomial with significant digits retained after the decimal point, and round(3×d2 k+30 ,1) represents retaining 1 significant digit after the decimal point of the value 3×d2 k+30 . 9.根据权利要求1所述的基于区块链技术的地铁车载PIS信息安全传输系统，其特征在于，所述第三混沌序列的获取方法，包括：9. According to the subway vehicle PIS information security transmission system based on blockchain technology according to claim 1, it is characterized in that the method for obtaining the third chaotic sequence includes: 将第三密钥作为一维Logistic混沌映射函数的初始值和参数，将一维Logistic混沌映射函数迭代4×[256+(F-1)]+30次，获得4×[256+(F-1)]+30个第三数值；则第三混沌序列中第t个第三混沌值D3t＝round(20×d3t+30-10，1)，t的取值范围为[1，4×[256+(F-1)]]，d3t+30表示获得t+30个第三数值，round()表示小数点后保留有效数字的多项式，round(20×d3t+30-10，1)表示数值20×d3t+30-10的小数点后保留1位有效数字。The third key is used as the initial value and parameter of the one-dimensional Logistic chaotic mapping function, and the one-dimensional Logistic chaotic mapping function is iterated 4×[256+(F-1)]+30 times to obtain 4×[256+(F-1)]+30 third numerical values; then the t-th third chaotic value D3 t in the third chaotic sequence =round(20×d3 t+30 -10, 1), the value range of t is [1, 4×[256+(F-1)]], d3 t+30 means that t+30 third numerical values are obtained, round() means a polynomial with significant digits retained after the decimal point, and round(20×d3 t+30 -10, 1) means that 1 significant digit is retained after the decimal point of the value 20×d3 t+30 -10.
CN202411239884.6A 2024-09-05 2024-09-05 Subway vehicle-mounted PIS information safety transmission system based on block chain technology Active CN118784208B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202411239884.6A CN118784208B (en) 2024-09-05 2024-09-05 Subway vehicle-mounted PIS information safety transmission system based on block chain technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202411239884.6A CN118784208B (en) 2024-09-05 2024-09-05 Subway vehicle-mounted PIS information safety transmission system based on block chain technology

Publications (2)

Publication Number Publication Date
CN118784208A CN118784208A (en) 2024-10-15
CN118784208B true CN118784208B (en) 2024-12-03

Family

ID=92986567

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202411239884.6A Active CN118784208B (en) 2024-09-05 2024-09-05 Subway vehicle-mounted PIS information safety transmission system based on block chain technology

Country Status (1)

Country Link
CN (1) CN118784208B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112422266A (en) * 2020-10-28 2021-02-26 郑州轻工业大学 A Hyperchaotic Encryption Method Based on Joseph Traversal and Bit-Plane Reconstruction
CN115776368A (en) * 2022-11-21 2023-03-10 西南大学 Image encryption method, electronic equipment and storage medium based on Logistic mapping scrambling offset

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116305211A (en) * 2023-03-21 2023-06-23 中国工商银行股份有限公司 Image encryption processing method and device
CN118509537B (en) * 2024-07-16 2024-10-11 中南大学 Image encryption method and device

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112422266A (en) * 2020-10-28 2021-02-26 郑州轻工业大学 A Hyperchaotic Encryption Method Based on Joseph Traversal and Bit-Plane Reconstruction
CN115776368A (en) * 2022-11-21 2023-03-10 西南大学 Image encryption method, electronic equipment and storage medium based on Logistic mapping scrambling offset

Also Published As

Publication number Publication date
CN118784208A (en) 2024-10-15

Similar Documents

Publication Publication Date Title
Pak et al. A new color image encryption using combination of the 1D chaotic map
US6266429B1 (en) Method for confirming the integrity of an image transmitted with a loss
Wu et al. Local Shannon entropy measure with statistical tests for image randomness
CN113824728A (en) Network communication method and system based on data encryption
CN106296561A (en) Image encryption method based on hyperchaotic system and device, decryption method and device
CN107292802A (en) A kind of parallel image encryption method of quantum chaos
Wang et al. Galois field-based image encryption for remote transmission of tumor ultrasound images
CN115460382A (en) Security and protection engineering monitoring data safety transmission method
Fadhil et al. Improved security of a deep learning-based steganography system with imperceptibility preservation
CN113806781A (en) Energy internet data packet encryption algorithm based on 2D-LCLM
Raghuvanshi et al. A data encryption model based on intertwining logistic map
CN118784208B (en) Subway vehicle-mounted PIS information safety transmission system based on block chain technology
Aldin et al. Quad-color image encryption based on Chaos and Fibonacci Q-matrix
Arun et al. High security cryptographic technique using steganography and chaotic image encryption
CN115205089B (en) Image encryption method, training method and device of network model and electronic equipment
CN116595548A (en) Service parameter comparison method, device, system and storage medium
CN114697671B (en) Building engineering quality management system
CN112491840B (en) Information modification method, device, computer equipment and storage medium
CN114049246A (en) Information hiding method and system based on wavelet transformation
Zhang et al. An image encryption algorithm based on an epidemic spreading model
Qin et al. Reversible Data Hiding in Encrypted Images Based on Adaptive Prediction and Labeling.
CN114389787B (en) Carrier-free information hiding method and system based on chaotic system and computer storage medium
Tripathi et al. Color images encryption by using bit plane crypt algorithm
CN118827001B (en) Internet of things gateway cloud edge end cooperative authentication method
Huang et al. Development of a Novel Hyperchaos‐Based Image Encryption Algorithm Consisting of Two Scrambling‐Diffusion Operations

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