CN111835506B - Information security digital encryption method based on one-time use codebook - Google Patents

Information security digital encryption method based on one-time use codebook Download PDF

Info

Publication number
CN111835506B
CN111835506B CN201910321141.6A CN201910321141A CN111835506B CN 111835506 B CN111835506 B CN 111835506B CN 201910321141 A CN201910321141 A CN 201910321141A CN 111835506 B CN111835506 B CN 111835506B
Authority
CN
China
Prior art keywords
digital
information
vector
codebook
key
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
CN201910321141.6A
Other languages
Chinese (zh)
Other versions
CN111835506A (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.)
Guangzhou Jiaxin Future Technology Co ltd
Original Assignee
Guangzhou Jiaxin Future 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 Guangzhou Jiaxin Future Technology Co ltd filed Critical Guangzhou Jiaxin Future Technology Co ltd
Priority to CN201910321141.6A priority Critical patent/CN111835506B/en
Publication of CN111835506A publication Critical patent/CN111835506A/en
Application granted granted Critical
Publication of CN111835506B publication Critical patent/CN111835506B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0863Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/16Implementing security features at a particular protocol layer
    • H04L63/166Implementing security features at a particular protocol layer at the transport layer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0819Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
    • H04L9/0825Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) using asymmetric-key encryption or public key infrastructure [PKI], e.g. key signature or public key certificates

Abstract

The invention discloses an information security digital encryption method based on a disposable codebook, which comprises the following steps: the method comprises the steps of utilizing host characteristic information of a file and information special for communication equipment used by the file to form front and back background information, forming a double-track double-block K-group digital vector association structure, extracting part of characteristic information in the background information to serve as a digital key for encrypting plaintext information, adopting a functional dynamic encryption algorithm to encrypt and modulate a symbol dictionary, generating a one-time digital cipher book with the background information, and generating a public digital cipher of the plaintext information. The information security digital encryption method based on the one-time use codebook provided by the invention is organically combined with the SSL/TLS communication protocol encryption system transmitted by the third party, so that the big data and information security in the Internet environment are effectively ensured. The method is suitable for completing the encryption task of the plaintext information by utilizing the characteristic that the private confidential information and the public information are asymmetric under the condition that the background information of the Internet environment is not completely transparent.

Description

