CN102271036B - Method for encrypting digital signal by utilizing matrixes - Google Patents
Method for encrypting digital signal by utilizing matrixes Download PDFInfo
- Publication number
- CN102271036B CN102271036B CN201110250984.5A CN201110250984A CN102271036B CN 102271036 B CN102271036 B CN 102271036B CN 201110250984 A CN201110250984 A CN 201110250984A CN 102271036 B CN102271036 B CN 102271036B
- Authority
- CN
- China
- Prior art keywords
- matrix
- ciphertext
- segmentation
- exchange
- pseudo
- 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.)
- Expired - Fee Related
Links
Landscapes
- Storage Device Security (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a method for encrypting a digital signal by utilizing a plurality of matrixes. The method comprises the following steps of: inputting commands, converting a positioning matrix, a pseudo code matrix and an offset matrix according to the commands, performing segmentation computation on the data of the pseudo code matrix and an original text to obtain a segmented cipher text after the conversion is finished, rearranging the cipher text according to the positioning matrix, segmenting the cipher text in an equal length segmentation or unequal length segmentation way after the rearrangement of the cipher text is finished, performing intra-segment offsetting on obtained segments according to a value of the offset matrix, and saving an offset result. By the method, the security of communication can be well enhanced, and the conversion of the matrixes is controlled by the commands to eliminate the threat of a third party to the security of the communication. By the encryption method, the shortcomings that user identity cannot be verified by the other conventional encryption methods and that a plurality of users use the same set of encryption method to cause a high secret divulging rate are overcome, and the problem of information security in a communication process is well solved.
Description
Technical field
The present invention relates to a kind of digital signal encryption method of utilizing many matrixes.
Background technology
Modern communications amount of information constantly increases, and document information is increasing, and it is particularly important that the fail safe of guarantee information becomes.Do not divulge a secret in transmitting procedure for guarantee information, be badly in need of a kind of strong security and practical encryption technology.Other encryption technologies respectively have shortcoming at present, also likely after long-term communication, are cracked.There is no at present the many matrixes of a kind of employing, and with its variation pattern of password controls, change complexity, simple operation, encryption is extremely strong, and efficiency is high, and can accomplish in many ways to use, and respectively has its rule of communication, can not know mutually, the extremely difficult encryption method of decoding.
Summary of the invention
The object of the invention is to for the deficiencies in the prior art, a kind of digital signal encryption method of utilizing many matrixes is provided, this encryption method has adopted many matrixes, and with its variation pattern of password controls.The method changes complicated, simple operation, and encryption is extremely strong, and efficiency is high, and can accomplish in many ways to use, and respectively has its rule of communication, can not know mutually, extremely difficult decoding.
For achieving the above object, the technical solution used in the present invention is: a kind of digital signal encryption method of utilizing many matrixes, is characterized in that comprising the following steps:
1) formulate positional matrix, pseudo-code matrix and excursion matrix; In positional matrix, deposit the ciphertext deposit position after encryption; In pseudo-code matrix, deposit one group of pseudo-code; Excursion matrix is deposited one group of side-play amount, and in this matrix, the value of element is used for determining the amount of the ciphertext section of carrying out bias internal that segmentation generates;
2) three groups of passwords of input, password Cover matrix information converting, converts respectively positional matrix, pseudo-code matrix and excursion matrix according to three groups of passwords;
3) calculate segmentation ciphertext with data and the original text segmentation of pseudo-code matrix, according to positional matrix, ciphertext is rearranged, after completing, by ciphertext segmentation, again according to the value of excursion matrix to the section section of the carrying out bias internal having divided, and preserve migration result, the ciphertext of once being encrypted.
Described is isometric section or non-isometric section by the segmented mode of ciphertext segmentation.
The data of described pseudo-code matrix and original text segmentation are calculated, and its operation method can adopt two kinds of compute modes to carry out: a kind of is step-by-step XOR, and this kind of method do not produce overflow position; Another kind method is add operation, and this kind of method can produce overflow position, need to preserve overflow position data.
Described ciphertext of once encrypting is as original text, calculate segmentation ciphertext with data and the original text segmentation of pseudo-code matrix, according to positional matrix, ciphertext is rearranged, after completing, by ciphertext segmentation, again according to the value of excursion matrix to the section section of the carrying out bias internal having divided, and preserve migration result, obtain the ciphertext of superencipher.
In described password, matrixing method is made up of different figure places, comprises one or more in lower rank transformation: translation occupies 3 positions, and first represents that translation, second represent the i.e. direction up and down of moving direction, and the 3rd represents mobile quantity; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange line number; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange columns; Ranks exchange occupies 3 positions, and first represents ranks exchange, second representative exchange line number, the 3rd representative exchange columns; Transposition occupies 1, represents transposition; Each circle rotation occupies 3, and first represents the rotation of matrix circle, and second representative is rotated the number of turns, and the 3rd represents rotation degree; Axial symmetry is occupied 2, and first represents that axial symmetry, second represent that symmetry axis is major-minor diagonal, central horizontal Xian Huo center vertical curve; Invert and occupy one, representative is inverted; Deflection occupies 2, and first represents deflection, and second represents degree of deflection.
The present invention has following advantage: the method changes complicated, simple operation, and encryption is extremely strong, and efficiency is high, and can accomplish in many ways to use, and respectively has its rule of communication, can not know mutually, extremely difficult decoding.
Brief description of the drawings
Fig. 1 is the use schematic flow sheet of the inventive method;
Fig. 2 is encryption method encrypting step schematic diagram of the present invention;
Fig. 3 is encryption method example detailed maps of the present invention;
Embodiment
As shown in Figure 1: start s10, three matrixes of predefine, be respectively initial location, pseudo-code and excursion matrix, before communication, transmit password s11 by the third party's means that can not decode, password can be 16-24 position, password implication is free by user, implication can comprise that matrix moves to left, move to right, on move, move down, row exchange, row exchange, ranks exchange, transposition, each circle rotation, axial symmetry, invert, deflection etc., and the specifying information of the amount of above-mentioned conversion, these information are drafted voluntarily by communicating pair, make password there is nonrepeatability, carry out the variation of gating matrix with this, to produce three location, pseudo-code and excursion matrix.By key authentication password, whether inspection is validated user s12, according to three matrix s13 of password transforming, and encrypting and transmitting information s14, information receives, deciphering s15.
Before communication starts, first transmission information side translates into ciphertext with first set key with the method for XOR by password and sends, recipient receives after ciphertext and translated into expressly with first set key, then translated into ciphertext by the second method of overlapping key XOR, then sends it back transmit leg.Whether transmit leg receives after ciphertext and translated into expressly with the second cover key again, check with to send password consistent.If consistent, start communication; If inconsistent, stop communicating by letter and verifying problem.Sign off, reduction initial matrix s16, finishes s17.
In concrete password, matrixing method is made up of different figure places.Translation occupies 3 positions, and first represents that translation, second represent moving direction (up and down), and the 3rd represents mobile quantity; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange line number; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange columns; Ranks exchange occupies 3 positions, and first represents ranks exchange, second representative exchange line number, the 3rd representative exchange columns; Transposition occupies 1, represents transposition; Each circle rotation occupies 3, and first represents the rotation of matrix circle, and second representative is rotated the number of turns, and the 3rd represents rotation degree; Axial symmetry is occupied 2, and first represents that axial symmetry, second represent symmetry axis (major-minor diagonal, central horizontal line, center vertical curve); Invert and occupy one, representative is inverted; Deflection occupies 2, and first represents deflection, and second represents degree of deflection.
The conversion that can not use all matrixes in password completely, therefore using which transform method need to be set by the user, and the transform method of each customer selecting is inconsistent, and the transform method code of setting is also inconsistent.
The alternative dynamic matrix conversion method of part is as shown in table 1 below:
Table 1:
(1) positional matrix 3
After utilizing password controls initial alignment matrix to change, positional matrix 3 generates, in positional matrix 3, deposit the ciphertext deposit position after encryption, its numerical value span can free setting, as be 0-63, divide into 64 sections by encrypt data, deposit one group of data for each section, the effect of this matrix is that cipher-text information is upset again and deposited.
(2) pseudo-code matrix 5
After utilizing the initial pseudo-code matrix of password controls to change, pseudo-code matrix 5 generates, in this matrix, deposit one group of pseudo-code, its element span is 0-255, this matrix and original text carry out generating segmentation ciphertext after computing, its operation method can adopt two kinds of compute modes to carry out: a kind of is step-by-step XOR, and this kind of method do not produce overflow position.Another kind method is add operation, and this kind of method can produce overflow position, need to preserve overflow position data.Comparatively speaking, the confidentiality of second method is stronger, but speed and efficiency slightly declines, if matrix is 8*8 pattern, produces the literary composition that overflows of original text 1/8.
(3) excursion matrix 2
After utilizing password controls initial offset matrix to change, excursion matrix 2 generates, and this matrix is deposited one group of side-play amount, and its element span is 0-63, and in this matrix, the value of element is used for determining the amount of the ciphertext section of carrying out bias internal that segmentation generates.As ciphertext being divided into 64 sections, excursion matrix just has 64 similar and different numerals, is used for ciphertext to be offset.
Two ciphering process principles
As shown in Figure 2: input three groups of passwords 1, convert respectively positional matrix 3, pseudo-code matrix 5 and excursion matrix 2 according to password, data and original text 4 segmentations with pseudo-code matrix 5 after completing calculate the initial ciphertext 6 of segmentation, according to positional matrix 3, ciphertext is rearranged and forms ciphertext 7 at random, after completing, by ciphertext segmentation, segmented mode can be isometric section or non-isometric section, again according to the value of excursion matrix to the section section of the carrying out bias internal having divided, and preserve migration result.Original text, after having encrypted with upper type, has obtained an infill layer ciphertext 8, for improving cryptographic security, can carry out the superencipher of same mode, encrypts general flow chart as shown in Figure 1.
Utilize the variation of password controls matrix, for identical initial matrix, because of the difference of password, can produce different skews, location and pseudo-code matrix, encrypt the difference of ciphertext generating, i.e. same original text, produces different ciphertexts.
Concrete ciphering process:
The original text that is 4K to an original text is encrypted, and positional matrix 3, pseudo-code matrix 5 and excursion matrix 2 are all defined as to 8*8 matrix, and these 3 matrixes all have 64 digital elements, and the span of positional matrix 3 is (0-63), and numeral is not reproducible.The span of pseudo-code matrix 5 is (0-255), and wherein numeral can repeat.The span of excursion matrix 2 is (0-63), and numeral can repeat.
First create a ciphertext pond, be divided into 64*64 matrix, original text is divided into 64 isometric section, every section of 64 numerals, the total data of the numeral of every section and pseudo-code matrix 5 carries out obtaining the initial ciphertext of segmentation after an XOR, gets data as line position from positional matrix 3, deposits the corresponding line in ciphertext pond in, repeat altogether 64 times, obtain ciphertext 7 at random.Obtain side-play amount from excursion matrix 2 again, to the ciphertext 7 segmentation section of carrying out bias internals at random, after 64 sections have been offset respectively, obtain an infill layer ciphertext 8.
Because each section of ciphertext 7 at random is also a matrix, can carry out matrix variation to each section of ciphertext 7 at random, its cipher round results is better than adopting offset manner.
For skew, also can be divided into not isometric section to ciphertext 7 at random, the number of section is indefinite, as long as segment length's sum is ciphertext length at random, the numerical value of recycling excursion matrix 2 is offset, and its cipher round results is better than isometric section, just will add a chopping rule.
For a larger space original text, only need repeat above process.Thereby complete ciphering process one time.Its detailed example process as shown in Figure 3.
Decrypting process principle is:
Decrypting process and ciphering process are contrary, first utilize excursion matrix 2 reversed migrations, and ciphertext is reduced to original text by recycling pseudo-code matrix 5 and positional matrix 3.
Algorithm Analysis: positional matrix 3 has 64 numerals, to its be arranged with Kind, pseudo-code matrix 5 has 64 numerals, and it is arranged with to 255
64plant possibility, fail safe is higher.
Application can be applied both ways:
1, instant digital communication:
To collect to obtain data-signal by A/D converter, and carry out enciphering transformation 1-2 time, digital signal changes and is upset generating ciphertext, then sends to recipient, and party B is decrypted after receiving signal, then carries out D/A conversion, obtains information.This application can adopt hardware or software mode to realize, and hardware using Programmable Logic Controller is realized, and software mode adopts file packet mode to realize sending and receiving, and hardware mode speed is faster than software mode.
2, classified papers are encrypted:
After file in computer is encrypted by the encryption system of being developed by this method, preserve or transmission, even ciphertext stealing, file also cannot be opened, and ensures the safety of file again.
A kind of concrete encryption method has more than been described, examples, diagram are illustrated, wherein details is not because of difference the describing of application and object, and application personnel can modify or be equal to replacement this encryption technique method, and do not depart from the scope and spirit of technical scheme.
Claims (5)
1. a digital signal encryption method of utilizing many matrixes, is characterized in that comprising the following steps:
1) formulate positional matrix, pseudo-code matrix and excursion matrix; In positional matrix, deposit the ciphertext deposit position after encryption; In pseudo-code matrix, deposit one group of pseudo-code; Excursion matrix is deposited one group of side-play amount, and in this matrix, the value of element is used for determining the amount of the ciphertext section of carrying out bias internal that segmentation generates;
2) three groups of passwords of input, password Cover matrix information converting, converts respectively positional matrix, pseudo-code matrix and excursion matrix according to three groups of passwords;
3) calculate segmentation ciphertext with data and the original text segmentation of pseudo-code matrix, according to positional matrix, ciphertext is rearranged, after completing, by ciphertext segmentation, again according to the value of excursion matrix to the section section of the carrying out bias internal having divided, and preserve migration result, the ciphertext of once being encrypted.
2. a kind of digital signal encryption method of utilizing many matrixes as claimed in claim 1, is characterized in that described is isometric section or non-isometric section by the segmented mode of ciphertext segmentation.
3. a kind of digital signal encryption method of utilizing many matrixes as claimed in claim 1 or 2, the data and the original text segmentation that it is characterized in that described pseudo-code matrix are calculated, its operation method can adopt one of two kinds of compute modes to carry out: a kind of is step-by-step XOR, and this kind of method do not produce overflow position; Another kind method is add operation, and this kind of method can produce overflow position, need to preserve overflow position data.
4. a kind of digital signal encryption method of utilizing many matrixes as claimed in claim 1 or 2, the ciphertext of once encrypting described in it is characterized in that is as original text, calculate segmentation ciphertext with data and the original text segmentation of pseudo-code matrix, according to positional matrix, ciphertext is rearranged, after completing, by ciphertext segmentation, then according to the value of excursion matrix to the section section of the carrying out bias internal having divided, and preserve migration result, obtain the ciphertext of superencipher.
5. a kind of digital signal encryption method of utilizing many matrixes as claimed in claim 1 or 2, it is characterized in that in described password, matrixing method is made up of different figure places, comprise one or more in lower rank transformation: translation occupies 3 positions, first represents translation, second represents the i.e. direction up and down of moving direction, and the 3rd represents mobile quantity; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange line number; Row exchange occupies 3 positions, the exchange of first representative row, second and third position representative exchange columns; Ranks exchange occupies 3 positions, and first represents ranks exchange, second representative exchange line number, the 3rd representative exchange columns; Transposition occupies 1, represents transposition; Each circle rotation occupies 3, and first represents the rotation of matrix circle, and second representative is rotated the number of turns, and the 3rd represents rotation degree; Axial symmetry is occupied 2, and first represents that axial symmetry, second represent that symmetry axis is major-minor diagonal, central horizontal Xian Huo center vertical curve; Invert and occupy one, representative is inverted; Deflection occupies 2, and first represents deflection, and second represents degree of deflection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110250984.5A CN102271036B (en) | 2011-08-29 | 2011-08-29 | Method for encrypting digital signal by utilizing matrixes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110250984.5A CN102271036B (en) | 2011-08-29 | 2011-08-29 | Method for encrypting digital signal by utilizing matrixes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102271036A CN102271036A (en) | 2011-12-07 |
| CN102271036B true CN102271036B (en) | 2014-10-15 |
Family
ID=45053208
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110250984.5A Expired - Fee Related CN102271036B (en) | 2011-08-29 | 2011-08-29 | Method for encrypting digital signal by utilizing matrixes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102271036B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112491648B (en) * | 2020-11-17 | 2022-03-08 | 重庆美沣秦安汽车驱动系统有限公司 | Automobile communication data conversion method based on CAN communication matrix and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101237322A (en) * | 2008-02-03 | 2008-08-06 | 西北农林科技大学 | Encryption method based on dual cycle queue shift and transposition rule |
| CN101237321A (en) * | 2008-02-03 | 2008-08-06 | 西北农林科技大学 | Encryption method based on cycle queue shift rule |
| CN101783805A (en) * | 2010-03-01 | 2010-07-21 | 田耕 | Method for encrypting communication by adopting dynamic vector matrix |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030021409A1 (en) * | 1999-10-29 | 2003-01-30 | Incarnato Joseph S. | Alphabet soup cryptography |
-
2011
- 2011-08-29 CN CN201110250984.5A patent/CN102271036B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101237322A (en) * | 2008-02-03 | 2008-08-06 | 西北农林科技大学 | Encryption method based on dual cycle queue shift and transposition rule |
| CN101237321A (en) * | 2008-02-03 | 2008-08-06 | 西北农林科技大学 | Encryption method based on cycle queue shift rule |
| CN101783805A (en) * | 2010-03-01 | 2010-07-21 | 田耕 | Method for encrypting communication by adopting dynamic vector matrix |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102271036A (en) | 2011-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | A novel image encryption scheme based on 2-D logistic map and DNA sequence operations | |
| CN103414549B (en) | A kind of QR two-dimensional code binary image partition becomes key chaos encrypting method | |
| CN101447870B (en) | Safe storage method of private key based on technology of distributed password | |
| CN102684877B (en) | A kind of method and device carrying out user profile process | |
| CN102064936B (en) | Data encryption and decryption methods and devices | |
| Al-Harbi et al. | Security analysis of DNA based steganography techniques | |
| CN105743645A (en) | PUF (Physical Unclonable Function)-based stream key generation device and method and data encryption and decryption method | |
| CN106685980A (en) | Cryptographic method of large files | |
| Hua et al. | Image encryption using value-differencing transformation and modified zigzag transformation | |
| Osamor et al. | Employing scrambled alpha-numeric randomization and RSA algorithm to ensure enhanced encryption in electronic medical records | |
| US20150205970A1 (en) | Data encryption using an external arguments encryption algorithm | |
| Salmi et al. | Implementation of the data encryption using caesar cipher and vernam cipher methods based on CrypTool2 | |
| CN116760546B (en) | Modularized password service method based on cloud environment | |
| CN102271036B (en) | Method for encrypting digital signal by utilizing matrixes | |
| Godara et al. | An improved algorithmic implementation of rail fence Cipher | |
| Xingyuan et al. | Cracking and improvement of an image encryption algorithm based on bit-level permutation and chaotic system | |
| Zhang | Security analysis of a chaos triggered image encryption scheme | |
| US20230049768A1 (en) | A method for symmetric asynchronous generative encryption | |
| CN101783805B (en) | Method for encrypting communication by adopting dynamic vector matrix | |
| CN104601856B (en) | A kind of dynamic random key encryption and decryption approaches of digital picture | |
| CN1168058C (en) | Data enciphering method for dynamic cipher coding | |
| CN103746793B (en) | A kind of number form literary composition carries encryption and decryption approaches | |
| Dweik et al. | A survey of lightweight image encryption for IoT | |
| Dawson et al. | Ensuring privacy and confidentiality of cloud data: A comparative analysis of diverse cryptographic solutions based on run time trend | |
| Gao et al. | DNA computing in cryptography |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| DD01 | Delivery of document by public notice |
Addressee: Tian Geng Document name: Notification of Termination of Patent Right |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141015 Termination date: 20150829 |
|
| EXPY | Termination of patent right or utility model |