CN113141348A - Four-network-in-one data-based government affair safety guarantee working method - Google Patents

Four-network-in-one data-based government affair safety guarantee working method Download PDF

Info

Publication number
CN113141348A
CN113141348A CN202110284787.9A CN202110284787A CN113141348A CN 113141348 A CN113141348 A CN 113141348A CN 202110284787 A CN202110284787 A CN 202110284787A CN 113141348 A CN113141348 A CN 113141348A
Authority
CN
China
Prior art keywords
orv
operation result
equal
result value
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110284787.9A
Other languages
Chinese (zh)
Other versions
CN113141348B (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.)
Chongqing Yangcheng Big Data Technology Co ltd
Original Assignee
Chongqing Yangcheng Big Data 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 Chongqing Yangcheng Big Data Technology Co ltd filed Critical Chongqing Yangcheng Big Data Technology Co ltd
Priority to CN202110284787.9A priority Critical patent/CN113141348B/en
Publication of CN113141348A publication Critical patent/CN113141348A/en
Application granted granted Critical
Publication of CN113141348B publication Critical patent/CN113141348B/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
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • 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/06Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • 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/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • 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/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Emergency Protection Circuit Devices (AREA)
  • Storage Device Security (AREA)

Abstract

The invention provides a four-network-in-one data-based government affair safety guarantee working method, which comprises the following steps of: s1, acquiring user information; the user information comprises one or any combination of an identity card number, a telephone number and a license plate number; and S2, encrypting the user information obtained in the step S1 and sending the encrypted user information to the cloud. The invention can read the user information through the ID card reader, avoid the input and forgetting of the information and ensure the safety of the user information.

Description