Information security digital encryption method based on one-time use codebook
Technical Field
The invention relates to an information security digital encryption method based on a one-time use codebook.
Background
The technology related to the password is various, namely invisible and visible, and digital and non-digital. However, they all share a common feature: digital cryptography is generated around multiple keys generated by a fixed codebook, and there is a close relationship between each of the cryptography.
The general cryptosystem is an information host a of information (message) W, performs public key encryption processing on W to be encrypted by using an encryption algorithm of a symmetric key Q or an asymmetric private key PW and a public key GW, generates a public password MW, and delivers the password MW to a third party C for transmission.
After receiving the encrypted password MW, the access receiver B decrypts the MW by using the private key and a decryption algorithm to restore the information W. (transmitter C: radio delivery/internet delivery).
The most important core method is the generation technology of a fixed codebook used for a plurality of times and a series of encryption technologies generated by the generation technology. Currently there are three types of development:
1. password-based cryptography (PBE-Password Based Encryption) techniques
In order to ensure the flexibility and the security strength of the fixed codebook. A password-based password (PBE-Password Based Encryption) is generated. And generating a symmetric key KEK, and encrypting the information W by the sender A to form a ciphertext MW. After receiving the ciphertext MW, the receiver B decrypts the MW with the symmetric key KEK to restore the information W.
2. Asymmetric cryptography-based (PGP-Pretty Good Privacy) cryptography system
Since symmetric cryptography KEK is easily compromised by third parties, cryptographic software written by Phillips Ji Moman (Philip Zimmermann) individuals in 1990 was improved to asymmetric cryptography-based (PGP-Pretty Good Privacy) cryptography systems.
PGP is currently the most excellent and most secure encryption scheme. Representative software in this regard is PGP encryption software in the united states. The core idea of this software is to protect files with logical partitions, such as logical partition E: is a hard disk partition protected by PGP, then each time the partition is opened, a password is entered to open the partition, and the files within the partition are absolutely secure. When the partition is no longer needed, the partition can be closed and can be made to disappear from the desktop, and when the partition is opened again, a password needs to be input. Without the password, the software developer itself cannot decrypt-! PGP is the most popular file encryption software worldwide. Its source code is public, withstands the cracking challenges of thousands of top hackers, and the fact proves that PGP is currently the safest encryption software in the world. Its only disadvantage is that PGP currently has no official chinese version and that the original version is extremely expensive. Since PGP technology is a technology that the united states national security agency prohibits export.
3. Asymmetric cryptography based (SSL/TLS-Secure Socket Layer/Transport Layer Security) internet cryptography system
SSL/TLS is a cryptographic communication protocol method widely used in Web servers, and is a communication between a client and a server. They all follow a protocol called HTTP (HyperText Transfer Protocol ) for communication. The Web browser is called an HTTP client, and the Web server is called an HTTP server. SSL/TLS is a secure communication technology implemented by combining symmetric keys, public key cryptography, one-way hash functions, message authentication codes, pseudo-random generators, digital signatures, and other technologies in the communication between a Web server and a Web browser. In addition, SSL/TLS may also switch the cipher suite to use a more robust cipher algorithm.
The most important in SSL/TLS systems is the TLS protocol, which is divided into two parts: the TLS recording protocol and TLS handshake protocol.
TLS recording protocol: is responsible for message compression, encryption and data authentication.
TLS handshake protocol: it has 4 sub-protocols: handshake protocol, password specification change protocol, warning protocol, and application data protocol. Handshake protocol: is responsible for negotiating decision cryptographic algorithms and shared keys between the client and the server. Password specification change protocol: is responsible for transmitting a signal for changing the cipher mode to a communication object. Warning protocol: is responsible for communicating errors to the other party when errors occur. Application data protocol: and a protocol for communicating the application data carried on the TLS to the communication object. Wherein the handshake protocol is the focus: after the information exchange between the client and the server is completed, the application data protocol is switched to.
The client obtains the legal public key of the server and completes the authentication of the server.
The server obtains the legal public key of the client and completes the authentication of the client.
The client and the server generate a shared key for use in cryptographic communications.
The client and server generate a shared key for use in the message authentication code.
SSL/TLS is a cryptographic communication scheme that is often used worldwide under today's internet.
With the rapid development of computer technology and digital technology, digital cryptography has also advanced. The main technical direction of the current information data security technology development is as follows: advances in one-way hash function computation technology have evolved toward new encryption algorithms for high-strength one-way hash function values.
1. MD series
MD4 is a one-way hash function designed by Rivet in 1990, capable of producing 128-bit hash values (RFC 1186, revision RFC 1320).
MD5 is a one-way hash function designed by Rivet in 1991, capable of producing 128-bit hash values (RFC 1321). The strong collision resistance of MD5 has been compromised and is currently unsafe.
2、RIPEMD-160
RIPEMD-160 is a one-way hash function designed by Hans Dobbertin, antonon Bosselas and BartPrenee in 1996 that can produce 160-bit hashes.
RIPEMD-160 is also a revision of the RIPEMD one-way hash function designed by the European Union RIPE project. The method comprises the following steps: RIPEMD-128, RIPEMD-256, RIPEMD-320, etc. The strong collision resistance of RIPEMD has been compromised in 2004, but RIPEMD-160 has not yet been compromised. The digital encryption system currently used in bitcoin is RIPEMD-160.
3. SHA series
SHA-1 was designed by NIST (National Institute of Standards and Technology ) in 1993 as a one-way hash function capable of generating 160-bit hash values. As the U.S. Federal information processing Specification (FIPS PUB 180), published as SHA, the revision (FIPS PUB 180-1) published in 1995 was called SHA-1. The NIST then designed a series of SHA as follows:
SHA-256 is capable of generating a 256-bit hash value one-way hash function
SHA-384 is capable of generating 384-bit hash value one-way hash functions
SHA-512 is capable of generating a 512-bit hash value one-way hash function
These one-way hash functions of SHA-2 (SHA-256, SHA-384, SHA-512) were issued in 2002 as a new version (FIPS PUB 180-2) concurrently with SHA-1. The strong collision resistance of SHA-1 has been compromised in 2005, but SHA-2 has not yet been compromised. SHA-3 is the next generation one-way hash function SHA-3 that was developed by NIST (National Institute of Standards and Technology ) beginning in 2005 to replace SHA-1. A one-way hash function algorithm of Keccak was used. Currently, the Internet (SSL/TLS- -Secure Socket Layer/Transport Layer Security cryptosystem mainly adopts the SHA-2 standard.
All of the above cryptographic techniques can be referred to as conventional digital cryptographic techniques, which have the main problems:
1. conventional digital cryptography uses a fixed codebook multiple times.
Defects and deficiencies: security is limited and once a fixed codebook leaks, security fails. The actual requirements of large information quantity and quick change in modern times cannot be met.
2. Conventional digital cryptography uses specialized one-way hash functions, and hash values employ fixed-length binary bits, such as 128 bits, 256 bits, etc., of SHA-2, with a maximum of 512 bits, although SHA-3 alone may not be limited in length. Defects and deficiencies: is regulated by international export, and has high cost.
3. The above conventional digital cryptography methods are all single structures employing a single digital unit.
Defects and deficiencies: the encryption key is generated independently of the background information of the encrypted information W.
The secondary problems are:
1. the traditional password method adopts the following steps:
the encryption processing is directly carried out on the information W, and the encryption method is only related to W and is irrelevant to technical parameters of a Client browser end and a Server end of transmission communication equipment.
2. The traditional password method adopts the following steps:
the encryption processing is directly carried out on the information W, and the encryption method is only related to the W and is irrelevant to the background information of the information host A and the information access receiver B.
Disclosure of Invention
The invention provides an information security digital encryption method based on a disposable codebook, which is organically combined with a third party transmission SSL/TLS communication protocol password system to completely solve the problem of big data and information security in an Internet environment. The invention adopts the following technical scheme for realizing the purposes:
the invention discloses an information security digital encryption method based on a disposable codebook, which comprises the following steps: the method comprises the steps of utilizing host characteristic information of a file and information special for communication equipment used by the file to form front and back background information, forming a double-track double-block K-group digital vector association structure, extracting part of characteristic information in the background information to serve as a digital key for encrypting plaintext information, adopting a functional dynamic encryption algorithm to encrypt and modulate a symbol dictionary, generating a one-time digital cipher book with the background information, and generating a public digital cipher of the plaintext information.
The information security digital encryption method based on the one-time use codebook provided by the invention is organically combined with the SSL/TLS communication protocol encryption system transmitted by the third party, so that the big data and information security in the Internet environment are effectively ensured. The method is suitable for completing the encryption task of the plaintext information by utilizing the characteristic that the private confidential information and the public information are asymmetric under the condition that the background information of the Internet environment is not completely transparent.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate and do not limit the invention, and together with the description serve to explain the principle of the invention:
FIG. 1 is a block K-group random feature number vector correlation body with double tracks and double granules according to an embodiment of the invention
Figure BSA0000182085040000051
Is a working principle diagram of the (c).
FIG. 2 is a private secret digital key of an embodiment of the present invention
Figure BSA0000182085040000052
Modulation schematic.
FIG. 3 is a private public digital key of an embodiment of the present invention
Figure BSA0000182085040000053
Modulation schematic.
FIG. 4 shows the embodiment of the invention with prospect
Figure BSA0000182085040000061
Public digital password of characteristic KeyW (x)/PassW (x)
Figure BSA0000182085040000062
Modulation schematic.
Detailed Description
The present invention will now be described in detail with reference to the drawings and the specific embodiments thereof, wherein the exemplary embodiments and descriptions of the present invention are provided for illustration of the invention and are not intended to be limiting.
Examples:
basic concept and mathematical principle of digital encryption modulation algorithm
1. Monorail K granule digital vector unit:
Figure BSA0000182085040000063
assume that
Figure BSA0000182085040000064
The method is an L-dimensional positive integer digital vector group with the digital length of M bits and the metering system unit of L, and can be divided into K groups.
When K is more than 1, the method comprises the steps of,
Figure BSA0000182085040000065
namely an L-dimension digital vector unit of a single-track K granule:
Figure BSA0000182085040000066
is a digital vector group composed of positive integer digital information.
It can be noted that:
Figure BSA0000182085040000067
when k=1, _a->
Figure BSA0000182085040000068
The transformation into a common monorail L-dimensional vector +.>
Figure BSA0000182085040000069
Is a positive integer number set.
2. Double-track K-block digital vector correlation body:
Figure BSA00001820850400000610
assume that
Figure BSA00001820850400000611
The number length is M bits, the metering system unit is L, and the two L-dimensional positive integer number vector groups can be divided into K groups:
Figure BSA0000182085040000071
is composed of
Figure BSA0000182085040000072
Double-track K-block digital vector correlation body: />
Figure BSA0000182085040000073
3. Double-track single-block digital vector correlation body
Figure BSA0000182085040000074
Assume that
Figure BSA0000182085040000075
The number length is M bits, the metering system unit is L, and the metering system unit can be divided into two L-dimensional positive integer number vector groups of K groups. In particular, when k=1, at +.>
Figure BSA0000182085040000076
In the process, the liquid crystal display device comprises a liquid crystal display device,
Figure BSA0000182085040000077
wherein (1)>
Figure BSA0000182085040000078
Are all normal L-dimensional positive integer digital vectors.
Weighing scale
Figure BSA0000182085040000079
The vector correlation body is an L-dimensional double-track single-block digital vector.
4. Parameter-free double-rail single-block digital vector correlation body:
and (3) making:
Figure BSA00001820850400000710
for origin, ++>
Figure BSA00001820850400000711
Is a moving point.
Then
Figure BSA00001820850400000712
Is a two-track single-block digital vector correlation body, and forms a plane called a digital cipher plane MMS in an L-dimension digital vector space. In MMS plane there is a concomitant L-dimensional double-track single-block digital vector correlation body +.>
Figure BSA00001820850400000713
Figure BSA0000182085040000081
A is called an associated matrix, and +.>
Figure BSA0000182085040000082
Figure BSA0000182085040000083
Let B be the derivative matrix, and +.>
Figure BSA0000182085040000084
Thus, it is called
Figure BSA0000182085040000085
Is->
Figure BSA0000182085040000086
Non-parameter associated digital vector correlation body
Weighing scale
Figure BSA0000182085040000087
Is->
Figure BSA0000182085040000088
Non-parametric derived digital vector correlation body
From derived transformations
Figure BSA0000182085040000089
Namely: />
Figure BSA00001820850400000810
The encryption function of the digital password is realized.
5. Double-track double-block K grouping digital vector correlation body:
Figure BSA00001820850400000811
assume that
Figure BSA00001820850400000812
The number length is M bits, the metering system unit is L, and the metering system unit can be divided into two L-dimensional positive integer number vector groups of K groups. If not specified otherwise, in the following, M.ltoreq.13, l=10, 1 is assumed < L < +++ and L is a positive integer. When k=2, by +.>
Figure BSA00001820850400000813
The formed association body is used for: />
Figure BSA00001820850400000814
To represent. Here:
Figure BSA00001820850400000815
assume that:
Figure BSA00001820850400000816
is the (foreground) first number vector, < ->
Figure BSA00001820850400000817
For the (background) second digital vector, W (x) is the plaintext of the information.
For the sake of simplicity the device is designed to be,
definition 1:
Figure BSA00001820850400000818
use->
Figure BSA00001820850400000819
Representing a set of background parametric information digital vectors representing the foreground.
Definition 2:
Figure BSA00001820850400000820
use->
Figure BSA00001820850400000821
Representing a digitally encoded vector set representing the character set of the information W (x) that needs to be encrypted.
Definition 3:
Figure BSA00001820850400000822
use->
Figure BSA00001820850400000823
And representing the background parameter information digital vector group representing the background.
Definition 4:
Figure BSA00001820850400000824
use->
Figure BSA00001820850400000825
Representation, representing addThe background keyword Key W (x)/PassW (x) character set of the secret control process is a digital coding vector group.
Thus, the first and second substrates are bonded together,
Figure BSA0000182085040000091
at->
Figure BSA0000182085040000092
In the case of a change in the background B and a further subdivision into groups K-1, then +.>
Figure BSA0000182085040000093
While the changes constitute K-1 subpackets. At this time, by +.>
Figure BSA0000182085040000094
The formed association body can be used
Figure BSA0000182085040000095
To represent. Then, there are:
Figure BSA0000182085040000096
and call->
Figure BSA0000182085040000097
Grouping the digital vector correlation bodies for the double-track double-granule K,
the method is characterized by comprising the following steps:
Figure BSA0000182085040000098
wherein->
Figure BSA0000182085040000099
Is the kth packet.
Encryption modulation algorithm of information plaintext W (x)
General function word cipher book
Figure BSA00001820850400000910
Modulation of (2)
Assume that
Figure BSA00001820850400000911
The number length is M bits, the metering system unit is L, and the two L-dimensional positive integer number vector groups can be divided into two groups of K groups. At this time, by +.>
Figure BSA00001820850400000912
The digital vector correlation body is formed: />
Figure BSA00001820850400000913
Definition 5: v is a vector consisting of 2 numbers
Figure BSA00001820850400000914
The dimension of the metric space is L. V can be divided into independent subspaces V 1 ,V 2 ,…V i ,…V K ,V i Is the V i-th subspace (i=1, 2, …, K).
Definition 6: let t denote the vector
Figure BSA00001820850400000915
The subscript value of the metric space V is formed and B is used 1 ,B 2 ,B 3 ,…,B k-1 ,B k Representing each subspace V i The maximum value of the subscript (i=1, 2, …, K, l=b K )。
Definition 7: by m i =B i -B i-1 (i=1, 2, …, K) denotes subspace V i Is a dimension of (c). And at t E (B) i-1 ,B i ]On each subspace of (2), there is m 1 =B 1 ,m 2 =B 2 -B 1 ,...,m K =B K -B K-1 ,(B K =L,1≤t≤L)。
When M is less than or equal to 13 and l=10, the method comprises the following steps of
Figure BSA00001820850400000916
The composed double-track double-group K grouping digital vector correlation body is as follows:
Figure BSA0000182085040000101
and has the following components: t is more than or equal to 1 and less than or equal to L
Deriving a cryptographic transformation: v (t) =p (t) +q (t)
Derivative digital vector:
Figure BSA0000182085040000102
functional derived cryptographic transformations:
Figure BSA0000182085040000103
functional derivative digital vector:
Figure BSA0000182085040000104
in particular: in last bit vector subspace V K And (3) the following steps: m is m K =N,τ∈(B K-1 ,B K ](τ=0, 1,2, …, N) and
Figure BSA0000182085040000105
and (3) performing linear transformation: p (P) WZ (B K-1 +1+τ)=MB(τ)(t=B K-1 +1+τ) then creates a new double track double block K grouped digital vector correlation:
Figure BSA0000182085040000106
a high-dimensional one-way hash functional power algorithm DMAC (c) is adopted for encoding the dictionary +.>
Figure BSA0000182085040000107
Modulating to obtain->
Figure BSA0000182085040000108
The functional derivative 1-1 corresponds to the transformation. Thereby generating a new alphanumeric code mapping relationship: />
Figure BSA0000182085040000109
Thus creating a new digital codeDictionary:
Figure BSA00001820850400001010
thus, it is called a generalized function word codebook:
Figure BSA00001820850400001011
note 1: MB (τ) is a character encoding dictionary
Figure BSA00001820850400001012
UTF-8/16 unified digital coding of character No. tau, Z (tau);
and (2) injection: DMAC (c) is a special one-way hash functional power calculation method;
and (3) injection: v (V) WZ RTMB (τ) as a correlator
Figure BSA0000182085040000111
The value at point τ.
Random generalized function word cipher book
Figure BSA0000182085040000112
New generated universal function word cipher book
Figure BSA0000182085040000113
In the modulation process of (2) the association->
Figure BSA0000182085040000114
Background conditions of (2):
Figure BSA0000182085040000115
is fixed. But when local digital vector is taken +.>
Figure BSA0000182085040000116
Is a pseudo-random number subspace
Figure BSA0000182085040000117
And then generating a double-track double-granule K grouping random number vector correlation body: />
Figure BSA0000182085040000118
Digital code book->
Figure BSA0000182085040000119
The digital codebook with random parameter R is modulated:
Figure BSA00001820850400001110
therefore, it is called random generalized function word codebook
Figure BSA00001820850400001111
And (4) injection:
Figure BSA00001820850400001112
as pseudo-random number vectors, RND (x) is a pseudo-random function.
Disposable digital cipher book
Figure BSA00001820850400001113
The first party (information host A) encrypts the information plaintext W (x) to be kept secret, and then generates a digital password file MW (x) for storage. When the second party (information access person B) needs to make an information access, the digital password MW (x) is transmitted to the second party (information access receiver B) by the third party (intermediate person C). The context conditions are formed by a series of associated information such as A, B, C and the environment D where ABC is located:
Figure BSA00001820850400001114
plus pseudo-random number space->
Figure BSA00001820850400001115
Then a uniquely determined encryption condition is constituted that is only related to ABCD:
Figure BSA0000182085040000121
under the condition, communication characteristic authentication information of a third party C/S is added>
Figure BSA0000182085040000122
Constitute the double track double group K group random number vector correlation body:
Figure BSA0000182085040000123
the notation dictionary is +.>
Figure BSA0000182085040000124
Modulating, thereby producing a random generalized function word codebook with third party authentication:
Figure BSA0000182085040000125
the method is called as: disposable digital cipher book
Figure BSA0000182085040000126
And (5) injection: r represents a random parameter;
and (6) injection: t represents the band pass authentication parameter.
FIG. 1 is a block K-group random feature number vector correlation body with double tracks and double granules according to an embodiment of the invention
Figure BSA0000182085040000127
Is a working principle diagram of the (c).
Definition 8: (digital code) a one-time use digital code book:
Figure BSA0000182085040000128
after generation. Ming dynastyThe word W (x) is in the digital codebook +.>
Figure BSA0000182085040000129
In (a) the corresponding value->
Figure BSA00001820850400001210
A digital cipher called plaintext W (x).
Definition 9: (private digital password) when
Figure BSA00001820850400001211
When the private information is the private information, the private digital codebook is as follows: />
Figure BSA00001820850400001212
Plaintext W (x) is in digital codebook +.>
Figure BSA00001820850400001213
In (a) the corresponding value->
Figure BSA00001820850400001214
A private digital password called plaintext W (x).
Definition 10: (public digital code) when
Figure BSA00001820850400001215
When the public information is the public information, the public digital code book is as follows: />
Figure BSA00001820850400001216
Plaintext W (x) is in public digital codebook +.>
Figure BSA00001820850400001217
In (a) the corresponding value->
Figure BSA0000182085040000131
A public digital cipher called plaintext W (x).
Private secret digital key
Figure BSA0000182085040000132
And private public digital key->
Figure BSA0000182085040000133
In the digital codebook:
Figure BSA0000182085040000134
in the modulation process of (1), the double-track double-block group K-1 grouping digital vector association condition is utilized:
Figure BSA0000182085040000135
constitute general digital association->
Figure BSA0000182085040000136
Performing first modulation by adopting functional power algorithm DMAC (c) to generate universal digital codebook +.>
Figure BSA0000182085040000137
Constructing a digital vector ++with a foreground according to a special rule by using the foreground condition>
Figure BSA00001820850400001319
Special text Key W (x) for keywords, digital codebook +.>
Figure BSA0000182085040000138
Generating a key number vector private digital password corresponding to the Key W (x)>
Figure BSA0000182085040000139
Definition 11: here, the
Figure BSA00001820850400001310
Corresponding to PW (x), called private secret digital key, noted +.>
Figure BSA00001820850400001311
FIG. 2 is a schematic illustration of the present inventionEmbodiment private secret digital key
Figure BSA00001820850400001312
Is a modulation scheme of (a)
Will be
Figure BSA00001820850400001313
Digital vector +.>
Figure BSA00001820850400001314
Another part of information->
Figure BSA00001820850400001315
Thus, a new vector with the foreground number is generated +.>
Figure BSA00001820850400001320
Double-track double-granule K grouping digital vector correlation body with key character:
Figure BSA00001820850400001316
DMAC (c) versus symbol dictionary employing functional power algorithm
Figure BSA00001820850400001317
And re-modulating the second time. Obtaining a new one-time use vector with a foreground number +.>
Figure BSA00001820850400001318
Digital codebook of key feature information:
Figure BSA0000182085040000141
thus, at codebook->
Figure BSA0000182085040000142
The foreground number vector ++of the password PassW (x) is generated in>
Figure BSA0000182085040000143
Private public digital code of features->
Figure BSA0000182085040000144
Definition 12: here, the
Figure BSA0000182085040000145
Corresponds to GW (x), called private public digital key, denoted as +.>
Figure BSA0000182085040000146
Thus, the first and second substrates are bonded together,
Figure BSA0000182085040000147
key digital vector encryption information (private secret digital key) which is the most important for the password PassW (x) to complete the encryption task. In turn->
Figure BSA0000182085040000148
Becomes the private public digital key of W (x).
FIG. 3 is a private public digital key of an embodiment of the present invention
Figure BSA0000182085040000149
Is a modulation scheme of (a)
Private public digital key
Figure BSA00001820850400001410
And public digital code->
Figure BSA00001820850400001411
Is of (a) associated modulation
Definition 13: when (when)
Figure BSA00001820850400001412
Is a public foreground digital vector->
Figure BSA00001820850400001413
When (I)>
Figure BSA00001820850400001414
When->
Figure BSA00001820850400001415
Key W (x) is defined by +.>
Figure BSA00001820850400001416
When the key W (x) and the passW (x) are combined, the generated public digital code +_>
Figure BSA00001820850400001417
With->
Figure BSA00001820850400001418
Is a private feature of (a). It is called a public digital code, noted: />
Figure BSA00001820850400001419
From the definition above alone:
Figure BSA00001820850400001420
and->
Figure BSA00001820850400001421
There is no association. Only foreground condition->
Figure BSA00001820850400001422
And->
Figure BSA00001820850400001423
Is different in value. But in the actual encryption modulation process, the background condition is adopted>
Figure BSA00001820850400001424
To change the personality modulation of
Figure BSA00001820850400001425
And->
Figure BSA00001820850400001426
Is a relationship of association of the above. Thereby realizing the modulation function of (private/public) associated encryption. The specific implementation process is as follows:
grouping the private digital vector correlation bodies with double-track double-granule K:
Figure BSA00001820850400001427
DMAC (c) adopting functional power algorithm for character dictionary +.>
Figure BSA00001820850400001428
The first modulation is performed. Generating a private universal digital codebook: />
Figure BSA00001820850400001429
In the foreground condition->
Figure BSA00001820850400001430
A set of key keys w (x) is extracted. Utilize private digital codebook->
Figure BSA00001820850400001431
Private secret digital key modulated to W (x)>
Figure BSA00001820850400001432
Reuse->
Figure BSA00001820850400001433
Calculating as parameters, partially replacing the correlation body->
Figure BSA0000182085040000151
Is->
Figure BSA0000182085040000152
Namely: />
Figure BSA0000182085040000153
Figure BSA0000182085040000154
The functional power algorithm DMAC (c) is adopted for the word dictionary +.>
Figure BSA0000182085040000155
Performing a second modulation, thereby generating a new one-time-use private digital codebook with foreground features>
Figure BSA0000182085040000156
The private public key +_of the password PassW (x) can thus be modulated out>
Figure BSA0000182085040000157
In public digital ciphers
Figure BSA0000182085040000158
In the modulation process of (2) with private public digital key->
Figure BSA0000182085040000159
Calculating as public parameter to replace partial public double track double block K group digital vector relation body ∈>
Figure BSA00001820850400001510
In (a) and (b)
Figure BSA00001820850400001511
Namely: />
Figure BSA00001820850400001512
Figure BSA00001820850400001513
The functional power algorithm DMAC (c) is adopted for the word dictionary +.>
Figure BSA00001820850400001514
The third modulation is carried out, thereby generating a new disposable with prospect +.>
Figure BSA00001820850400001515
Public digital codebook of keyword Key W (x) and password PassW (x)>
Figure BSA00001820850400001516
Thereby modulating the product with prospect +.>
Figure BSA00001820850400001517
Public digital code of plaintext information W (x) of feature KeyW (x)/PassW (x)>
Figure BSA00001820850400001518
FIG. 4 is a public digital code of an embodiment of the present invention
Figure BSA00001820850400001519
Is a modulation scheme of (a)
Due to
Figure BSA00001820850400001520
Is->
Figure BSA00001820850400001521
Use of foreground vector +.>
Figure BSA00001820850400001522
Key w (x) and pass word PassW (x). Public digital code->
Figure BSA00001820850400001523
With the private feature of plaintext W (x). Thereby realizing private public digital key +>
Figure BSA00001820850400001524
And public digital code->
Figure BSA00001820850400001525
Is a modulation of the correlation of (a).
Digital cipher decryption algorithm for digital cipher MW (x)
Information host A is required in different places or at different timesWhen decrypting digital cipher MW (x), firstly obtaining public digital cipher
Figure BSA0000182085040000161
After this, a private secret digital key +.>
Figure BSA0000182085040000162
Modulating private public digital key with private key and password KeyW (x)/PassW (x)>
Figure BSA0000182085040000163
To->
Figure BSA0000182085040000164
Calculating as public parameter to replace partial public double track double block K group digital vector relation body ∈>
Figure BSA0000182085040000165
Is->
Figure BSA0000182085040000166
Namely:
Figure BSA0000182085040000167
Figure BSA0000182085040000168
thereby generating a one-time-use digital cipher +_ with private key>
Figure BSA0000182085040000169
Public digital codebook of key features +.>
Figure BSA00001820850400001610
Then receive the public digital code +.>
Figure BSA00001820850400001611
Using character dictionary->
Figure BSA00001820850400001612
The digital comparison calculation is carried out to obtain
Figure BSA00001820850400001613
The corresponding UTF-8/16 is coded uniformly. Thereby, the information plaintext W (x) is restored, thereby realizing the information plaintext W (x) by the public password +.>
Figure BSA00001820850400001614
Decryption to W (x).
Figure BSA00001820850400001615
Figure BSA00001820850400001616
The foregoing has described in detail the technical solutions provided by the embodiments of the present invention, and specific single examples have been applied to illustrate the principles and implementations of the embodiments of the present invention, and the description of the above embodiments is only suitable for helping to understand the principles of the embodiments of the present invention; meanwhile, as for those skilled in the art, according to the embodiments of the present invention, there are variations in the specific embodiments and the application scope, and the present description should not be construed as limiting the present invention.

