CN104734723A - Data conversion method based on compression and scrambling - Google Patents

Data conversion method based on compression and scrambling Download PDF

Info

Publication number
CN104734723A
CN104734723A CN201510103836.9A CN201510103836A CN104734723A CN 104734723 A CN104734723 A CN 104734723A CN 201510103836 A CN201510103836 A CN 201510103836A CN 104734723 A CN104734723 A CN 104734723A
Authority
CN
China
Prior art keywords
data
scrambling
compression
length
conversion method
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.)
Pending
Application number
CN201510103836.9A
Other languages
Chinese (zh)
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.)
PLA Information Engineering University
Original Assignee
PLA Information Engineering University
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 PLA Information Engineering University filed Critical PLA Information Engineering University
Priority to CN201510103836.9A priority Critical patent/CN104734723A/en
Publication of CN104734723A publication Critical patent/CN104734723A/en
Pending legal-status Critical Current

Links

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention discloses a data conversion method based on compression and scrambling, and provides the conversion method capable of achieving data compression and protecting data safety. The method comprises a data conversion process and a data recovery process. The data conversion process is as follow, original data D and a bit length L of the original data D are known, the original data D are compressed by using a data compression algorithm F, compressed data DF are obtained, and the length is LF bits (LF<=L); a scrambling position X and a scrambling length LX are randomly selected from the DF, data scrambling G is applied to a data bit, starting from X and having a length of LX, in the DF by using the data scrambling G, and scrambled data DFG are obtained. The data recovery process is as follow, data descrambling G' is applied to a data bit, starting from X and having a length of LX, in the scrambled data DFG, and compressed data DF are obtained; the DF is decompressed by using decompression algorithm F', and the original data D is obtained. According to the data conversion method, the data length is shortened, and the data security is improved.

Description