Four-network-in-one data-based government affair safety guarantee working method
Technical Field
The invention relates to the technical field of government affair safety, in particular to a work method for government affair safety guarantee based on four-in-one data.
Background
The four-in-one network is a general name of party networking, comprehensive networking, city pipe networking and illegal networking, and can enter other websites after logging in through one website, so that the problem of repeated logging in of a user is solved. However, the login of the website requires inputting user information, which causes inconvenience, and the user information may be stolen, thereby presenting a security risk.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly creatively provides a four-network-in-one data-based government affair safety guarantee working method.
In order to achieve the above purpose, the invention provides a four-network-in-one data-based government affair security guarantee working method, which comprises the following steps:
s1, acquiring user information; the user information comprises one or any combination of an identity card number, a telephone number and a license plate number;
and S2, encrypting the user information obtained in the step S1 and sending the encrypted user information to the cloud.
In a preferred embodiment of the present invention, step S2 includes the steps of:
s21, carrying out the following operation on the acquired user information to obtain an operation result value;
ORV=MD(User Info),
wherein, MD () represents a hashing algorithm using MD 5;
user Info represents User information;
ORV represents the operation result value;
s22, converting the operation result value ORV obtained in the step S21 into a B system, wherein B is a positive integer greater than or equal to 2, and obtaining the B system operation result;
judging whether the operation result value ORV is B system:
if the operation result value ORV is B system, then VBORV; wherein ORV is the operation result value, VBIs a B-system result value;
if the operation result value ORV is not in the B system, converting the operation result value ORV into the B system;
s23, the result { B } of the B-system operation is counted from 0 to [ B ]]The number of-1, written as | | (0, u)0),(1,u1),(2,u2),(3,u3),…,([B]-1,u[B]-1)||{B}
Wherein (0, u)0) Represents that the number of 0 s is u0A first one, theu0Is greater than or equal to 0 and less than or equal to<{B}>-1 is a positive integer;<{B}>representing the total number of bits of the B-system operation result { B };
(1,u1) The number of 1 s is u1A, the u1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(2,u2) The number of 2 is u2A, the u2Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(3,u3) The number of the symbols 3 is u3A, the u3Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
([B]-1,u[B]-1) Is represented by [ B]The number of-1 is u[B]-1A, the u[B]-1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d); u. of0+u1+u2+u3+…+u[B]-1=<{B}>;
S24, expressing the B-system number of the vector u0u1u2u3…u[B]-1.[B]Carrying out the following operations to obtain a first encryption result value;
ERV=MD(u0u1u2u3…u[B]-1.[B]),
wherein, MD () represents a hashing algorithm using MD 5;
u0u1u2u3…u[B]-1.[B]expressing B-system number expression quantity;
ERV represents a first encryption result value;
and S25, sending the first encryption result value ERV to the cloud.
In a preferred embodiment of the present invention, the method for converting the operation result value ORV into the B scale includes:
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure BDA0002979987730000021
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B system operation result, and converting into C system result VORV→CThe method for converting the B-system operation result comprises the following steps:
s2221, setting the round-robin parameter i to 1; a is1=VORV→C
S2222,
Figure BDA0002979987730000031
Wherein int () represents a rounding function;
[B] representing a system value corresponding to the B system;
airepresenting the integral quantity of the ith cycle;
ai+1represents the rounding amount of the i +1 th cycle;
determine a thereofi+1And 0, [ B ]]-1 and [ B]The relationship between:
if ai+1≥[B]I +1, returning to step S2222;
if 0 is less than or equal to ai+1≤([B]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic remainder parameter j to 1;
S22222,bj=aj%[B],
wherein,% represents the remainder;
[B] representing a system value corresponding to the B system;
ajrepresents the integer quantity of the j cycle;
bjindicating that the jth cycle takes the margin;
judging the relationship between j and i:
if j ≠ i, j ≠ j +1, returning to S22132;
if j is i, then B is Bibi-1bi-2…b3b2b1
Wherein { B } represents a B-system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi-2indicating the residue taken in the i-2 th cycle;
bi-1indicating that the cycle i-1 takes the residue;
biindicating that the ith cycle takes the surplus.
In a preferred embodiment of the present invention, the steps S22 to S25 are:
s22, converting the operation result value ORV obtained in the step S21 into a B ' system, wherein B ' is a positive integer greater than or equal to 2, and B ' ≠ B; obtaining the B' system operation result;
judging whether the operation result value ORV is B' system:
if the operation result value ORV is B' system, then VB′ORV; wherein ORV is the operation result value, VB′Is a B' scale result value;
if the operation result value ORV is not in the B 'system, the operation result value ORV is converted into the B' system;
s23, counting 0 to [ B 'in B' system operation result { B '}']The number of-1, written as | | (0, u)0′),(1,u1′),(2,u2′),(3,u3′),…,([B′]-1,u[B′]-1′)||{B′}
Wherein (0, u)0') indicates that the number of 0 s is u0' u, said u0' is greater than or equal to 0 and less than or equal to<{B′}>-1 is a positive integer;<{B′}>represents the total number of bits of the B 'system operation result { B' };
(1,u1') indicates that the number of 1 s is u1' u, said u1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(2,u2') indicates 2 is u2' u, said u2' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(3,u3') indicates that the number of 3 is u3' u, said u3' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
([B′]-1,u[B′]-1') represents [ B']The number of-1 is u[B′]-1' u, said u[B]′-1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d); u. of0′+u1′+u2′+u3′+…+u[B′]-1′=<{B′}>;
S24, expressing the B' number expression u0′u1′u2′u3′…u[B′]-1′.[B′]Carrying out the following operations to obtain a second encryption result value;
ERV′=MD(u0′u1′u2′u3′…u[B′]-1′.[B′]),
wherein, MD () represents a hashing algorithm using MD 5;
u0′u1′u2′u3′…u[B′]-1′.[B′]expressing B' system number expression quantity;
ERV' represents a second encryption result value;
and S25, sending the second encryption result value ERV' to the cloud.
In a preferred embodiment of the present invention, the method for converting the operation result value ORV into the B' scale includes:
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure BDA0002979987730000051
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B' system operation result, and converting into C system result VORV→CThe method for converting the B' system operation result comprises the following steps:
s2221, rounding the loop to obtain a first parameter i' equal to 1; a is1=VORV→C
S2222,
Figure BDA0002979987730000052
Wherein int () represents a rounding function;
[ B '] represents a scale value corresponding to the B' scale;
ai′representing the ith' round up quantity;
ai′+1represents the i' +1 cycle integer;
determine a thereofi′+1And 0, [ B']-1 and [ B']The relationship between:
if ai′+1≥[B′]I' +1, return to step S2222;
if 0 is less than or equal to ai′+1≤([B′]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic residual first parameter j' to 1;
S22222,bj′=aj′%[B′],
wherein,% represents the remainder;
[ B '] represents a scale value corresponding to the B' scale;
aj′represents the cycle integer of j';
bj′represents the residue taken by the j' th cycle;
judging the relationship between j 'and i':
if j ' ≠ i ', j ' +1, returning to S22132;
if j ' is i ', then B ' is Bi′bi′-1bi′-2…b3b2b1
Wherein, { B '} represents a B' system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi′-2indicating the residue taken in the i' -2 th cycle;
bi′-1indicating that the cycle i' -1 takes the rest;
bi′indicating that the ith' cycle takes the surplus.
In summary, by adopting the above technical scheme, the invention can read the user information through the identity ID card reader, avoid the input and forgetting of the information, and can ensure the safety of the user information.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a schematic block diagram of the process of the present invention.
Fig. 2 is a schematic structural diagram of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
The invention provides a four-in-one data-based government affair safety guarantee working method, which comprises the following steps as shown in figure 1:
s1, acquiring user information;
and S2, encrypting the user information obtained in the step S1 and sending the encrypted user information to the cloud. In this embodiment, the method further includes step S3,
and S3, after cloud verification, displaying the data information corresponding to the user on the touch display screen.
In a preferred embodiment of the present invention, step S2 includes the steps of:
s21, carrying out the following operation on the acquired user information to obtain an operation result value;
ORV=MD(User Info),
wherein, MD () represents a hashing algorithm using MD 5;
user Info represents User information, including one or any combination of identity card number, telephone number, license plate number;
ORV represents the operation result value;
s22, converting the operation result value ORV obtained in the step S21 into a B system, wherein B is a positive integer greater than or equal to 2, and obtaining the B system operation result;
judging whether the operation result value ORV is B system:
if the operation result value ORV is B system, then VBORV; wherein ORV is the operation result value, VBIs a B-system result value;
if the operation result value ORV is not B-scale, then steps S221-S222 are included;
s221, the operation result value ORV is converted into a C-ary result, and the preferred C-ary result is a 10-ary result. The method for converting the operation result value ORV into the C-system result comprises the following steps:
Figure BDA0002979987730000071
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B system operation result, and converting into C system result VORV→CThe method for converting the B-system operation result comprises the following steps:
s2221, setting the round-robin parameter i to 1; a is1=VORV→C
S2222,
Figure BDA0002979987730000072
Wherein int () represents a rounding function;
[B] representing a system value corresponding to the B system;
airepresenting the integral quantity of the ith cycle;
ai+1represents the rounding amount of the i +1 th cycle;
determine a thereofi+1And 0, [ B ]]-1 and [ B]The relationship between:
if ai+1≥[B]I +1, returning to step S2222;
if 0 is less than or equal to ai+1≤([B]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic remainder parameter j to 1;
S22222,bj=aj%[B],
wherein,% represents the remainder;
[B] representing a system value corresponding to the B system;
ajrepresents the integer quantity of the j cycle;
bjindicating that the jth cycle takes the margin;
judging the relationship between j and i:
if j ≠ i, j ≠ j +1, returning to S22132;
if j is i, then B is Bibi-1bi-2…b3b2b1(ii) a In this embodiment, b is defined asQWhen the ratio is more than or equal to 10, Q is 1,2, 3. 10, 11, 12, 13, 14, 15, … … and 35 can be sequentially represented by capital letters A, B, C, D, E, F, … … and Z; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z. Other values, if greater than or equal to 10, may be represented by the capital letters A, B, C, D, E, F, … …, Z in turn as 10, 11, 12, 13, 14, 15, … …, 35; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z.
Wherein { B } represents a B-system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi-2indicating the residue taken in the i-2 th cycle;
bi-1indicating that the cycle i-1 takes the residue;
biindicating the margin taken by the ith cycle;
s23, the result { B } of the B-system operation is counted from 0 to [ B ]]The number of-1, written as | | (0, u)0),(1,u1),(2,u2),(3,u3),…,([B]-1,u[B]-1)||{B}Wherein, the highest bit in the B system operation result { B } is not 0, namely the first bit is not 0; when it is a 1-bit number, only a 1-bit number can be written, for example, if it is 0, only 0 can be written, 00 cannot be written, or a plurality of 0's before or after 0; if 1, can only be written asA 1 cannot be written as a 01, or preceded by more than one 0 before a 1.
Wherein (0, u)0) Represents that the number of 0 s is u0A, the u0Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);<{B}>representing the total number of bits of the B-system operation result { B };
(1,u1) The number of 1 s is u1A, the u1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(2,u2) The number of 2 is u2A, the u2Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(3,u3) The number of the symbols 3 is u3A, the u3Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
([B]-1,u[B]-1) Is represented by [ B]The number of-1 is u[B]-1A, the u[B]-1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d); u. of0+u1+u2+u3+…+u[B]-1=<{B}>;
S24, expressing the B-system number of the vector u0u1u2u3…u[B]-1.[B]Or B-system number expression quantity u0u1u2u3…u[B]-1Carrying out the following operations to obtain a first encryption result value; wherein the B-system number expression quantity u0u1u2u3…u[B]-1.[B]Or u0u1u2u3…u[B]-1Indicates u in B scale00, u 11, u 22, u 33, … …, u[B]-1A (B)]-1. For example, a 2-ary number expression of 22.2 or 22 indicates 20 s and 21 s in a 2-ary expression; the corresponding 2-ary operation results may be 1010, 1001, 1100. The 2-ary number expression 02.2 or 02 indicates 0 s and 21 s (i.e., only 21 s) in the 2-ary expression; its corresponding 2-ary operation result may be 11. 2-system numerical expression quantity15.2 or 15 indicates 10 and 5 1 in the 2-ary expression; the corresponding 2-ary operation results may be 101111, 110111, 111011, 111101, 111110. The 3-system number expression quantity 120.3 or 120 indicates that 10, 21, 02 (only 10 and 2 1) are expressed in the 3-system; the corresponding 3-ary operation results may be 101, 110. The 3-system number expression quantity 111.3 or 111 indicates that 10, 1 and 12 exist in the 3-system expression; the corresponding 3-ary operation results may be 102, 120, 201, 210. The expression amount 1011.4 or 1011 of the 4-system number indicates 10, 01, 12, 13 (i.e. 10, 12, 1 3) in the 4-system expression; the corresponding 4-ary operation results may be 203, 230, 302, 320. The 4-ary numerical expression 1101.4 or 1101 indicates that 10, 1, 0, 2, 13 (i.e., 10, 1, 3) are expressed in 4-ary; the corresponding 4-ary operation results may be 103, 130, 301, 310. The 8-system number expression 00110010.8 or 00110010 indicates that 0, 01, 12, 13, 04, 05, 16, 07 (i.e. only 12, 13, 1 6) are expressed in the 0-system; the corresponding 8-ary operation result may be 236, 263, 326, 362, 623, 632. The 16-ary numerical expression 0000100000010001.16 or 0000100000010001 indicates that there are 0, 01, 02, 03, 14, 05, 06, 07, 0 8, 09, 0a, 1B, 0C, 0D, 0E, 1F (i.e., there are only 14, 1B, 1F) in the 16-ary expression; the corresponding 16-ary operation results may be 4BF, 4FB, B4F, BF4, F4B, and FB 4.
ERV=MD(u0u1u2u3…u[B]-1.[B]),
Wherein, MD () represents a hashing algorithm using MD 5;
u0u1u2u3…u[B]-1.[B]expressing B-system number expression quantity;
ERV represents a first encryption result value;
and S25, sending the first encryption result value ERV to the cloud.
An example is given below, taking telephone numbers 13333333333, [ B ] 8, [ C ] 10 as an example:
firstly, obtaining an operation result value:
ORV ═ md (user info), i.e.
The ORV (13333333333) ═ MD (34347C 343003E57232A5D21F14FE399E, which is a 32-bit 16-ary operation result value.
Secondly, solving a 10-system result:
Figure BDA0002979987730000101
namely, it is
Figure BDA0002979987730000102
Thirdly, solving the value of i:
Figure BDA0002979987730000111
namely, it is
Figure BDA0002979987730000112
Figure BDA0002979987730000113
Figure BDA0002979987730000114
……,
Figure BDA0002979987730000115
Figure BDA0002979987730000116
Figure BDA0002979987730000121
Since 0 is less than or equal to a42Not more than 8-1, namely not less than 0 and not more than 6 and not more than 7; so i is 42.
Fourthly, solving the 8-system operation result:
bj=aj%[B]i.e. by
Figure BDA0002979987730000122
Figure BDA0002979987730000123
Figure BDA0002979987730000124
……,
Figure BDA0002979987730000125
Figure BDA0002979987730000128
Figure BDA0002979987730000126
Since j-i, i.e., j-i-42,
then
Figure BDA0002979987730000127
Fifthly, counting the number of 0-7 in 641507606414001745344312456441742477434636, and recording as | | (0, u)0),(1,u1),(2,u2),(3,u3),…,([B]-1,u[B]-1)||641507606414001745344312456441742477434636I.e. by
Figure BDA0002979987730000131
Sixthly, obtaining a first encryption result value:
ERV=MD(u0u1u2u3…u[B]-1.[B]),
namely, it is
Figure BDA0002979987730000132
Seventhly, the B0DE35E8C50FCB14A7765B73C196A8AA is sent to the cloud.
In a preferred embodiment of the present invention, the steps S22 to S25 are:
s22, converting the operation result value ORV obtained in the step S21 into a B ' system, wherein B ' is a positive integer greater than or equal to 2, and B ' ≠ B; obtaining the B' system operation result;
judging whether the operation result value ORV is B' system:
if the operation result value ORV is B' system, then VB′ORV; wherein ORV is the operation result value, VB′Is a B' scale result value;
if the operation result value ORV is not in the B' scale, the method includes steps S221-S222;
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure BDA0002979987730000133
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cindicating the conversion of its operation result value ORVIs a C system result;
s222, carry the C to the result VORV→CConverting into B' system operation result, and converting into C system result VORV→CThe method for converting the B' system operation result comprises the following steps:
s2221, rounding the loop to obtain a first parameter i' equal to 1; a is1=VORV→C
S2222,
Figure BDA0002979987730000141
Wherein int () represents a rounding function;
[ B '] represents a scale value corresponding to the B' scale;
ai′representing the ith' round up quantity;
ai′+1represents the i' +1 cycle integer;
determine a thereofi′+1And 0, [ B']-1 and [ B']The relationship between:
if ai′+1≥[B′]I' +1, return to step S2222;
if 0 is less than or equal to ai′+1≤([B′]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic residual first parameter j' to 1;
S22222,bj′=aj′%[B′],
wherein,% represents the remainder;
[ B '] represents a scale value corresponding to the B' scale;
aj′represents the cycle integer of j';
bj′represents the residue taken by the j' th cycle;
judging the relationship between j 'and i':
if j ' ≠ i ', j ' +1, returning to S22132;
if j ' is i ', then B ' is Bi′bi′-1bi′-2…b3b2b1(ii) a In this embodiment, b is defined asQ′No less than 10, Q ' ═ 1,2, 3., i ' -2, i '-1, i'; 10, 11, 12, 13, 14, 15, … … and 35 can be sequentially represented by capital letters A, B, C, D, E, F, … … and Z; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z. Other values, if greater than or equal to 10, may be represented by the capital letters A, B, C, D, E, F, … …, Z in turn as 10, 11, 12, 13, 14, 15, … …, 35; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z.
Wherein, { B '} represents a B' system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi′-2indicating the residue taken in the i' -2 th cycle;
bi′-1indicating that the cycle i' -1 takes the rest;
bi′indicating the i' th cycle allowance;
s23, counting 0 to [ B 'in B' system operation result { B '}']The number of-1, written as | | (0, u)0′),(1,u1′),(2,u2′),(3,u3′),…,([B′]-1,u[B′]-1′)||{B′}Wherein, the highest bit in the B 'system operation result { B' } is not 0, namely the first bit is not 0; when it is a 1-bit number, only a 1-bit number can be written, for example, if it is 0, only 0 can be written, 00 cannot be written, or a plurality of 0's before or after 0; if 1, only 1 can be written, 01 cannot be written, or a plurality of 0 s precede 1.
Wherein (0, u)0') indicates that the number of 0 s is u0' u, said u0' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);<{B′}>represents the total number of bits of the B 'system operation result { B' };
(1,u1') indicates that the number of 1 s is u1' u, said u1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(2,u2') indicates 2 is u2' u, said u2' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(3,u3') indicates that the number of 3 is u3' u, said u3' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
([B′]-1,u[B′]-1') represents [ B']The number of-1 is u[B′]-1' u, said u[B]′-1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d); u. of0′+u1′+u2′+u3′+…+u[B′]-1′=<{B′}>;
S24, expressing the B' number expression u0′u1′u2′u3′…u[B′]-1′.[B′]Or u0′u1′u2′u3′…u[B′]-1' get its second encryption result value; wherein B' is a number expression u0′u1′u2′u3′...u[B′]-1′.[B′]Or u0′u1′u2′u3′...u[B′]-1'indicates that there is u in B' scale0' 0, u1' pieces 1, u2' pieces 2, u3' pieces 3, … …, u[B′]-1'A']-1. For example, a 2-ary number expression of 22.2 or 22 indicates 20 s and 21 s in a 2-ary expression; the corresponding 2-ary operation results may be 1010, 1001, 1100. The 2-ary number expression 02.2 or 02 indicates 0 s and 21 s (i.e., only 21 s) in the 2-ary expression; its corresponding 2-ary operation result may be 11. The 2-system number expression quantity 15.2 or 15 indicates that 10 and 5 1 exist in the 2-system expression; the corresponding 2-ary operation results may be 101111, 110111, 111011, 111101, 111110. The 3-system number expression quantity 120.3 or 120 indicates that 10, 21, 02 (only 10 and 2 1) are expressed in the 3-system; the corresponding 3-ary operation results may be 101, 110. 3-system numerical expression quantity111.3 or 111 indicates 10, 1 and 12 in 3-ary expression; the corresponding 3-ary operation results may be 102, 120, 201, 210. The expression amount 1011.4 or 1011 of the 4-system number indicates 10, 01, 12, 13 (i.e. 10, 12, 1 3) in the 4-system expression; the corresponding 4-ary operation results may be 203, 230, 302, 320. The 4-ary numerical expression 1101.4 or 1101 indicates that 10, 1, 0, 2, 13 (i.e., 10, 1, 3) are expressed in 4-ary; the corresponding 4-ary operation results may be 103, 130, 301, 310. The 8-system number expression 00110010.8 or 00110010 indicates that 0, 01, 12, 13, 04, 05, 16, 07 (i.e. only 12, 13, 1 6) are expressed in the 0-system; the corresponding 8-ary operation result may be 236, 263, 326, 362, 623, 632. The 16-ary numerical expression 0000100000010001.16 or 0000100000010001 indicates that there are 0, 01, 02, 03, 14, 05, 06, 07, 0 8, 09, 0a, 1B, 0C, 0D, 0E, 1F (i.e., there are only 14, 1B, 1F) in the 16-ary expression; the corresponding 16-ary operation results may be 4BF, 4FB, B4F, BF4, F4B, and FB 4.
ERV′=MD(u0′u1′u2′u3′…u[B′]-1′.[B′]),
Wherein, MD () represents a hashing algorithm using MD 5;
u0′u1′u2′u3′...u[B′]-1′.[B′]expressing B' system number expression quantity;
ERV' represents a second encryption result value;
and S25, sending the second encryption result value ERV' to the cloud.
An example is given below, taking the telephone number 13333333333, [ B' ] 16, [ C ] 10 as an example:
firstly, obtaining an operation result value:
ORV ═ md (user info), i.e.
The ORV (13333333333) ═ MD (34347C 343003E57232A5D21F14FE399E, which is a 32-bit 16-ary operation result value.
Secondly, solving a 10-system result:
Figure BDA0002979987730000161
namely, it is
Figure BDA0002979987730000171
Thirdly, solving the value of i':
Figure BDA0002979987730000172
namely, it is
Figure BDA0002979987730000173
Figure BDA0002979987730000174
Figure BDA0002979987730000175
……,
Figure BDA0002979987730000181
Figure BDA0002979987730000182
Figure BDA0002979987730000183
Since 0 is less than or equal to a32Less than or equal to (16-1), namely less than or equal to 0 and less than or equal to 3 and less than or equal to 15; so i' is 32.
Fourthly, solving a 16-system operation result:
bj′=aj′%[B′]i.e. by
Figure BDA0002979987730000184
Figure BDA0002979987730000185
Figure BDA0002979987730000186
……,
Figure BDA0002979987730000191
Figure BDA0002979987730000192
Figure BDA0002979987730000193
Since j 'is equal to i', i.e. j 'is equal to i' is equal to 32,
then
Figure BDA0002979987730000194
Fifthly, counting the number of 0-F in 34347C343003E57232A5D21F14FE399E, and recording the number as
Figure BDA0002979987730000195
Namely, it is
Figure BDA0002979987730000196
Sixthly, obtaining a second encryption result value:
ERV′=MD(u0′u1′u2′u3′…u[B′]-1′.[B′]) I.e. by
ERV=MD(2237420202101132.16)=B2A509D26266599F38C799BF1599100A。
And seventhly, sending the B2A509D26266599F38C799BF1599100A to the cloud.
In a preferred embodiment of the present invention, the steps S22 to S25 are:
s22, converting the operation result value ORV obtained by the operation in the step S21 into a B 'system, wherein B' is a positive integer greater than or equal to 2, and B 'is not equal to B' ≠ B; obtaining the B' system operation result;
judging whether the operation result value ORV is B' system:
if the operation result value ORV is B' system, then VB"═ ORV; wherein ORV is the operation result value, VB"is B" the resulting value;
if the operation result value ORV is not B' system, then it includes steps S221-S222;
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure BDA0002979987730000201
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B' system operation result, and converting into C system result VORV→CThe method for converting the binary operation result into the B' system operation result comprises the following steps:
s2221, rounding the second parameter i ″, to 1; a is1=VORV→C
S2222,
Figure BDA0002979987730000202
Wherein int () represents a rounding function;
[ B "] represents a scale value corresponding to the B";
ai″represents the integral quantity of the i' cycle;
ai″+1represents the i' +1 cycle rounding amount;
determine a thereofi″+1And 0, [ B "]]-1 and [ B]The relationship between:
if ai″+1≥[B″]I ″ +1, return to step S2222;
if 0 is less than or equal to ai″+1≤([B″]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic remainder second parameter j ″, to 1;
S22222,bj″=aj″%[B″],
wherein,% represents the remainder;
[ B "] represents a scale value corresponding to the B";
aj″represents the integer quantity of the j' cycle;
bj″indicating that the j' cycle takes the surplus;
judging the relationship between j 'and i':
if j ≠ i ″, then j ≠ j ″ +1, returning to S22132;
if j ″ ═ i ″, then { B ″ } ═ B ″i″bi″-1bi″-2…b3b2b1(ii) a In this embodiment, b is defined asQ″No less than 10, Q ″, 1,2,3,.., i "-2, i" -1, i "; 10, 11, 12, 13, 14, 15, … … and 35 can be sequentially represented by capital letters A, B, C, D, E, F, … … and Z; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z. Other values greater than or equal to 10 may be obtained by using the capital letters A, B, C, D,E. F, … … and Z represent 10, 11, 12, 13, 14, 15, … … and 35 in sequence; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z.
Wherein, { B "} denotes the B" system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi″-2represents the i' -2 cycle allowance;
bi″-1represents the i' -1 th cycle to take the margin;
bi″indicating that the ith' cycle takes the residue;
s23, counting 0 to [ B "] in B 'system operation result { B' }]The number of-1, written as | | (0, u)0″),(1,u1″),(2,u2″),(3,u3″),…,([B″]-1,u[B″]-1″)||{B″}Wherein, the highest bit in the B 'system operation result { B' } is not 0, i.e. the first bit is not 0; when it is a 1-bit number, only a 1-bit number can be written, for example, if it is 0, only 0 can be written, 00 cannot be written, or a plurality of 0's before or after 0; if 1, only 1 can be written, 01 cannot be written, or a plurality of 0 s precede 1.
Wherein (0, u)0") indicates that the number of 0 s is u0"to, said u0Is greater than or equal to 0 and less than or equal to<{B″}>A positive integer of (d);<{B″}>represents the total number of bits of the B 'system operation result { B' };
(1,u1") indicates that the number of 1 s is u1"to, said u1Is greater than or equal to 0 and less than or equal to<{B″}>A positive integer of (d);
(2,u2") indicates that the number of 2 is u2"to, said u2Is greater than or equal to 0 and less than or equal to<{B″}>A positive integer of (d);
(3,u3") indicates that the number of 3 is u3"to, said u3Is greater than or equal to 0 and less than or equal to<{B″}>A positive integer of (d);
([B″]-1,u[B″]-1") means [ B]The number of-1 is u[B″]-1"to, said u[B″]-1Is greater than or equal to 0 and less than or equal to<{B″}>A positive integer of (d); u. of0″+u1″+u2″+u3″+…+u[B″]-1″=<{B″}>;
S24, expressing the B' number of the expression vector u0″u1″u2″u3″…u[B″]-1″.[B″]Or u0″u1″u2″u3″…u[B″]-1"perform the following operation to obtain a third encryption result value thereof; wherein B' is a number expression u0″u1″u2″u3″…u[B″]-1″.[B″]Or u0″u1″u2″u3″…u[B″]-1"indicates that there is u in the B" scale expression0"each 0, u1"each 1, u2"an 2, u3"each 3, … …, u[B″]-1' A]-1. For example, a 2-ary number expression of 22.2 or 22 indicates 20 s and 21 s in a 2-ary expression; the corresponding 2-ary operation results may be 1010, 1001, 1100. The 2-ary number expression 02.2 or 02 indicates 0 s and 21 s (i.e., only 21 s) in the 2-ary expression; its corresponding 2-ary operation result may be 11. The 2-system number expression quantity 15.2 or 15 indicates that 10 and 5 1 exist in the 2-system expression; the corresponding 2-ary operation results may be 101111, 110111, 111011, 111101, 111110. The 3-system number expression quantity 120.3 or 120 indicates that 10, 21, 02 (only 10 and 2 1) are expressed in the 3-system; the corresponding 3-ary operation results may be 101, 110. The 3-system number expression quantity 111.3 or 111 indicates that 10, 1 and 12 exist in the 3-system expression; the corresponding 3-ary operation results may be 102, 120, 201, 210.
The expression amount 1011.4 or 1011 of the 4-system number indicates 10, 01, 12, 13 (i.e. 10, 12, 1 3) in the 4-system expression; the corresponding 4-ary operation results may be 203, 230, 302, 320. The 4-ary numerical expression 1101.4 or 1101 indicates that 10, 1, 0, 2, 13 (i.e., 10, 1, 3) are expressed in 4-ary; the corresponding 4-ary operation results may be 103, 130, 301, 310. The 8-system number expression 00110010.8 or 00110010 indicates that 0, 01, 12, 13, 04, 05, 16, 07 (i.e. only 12, 13, 1 6) are expressed in the 0-system; the corresponding 8-ary operation result may be 236, 263, 326, 362, 623, 632. The 16-ary numerical expression 0000100000010001.16 or 0000100000010001 indicates that there are 0, 01, 02, 03, 14, 05, 06, 07, 0 8, 09, 0a, 1B, 0C, 0D, 0E, 1F (i.e., there are only 14, 1B, 1F) in the 16-ary expression; the corresponding 16-ary operation results may be 4BF, 4FB, B4F, BF4, F4B, and FB 4.
ERV″=MD(u0″u1″u2″u3″…u[B″]-1″.[B″]),
Wherein, MD () represents a hashing algorithm using MD 5;
u0″u1″u2″u3″…u[B″]-1″.[B″]representing the expression quantity of the B' system number;
ERV "represents a third encryption result value;
s25, sending the third encryption result value ERV' to the cloud.
In a preferred embodiment of the present invention, step S3 includes the following steps:
s31, the cloud inquires according to the received first encryption result value ERV and the second encryption result value ERV 'to obtain a cloud storage first value corresponding to the first encryption result value ERV and a cloud storage second value corresponding to the second encryption result value ERV'; namely, the first encryption result value ERV and the second encryption result value ERV' belong to the cloud encryption result set; the first value stored in the cloud corresponding to the first encryption result value ERV is equivalent to the element e in the cloud encryption result set1The corresponding cloud expression quantity, the second value of the cloud storage corresponding to the second encryption result value ERV' is equivalent to the cloud expression quantityElement e in end encryption result set2The corresponding cloud expression.
S32, calculating according to the first cloud storage value and the second cloud storage value to obtain a first cloud combination value set corresponding to the first cloud storage value and a second cloud combination value set corresponding to the second cloud storage value;
judging whether the first set of the cloud combined values and the second set of the cloud combined values have equal actual values:
if the first set of cloud combined values and the second set of cloud combined values have equal actual values, inquiring to obtain user information according to the actual values, and executing step S33;
if the first set of the cloud combined values and the second set of the cloud combined values do not have equal actual values, re-receiving the first encryption result value ERV and the second encryption result value ERV';
and S33, transmitting the data information corresponding to the user to the self-service terminal for display.
In a preferred embodiment of the present invention, step S3 includes the following steps:
s31, the cloud end inquires according to the received first encryption result value ERV, the second encryption result value ERV 'and the third encryption result value ERV' to obtain a first cloud end storage value corresponding to the first encryption result value ERV, a second cloud end storage value corresponding to the second encryption result value ERV 'and a third cloud end storage value corresponding to the third encryption result value ERV'; that is, the first encryption result value ERV, the second encryption result value ERV' and the third encryption result value ERV "all belong to the cloud encryption result set, and the first value stored in the cloud corresponding to the first encryption result value ERV is equivalent to the element e in the cloud encryption result set1The corresponding cloud expression quantity, the second value of the cloud storage corresponding to the second encryption result value ERV' is equivalent to the element e in the cloud encryption result set2The corresponding cloud expression quantity, the third value of the cloud storage corresponding to the third encryption result value ERV' is equivalent to the element e in the cloud encryption result set3The corresponding cloud expression.
S32, calculating according to the first cloud storage value, the second cloud storage value and the third cloud storage value to obtain a first cloud combination value set corresponding to the first cloud storage value, a second cloud combination value set corresponding to the second cloud storage value and a third cloud combination value set corresponding to the third cloud storage value; in this embodiment, for example, if the cloud expression (the cloud storage first value) is 14.2 or 14, it indicates that 10 and 41 in the 2-ary expression exist, and the elements in the first set of the cloud combined values corresponding to the cloud storage first value are 1011, 1101, 1110; if the cloud expression quantity (the second cloud storage value) is 00020000.8 or 00020000, it indicates that there are only 23 in the 8-system expression, and the element in the second set of the cloud combined value corresponding to the second cloud storage value is 33; if the cloud expression (the cloud storage third value) is 0111.4 or 0111, it indicates that 1,2, and 13 in the 4-ary expression exist, and the elements in the cloud combined value third set corresponding to the cloud storage third value are 123, 132, 213, 231, 312, and 321.
Judging whether equal actual values exist in the first set of the cloud combined values, the second set of the cloud combined values and the third set of the cloud combined values:
if the same actual value (the actual value is a value under the condition of the same scale) exists in the first set of the cloud combined values, the second set of the cloud combined values and the third set of the cloud combined values, inquiring to obtain user information according to the actual value, and executing step S33; in this embodiment, for example, if the cloud expression (the cloud storage first value) is 14.2 or 14, it indicates that there are 10 and 41 in the 2-ary expression, and the elements in the first set of cloud combined values corresponding to the cloud storage first value are 10111, 11011, 11101, and 11110; if the cloud expression quantity (the second cloud storage value) is 00020000.8 or 00020000, it indicates that there are only 23 in the 8-system expression, and the element in the second set of the cloud combined value corresponding to the second cloud storage value is 33; if the cloud expression (the cloud storage third value) is 0111.4 or 0111, it indicates that 1,2, and 13 in the 4-ary expression exist, and the elements in the cloud combined value third set corresponding to the cloud storage third value are 123, 132, 213, 231, 312, and 321. Converting the 2-system values in the first set of the cloud combined values into 10-system values which are 23, 27, 29 and 30 in sequence; converting the 8-system values in the second set of the cloud combined values into 10-system values, and sequentially corresponding to the 10-system values to be 27; the 4-system values in the cloud combined value third set are converted into 10-system values, and the 10-system values are 27, 30, 39, 45, 54 and 57 in sequence. Since there are equal actual values 27 in the first, second and third sets of cloud combined values. Converting the 2-system values in the first set of the cloud combined values into 16-system values which are respectively 17, 1B, 1D and 1E in sequence; converting the 8-system values in the second set of the cloud combined values into 16-system values, and sequentially corresponding to 1B; and 4-system values in the cloud combined value third set are converted into 16-system values which are sequentially corresponding to 1B, 1E, 27, 2D, 36 and 39. The actual values 1B are equal in the first set of cloud combined values, the second set of cloud combined values, and the third set of cloud combined values.
If the first set of the cloud combined values, the second set of the cloud combined values and the third set of the cloud combined values do not have equal actual values, re-receiving the first encryption result value ERV, the second encryption result value ERV 'and the third encryption result value ERV';
and S33, transmitting the data information corresponding to the user to the self-service terminal for display.
In a preferred embodiment of the present invention, step S0 is included before step S1,
s01, the cloud performs the following operations on the acquired user information to obtain a cloud operation result value;
ORV″′=MD(User Info″′),
wherein, MD () represents a hashing algorithm using MD 5;
the User Info' ″ represents User information acquired by the cloud, and the User information comprises one or any combination of an identity card number, a telephone number and a license plate number;
ORV' represents the result value of the cloud operation;
s02, converting the cloud operation result value ORV 'obtained in the step S01 into a B' system, wherein B 'is a positive integer greater than or equal to 2, and obtaining a B' system cloud operation result;
judging whether the cloud computing result value ORV 'is in a B' system or not:
if the cloud computing result value ORV 'is in the B' system, then VB″′ORV "; wherein ORV' is the result value of cloud computing, VB″′Carry the cloud result value for B';
if the cloud computing result value ORV 'is not in the B' system, the method comprises steps S021 to S022;
s021, converting the cloud operation result value ORV '"into a C'" cloud result, and converting the cloud operation result value ORV '"into a C'" cloud result:
Figure BDA0002979987730000251
wherein < ORV '"> represents the total number of bits of the cloud operation result value ORV'";
ORV″′a″′representing a numerical value corresponding to the a 'th bit in the ordering from low bit to high bit of the cloud computing result value ORV';
[ A '] represents a binary numerical value corresponding to the cloud operation result value ORV';
[A″′]a″′-1is represented by [ A']A' "-1 to the power of;
VORV″′→C″′converting the cloud computing result value ORV 'into a C' system cloud result;
s022, carrying out C 'binary cloud result V on the C' of the cloud resultORV″′→C″′Converting the result into B ' system cloud end operation result, and converting the C ' system cloud end result into C ' system cloud end result VORV″′→C″′The method for converting the result into the B' system cloud operation result comprises the following steps:
s0221, rounding the cloud parameter i' ″ to 1; a is1″′=VORV″′→C″′
S0222,
Figure BDA0002979987730000252
Wherein int () represents a rounding function;
[ B '"] indicates a scale value corresponding to the B'" scale;
ai″′"'indicates the i' cycle to round the cloud end;
ai″′+1"'indicates the amount of the rounded cloud end at the i' +1 th cycle;
determine a thereofi″′+1"'and 0, [ B']-1 and [ B']The relationship between:
if ai″′+1″′≥[B″′]I "" +1, return to step S0222;
if 0 is less than or equal to ai″′+1″′≤([B″′]-1), then comprising steps S02221 to S02222;
s02221, setting a cyclic remaining cloud parameter j' ″ to 1;
S02222,bj″′″′=aj″′″′%[B″′],
wherein,% represents the remainder;
[ B '"] indicates a scale value corresponding to the B'" scale;
aj″′"'indicates the jth'" cycle to round the cloud end;
bj″′"'indicates the residual cloud end amount taken in the j'" th cycle;
judging the relationship between j 'and i':
if j '≠ i' ″, j '″ is j' ″ +1, and the process returns to S22132;
if j 'is i', then B '} is B'i″′″′bi″′-1″′bi″′-2″′…b3″′b2″′b1"; in this embodiment, b is defined asQ″′When "≧ 10, Q '" 1,2,3,., i' "-2, i '" -1, i' "; 10, 11, 12, 13, 14, 15, … … and 35 can be sequentially represented by capital letters A, B, C, D, E, F, … … and Z; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z. Other values greater than or equal to 10 may be usedCapital letters A, B, C, D, E, F, … … and Z sequentially represent 10, 11, 12, 13, 14, 15, … … and 35; 36, 37, 38, 39, 40, 41, … …, 61 are indicated in turn by the lower case letters a, b, c, d, e, f, … …, z.
Wherein { B '} represents a B' system cloud computing result;
b1"' indicates the amount of the residual cloud end taken in the 1 st cycle;
b2"' indicates the amount of residual cloud in the 2 nd cycle;
b3"' indicates the amount of the residual cloud at the 3 rd cycle;
bi″′-2"'indicates the amount of residual cloud end taken at cycle i' -2;
bi″′-1"'indicates the amount of the residual cloud end taken at the i' -1 th cycle;
bi″′"'indicates the amount of residual cloud end taken out in the i' cycle;
s03, statistics are carried out on 0 to [ B ' ″ ' in the B ' ″ binary cloud end operation result { B ' } ']The number of-1, written as | | (0, u)0″′),(1,u1″′),(2,u2″′),(3,u3″′),…,([B″′]-1,u[B″′]-1″′)||{B″′}Wherein, the highest bit in the B 'carry operation result { B' } is not 0, i.e. the first bit is not 0; when it is a 1-bit number, only a 1-bit number can be written, for example, if it is 0, only 0 can be written, 00 cannot be written, or a plurality of 0's before or after 0; if 1, only 1 can be written, 01 cannot be written, or a plurality of 0 s precede 1.
Wherein (0, u)0") indicates that the number of 0 s is u0", said u0"' is greater than or equal to 0 and less than or equal to<{B″′}>A positive integer of (d);<{B″′}>indicating the total bit number of the B 'binary cloud operation result { B' };
(1,u1") indicates that the number of 1 s is u1", said u1"' is greater than or equal to 0 and less than or equal to<{B″′}>A positive integer of (d);
(2,u2") indicates that the number of 2 is u2", said u2"' is greater than or equal to 0 and less than or equal to<{B″′}>A positive integer of (d);
(3,u3") indicates that the number of 3 is u3", said u3"' is greater than or equal to 0 and less than or equal to<{B″′}>A positive integer of (d);
([B″′]-1,u[B″′]-1") represents [ B"']The number of-1 is u[B″′]-1", said u[B″′]-1"' is greater than or equal to 0 and less than or equal to<{B″′}>A positive integer of (d); u. of0″′+u1″′+u2″′+u3″′+…+u[B″′]-1″′=<{B″′}>;
S04, the B' number cloud expression u is expressed0″′u1″′u2″′u3″′…u[B″′]-1″′.[B″′]Or u0″′u1″′u2″′u3″′…u[B″′]-1' the following operation is carried out to obtain a cloud encryption result value; wherein B' is a number expressed in u0″′u1″′u2″′u3″′…u[B″′]-1″′.[B″′]Or u0″′u1″′u2″′u3″′…u[B″′]-1"'indicates that there is u in the B' scale expression0"' one 0, u1"' one 1, u2"' 2, u3"' one 3, … …, u[B″′]-1"'pieces of [ B']-1. For example, a 2-ary number expression of 22.2 or 22 indicates 20 s and 21 s in a 2-ary expression; the corresponding 2-ary operation results may be 1010, 1001, 1100. The 2-ary number expression 02.2 or 02 indicates 0 s and 21 s (i.e., only 21 s) in the 2-ary expression; its corresponding 2-ary operation result may be 11. The 2-system number expression quantity 15.2 or 15 indicates that 10 and 5 1 exist in the 2-system expression; the corresponding 2-ary operation results may be 101111, 110111, 111011, 111101, 111110. The 3-system number expression quantity 120.3 or 120 indicates that 10, 21 and 0 are expressed in the 3-system2 (only 10 and 2 1); the corresponding 3-ary operation results may be 101, 110. The 3-system number expression quantity 111.3 or 111 indicates that 10, 1 and 12 exist in the 3-system expression; the corresponding 3-ary operation results may be 102, 120, 201, 210. The expression amount 1011.4 or 1011 of the 4-system number indicates 10, 01, 12, 13 (i.e. 10, 12, 1 3) in the 4-system expression; the corresponding 4-ary operation results may be 203, 230, 302, 320. The 4-ary numerical expression 1101.4 or 1101 indicates that 10, 1, 0, 2, 13 (i.e., 10, 1, 3) are expressed in 4-ary; the corresponding 4-ary operation results may be 103, 130, 301, 310. The 8-system number expression 00110010.8 or 00110010 indicates that 0, 01, 12, 13, 04, 05, 16, 07 (i.e. only 12, 13, 1 6) are expressed in the 0-system; the corresponding 8-ary operation result may be 236, 263, 326, 362, 623, 632. The 16-ary numerical expression 0000100000010001.16 or 0000100000010001 indicates that there are 0, 01, 02, 03, 14, 05, 06, 07, 0 8, 09, 0a, 1B, 0C, 0D, 0E, 1F (i.e., there are only 14, 1B, 1F) in the 16-ary expression; the corresponding 16-ary operation results may be 4BF, 4FB, B4F, BF4, F4B, and FB 4.
ERV″′=MD(u0″′u1″′u2″′u3″′…u[B″′]-1″′.[B″′]),
Wherein, MD () represents a hashing algorithm using MD 5;
u0″′u1″′u2″′u3″′…u[B″′]-1″′.[B″′]representing B' number of cloud expression;
ERV' "represents the cloud encryption result value;
s05, forming a cloud encryption result set by all the cloud encryption result values ERV 'of the cloud encryption result set, storing the cloud encryption result set and a cloud expression corresponding to each element in the cloud encryption result set in a cloud database, and storing user information corresponding to the B' system cloud operation result in the cloud database.
The invention discloses a self-service terminal based on a four-in-one data government affair safety guarantee working method, as shown in figure 2, the self-service terminal comprises a box body 5, an inward concave space is arranged on the front surface of the box body 5, a touch display screen mounting seat for fixedly mounting a touch display screen 3 is arranged in the concave space, the touch display screen 3 is fixedly mounted on the touch display screen mounting seat, an ID card reader mounting seat for fixedly mounting an ID card reader 4 is arranged on the lower side of the concave space, the ID card reader 4 is fixedly mounted on the ID card reader mounting seat, outward convex peep-proof plates 6 are arranged on two sides of the front surface of the box body 5, a control circuit board mounting seat for fixedly mounting a control circuit board is arranged in the box body 5, the control circuit board is fixedly mounted on the control circuit board mounting seat, a controller and a network transmission module are arranged on the control circuit board, the network transmission data end of the controller is connected with the network transmission data end of the network transmission module, the identity information data output end of the identity ID card reader 4 is connected with the identity information data input end of the controller, and the touch display end of the controller is connected with the touch display end of the touch display screen 3;
after the user information is read by the identity ID card reader 4, the user information is processed and then transmitted to the cloud for verification, and the data information corresponding to the user is called and displayed on the touch display screen 3.
In a preferred embodiment of the present invention, the network transmission module includes a network wireless transmission unit or/and a network wired transmission unit;
the wireless data end of the network wireless transmission unit is connected with the wireless data end of the controller, and the wired data end of the network wired transmission unit is connected with the wired data end of the controller;
the network wireless transmission unit comprises one or any combination of a network wireless WiFi transmission subunit, a network wireless 5G transmission subunit and a network wireless 4G transmission subunit;
the wireless WiFi data end of the network wireless WiFi transmission subunit is connected with the wireless WiFi data end of the controller, the wireless 5G data end of the network wireless 5G transmission subunit is connected with the wireless 5G data end of the controller, and the wireless 4G data end of the network wireless 4G transmission subunit is connected with the wireless 4G data end of the controller;
the network wired transmission unit comprises a hundred-megabyte network wired transmission subunit or/and a gigabit network wireless transmission subunit; the giga-cable data end of the giga-network cable transmission unit is connected with the giga-cable data end of the controller.
In a preferred embodiment of the present invention, the mobile phone further includes a camera fixing and mounting area which is arranged on the front surface of the box body 5 and is used for fixedly mounting the camera 1, and the camera 1 is fixedly mounted on the camera fixing and mounting area; the camera 1 is positioned above the touch display screen 3; the image data output end of the camera 1 is connected with the image data input end of the controller.
In a preferred embodiment of the present invention, the mobile phone further includes a peep-proof lens fixing and mounting area which is arranged on the front surface of the box body 5 and used for fixing the peep-proof lens 2, wherein the peep-proof lens 2 is positioned above the touch display screen 3 and on the left side or the right side of the camera 1; the sight-proof glass 2 is fixedly arranged on the sight-proof glass fixing and mounting area.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

Claims (5)

1. A four-in-one data government affair safety guarantee based working method is characterized by comprising the following steps:
s1, acquiring user information; the user information comprises one or any combination of an identity card number, a telephone number and a license plate number;
and S2, encrypting the user information obtained in the step S1 and sending the encrypted user information to the cloud.
2. The four-in-one data-based government affair security guarantee working method according to claim 1, wherein the step S2 includes the steps of:
s21, carrying out the following operation on the acquired user information to obtain an operation result value;
ORV=MD(User Info),
wherein, MD () represents a hash algorithm using MD 5;
user Info represents User information;
ORV represents the operation result value;
s22, converting the operation result value ORV obtained in the step S21 into a B system, wherein B is a positive integer greater than or equal to 2, and obtaining the B system operation result;
judging whether the operation result value ORV is B system:
if the operation result value ORV is B system, then VBORV; wherein ORV is the operation result value, VBIs a B-system result value;
if the operation result value ORV is not in the B system, converting the operation result value ORV into the B system;
s23, the result { B } of the B-system operation is counted from 0 to [ B ]]The number of-1, written as | | (0, u)0),(1,u1),(2,u2),(3,u3),…,([B]-1,u[B]-1)||{B}
Wherein (o, u)0) Represents that the number of 0 s is u0A, the u0Is greater than or equal to 0 and less than or equal to<{B}>-1 is a positive integer;<{B}>representing the total number of bits of the B-system operation result { B };
(1,u1) The number of 1 s is u1A, the u1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(2,u2) The number of 2 is u2A, the u2Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
(3,u3) The number of the symbols 3 is u3A, the u3Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d);
([B]-1,u[B]-1) To represent[B]The number of-1 is u[B]-1A, the u[B]-1Is greater than or equal to 0 and less than or equal to<{B}>A positive integer of (d); u. of0+u1+u2+u3+…+u[B]-1=<{B}>;
S24, expressing the B-system number of the vector u0u1u2u3…u[B]-1·[B]Carrying out the following operations to obtain a first encryption result value;
ERV=MD(u0u1u2u3…u[B]-1·[B]),
wherein, MD () represents a hash algorithm using MD 5;
u0u1u2u3…u[B]-1·[B]expressing B-system number expression quantity;
ERV represents a first encryption result value;
and S25, sending the first encryption result value ERV to the cloud.
3. The work method for government affairs safety guarantee based on four-in-one data according to claim 2, wherein the method for converting the operation result value ORV into the B scale is:
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure FDA0002979987720000021
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVarepresenting the numerical value corresponding to the a-th bit in the sequence from low to high of the operation result value ORV;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B system operation result, and converting into C system result VORV→CThe method for converting the B-system operation result comprises the following steps:
s2221, setting the round-robin parameter i to 1; a is1=VORV→C
S2222,
Figure FDA0002979987720000031
Wherein int () represents a rounding function;
[B] representing a system value corresponding to the B system;
airepresenting the integral quantity of the ith cycle;
ai+1represents the rounding amount of the i +1 th cycle;
determine a thereofi+1And 0, [ B ]]-1 and [ B]The relationship between:
if ai+1≥[B]I +1, returning to step S2222;
if 0 is less than or equal to ai+1≤([B]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic remainder parameter j to 1;
S22222,bj=aj%[B],
wherein,% represents the remainder;
[B] representing a system value corresponding to the B system;
ajrepresents the integer quantity of the j cycle;
bjindicating that the jth cycle takes the margin;
judging the relationship between j and i:
if j ≠ i, j ≠ j +1, returning to S22132;
if j is i, then B is Bibi-1bi-2…b3b2b1
Wherein { B } represents a B-system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicates cycle 3Taking the rest;
bi-2indicating the residue taken in the i-2 th cycle;
bi-1indicating that the cycle i-1 takes the residue;
biindicating that the ith cycle takes the surplus.
4. The four-in-one data-based government affair safety guarantee working method according to claim 2, wherein the steps S22-S25 are:
s22, converting the operation result value ORV obtained in the step S21 into a B ' system, wherein B ' is a positive integer greater than or equal to 2, and B ' ≠ B; obtaining the B' system operation result;
judging whether the operation result value ORV is B' system:
if the operation result value ORV is B' system, then VB′ORV; wherein ORV is the operation result value, VB′Is a B' scale result value;
if the operation result value ORV is not in the B 'system, the operation result value ORV is converted into the B' system;
s23, counting 0 to [ B 'in B' system operation result { B '}']The number of-1, written as | | (0, u)0′),(1,u1′),(2,u2′),(3,u3′),…,([B′]-1,u[B′]-1′)||{B′}
Wherein (0, u)0') indicates that the number of 0 s is u0' u, said u0' is greater than or equal to 0 and less than or equal to<{B′}>-1 is a positive integer;<{B′}>represents the total number of bits of the B 'system operation result { B' };
(1,u1') indicates that the number of 1 s is u1' u, said u1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(2,u2') indicates 2 is u2' u, said u2' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
(3,u3') indicates that the number of 3 is u3' u, said u3' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d);
([B′]-1,u[B′]-1') represents [ B']The number of-1 is u[B′]-1' u, said u[B]′-1' is greater than or equal to 0 and less than or equal to<{B′}>A positive integer of (d); u. of0′+u1′+u2′+u3′+…+u[B′]-1′=<{B′}>;
S24, expressing the B' number expression u0′u1′u2′u3′…u[B′]-1′·[B′]Carrying out the following operations to obtain a second encryption result value;
ERV′=MD(u0′u1′u2′u3′…u[B′]-1′.[B′]),
wherein, MD () represents a hashing algorithm using MD 5;
u0′u1′u2′u3′…u[B′]-1′.[B′]expressing B' system number expression quantity;
ERV' represents a second encryption result value;
and S25, sending the second encryption result value ERV' to the cloud.
5. The work method for government affairs safety guarantee based on four-in-one data according to claim 4, wherein the method for converting the operation result value ORV into B' scale is as follows:
s221, the method of converting the operation result value ORV into the C-ary result includes:
Figure FDA0002979987720000051
wherein < ORV > represents the total number of bits of the operation result value ORV;
ORVaindicating the number corresponding to the a-th bit in the ordering of the operation result value ORV from low to highA value;
[A] representing a carry number corresponding to the operation result value ORV;
[A]a-1is represented by [ A]To the power of a-1;
VORV→Cthe method comprises the steps of converting an operation result value ORV into a C-system result;
s222, carry the C to the result VORV→CConverting into B' system operation result, and converting into C system result VORV→CThe method for converting the B' system operation result comprises the following steps:
s2221, rounding the loop to obtain a first parameter i' equal to 1; a is1=VORV→C
S2222,
Figure FDA0002979987720000052
Wherein int () represents a rounding function;
[ B '] represents a scale value corresponding to the B' scale;
ai′representing the ith' round up quantity;
ai′+1represents the i' +1 cycle integer;
determine a thereofi′+1And 0, [ B']-1 and [ B']The relationship between:
if ai′+1≥[B′]I' +1, return to step S2222;
if 0 is less than or equal to ai′+1≤([B′]-1), then comprising steps S22221 to S22222;
s22221, setting the cyclic residual first parameter j' to 1;
S22222,bj′=aj′%[B′],
wherein,% represents the remainder;
[ B '] represents a scale value corresponding to the B' scale;
aj′represents the cycle integer of j';
bj′represents the residue taken by the j' th cycle;
judging the relationship between j 'and i':
if j ' ≠ i ', j ' +1, returning to S22132;
if j ' is i ', then B ' is Bi′bi′-1bi′-2…b3b2b1
Wherein, { B '} represents a B' system operation result;
b1indicating that the 1 st cycle takes the allowance;
b2indicating the 2 nd cycle allowance;
b3indicating that the 3 rd cycle takes the allowance;
bi′-2indicating the residue taken in the i' -2 th cycle;
bi′-1indicating that the cycle i' -1 takes the rest;
bi′indicating that the ith' cycle takes the surplus.
CN202110284787.9A 2021-03-17 2021-03-17 Four-network-based data government affair security guarantee working method Active CN113141348B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110284787.9A CN113141348B (en) 2021-03-17 2021-03-17 Four-network-based data government affair security guarantee working method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110284787.9A CN113141348B (en) 2021-03-17 2021-03-17 Four-network-based data government affair security guarantee working method

Publications (2)

Publication Number Publication Date
CN113141348A true CN113141348A (en) 2021-07-20
CN113141348B CN113141348B (en) 2023-04-28

Family

ID=76811326

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110284787.9A Active CN113141348B (en) 2021-03-17 2021-03-17 Four-network-based data government affair security guarantee working method

Country Status (1)

Country Link
CN (1) CN113141348B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114640471A (en) * 2022-03-21 2022-06-17 重庆市规划和自然资源信息中心 Centralized government affair office client safety operation and maintenance method based on domestic operating system

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103595535A (en) * 2013-11-13 2014-02-19 江苏中云科技有限公司 Cloud key of cloud computing identity authentication system
CN103856468A (en) * 2012-12-06 2014-06-11 鸿富锦精密工业(深圳)有限公司 Authentication system and method
CN105592100A (en) * 2016-01-26 2016-05-18 西安电子科技大学 Government services cloud access control method based on attribute encryption
CN106789047A (en) * 2017-03-03 2017-05-31 钱德君 A kind of block chain identification system
CN109359471A (en) * 2018-08-20 2019-02-19 北京中测安华科技有限公司 Encryption method, device, system, equipment and medium based on user identity
CN109688151A (en) * 2019-01-02 2019-04-26 中车株洲电力机车有限公司 A kind of transmission method of traffic information, Transmission system and transmission device
CN110971574A (en) * 2018-09-29 2020-04-07 广州小鹏汽车科技有限公司 Method, device and system for logging in vehicle-mounted system and storage medium
CN111131269A (en) * 2019-12-27 2020-05-08 中国银行股份有限公司 User information verification method and device based on block chain

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103856468A (en) * 2012-12-06 2014-06-11 鸿富锦精密工业(深圳)有限公司 Authentication system and method
CN103595535A (en) * 2013-11-13 2014-02-19 江苏中云科技有限公司 Cloud key of cloud computing identity authentication system
CN105592100A (en) * 2016-01-26 2016-05-18 西安电子科技大学 Government services cloud access control method based on attribute encryption
CN106789047A (en) * 2017-03-03 2017-05-31 钱德君 A kind of block chain identification system
CN109359471A (en) * 2018-08-20 2019-02-19 北京中测安华科技有限公司 Encryption method, device, system, equipment and medium based on user identity
CN110971574A (en) * 2018-09-29 2020-04-07 广州小鹏汽车科技有限公司 Method, device and system for logging in vehicle-mounted system and storage medium
CN109688151A (en) * 2019-01-02 2019-04-26 中车株洲电力机车有限公司 A kind of transmission method of traffic information, Transmission system and transmission device
CN111131269A (en) * 2019-12-27 2020-05-08 中国银行股份有限公司 User information verification method and device based on block chain

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
METE EMINAGAOGLU、ECE CINI、GIZEM SERT、DERYA ZOR: ""A Two-Factor Authentication System with QR Codes for Web and Mobile Applications"" *
聂云霞、何金梅、肖坤: ""基于区块链的政务档案信息共享策略"" *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114640471A (en) * 2022-03-21 2022-06-17 重庆市规划和自然资源信息中心 Centralized government affair office client safety operation and maintenance method based on domestic operating system

Also Published As

Publication number Publication date
CN113141348B (en) 2023-04-28

Similar Documents

Publication Publication Date Title
KR102045978B1 (en) Facial authentication method, device and computer storage
CN113051589B (en) Big data government affair analysis and processing safety application platform
CN110602114B (en) Block chain-based identity authentication method and device, storage medium and electronic equipment
CN113141348A (en) Four-network-in-one data-based government affair safety guarantee working method
CN110602214A (en) Evidence storing and processing method, device, equipment and medium of judicial chain
CN110598058A (en) Evidence storing and processing method, device, equipment and medium of judicial chain
CN112837237A (en) Video repair method and device, electronic equipment and storage medium
CN112053159A (en) Transaction data verification method and device, risk control server and business server
US20160196420A1 (en) Electronic system and device unlock method of the same
CN113515555A (en) Working method for government affair data security through big data network
CN105847003A (en) Encryption method of biological feature, encryption matching method and encryption system, and encryption matching system
CN109560917A (en) A kind of QKD method, equipment and system
CN116382916A (en) Resource scheduling method and system for cloud computer computing power cluster and electronic equipment
CN111162907B (en) Generation method of negotiation key and smart card device
WO2018131466A1 (en) Communication device, communication system, communication method, and communication program
CN114900325A (en) Privacy set intersection method, system, device and medium based on federal learning
CN111612440B (en) Method and device for circulating digital currency, server and readable storage medium
CN114339252A (en) Data compression method and device
CN113922949A (en) Password coprocessor based on CLEFIA-SHA3
CN106303236A (en) Image processing method and device
CN105654295A (en) Transaction control method and client
CN110418333A (en) A kind of USIM obtains the method and device of image by terminal
CN116089991B (en) Data alignment method, device, equipment and storage medium
CN117478271B (en) Safety protection system for industrial Internet data transmission
CN113162918B (en) Method for extracting abnormal data under condition of rapidly mining four-in-one network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant