CN108804933A - A kind of system conversion method for big data - Google Patents

A kind of system conversion method for big data Download PDF

Info

Publication number
CN108804933A
CN108804933A CN201810532098.3A CN201810532098A CN108804933A CN 108804933 A CN108804933 A CN 108804933A CN 201810532098 A CN201810532098 A CN 201810532098A CN 108804933 A CN108804933 A CN 108804933A
Authority
CN
China
Prior art keywords
sequence
data
section
iteration
conversion
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
Application number
CN201810532098.3A
Other languages
Chinese (zh)
Other versions
CN108804933B (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.)
Northeastern University China
Original Assignee
Northeastern University China
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 Northeastern University China filed Critical Northeastern University China
Priority to CN201810532098.3A priority Critical patent/CN108804933B/en
Publication of CN108804933A publication Critical patent/CN108804933A/en
Application granted granted Critical
Publication of CN108804933B publication Critical patent/CN108804933B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G06F7/582—Pseudo-random number generators

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The invention belongs to technical field of information processing, disclose a kind of system conversion method for big data.The influence of the big number system conversion operation of analysis correlation complexity between arbitrary carry system sequence and vectorial character digit, by estimating that memory headroom obtains the complete fragment sequence of step-by-step power arrangement, based on segmentation except vertical long division operation rule obtains new system characteristic sequence using iteration quotient and new binary value, arbitrary carry system conversions several greatly is effectively carried out.The present invention solves the problems, such as that vectorial character bit overflows, and has broken the limitation of built-in conversion, has overcome the limitation of conversion hex value, realize the versatility of conversion.

Description

