CN109409106A - A kind of Shannon perfection time slot scrambling of novel infinite alphabet - Google Patents
A kind of Shannon perfection time slot scrambling of novel infinite alphabet Download PDFInfo
- Publication number
- CN109409106A CN109409106A CN201811165947.2A CN201811165947A CN109409106A CN 109409106 A CN109409106 A CN 109409106A CN 201811165947 A CN201811165947 A CN 201811165947A CN 109409106 A CN109409106 A CN 109409106A
- Authority
- CN
- China
- Prior art keywords
- cryptographic
- information
- key
- plaintext
- shannon
- 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
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
Abstract
The invention discloses a kind of Shannon perfection time slot scramblings of novel infinite alphabet, belong to information technology field, comprising the following steps: step 1: determining primary word matrix according to the information of required transmitting, combination forms information in plain text；Step 2: alphabet is encoded to obtain digital plaintext；Step 3: it is sequentially grouped with some regular length in plain text digital；Step 4: encrypting each grouping of digital plaintext, the plaintext cryptographic being newly grouped；Step 5: cryptographic key is generated using inverible transform, encryption obtains information ciphertext；Step 6: encryption cryptographic key obtains key ciphertext；Step 7: information transmitting；Step 8: recipient calculates all cryptographic keys using the seed key that safe lane receives, and obtains information cryptographic with cryptographic key solution confidential information ciphertext；Step 9: the corresponding plaintext of cryptographic is calculated.Encrypting and decrypting of the present invention is efficient, highly-safe, so that Shannon perfection secrecy theory can be applied to the secrecy transmission of extensive plaintext.
Description
Technical field
The present invention is a kind of Shannon perfection time slot scrambling of novel infinite alphabet, belongs to field of information security technology, relates to
And arrive many technical fields such as information communication safety and computer network security.
Background technique
In field of information security technology, information encryption is a core of information security.Shannon proposes a set of based on entropy
Information theory with it established information security mathematical theory basis.Wherein, Shannon proposes a set of perfect security scheme.It is sorry
Ground is the perfect confidentiality that Shannon also demonstrates that perfect secrecy needs the password at least as information content just to can guarantee information, this
A characteristic prevents the perfect practical application to maintain secrecy.Current all commercial encryption schemes are all based on the encryption of computation complexity
Method.
Secret method based on computation complexity all assumes that the mathematical problem in encipherment scheme has very high calculate again
Miscellaneous degree generally assumes that as NP hardly possible.Many commercial solutions, for example, RSA, ECC, Elgamal etc., they assume big integer point
Solution is a challenge.However, there is no a stringent proofs for the hypothesis.It is worse, quantum calculation has been found at present
Method can decompose any integer in polynomial time.So encipherment scheme of the design based on comentropy opinion has important theory
With practical application value.
The Shannon perfection time slot scrambling for the novel infinite alphabet of one kind that the present patent application is proposed is based on information entropy theory,
And encryption and decrypting process are all very efficiently, and the probability that theoretically password is cracked is 0.So this method can be widely
Applied to many technical fields such as information communication safety and computer network security.
Summary of the invention
Beneficial effects of the present invention: the present invention is re-encrypted by the random cipher to Shannon perfection secret password, contracting
The short length for guaranteeing password required for Shannon perfection maintains secrecy so that Shannon perfection secrecy theory can be applied to it is extensive bright
The secrecy transmission of text.Moreover, the encryption that the present invention uses can be completed with decryption method in linear session.So this hair
Bright is also an efficient cryptographic methods.Therefore, method of the invention can be with, but is not limited to, and is applied to the needs efficiently big text of transmission
Many technical fields such as this information communication safety and computer network security.
The purpose of the present invention is to provide efficiently and guarantee that the cryptographic methods of perfect secrecy be the safety of guarantee information communication
Technical support is provided.The technology has developed the technology that a set of pair of password re-encrypts sufficiently to solve the password in Shannon perfection password
Scale issue.
In order to achieve the above objectives, the invention provides the following technical scheme:
A kind of Shannon perfection time slot scrambling of novel infinite alphabet, it is characterised in that: comprise the steps of:
Step 1: determining primary word matrix according to the information of required transmitting, and with the alphabet, by combination, to form information bright
Text；
Step 2: an integer range is selected according to alphabetical table size, and alphabet is carried out with the integer in this section
Coding obtains digital plaintext；
Step 3: it is sequentially grouped with some regular length in plain text digital；
Step 4: one integer set of random selection encrypts each grouping of digital plaintext, is newly grouped
Plaintext cryptographic；
Step 5: the inverible transform in an integer item is randomly choosed to the plaintext cryptographic of each new grouping, generates the group
Cryptographic key, encryption obtain information ciphertext；
Step 6: some cryptographic key is close as seed in the inverible transform and step 5 in one integer item of random selection
Key obtains key ciphertext using other cryptographic keys in seed key encrypting step five；
Step 7: information ciphertext and key ciphertext are sent to receiving party by common channel, open alphabet is compiled
Seed key, is sent to receiving party by safe lane by code；
Step 8: recipient is calculated according to the encipherment scheme of cryptographic key using the seed key that safe lane receives
All cryptographic keys, and information cryptographic is obtained with cryptographic key solution confidential information ciphertext；
Step 9: according to information cryptographic plaintext corresponding with digital plaintext, the corresponding relationship calculating cryptographic of information plaintext.
Further, the information of transmitting determines that primary word matrix ∑ is defined as needed by user oneself, so that information is in plain text
It is made of the element in alphabet.
Further, according to primary letters table element number K, determine that integer range is [0, K-1], and by letter each in ∑
It is mapped to the integer range one by one and carries out alphabet digital coding, obtains digital plaintext
Further, digital plaintextSequentially, regular length L is chosen, is divided into l group, in general, according to information security
It is required that and code efficiency requirement, L ∈ [25, 210]。
Further, opponent's number of times of attack is set as 2λ, λ=128 randomly choose an Integer N=pqAnd meet N！≥2128,
Wherein, p is prime number, and q is positive integer, and the absolute value of N can be infinity；To digital plaintextEach of
It is grouped VjRandom integers encryption is carried out, the plaintext cryptographic set of all groupings is obtainedSpecific encryption side
Method is as follows: it is assumed that Vj=(vJ, 1, vJ, 2..., vJ, L) beA grouping, wherein j=1,2 ..., l, it is random generate one it is whole
Manifold closes key μj=(uJ, 1, uJ, 2..., uJ, L) meet 0≤uJ, i≤ N-1, uses μjEncrypt Vj, the plaintext for obtaining the grouping is hidden
Literary Uj=(uJ, 1, uJ, 2..., uJ, 2L), u is met to all 1≤i≤LJ, L+i=(vJ, i-uJ, i) mod (N) and 0≤uJ, i≤N-
1；Special, when N takes infinity, u is met to all 1≤i≤LJ, L+i=(vJ, i-uJ, i)。
Further, the plaintext cryptographic of each new grouping is randomly choosed linear or non-linear reversible in an integer item
Transformation, in order to facilitate practical application, it will usually which we take the inverible transform matrix τ in the integer item that size is 2L × 2Lj, j=
1,2 ..., l, meet it is nonsingular, when N be it is limited when, need to be to τjEach element mould N, when N is to also need to meet det (τ without prescribing a time limitj)
=± 1, by τjAs this group of cryptographic key, corresponding grouping plaintext cryptographic U is encryptedj, obtain corresponding grouping information ciphertext Cj=Uj·
τj, information ciphertext set C={ Cj| j=1,2 ..., l }.
Further, randomly choosing a size is the inverible transform matrix θ in 2L × 2L integer item, meets nonsingular, works as N
When being limited, need to element mould N each to θ, when N is to also need to meet det (θ)=± 1 without prescribing a time limit；In conjunction with some in step 5 point
Group cryptographic key τk(1≤k≤l) and N are as seed key, as seed key (θ, τk, k, N), added using the seed key
Other cryptographic keys in close step 5 obtain key ciphertext σ={ σj[j=1,2 ..., l }.Specific ciphering process is as follows: needle
To other cryptographic keys in step 5, it is successively ordered as τ1, τ2..., τk-1, τk+1..., τl, as j > k, by σj=
τj-1·θ·τjEncrypt cryptographic key τj, as j < k, by σj=τj·θ·τj+1Encrypt cryptographic key τj, as j=k, at random
The INTEGER MATRICES of a 2L × 2L is generated as σj。
Further, information ciphertext C and key ciphertext σ is sent to receiving party, open alphabet by common channel
Coding, seed key (θ, τk, k, N) and receiving party sent to by safe lane.
Further, recipient is according to the encipherment scheme of cryptographic key, the seed key received using safe lane (θ,
τk, k, N) and all cryptographic keys are calculated, and information cryptographic is obtained with cryptographic key solution confidential information ciphertext.Detailed process is as follows:
(1) it calculates block length: block length L is calculated according to the dimension of θ.
(2) it calculates cryptographic key: when for j > k, usingCryptographic key decryption is carried out, for j < k
When, it uses Carry out cryptographic key decryption.
(3) information cryptographic is calculated: to each grouping information ciphertext Cj, corresponding plaintext cryptographic
Further, according to information cryptographic and corresponding relationship v digital in plain textJ, i≡uJ, i+uJ, L+iMod (N), (1≤i≤L),
Special, the v when N takes infinityJ, i≡uJ, i+uJ, L+i；Calculate each grouping plaintext cryptographic UjThe digital plaintext V of corresponding groupingj,
Again by alphabet digital coding, derive information in plain text.
Beneficial effects of the present invention: the present invention is being encrypted by the random cipher progress to Shannon perfection secret password, is contracted
The short length for guaranteeing password required for Shannon perfection maintains secrecy so that Shannon perfection secrecy theory can be applied to it is extensive bright
The secrecy transmission of text.Moreover, the encryption that the present invention uses can be completed in a short time with decryption method, and theoretically password
The probability being cracked is 0.So the present invention is also an efficient cryptographic methods.Therefore, method of the invention can be with, but unlimited
In being applied to many technical fields such as the information communication safety for needing efficiently to transmit big text and computer network security.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is a kind of Shannon perfection time slot scrambling flow chart of novel infinite alphabet in the embodiment of the present invention.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification
Other advantages and efficacy of the present invention can be easily understood for disclosed content.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, the various details in this specification can also based on different viewpoints and application, without departing from
Various modifications or alterations are carried out under spirit of the invention.It should be noted that in the absence of conflict, following embodiment and implementation
Feature in example can be combined with each other.
It should be noted that illustrating the basic structure that only the invention is illustrated in a schematic way provided in following embodiment
Think, only shown in schema then with related component in the present invention rather than component count, shape and size when according to actual implementation
Draw, when actual implementation kenel, quantity and the ratio of each component can arbitrarily change for one kind, and its assembly layout kenel
It is likely more complexity.
Embodiment: in information exchanging process, in order to maintain secrecy, we need transmitted breath to encrypt；Then pass through through
Ciphertext is passed to intended recipient by the quick channel that helps, and at the same time, is needed the corresponding password of ciphertext to pass through certain and is maintained secrecy
Mode pass to receiver；Receiver obtains information using password decryption ciphertext.
In this example, it is assumed that the information that we need to transmit is that " this is the Shannon of the novel infinite alphabet of an one kind
Perfect time slot scrambling ".
As shown in Figure 1, the Shannon perfection time slot scrambling of the novel infinite alphabet of one of the present embodiment, comprising:
S1: determining primary word matrix according to the information of required transmitting, forms information in plain text by combination with the alphabet；
S2: an integer range is selected according to alphabetical table size, and alphabet is encoded with the integer in this section
Obtain digital plaintext；
S3: it is sequentially grouped with some regular length in plain text digital；
S4: one integer set of random selection encrypts each grouping of digital plaintext, the plaintext being newly grouped
Cryptographic；
S5: the inverible transform in an integer item is randomly choosed to the plaintext cryptographic of each new grouping, generates this group of cryptographic
Key, encryption obtain information ciphertext；
S6: some cryptographic key is used as seed key in the inverible transform and S5 in one integer item of random selection
Seed key encrypts other cryptographic keys in S5, obtains key ciphertext；
Information ciphertext and key ciphertext: being sent to receiving party by common channel, disclose alphabetic coding by S7,
Seed key sends receiving party to by safe lane；
S8: recipient is calculated all according to the encipherment scheme of cryptographic key using the seed key that safe lane receives
Cryptographic key, and information cryptographic is obtained with cryptographic key solution confidential information ciphertext；
S9: according to information cryptographic plaintext corresponding with digital plaintext, the corresponding relationship calculating cryptographic of information plaintext.
In step sl:
The present embodiment uses " time slot scrambling " corresponding Chinese character quadrangular number as the information of required transmitting: " 26,294 30772
00227 34132 ", can determine primary word matrix be ∑=0,1,2 ..., 9,10 alphabets of *, with the letter table element
Information is formed in plain text by permutation and combination, and wherein * is grouping redundancy secondary characters.
In step s 2:
According to primary letters table element number 10, determine that integer range is [0,11], and letter each in ∑ is reflected one by one
Be mapped to the integer range and carry out alphabet digital coding: " 0 → 0,1 → 1,2 → 2 ..., 9 → 9, * → 11 " obtain digital plaintext
In step s3:
Digital plaintextSequentially, it is contemplated that embodiment computational complexity and readability, the present embodiment, which is chosen, to be fixed
Length L=3 is divided into 7 groups,If most
Digital number and front contained by the latter piecemeal are different, must increase grouping redundancy secondary characters " * ", i.e., last piecemeal becomes
(3211)。
In step s 4:
S401: embodiment computational complexity and readability are considered, sets opponent's number of times of attack as 2λ, λ=100, selection
Integer N=25Meet 32！≥2100；
S402: it is assumed that Vj=(vJ, 1, vJ, 2..., vJ, 4) beA grouping, wherein j=1,2 ..., 7 is random to generate
One integer set key μj=(uJ, 1, uJ, 2, uJ, 3) meet 0≤uJ, i≤ N-1, uses μjEncrypt Vj, obtain the plaintext of the grouping
Cryptographic Uj=(uJ, 1, uJ, 2..., uJ, 6), u is met to all 1≤i≤3J, 3+i=(vJ, i-uJ, i) mod (N) and 0≤uJ, i≤
N-1.Wherein, the key randomly selected
S403: to digital plaintextEach grouping VjIt is encrypted, obtains the plaintext of all groupings
Cryptographic set
In step s 5:
S501: the integer item that size is 6 × 6 in an integer item is randomly choosed to the plaintext cryptographic being each newly grouped in S4
On inverible transform matrix τj, j=1,2 ..., 7, τj=τjMod (32), usually takes τjMeet it is nonsingular, as this group of cryptographic
Key.In view of embodiment computational complexity and readability, it is 1 upper triangular matrix that the implementation case, which takes diagonal line:
S502: cryptographic key τ is usedjThe corresponding grouping plaintext cryptographic U of encryptionj, calculate information ciphertext Cj=Uj·τj, obtain letter
Breath ciphertext set C=(12 22 31 21 28 31), (7 18 19 21 6 16), (2 23 755 22), (25 9 29
69 30), (14 11 19 7 22 17), (1 49 10 5 30), (17 22 12 30 20 2) }.
In step s 6:
Randomly choosing a size is inverible transform the matrix θ, θ=τ in 6 × 6 integer items7；In conjunction with some in S501 point
Group cryptographic key τ1And 32 be used as seed key, as seed key (θ, τ1, 1,32), use the seed key encrypting step
Other cryptographic keys in five obtain key ciphertext σ={ σj| j=1,2 ..., l }.Specific ciphering process is as follows: being directed to S501
In other cryptographic keys, be successively ordered as τ1, τ2..., τ6, by σj=τj·θ·τj+1Encrypt cryptographic key τj, work as j=7
When, the random INTEGER MATRICES for generating one 6 × 6 is as σ7。
In the step s 7:
Information ciphertext C and key ciphertext σ is sent to receiving party by common channel, alphabetic coding and grouping are grown
3 disclosures are spent, seed key (θ, τ1, 1,32) and receiving party sent to by safe lane.
In step s 8:
Encipherment scheme of the recipient according to cryptographic key, seed key (θ, the τ received using safe lane1, 1,32)
All cryptographic keys are calculated, and obtain information cryptographic with cryptographic key solution confidential information ciphertext.Detailed process is as follows:
S801: calculate block length: calculating block length according to the dimension 6 × 6 of θ is 3.
S802: it calculates cryptographic key: usingCarry out cryptographic key decryption.
S803: information cryptographic is calculated: to each grouping information ciphertext Cj, corresponding plaintext cryptographic
In step s 9:
According to information cryptographic and corresponding relationship v digital in plain textJ, i≡uJ, i+uJ, 3+iMod (32), (1≤i≤3) calculate every
A grouping plaintext cryptographic UjThe digital plaintext V of corresponding groupingj, then by alphabet digital coding, derive information in plain text
" 26294307720022734132* ", the redundancy letter * for removing end are obtained in plain text " 26294307720022734132 ".
From example it can be seen that this novel Shannon perfection time slot scrambling passes through the digital coding to information, random coded
And it can guarantee the encryption method again of its random cipher the confidentiality of information and the height of encryption and decrypting process simultaneously
Effect property.Therefore the highly effective and safe transmitting of the invention that can be used for confidential information and information communication safety and computer network security
Etc. many technical fields.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.It is any ripe
The personage for knowing this technology all without departing from the spirit and scope of the present invention, carries out modifications and changes to above-described embodiment.Cause
This, institute is complete without departing from the spirit and technical ideas disclosed in the present invention by those of ordinary skill in the art such as
At all equivalent modifications or change, should be covered by the claims of the present invention.
Claims (10)
1. a kind of Shannon perfection time slot scrambling of novel infinite alphabet, it is characterised in that comprise the steps of:
Step 1: determining primary word matrix according to the information of required transmitting, forms information in plain text by combination with the alphabet；
Step 2: an integer range is selected according to alphabetical table size, and alphabet is encoded with the integer in this section
Obtain digital plaintext；
Step 3: it is sequentially grouped with some regular length in plain text digital；
Step 4: one integer set of random selection encrypts each grouping of digital plaintext, the plaintext being newly grouped
Cryptographic；
Step 5: the inverible transform in an integer item is randomly choosed to the plaintext cryptographic of each new grouping, generates this group of cryptographic
Key, encryption obtain information ciphertext；
Step 6: in the inverible transform and step 5 in one integer item of random selection some cryptographic key as seed key,
Using other cryptographic keys in seed key encrypting step five, key ciphertext is obtained；
Information ciphertext and key ciphertext: being sent to receiving party by common channel, disclose alphabetic coding by step 7,
Seed key sends receiving party to by safe lane；
Step 8: recipient is calculated all according to the encipherment scheme of cryptographic key using the seed key that safe lane receives
Cryptographic key, and information cryptographic is obtained with cryptographic key solution confidential information ciphertext；
Step 9: according to information cryptographic plaintext corresponding with digital plaintext, the corresponding relationship calculating cryptographic of information plaintext.
2. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
The information transmitted in one determines that primary word matrix ∑ is defined as needed by user oneself, so that information is in plain text by alphabet
Element composition.
3. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Two according to primary letters table element number K, determines that integer range is [0, K-1], and letter each in ∑ is mapped to this one by one
Integer range carries out alphabet digital coding, obtains digital plaintext
4. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Three numbers are in plain textSequentially, regular length L is chosen, l group is divided into, in general, being required and being encoded according to information security
Efficiency requirements, L ∈ [25, 210]。
5. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Opponent's number of times of attack is set in four as 2λ, λ=128 randomly choose an Integer N=pqAnd meet N！≥2128, wherein p is element
Number, q are positive integer, and the absolute value of N can be infinity；To digital plaintextEach grouping VjIt carries out
Random integers encryption, obtains the plaintext cryptographic set of all groupingsSpecific encryption method is as follows: it is assumed that
Vj=(vJ, 1, vJ, 2..., vJ, L) beA grouping, wherein j=1,2 ..., l generate an integer set key at random
μj=(uJ, 1, uJ, 2..., uJ, L) meet 0≤uJ, i≤ N-1, uses μjEncrypt Vj, obtain the plaintext cryptographic U of the groupingj=
(uJ, 1, uJ, 2..., uJ, 2L), u is met to all 1≤i≤LJ, L+i=(vJ, i-uJ, i) mod (N) and 0≤uJ, i≤N-1；It is special
, when N takes infinity, u is met to all 1≤i≤LJ, L+i=(vJ, i-uJ, i)。
6. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
The linear or non-linear inverible transform in an integer item is randomly choosed to the plaintext cryptographic of each new grouping in five, for side
Just practical application, it will usually which we take the inverible transform matrix τ in the integer item that size is 2L × 2Lj, j=1,2 ..., l are full
Foot is nonsingular, need to be to τ when N is limitedjEach element mould N, when N is to also need to meet det (τ without prescribing a time limitj)=± 1, by τjMake
For this group of cryptographic key, corresponding grouping plaintext cryptographic U is encryptedj, obtain corresponding grouping information ciphertext Cj=Uj·τj, information ciphertext
Set C={ Cj| j=1,2 ..., l }.
7. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Six one size of random selection are the inverible transform matrix θ in 2L × 2L integer item, meet nonsingular, when N is limited, are needed pair
The each element mould N of θ, when N is to also need to meet det (θ)=± 1 without prescribing a time limit；In conjunction with some grouping cryptographic key τ in step 5k(1
≤ k≤l) and N as seed key, as seed key (θ, τk, k, N), using in the seed key encrypting step five
Other cryptographic keys obtain key ciphertext σ={ σj| j=1,2 ..., l }.Specific ciphering process is as follows: in step 5
Other cryptographic keys, are successively ordered as τ1, τ2..., τk-1, τk+1..., τl, as j > k, by σj=τj-1·θ·τjIt encrypts hidden
Literary key τj, as j < k, by σj=τj·θ·τj+1Encrypt cryptographic key τj, random to generate a 2L × 2L's as j=k
INTEGER MATRICES is as σj。
8. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Seven information ciphertext C and key ciphertext σ send receiving party to by common channel, and open alphabetic coding is close seed
Key (θ, τk, k, N) and receiving party sent to by safe lane.
9. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Encipherment scheme of eight recipients according to cryptographic key, seed key (θ, the τ received using safe lanek, k, N) and it calculates and owns
Cryptographic key, and information cryptographic is obtained with cryptographic key solution confidential information ciphertext.Detailed process is as follows:
(1) it calculates block length: block length L is calculated according to the dimension of θ.
(2) it calculates cryptographic key: when for j > k, usingCryptographic key decryption is carried out, when for j < k,
Using Carry out cryptographic key decryption.
(3) information cryptographic is calculated: to each grouping information ciphertext Cj, corresponding plaintext cryptographic
10. the Shannon perfection time slot scrambling of the novel infinite alphabet of one kind according to claim 1, it is characterised in that: step
Rapid nine according to information cryptographic and corresponding relationship v digital in plain textJ, i≡uJ, i+uJ, L+iMod (N), (1≤i≤L) is special, works as N
V when taking infinityJ, i≡uJ, i+uJ, L+i；Calculate each grouping plaintext cryptographic UjThe digital plaintext V of corresponding groupingj, then pass through letter
Table digital coding derives information in plain text.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165947.2A CN109409106B (en) | 2018-09-25 | 2018-09-25 | Novel Shannon perfect secrecy method of infinite alphabet |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811165947.2A CN109409106B (en) | 2018-09-25 | 2018-09-25 | Novel Shannon perfect secrecy method of infinite alphabet |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109409106A true CN109409106A (en) | 2019-03-01 |
| CN109409106B CN109409106B (en) | 2021-05-28 |
Family
ID=65466720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811165947.2A Active CN109409106B (en) | 2018-09-25 | 2018-09-25 | Novel Shannon perfect secrecy method of infinite alphabet |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109409106B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022021005A1 (en) * | 2020-07-27 | 2022-02-03 | 中国科学院重庆绿色智能技术研究院 | Symmetric encryption and decryption method based on exponential complexity |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105637802A (en) * | 2013-10-16 | 2016-06-01 | 日本电信电话株式会社 | Key device, key cloud system, decryption method, and program |
| US20160154966A1 (en) * | 2014-11-28 | 2016-06-02 | Michael Stephen Fiske | Hiding Information in Noise |
| CN105790930A (en) * | 2016-04-29 | 2016-07-20 | 南京酷派软件技术有限公司 | Information encryption method and information encryption device used for mobile terminal and mobile terminal |
| CN106059768A (en) * | 2016-05-30 | 2016-10-26 | 西安电子科技大学 | Encryption system and method for resisting re-encryption key leakage and capable of cancelling attributes |
| CN107147487A (en) * | 2017-05-23 | 2017-09-08 | 高胜法 | The random block cipher of symmetric key |
-
2018
- 2018-09-25 CN CN201811165947.2A patent/CN109409106B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105637802A (en) * | 2013-10-16 | 2016-06-01 | 日本电信电话株式会社 | Key device, key cloud system, decryption method, and program |
| US20160154966A1 (en) * | 2014-11-28 | 2016-06-02 | Michael Stephen Fiske | Hiding Information in Noise |
| CN105790930A (en) * | 2016-04-29 | 2016-07-20 | 南京酷派软件技术有限公司 | Information encryption method and information encryption device used for mobile terminal and mobile terminal |
| CN106059768A (en) * | 2016-05-30 | 2016-10-26 | 西安电子科技大学 | Encryption system and method for resisting re-encryption key leakage and capable of cancelling attributes |
| CN107147487A (en) * | 2017-05-23 | 2017-09-08 | 高胜法 | The random block cipher of symmetric key |
Non-Patent Citations (2)
| Title |
|---|
| SHUIYIN LIU等: "《Unshared Secret Key Cryptography:Achieving Shannon’s Ideal Secrecy and Perfect Secrecy》", 《IEEEXPLORE》 * |
| 刘哲理等: "《保留格式加密模型研究》", 《通信学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022021005A1 (en) * | 2020-07-27 | 2022-02-03 | 中国科学院重庆绿色智能技术研究院 | Symmetric encryption and decryption method based on exponential complexity |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109409106B (en) | 2021-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mohammad et al. | A survey and analysis of the image encryption methods | |
| Baumslag et al. | A course in mathematical cryptography | |
| CN106656475A (en) | Novel symmetric key algorithm for high speed encryption | |
| Oktaviana et al. | Three-pass protocol implementation in caesar cipher classic cryptography | |
| Agrawal et al. | Elliptic curve cryptography with hill cipher generation for secure text cryptosystem | |
| CN109861809A (en) | A kind of random encipher-decipher method of grouping of functionization | |
| CN109344627A (en) | A kind of novel Shannon perfection time slot scrambling | |
| Godara et al. | An improved algorithmic implementation of rail fence Cipher | |
| US7280663B1 (en) | Encryption system based on crossed inverse quasigroups | |
| CN109409106A (en) | A kind of Shannon perfection time slot scrambling of novel infinite alphabet | |
| CN104954118B (en) | A kind of mimicry encryption method and system encoded based on vector network with DES | |
| CN108768923A (en) | A kind of real-time encrypted method of chat of the Encryption Algorithm based on Quantum Reversible Logic circuit | |
| Mohan et al. | An encryption technique using the adjacency matrices of certain graphs with a self-invertible key matrix | |
| Nalwaya et al. | A cryptographic approach based on integrating running key in feedback mode of elgamal system | |
| Disina | Robust Caesar Cipher against frequency cryptanalysis using bi-directional shifting | |
| Petrescu | n-QUASIGROUP CRYPTOGRAPHIC PRIMITIVES: STREAM CIPHERS. | |
| CN110061832B (en) | Method for realizing symmetric cipher algorithm using Chinese character as cipher | |
| CN106357382A (en) | Encryption method and system for network data transmission | |
| Joshi et al. | A randomized approach for cryptography | |
| Acharya et al. | Invertible, involutory and permutation matrix generation methods for hill cipher system | |
| CN110941815A (en) | Novel password | |
| Hegde et al. | A Comparative study on state of art Cryptographic key distribution with quantum networks | |
| Simmons | Symmetric and asymmetric encryption | |
| Amounas | Construction Efficiency of the Elliptic Curve Cryptosystem using Code Computing for Amazigh Alphabet | |
| Burke et al. | Cryptography |
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 |