Claims (3)

1. An information security digital encryption method based on a disposable cipher book is characterized by comprising the following steps:
Figure FDA0004240572900000011
the number length is M bits, the metering system unit is L, and the two L-dimensional positive integer number vector groups can be divided into K groups:
Figure FDA0004240572900000012
by->
Figure FDA0004240572900000013
Constitute a double track K group digital vector correlation body:
Figure FDA0004240572900000014
the digital information of the information host A forms a foreground condition:
Figure FDA0004240572900000015
the information receiver B, the transmission third party C/S and the digital information of the communication network environment D construct the background condition according to a certain rule: />
Figure FDA0004240572900000016
Plus pseudo-random number vector subspace->
Figure FDA0004240572900000017
Constructing a joint encryption condition->
Figure FDA0004240572900000018
Communication characteristic authentication digital information added with third party C/S>
Figure FDA0004240572900000019
K grouping random number vector correlation body for forming double-track double-group>
Figure FDA00042405729000000110
The notation dictionary is +.>
Figure FDA00042405729000000111
Modulating, thereby producing a random digital codebook with third party authentication,
i.e. one-time use digital codebook:
Figure FDA0004240572900000021
wherein the information plaintext W (x) is in the digital code book
Figure FDA0004240572900000022
Corresponding value +.>
Figure FDA0004240572900000023
Is a digital cipher of the information plaintext W (x).
2. The one-time-use-codebook-based information security digital encryption method as defined in claim 1, wherein:
using the double-track double-block K-1 grouping digital vector association condition:
Figure FDA0004240572900000024
constructing a random number vector correlation body: />
Figure FDA0004240572900000025
Performing first modulation by adopting a functional power algorithm DMAC (c) to generate a random universal digital codebook:
Figure FDA0004240572900000026
use prospect condition:
Figure FDA0004240572900000027
constructing the vector with the foreground number according to a specific rule>
Figure FDA0004240572900000028
Special text Key W (x) of keyword, using universal digital codebook +.>
Figure FDA0004240572900000029
Generating a key digital vector private digital key corresponding to KeyW (x)
Figure FDA00042405729000000210
Will->
Figure FDA00042405729000000211
Digital vector +.>
Figure FDA00042405729000000212
Another part of information,/i>
Figure FDA00042405729000000213
Thereby generating a new vector with foreground digits +.>
Figure FDA00042405729000000214
Double-track double-granule K grouping digital vector correlation body with key character:
Figure FDA00042405729000000215
the notation dictionary is +.>
Figure FDA00042405729000000216
Performing secondary modulation to obtain new one-time used digital vector ++>
Figure FDA00042405729000000217
Digital codebook of key information:
Figure FDA00042405729000000218
thereby modulating the private public digital key of the password PassW (x)>
Figure FDA00042405729000000219
3. The one-time-use-codebook-based information security digital encryption method as defined in claim 2, wherein:
in the foreground condition
Figure FDA00042405729000000220
Extracting a group of key words KeyW (x), and utilizing private digital codebook +.>
Figure FDA00042405729000000221
Private public digital key modulating the password PassW (x)>
Figure FDA00042405729000000222
To->
Figure FDA00042405729000000223
Calculating as public parameter to replace partial public double track double block K group digital vector relation body ∈>
Figure FDA00042405729000000224
Is->
Figure FDA00042405729000000225
Namely:
Figure FDA0004240572900000031
Figure FDA0004240572900000032
the functional power algorithm DMAC (c) is adopted for the word dictionary +.>
Figure FDA0004240572900000033
Performing a third stepSecondary modulation to produce a new one-time use with private public digital key
Figure FDA0004240572900000034
Public digital codebook->
Figure FDA0004240572900000035
Public digital password for generating plaintext information W (x)
Figure FDA0004240572900000036
CN201910321141.6A 2019-04-18 2019-04-18 Information security digital encryption method based on one-time use codebook Active CN111835506B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910321141.6A CN111835506B (en) 2019-04-18 2019-04-18 Information security digital encryption method based on one-time use codebook

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910321141.6A CN111835506B (en) 2019-04-18 2019-04-18 Information security digital encryption method based on one-time use codebook