A kind of system conversion method for big data
Technical field
The invention belongs to technical field of information processing, are related to a kind of system conversion method for big data.
Background technology
Information Hiding Techniques based on information security are to be hidden in information in initial carrier by specific method, in turn " existed facts " of hiding information, are mainly used in the secret communications such as banking system, military intelligence.Currently used base It is needed in the information steganography algorithm for changing multi-direction coding techniques (EMD, Exploiting Modification Direction) Former system secret information is converted into other system sequences needed for method before secret information insertion, based on diamond shape coding Steganographic algorithm needs the secret information by an arbitrary carry system to be embedded into pixel.As it can be seen that realizing the correct and fast of data system Speed conversion, is the premise guarantee that this category information steganography method puts into practice.In the information age of current big data, secret information It is different with steganography carrier, PB, EB, ZB or even YB and BB may be arrived greatly.The system conversion method being related at present is that classical length is removed Entire data can only be carried out complementation (as shown in Figure 1) of being divided by by method, this method to conversion hex value.It is limited by data value field range System, this method are only applicable to the less situation of former data bits, cannot be satisfied the big data structure based on Information Hiding Techniques Demand, therefore, it is necessary to establish a kind of correct and quick system conversion method for big data.
Most of system conversion method all there are problems that converting system limitation, the high speed having due to big data (speed that data are generated and used), High variation (range of data type and source) and high scale data amount feature, and big number Between arbitrary carry system complexity the problem of being included in the correlation between latent variable, bringing for converting be exactly to calculate to answer Polygamy is in Nonlinear Superposition, so the complexity for how reducing big number arbitrary carry system conversion is that needs are urgently to be resolved hurrily.
Invention content
The object of the present invention is to provide a kind of vertical length of segmentation for the conversion of big data system to remove method, existing to solve " character digit " overflow problem of system conversion is counted existing for technology greatly.
In order to achieve the above objectives, the technical solution adopted in the present invention is：
One kind being segmented vertical length for the conversion of big data system and removes method, analyzes big number system conversion operation to arbitrary carry system The influence of correlation complexity between sequence and vectorial character digit, by estimating that memory headroom obtains the complete of step-by-step power arrangement Fragment sequence, based on segmentation except vertical long division operation rule obtains new system characteristic sequence using iteration quotient and new binary value, Effectively carry out arbitrary carry system conversions several greatly.
The method have the characteristics that：
Including counting system sequence X greatlyI, j, k：X is original system sequence (x indicates original hex value)；I indicates iterations rope Draw (i > 0, i ∈ I, I are total iterations)；J indicates segment number index (j > 0, j ∈ J, J are total division number)；K indicates every section Sequence position number index (k > 0, k ∈ K, K are every section of sequence total bit).YiIndicate that (y indicates new system to the big Number Sequence of new system Value), it is exactly by the sequence of the last one remainder dynamical save of each iteration.And when big number arbitrary carry system conversion be related to Parameter L, Sj、Qi、Rk.Wherein, L indicates original system sequence total length, is according to original per segment data length K and division number J Correlation complexity obtains between beginning system sequence and vectorial character digit, when initial data can not carry out complete fraction processing When, the data length t of most end endpiece centainly meets t≤K.SjThe factor sequence that (j=1 ..., J) is every section；Qi=[SI, 1..., SI, J] factor sequence that indicates each iteration, continue operation as dividend；Quotient's remainder R corresponding with the last position power of the preceding paragraphI, j*1 It is a pair of relevant value, works as RI, j-1·xk+XI, j·x0When >=y, quotient SjThere is value；Terminate operation, dynamic cepstrum when the quotient of calculating is 0 Sequence retains remainder, obtains new system sequence Yi。
Specific technical solution is as follows：
(1) primary data pre-processes
Function is generated using random sequence and generates equally distributed pseudo-random integer sequence X, and setting according to demand will be converted Hex value y, and corresponding feature is generated using the method for adaptive vectorial character bit segmentation based on original system sequence length Section sequence sets, wherein every section of sequence digit K is fixed, the data length t of most end endpiece meets t≤K；
(2) loop iteration data are obtained by simulation division；
Step (1) is obtained into original data sequence and obtains corresponding section characteristic sequence by section rolling interception, is pressed using segmentation Position division algorithm calculates every section of factor sequence SjRemainder in (j=1 ..., J) and corresponding positions power records every section finally at this time Weigh corresponding remainder R in positionI, j-1；By RI, j-1Lower one piece of data is passed to, using position power and new hex value y joining sections and section, is ensured Integrality when lower one piece of data operation and correctness are carried out, formula R is passed throughI, j-1·xK+XI, j·x0-SjY=RI, jObtain quotient SjAnd remainder RI, j；
(3) dynamic memory interative computation result
By dynamic vector connection type by the quotient of every section of factor sequence storage to each iteration while interative computation Sequence Qi=[SI, 1..., SI, J] in (J indicates total hop count when time iteration), new complete factor sequence collection is constructed as next The dividend of secondary iteration, and do the step identical as initial data (2) processing to dividend obtains the quotient of each iteration and remaining Number；
(4) system transformation result is exported
By last remainder R of the final stage of each iterationI, JIn dynamic memory to Y sequences, until Qi= [SI, 1..., SI, J] it is 0 expression conversion end, the remainder as a result, in backward output Y sequences is preserved, it is as required；Otherwise continue With quotient divided by hex value y, the operation of step (2)-(4) is repeated.
The invention has the advantages that：
(1) conversion method of the present invention is exclusively used in counting system conversion greatly for the first time.The system conversion method being related at present is classics Long division, entire data can only be carried out complementation (as shown in Figure 1) of being divided by by this method to conversion hex value, by data value field range Limitation will appear " character digit " overflow problem, be only applicable to the less situation of former data bits in this approach.And this hair It is bright by big number initial data be ranked sequentially by section, the big number that cannot achieve will be overflowed by " character digit " using segmentation thought Division problem, which resolves into, is simply segmented vertical operation, solves the problems, such as that vectorial character bit overflows.
(2) the vertical length of segmentation provided by the invention removes method, memory space is made full use of, using fragmented storage mechanism to original Beginning data are iterated operation, while reducing the space complexity that big number superposition is brought, realize arbitrary carry systems several greatly Conversion, has broken the limitation of built-in conversion, overcomes the limitation of conversion hex value, realizes the versatility of conversion.
Description of the drawings
The system transition diagram of integer when Fig. 1 initial data digits are less.
Fig. 2 is that the present invention is based on big number system conversion method flow charts.
Fig. 3 is that the present invention is based on big number system conversion method carrying out step by step figures.
Specific implementation mode
The present invention provides one kind and being used for big data system conversion method, is calculated based on the multi-direction coding techniques steganography of modification The implementation of method and Information Hiding Techniques such as steganographic algorithm based on diamond shape coding includes the following steps, this method implementing procedure Figure is as shown in Figure 2：
(1) primary data pre-processes；
Using it is big number system conversion requirements randomly generate equally distributed pseudorandom original data sequence X, to generation with The big Number Sequence of machine pre-processes, i.e., obtains corresponding characteristic segments using the method for adaptive vectorial character string segmentation using X length Sequence sets.In addition, defining new binary value y.
Original data sequence X, length L, segmentation sum J and every section of total bit K can be obtained in this way.
(2) loop iteration data are obtained by simulation division；
The initial data of known first time interative computation is X, carries out K to it and sequentially intercepts, by simulation division algorithm, Original system sequence is traversed by section, obtains every section of factor sequence Sj(j=1 ..., J) and RI, j(the last position of ith iteration, jth section Weigh corresponding remainder), by RI, jIt is transmitted to as the foundation for calculating second segment factor sequence in lower one piece of data, utilizes remainder successively And new binary value x, y repeat to obtain every section of factor sequence and the remainder of last position power by section divide operations.
It obtains quotient and remaining formula can be described as：
RI, j·xK+XI, j+1·x0-Sj+1Y=RI, j+1
(3) by obtaining interative computation result；
Every section of factor sequence is carried out to the factor sequence Q for each iteration that dynamic vector connectsi=[SI, 1..., SI, JAs Initial data does simulation division operation, and last remainder R of current iteration is also preserved while dynamic memoryJIt (indicates When the jth section in secondary iteration, kth position remainder).
(4) system transformation result is exported；
According to vertical long division property, indicates that operation terminates when quotient is 0, that is, work as QiOperation terminates when=0.It will change every time The last position of the dividend in generation is weighed in corresponding remainder dynamic memory to Y, and Q is worked asiThe remainder that backward exports when=0, i.e. Y= [RI, J, RI-1, J..., R2, J, R1, J] (I indicates that iterations, J indicate that, when time total hop count of iteration, K indicates every section of each iteration Last position index).
Example (referring to Fig. 3), the example are transformed into based on the binary system secret information for changing multi-direction coding techniques Carrying out system conversions to hundred data above under (2n+1) system sequence, (n indicates to participate in the number of pixels of coding techniques, in this example N=12), which is equally applicable in the steganographic algorithm encoded based on diamond shape a B system sequence secret information being embedded into Pixel centering (B=2v2+ 2v+1, v indicate pixel knots modification, v=3 in this example) demand.It is only the method for the present invention hundred Application on the binary sequence of position, can absolutely prove the effect of this method, but proposed by the present invention is a general frame, In addition to the example, this method can be applied to the arbitrary carry system conversion of any other length big data.
Example procedure is as follows：
(1) generate original series X (x=2, length L=101, total hop count J=11, every section of sequence digit K=10, last Section number t=1, user can be with nominative testing length), it is as follows that result is obtained by random sequence generation function：(X indicates original System sequence, y indicate new binary value)
X=101010111000101110001011100010100001110110100000000110 001001000111 000100011101010100110110000111110；
Y=25；
Segmentation interception operation is carried out to the initial data X of first time iteration according to K=10, every section of quotient is obtained by section sequence Sequence：S1,1=[0 00 00 11 01 1] ... S1,10=[1 11001101 0], S1,11=[1] and remainder sequence Row：R1,1=[1 25 10 21 17 10 21 18 11] ..., R1,10=[20 15 5 10 20 16 8 17 10 21], R1,11=[17]；It integrates factor sequence and obtains Q1=[S1, S2..., S9, S10, S11], by the factor sequence Q after integration1As new quilt Divisor, i.e., the initial data of second iteration；
To Q1Processing is set to 0 before removing, then it is carried out to roll by section and is intercepted, and obtained next iteration data are arranged by section Sequence be respectively [1101101110], [0100111110], [0101110011], [1110000010], [0001010010], [0110100101], [0010011111], [0001001110], [0111111100], [110101]；Repeat above procedure until QI=0 conversion end obtains remainder and obtains Y=[R in inverted order storage to sequence Y79,1, R78,1..., R2,10, R1,11].Most terminate Fruit is expressed as：
(1010101110001011100010111000101000011101101000000001100010010001110001000111 01010100110110000111110)2=(7 11 19 22 13 14 23 23 0 18 91 12 16 3 20 19 23 18 15 15 17)25
Example explanation：Binary-coded character vector is required in current system conversion method less than 53 to ensure that system is converted Algorithm data is not spilt over, and has been more than the memory range of built-in type if exceeding 53, i.e., binary vector character digit is super System conversion cannot be carried out when crossing 53, so this Fig. 2 example can not be realized for original technology, and the present invention can Successfully to carry out system conversion.

Claims (1)

1. a kind of system conversion method for big data, which is characterized in that include the following steps：
(1) primary data pre-processes
Generate function using random sequence and generate equally distributed pseudo-random integer sequence X, according to demand setting to be converted into Value y processed, and corresponding characteristic segments sequence is generated using the method for adaptive vectorial character bit segmentation based on original system sequence length Row collection, wherein every section of sequence digit K is fixed, the data length t of most end endpiece meets t≤K；
(2) loop iteration data are obtained by simulation division；
Step (1) is obtained into original data sequence and obtains corresponding section characteristic sequence by section rolling interception, is removed using segmentation step-by-step Method algorithm calculates every section of factor sequence SjRemainder in (j=1 ..., J) and corresponding positions power records every section of last position power at this time Corresponding remainder RI, j-1；By RI, j-1Lower one piece of data is passed to, using position power and new hex value y joining sections and section, ensures carrying out Integrality when lower one piece of data operation and correctness pass through formula RI, j-1·xK+XI, j·x0-SjY=RI, jObtain quotient SjWith Remainder RI, j；
(3) dynamic memory interative computation result
By dynamic vector connection type by the factor sequence Q of every section of factor sequence storage to each iteration while interative computationi =[SI, 1..., SI, J] in (J indicates total hop count when time iteration), new complete factor sequence collection is constructed as next iteration Dividend, and to dividend do the step identical as initial data (2) processing, obtain quotient and the remainder of each iteration；
(4) system transformation result is exported
By last remainder R of the final stage of each iterationI, JIn dynamic memory to Y sequences, until Qi=[SI, 1..., SI, J] it is 0 expression conversion end, the remainder as a result, in backward output Y sequences is preserved, it is as required；Otherwise continue with quotient divided by Hex value y repeats the operation of step (2)-(4).
CN201810532098.3A 2018-05-25 2018-05-25 Method for carrying out scale conversion on big data in information hiding technology Active CN108804933B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810532098.3A CN108804933B (en) 2018-05-25 2018-05-25 Method for carrying out scale conversion on big data in information hiding technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810532098.3A CN108804933B (en) 2018-05-25 2018-05-25 Method for carrying out scale conversion on big data in information hiding technology

Publications (2)

Publication Number Publication Date
CN108804933A true CN108804933A (en) 2018-11-13
CN108804933B CN108804933B (en) 2020-06-05

Family

ID=64090801

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810532098.3A Active CN108804933B (en) 2018-05-25 2018-05-25 Method for carrying out scale conversion on big data in information hiding technology

Country Status (1)

Country Link
CN (1) CN108804933B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109783053A (en) * 2019-01-16 2019-05-21 中科亿海微电子科技（苏州）有限公司 A kind of FPGA realizes the method and device of variable bit width division
CN110619218A (en) * 2018-12-29 2019-12-27 北京时光荏苒科技有限公司 Method and apparatus for generating information
CN111831256A (en) * 2020-06-30 2020-10-27 深圳市永达电子信息股份有限公司 Processing method of ultra-long digit division and computer readable storage medium

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101639828A (en) * 2009-09-11 2010-02-03 北京交通大学 Method for hiding and extracting watermark based on XML electronic document
US20120233465A1 (en) * 2007-04-05 2012-09-13 International Business Machines Corporation Distribution of Credentials
CN102750468A (en) * 2012-05-08 2012-10-24 南京吉印信息科技有限公司 Remote sensing image subsidiary file hiding method based on information hiding
CN105956492A (en) * 2016-06-23 2016-09-21 浪潮(北京)电子信息产业有限公司 File storage encryption method and apparatus
CN106131051A (en) * 2016-08-16 2016-11-16 深圳神盾电子科技有限公司 Information encryption and decryption method and device
CN107154851A (en) * 2017-06-30 2017-09-12 上海众人网络安全技术有限公司 A kind of method and device of data encryption and decryption

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120233465A1 (en) * 2007-04-05 2012-09-13 International Business Machines Corporation Distribution of Credentials
CN101639828A (en) * 2009-09-11 2010-02-03 北京交通大学 Method for hiding and extracting watermark based on XML electronic document
CN102750468A (en) * 2012-05-08 2012-10-24 南京吉印信息科技有限公司 Remote sensing image subsidiary file hiding method based on information hiding
CN105956492A (en) * 2016-06-23 2016-09-21 浪潮(北京)电子信息产业有限公司 File storage encryption method and apparatus
CN106131051A (en) * 2016-08-16 2016-11-16 深圳神盾电子科技有限公司 Information encryption and decryption method and device
CN107154851A (en) * 2017-06-30 2017-09-12 上海众人网络安全技术有限公司 A kind of method and device of data encryption and decryption

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
左力文等: ""结合恰可察觉编码失真模型的HEVC大容量信息隐藏方法"", 《中国图象图形学报》 *
王蕊: ""数字图像隐写算法的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *
陈嘉勇等: ""一种最优(k, p) 进制转换算法"", 《应用科学学报》 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110619218A (en) * 2018-12-29 2019-12-27 北京时光荏苒科技有限公司 Method and apparatus for generating information
CN109783053A (en) * 2019-01-16 2019-05-21 中科亿海微电子科技（苏州）有限公司 A kind of FPGA realizes the method and device of variable bit width division
CN111831256A (en) * 2020-06-30 2020-10-27 深圳市永达电子信息股份有限公司 Processing method of ultra-long digit division and computer readable storage medium

Also Published As

Publication number Publication date
CN108804933B (en) 2020-06-05

Similar Documents

Publication Publication Date Title
KR102476343B1 (en) Apparatus and method for supporting neural network calculation of fixed-point numbers with relatively few digits
CN110046513B (en) Plaintext associated image encryption method based on Hopfield chaotic neural network
CN107340993B (en) Arithmetic device and method
CN108053028A (en) Data fixed point processing method, device, electronic equipment and computer storage media
CN108804933A (en) A kind of system conversion method for big data
US20080080710A1 (en) Method for generating secure elliptic curves using an arithmetic-geometric mean iteration
CN106487512A (en) A kind of RSA key is to quick-speed generation system and method
CN107579811A (en) A kind of hardware optimization method based on SM3 cryptographic Hash algorithms
CN115296862B (en) Network data safety transmission method based on data coding
CN107644252A (en) A kind of recurrent neural networks model compression method of more mechanism mixing
CN106656459A (en) Side channel energy analysis method and device for SM3-HMAC
Sathishkumar et al. A novel image encryption algorithm using pixel shuffling and base 64 encoding based chaotic block cipher (IMPSBEC)
Li et al. Improvement of min-entropy evaluation based on pruning and quantized deep neural network
He et al. A Fast Image Encryption Algorithm based on Logistic Mapping and Hyperchaotic Lorenz System for Clear Text Correlation
CN113312058A (en) Similarity analysis method for intelligent contract binary function
CN110708160A (en) SM2 algorithm scalar multiplication coding-based side channel attack resisting method and system
CN106201435A (en) Pseudo-random number generation method based on cell neural network
CN106502627B (en) A kind of pseudo-random number seed generation method
Wang et al. Efficient construction of polar codes
Lv et al. High-efficiency min-entropy estimation based on neural network for random number generators
CN113157255B (en) Code generation method for syntax tree decoder
Li et al. Stacked denoising autoencoder enhanced Polar codes over Rayleigh fading channels
CN113988279A (en) Output current reading method and system of storage array supporting negative value excitation
CN111563263A (en) Carrier-free information hiding method for migration of any image style
CN116527824B (en) Method, device and equipment for training graph convolution neural network

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