A kind of based on compression and the data conversion method of scrambling
Technical field
This invention relates to a kind of transform method of computer security, particularly relates to a kind of based on compression and the data conversion method of scrambling.
Background technology
In computer systems, which, often need to convert data.The object of conversion has multiple, may be that conveniently the other side checks, as the form of transform data; May be to save memory space or accelerating transfer rate, as the content of packed data; Also may be in order to safety, as being encrypted data.
The main purpose of security transformation is the safety of protected data.After conversion, true content and the primitive attribute of data are hidden, and only know about transform method, grasp the user of alternate key and could be reduced.Even if data are intercepted and captured or stolen in the processes such as transmission, process, storage, stealer is also difficult to the true meaning of restoring data, thus can promote the fail safe of data.
Conventional data transformation mode has compression (as LZW, LZ, DEFLATE etc.) and encryption (as DES, AES, RSA etc.).Compression can reduce the scale of data, and encryption can the safety of protected data.Not only reduce data scale but also protected data safety if think, compression can be combined with encryption.But data were not only compressed but also encrypted and had needed Dual Transform, more complicated, also more consuming time.Therefore need a kind of simply, fast, not only can realize data compression but also can the transform method of protected data safety to improve this situation.
Summary of the invention
Instant invention overcomes in prior art, need a kind ofly simply, fast, not only can realize data compression but also can the problem of transform method of protected data safety, a kind of simple and quick data conversion method based on compression and scrambling is provided.
Technical solution of the present invention is: containing data transformation procedure and data convert process, data transformation procedure is as follows, known former data D and the long L in position thereof, choose any one kind of them data compression algorithm F, compress former data D with F, obtain compressing rear data DF, length is LF(LF≤L) position; In DF, Stochastic choice scrambling position X and scrambling length LX, selects a kind of data scrambling G to operate, in DF from X, length is that the data bit of LX applies data scrambling G operation, obtains the data DFG after scrambling; Data convert process is as follows, in the data DFG after scrambling from X, length is that the data bit of LX applies data de-scrambling G' operation, obtain compressing rear data DF; With decompression algorithm F', decompression is carried out to DF and obtain former data D.
The packet etc. that described former data D can be whole file, the small fragment of large files, network transmit.
Described data compression algorithm F can be LZ, LZW, DEFLATE etc. any one.
Described data scrambling G operation can be any one data bit operations such as step-by-step negate, XOR.
Described scrambling position X is a certain position after compression in data DF, and should satisfy condition 0≤X≤LF-1.
Described scrambling length LX carries out the figure place of scrambling conversion to data after compression, and should satisfy condition 1≤LX≤LF-X+1.
The data bit of described scrambling can be continuous print, also can be discontinuous, and the data bits of scrambling is at least 1, is at most the length of data after compression.
Compared with prior art, the present invention is based on compression and the data conversion method of scrambling has the following advantages: combine to the compresses in length of data and content conversion, both reduced the length of data, turn improved the fail safe of data.Even if the data DFG after conversion is intercepted and captured or steals, can only have several as follows to its result of carrying out decompress(ion):
(1) cannot decompress.Although the compression method of data DFG can obtain, decompression algorithm can find that data are tampered, its proper solution cannot be compressed.
(2) data after decompressing cannot be opened.Even if decompressed by DFG by force, what obtain is also no longer former data, cannot open it with normal instrument.
(3) data after decompressing cannot use.Namely allow to the data decompressed by force to open, its content is also chaotic, cannot normally use.
Thus, adopt data conversion method provided by the invention, both can reduce the scale of data, the fail safe of data can be increased again.In addition, Scrambling Operation G is exactly simple bit manipulation, and only convert some position of packed data DF, its complexity is far smaller than data encryption, and compared with data compression+cryptographic algorithm, performance loss is less.
Accompanying drawing explanation
Fig. 1 is the process schematic of the data conversion method that the present invention is based on compression and scrambling.
Embodiment
Below in conjunction with the drawings and specific embodiments, the data conversion method that the present invention is based on compression and scrambling is described further: as shown in the figure, Fig. 1 gives preferred embodiment of the present invention, but the present invention can realize in many different forms, be not limited to the embodiment described by this specification.On the contrary, provide the object of these embodiments be make more thorough to the understanding of content disclosed in the present invention, comprehensively.Unless otherwise defined, all technology of using of this specification are identical with the implication that those skilled in the art understand usually with scientific terminology.The object of term used in the description of the invention just in order to describe specific embodiment is not for limiting the present invention.The term "and/or" that this specification uses comprises arbitrary and all combinations of one or more relevant Listed Items.
The present embodiment is specifically containing data transformation procedure and data convert process, and data transformation procedure is as follows, known former data D and the long L in position thereof, choose any one kind of them data compression algorithm F, compress former data D with F, obtain compressing rear data DF, length is LF(LF≤L) position; In DF, Stochastic choice scrambling position X and scrambling length LX, selects a kind of data scrambling G to operate, in DF from X, length is that the data bit of LX applies data scrambling G operation, obtains the data DFG after scrambling; Data convert process is as follows, in the data DFG after scrambling from X, length is that the data bit of LX applies data de-scrambling G' operation, obtain compressing rear data DF; With decompression algorithm F', decompression is carried out to DF and obtain former data D.
The packet etc. that described former data D can be whole file, the small fragment of large files, network transmit.
Described data compression algorithm F can be LZ, LZW, DEFLATE etc. any one.
Described data scrambling G operation can be any one data bit operations such as step-by-step negate, XOR.
Described scrambling position X is a certain position after compression in data DF, and should satisfy condition 0≤X≤LF-1.
Described scrambling length LX carries out the figure place of scrambling conversion to data after compression, and should satisfy condition 1≤LX≤LF-X+1.
The data bit of described scrambling can be continuous print, also can be discontinuous, and the data bits of scrambling is at least 1, is at most the length of data after compression.
Given data D and the long L in position thereof, data conversion method of the present invention is completed by two steps: a. data compression.Compress data D with compression algorithm F, obtain packed data DF, length is LF(LF≤L) position; B. data scrambling.Stochastic choice scrambling position X and scrambling length LX in DF, in DF from X, length is that the data bit of LX applies data scrambling G operation, obtains the data DFG after scrambling.
The data bit of scrambling can be continuous print, also can be discontinuous, and the data bits of scrambling is at least 1, is at most the length of packed data.
Data DFG after known scrambling, decompression algorithm F', scrambling position X, scrambling length LX and data de-scrambling G' operate, and data restoration method of the present invention is completed by two steps: a. data de-scrambling.To in DFG from X, length is that the data bit of LX applies data de-scrambling G' operation, obtains data DF; B. data decompression.With decompression algorithm F', decompression is carried out to DF and obtain former data D.
By other approach, compression algorithm F, scrambling position X, scrambling length LX and data scrambling G operation etc. should be passed to the user of data.If conversion is file, the information such as scrambling position X, scrambling length LX and data scrambling G operation can be kept in file metadata.If conversion is network packet, scrambling position X, scrambling length LX and data scrambling G can be operated etc. and to tell the other side by agreement.