Publications (2)

Publication Number Publication Date
CN111835506A CN111835506A (en) 2020-10-27
CN111835506B true CN111835506B (en) 2023-06-27

Family

ID=72912162

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910321141.6A Active CN111835506B (en) 2019-04-18 2019-04-18 Information security digital encryption method based on one-time use codebook

Country Status (1)

Country Link
CN (1) CN111835506B (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008085579A2 (en) * 2006-10-25 2008-07-17 Spyrus, Inc. Method and system for deploying advanced cryptographic algorithms
CN101355422B (en) * 2008-07-16 2014-01-08 冯振周 Novel authentication mechanism for encrypting vector
CN102710605A (en) * 2012-05-08 2012-10-03 重庆大学 Information security management and control method under cloud manufacturing environment
CN103177415A (en) * 2013-04-08 2013-06-26 上海理工大学 Transform domain optical holographic watermarking algorithm based on colored image characteristic area
CN109218013A (en) * 2018-10-10 2019-01-15 青岛科技大学 Cover the binary data communication encryption method on plaintext symbol boundary

Also Published As

Publication number Publication date
CN111835506A (en) 2020-10-27

Similar Documents

Publication Publication Date Title
CN110677237B (en) File encryption method with chaos-like characteristic
CN111510281B (en) Homomorphic encryption method and device
GB2551865A (en) Improved stream cipher system
CN107181584B (en) Asymmetric completely homomorphic encryption and key replacement and ciphertext delivery method thereof
Koko et al. Comparison of Various Encryption Algorithms and Techniques for improving secured data Communication
Saikumar DES-Data Encryption Standard
CN111049738B (en) E-mail data security protection method based on hybrid encryption
Widiasari Combining advanced encryption standard (AES) and one time pad (OTP) encryption for data security
US8458452B1 (en) System and method for encryption and decryption of data transferred between computer systems
Tiwari Cryptography in blockchain
Yang Application of hybrid encryption algorithm in hardware encryption interface card
CN110932863B (en) Generalized signcryption method based on coding
Gaur et al. Comparative Study on Different Encryption and Decryption Algorithm
CN111835506B (en) Information security digital encryption method based on one-time use codebook
Kadry et al. An improvement of RC4 cipher using vigenère cipher
Tahir et al. A scheme for the generation of strong cryptographic key pairs based on ICMetrics
CN108768923A (en) A kind of real-time encrypted method of chat of the Encryption Algorithm based on Quantum Reversible Logic circuit
Singh et al. A secure private key encryption technique for data security in modern cryptosystem
WO2022021005A1 (en) Symmetric encryption and decryption method based on exponential complexity
KR102304831B1 (en) Encryption systems and method using permutaion group based cryptographic techniques
Pushpa Enhancing Data Security by Adapting Network Security and Cryptographic Paradigms
Tarawneh Cryptography: Recent Advances and Research Perspectives
CN111865578A (en) SM 2-based multi-receiver public key encryption method
Chen et al. An image encryption algorithm based on SM4 and Base64
Yin et al. A symmetric key exchange protocol bsaed on virtual S-box

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