Claims (7)

1. one kind based on compression and the data conversion method of scrambling, it is characterized in that: containing data transformation procedure and data convert process, data transformation procedure is as follows, known former data D and the long L in position thereof, choose any one kind of them data compression algorithm F, compress former data D with F, obtain compressing rear data DF, length is LF(LF≤L) position; In DF, Stochastic choice scrambling position X and scrambling length LX, selects a kind of data scrambling G to operate, in DF from X, length is that the data bit of LX applies data scrambling G operation, obtains the data DFG after scrambling; Data convert process is as follows, in the data DFG after scrambling from X, length is that the data bit of LX applies data de-scrambling G' operation, obtain compressing rear data DF; With decompression algorithm F', decompression is carried out to DF and obtain former data D.
2. according to claim 1 based on compression and the data conversion method of scrambling, it is characterized in that: described former data D can be whole file, packet etc. that the small fragment of large files, network transmit.
3. according to claim 1 based on compression and the data conversion method of scrambling, it is characterized in that: described data compression algorithm F can be LZ, LZW, DEFLATE etc. any one.
4. according to claim 1 based on compression and the data conversion method of scrambling, it is characterized in that: described data scrambling G operation can be that any one data bit such as step-by-step negate, XOR operate.
5. according to claim 1 based on compression and the data conversion method of scrambling, it is characterized in that: described scrambling position X is a certain position of compression afterwards in data DF, and should satisfy condition 0≤X≤LF-1.
6. according to claim 1 based on compression and the data conversion method of scrambling, it is characterized in that: described scrambling length LX be to compression afterwards data carry out the figure place of scrambling conversion, should satisfy condition 1≤LX≤LF-X+1.
7. according to claim 1ly it is characterized in that: the data bit of described scrambling can be continuous print, also can be discontinuous, and the data bits of scrambling is at least 1 based on compression and the data conversion method of scrambling, is at most the length of compression data afterwards.
CN201510103836.9A 2015-03-10 2015-03-10 Data conversion method based on compression and scrambling Pending CN104734723A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510103836.9A CN104734723A (en) 2015-03-10 2015-03-10 Data conversion method based on compression and scrambling

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510103836.9A CN104734723A (en) 2015-03-10 2015-03-10 Data conversion method based on compression and scrambling

Publications (1)

Publication Number Publication Date
CN104734723A true CN104734723A (en) 2015-06-24

Family

ID=53458217

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510103836.9A Pending CN104734723A (en) 2015-03-10 2015-03-10 Data conversion method based on compression and scrambling

Country Status (1)

Country Link
CN (1) CN104734723A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111371461A (en) * 2020-04-26 2020-07-03 宁夏隆基宁光仪表股份有限公司 Original code and inverse code mixed data compression method suitable for intelligent electric meter

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030133571A1 (en) * 2001-02-26 2003-07-17 Eric Chaubert Encryption of a compressed video stream
CN1604640A (en) * 2004-10-28 2005-04-06 武汉大学 A video information encrypting-decrypting method
CN1758587A (en) * 2005-09-06 2006-04-12 宏碁股份有限公司 Data processing method
CN101610088A (en) * 2008-06-17 2009-12-23 香港科技大学 Come the system and method for coded data based on compress technique with security feature
CN101741629A (en) * 2008-11-11 2010-06-16 英业达股份有限公司 Communication encryption method supporting remote monitoring system

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030133571A1 (en) * 2001-02-26 2003-07-17 Eric Chaubert Encryption of a compressed video stream
CN1494803A (en) * 2001-02-26 2004-05-05 �ɸ���Ӱ��ɷ����޹�˾ Encryption of compressed video stream
CN1604640A (en) * 2004-10-28 2005-04-06 武汉大学 A video information encrypting-decrypting method
CN1758587A (en) * 2005-09-06 2006-04-12 宏碁股份有限公司 Data processing method
CN101610088A (en) * 2008-06-17 2009-12-23 香港科技大学 Come the system and method for coded data based on compress technique with security feature
CN101741629A (en) * 2008-11-11 2010-06-16 英业达股份有限公司 Communication encryption method supporting remote monitoring system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111371461A (en) * 2020-04-26 2020-07-03 宁夏隆基宁光仪表股份有限公司 Original code and inverse code mixed data compression method suitable for intelligent electric meter
CN111371461B (en) * 2020-04-26 2023-04-07 宁夏隆基宁光仪表股份有限公司 Original code and inverse code mixed data compression method suitable for intelligent electric meter

Similar Documents

Publication Publication Date Title
CN101291325B (en) Method for encryption for information and decryption method for information
US9641331B2 (en) Method for converting a conditional access content and receiver for the implementation for said method
EP3178190B1 (en) Encoder, decoder and method
EP3195519B1 (en) Encoder, decoder and methods employing partial data encryption
JPWO2008078390A1 (en) Data compression apparatus and data decompression apparatus
JP6575532B2 (en) Encryption device, decryption device, encryption processing system, encryption method, decryption method, encryption program, and decryption program
US10148427B2 (en) Information processing apparatus, method for processing information, and medium
US20080192924A1 (en) Data encryption without padding
JP7226829B2 (en) Data processing apparatus, method and computer program
JP6187624B1 (en) Information processing apparatus, information processing method, and program
CN113098675A (en) Binary data encryption system and method based on polynomial complete homomorphism
WO2015166701A1 (en) Encryption method, program, and system
CN103501220A (en) Encryption method and device
JP4703805B2 (en) ENCRYPTION DEVICE, ENCRYPTION METHOD, DECRYPTION DEVICE, DECRYPTION METHOD, AND COMMUNICATION SYSTEM
CN104734723A (en) Data conversion method based on compression and scrambling
JP2015114771A (en) Data encryption device, data restoration device, data encryption method, data restoration method, data encryption program, and data restoration program
Suresh et al. Separable reversible data hiding using Rc4 algorithm
CN105959106A (en) Low-complexity digital encryption method
Akhter et al. Bangla and English text cryptography based on modified blowfish and Lempel-Ziv-Welch algorithm to minimize execution time
WO2008152533A2 (en) Method of authentication and electronic device for performing the authentication
US20060078121A1 (en) Encrypted cryptography system
US9160523B2 (en) Apparatus and method to prevent side channel power attacks in advanced encryption standard
KR101315683B1 (en) Encrypting and decrypting method without causing change of data size and type
US20150113286A1 (en) Method and system for chain transformation
CN112398834A (en) Voice secret communication method, device and system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20150624