CN113162916B - Working method for executing smart city operation instruction through big data platform - Google Patents

Working method for executing smart city operation instruction through big data platform Download PDF

Info

Publication number
CN113162916B
CN113162916B CN202110298065.9A CN202110298065A CN113162916B CN 113162916 B CN113162916 B CN 113162916B CN 202110298065 A CN202110298065 A CN 202110298065A CN 113162916 B CN113162916 B CN 113162916B
Authority
CN
China
Prior art keywords
small
character
key
login
values
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110298065.9A
Other languages
Chinese (zh)
Other versions
CN113162916A (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 CN202110298065.9A priority Critical patent/CN113162916B/en
Publication of CN113162916A publication Critical patent/CN113162916A/en
Application granted granted Critical
Publication of CN113162916B publication Critical patent/CN113162916B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • 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/70—Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
    • G06F21/82—Protecting input, output or interconnection devices
    • G06F21/83—Protecting input, output or interconnection devices input devices, e.g. keyboards, mice or controllers thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/02—Input arrangements using manually operated switches, e.g. using keyboards or dials
    • G06F3/023—Arrangements for converting discrete items of information into a coded form, e.g. arrangements for interpreting keyboard generated codes as alphanumeric codes, operand codes or instruction codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0876—Network architectures or network communication protocols for network security for authentication of entities based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • Human Computer Interaction (AREA)
  • Power Engineering (AREA)
  • Software Systems (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a working method for executing an operation instruction of a smart city through a big data platform, which comprises the following steps: s1, logging in the cloud intelligent platform through the mobile intelligent handheld terminal; s2, judging whether the login is successful: if the login is successful, go to step S3; if the login fails, returning to the step S1; and S3, after the login is successful, the mobile intelligent handheld terminal is used for inquiring and changing the data. According to the invention, after the mobile intelligent handheld terminal is used for logging in the cloud intelligent platform, the data can be inquired and changed.

Description

Working method for executing smart city operation instruction through big data platform
Technical Field
The invention relates to the technical field of security of smart platforms, in particular to a working method for executing smart city operation instructions through a big data platform.
Background
With the advent of the big data age, more and more data needs to process queries to obtain information needed by users thereof. Patent application No. 2020107025043 entitled "a method and apparatus for performing parallel query acceleration of data based on high frequency data processing", discloses that a first host node receives a data query request sent by a user, the query request carrying query conditions; the first main node generates an execution plan according to the data query request, and queries each first type of data node according to the execution plan; if a matched data block matched with the query condition exists in each first-class data node, the first main node returns result data to the user, wherein the result data is determined according to the combination result of each matched data block; the high-frequency data is data with access frequency larger than a preset frequency threshold value in the first main node, so that the parallel processing capacity and the query efficiency of the big data are improved.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly creatively provides a working method for executing an operation instruction of a smart city through a big data platform.
In order to achieve the above purpose, the invention provides a working method for executing smart city operation instructions through a big data platform, which comprises the following steps:
s1, logging in the cloud intelligent platform through the mobile intelligent handheld terminal;
s2, judging whether the login is successful:
if the login is successful, go to step S3;
if the login fails, returning to the step S1;
and S3, after the login is successful, inquiring and changing the data by using the mobile intelligent handheld terminal.
In a preferred embodiment of the present invention, step S3 includes the following steps:
s31, obtaining the input query words or query terms:
if the following operations are performed on the query word:
Qw＝MD(Query Word)，
wherein, MD () represents a hashing algorithm using MD 5;
query Word represents a Query Word;
qw represents a Query Word obtained after the Query Word is processed by the Hash algorithm of MD 5;
if the query word comprises the following steps:
s311, separating the query words into single query words G 1 、G 2 、G 3 、……、G g G is the number of the query words in the query word; g is a positive integer greater than or equal to 2; g 1 1 st query word G after representing query word separation 2 2 nd query word G after representing query word separation 3 Representing the 3 rd query word … …, G after the separation of the query words g Representing the g-th query word after the separation of the query words;
s312, carrying out permutation and combination on all the separated query words to obtain a permutation and combination set;
s313, executing the following operations on the elements in the permutation and combination set thereof:
Figure GDA0003783382370000021
wherein, MD () represents a hashing algorithm using MD 5;
Query term η representing the eta element in the permutation and combination set;
qt represents the η -th element Query term in the permutation and combination set η Obtaining a query word code after the processing by using a Hash algorithm of MD 5;
s32, the cloud intelligent platform is inquired by using the inquiry word code or the inquiry word code, and whether the check times are more than or equal to the preset check times is judged:
if the checking times are larger than or equal to the preset checking times, reserving the query results, and displaying the reserved query results on the mobile intelligent handheld terminal in sequence from the maximum checking times to the minimum checking times;
and if the checking times are less than the preset checking times, screening out the query result.
In a preferred embodiment of the present invention, step S1 includes the steps of:
s11, inputting a login name and a login code through the mobile intelligent handheld terminal;
and S12, processing the login name and the login code, and sending the processed login name and login code to the cloud intelligent platform.
The method for inputting the registration code comprises the following steps:
s111, judging whether the input registration code triggering command is received:
if receiving the input registration code triggering command, executing step S112;
if the input login code triggering command is not received, returning to the step S111;
s112, displaying a login code character input display frame on the mobile intelligent handheld terminal, wherein the login code character input display frame comprises login code character keys, all the login code character keys are all characters input by the login code characters, and the characters displayed on each login code character key are different and comprise one or any combination of numbers, capital letters and lowercase letters; the numbers comprise one or any combination of 0, 1, 2, 3, … … and 9, the capital letters comprise one or any combination of A, B, C, D, … … and Z, and the lowercase letters comprise one or any combination of a, b, c, d, … … and Z; let ζ be 2;
s113, counting the number of all login code character keys in a login code character input display frame and marking the number as psi after receiving the input of the 1 st login code character; respectively are a login code character No. 1 key, a login code character No. 2 key, a login code character No. 3 key, … … and a login code character No. psi key;
s114, obtaining the characters displayed on the 1 st key, the 2 nd key, the 3 rd key, … … and the psi th key of the login code character, and performing the following operations:
Figure GDA0003783382370000041
wherein, MD 2 () A hashing algorithm denoted as performing MD5 2 times;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
τ ξ a character indicating the displayed on the xi key of the login code character; ξ ═ 1, 2, 3, … …, ψ;
ζ ξ,2 character tau displayed on the xi key of character of registration code ξ Performing 2 times of operation to obtain an operation value;
s115, all the operation values are arranged from small to large or from large to small to obtain tau 1 ′、τ 2 ′、τ 3 ′、……、τ β '; wherein, tau 1 ' the operation value at bit 1 is arranged from small to large or from large to small for all operation values, τ 2 ' the operation value at the 2 nd bit is arranged from small to large or from large to small for all the operation values, τ 3 ' the operation value at the 3 rd bit is arranged from small to large or from large to small for all the operation values, … …, tau ψ ' arranging operation values in the bit psi from small to large or from large to small for all operation values;
s116, arranging all the operation values from small to large or from large to small to be in the operation value tau of the 1 st bit 1 ' the corresponding character is displayed on the 1 st key of the registration code character, and all the operation values are arranged from small to large or from large to small in the 2 nd bit operation value tau 2 ' the corresponding character is displayed on the 2 nd key of the registration code character, and all the calculated values are arranged from small to large or from large to small to be in the calculated value tau of the 3 rd bit 3 ' the corresponding character is displayed on the No. 3 key of the registration code character … …, all the calculated values are arranged from small to large or from large to small in the calculated value tau at the phi-th position ψ ' the corresponding character is displayed on the key of the psi key of the login code character;
s117, upon receiving input of the ζ th registration code character, performs the following operations:
Figure GDA0003783382370000051
wherein, MD ζ+1 () A hashing algorithm representing performing ζ +1 times MD 5;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD ζ () A hashing algorithm representing performing ζ times MD 5;
MD ζ-1 () A hashing algorithm representing performing ζ -1 times MD 5;
MD ζ-2 () A hashing algorithm representing performing ζ -2 times MD 5;
Figure GDA0003783382370000052
represents a total of ζ + 1;
MD () represents a hashing algorithm that performs MD 5;
τ ξ a character indicating that the xi key of the login code character is displayed in step S114; ξ ═ 1, 2, 3, … …, ψ;
ζ ξ,ζ+1 character tau displayed on the xi key of character of registration code ξ Carrying out zeta +1 operation to obtain a result value;
s118, arranging all the operation values from small to large or from large to small to obtain tau 1 ″、τ 2 ″、τ 3 ″、……、τ ψ "; wherein, tau 1 "all result values are arranged from small to large or from large to small in the 1 st bit, τ 2 "is the result value at the 2 nd bit is arranged from small to large or from large to small for all result values, τ 3 "is all the result values arranged in the 3 rd bit from small to large or from large to small, … …, τ ψ "arranging the result values at the ψ -th bit for all the result values from small to large or from large to small;
s119, arranging the result values tau at the 1 st bit from small to large or from large to small 1 "the corresponding character is displayed on the 1 st key of the registration code character, all the result values are arranged from small to large or from large to small at the 2 nd bit result value tau 2 "the corresponding character is displayed on the 2 nd key of the login code character, all the result values are arranged from small to large or from large to small in the 3 rd bit result value tau 3 "the corresponding character is displayed on the No. 3 key of the registration code character, … …, all the result values are arranged from small to large or from large to small in the result value tau at the phi position ψ "the corresponding character is displayed on the key of the psi key of the login code character; ζ +1, return to step S117; until the input of the login code character is finished.
In a preferred embodiment of the present invention, step S110 is included before step S111, and step S110 includes steps S1101 to S1104;
s1101, arranging all the characters input by the login code characters, sequentially numbering the characters, and marking the characters as B 1 、B 2 、B 3 、……、B β ；B 1 A 1 st character representing the arrangement of all characters input by the entry code character, B 2 2 nd bit character representing the arrangement of all characters input by the entry code character, B 3 A 3 rd digit character … …, B indicating that all characters input by the registration code character are arranged β A beta-bit character representing a character array of all characters inputted by the login code character;
s1102, performing the following operations on the arranged characters:
Figure GDA0003783382370000061
wherein, MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
Figure GDA0003783382370000062
a beta' bit character representing that all characters input by the login code character are arranged; β ″ ═ 1, 2, 3, … …, β;
Figure GDA0003783382370000063
a beta-bit character representing the arrangement of all characters input by the entry code character
Figure GDA0003783382370000064
Performing 1 operation to obtain a presentation value;
s1103, arranging all the presentation values from small to large or from large to small to obtain tau 1 ″′、τ 2 ″′、τ 3 ″′、……、τ β "; wherein, tau 1 "' is the presentation value at bit 1, τ, with all presentation values arranged from small to large or from large to small 2 "' is the presentation value at bit 2, with all presentation values arranged from small to large or from large to small, τ 3 "' is the presentation value at position 3, with all presentation values arranged from small to large or from large to small, … …, τ β "' is the presentation value at the beta-th position of all presentation values arranged from small to large or from large to small;
s1104, arranging all the presentation values in a 1 st bit presentation value tau from small to large or from large to small 1 The character corresponding to' is displayed on the No. 1 key of the login code character, all the presentation values are arranged from small to large or from large to small to be in the 2 nd bit presentation value tau 2 The character corresponding to' is displayed on the 2 nd key of the login code character, all the presentation values are arranged from small to large or from large to small to be at the presentation value tau of the 3 rd bit 3 The character corresponding to ""' is displayed on the No. 3 key of the registration code character, … …, all the presentation values are arranged from small to large or from large to small in the presentation value tau at the beta position β The character corresponding to ""' is displayed on the beta-th key of the login code character.
In a preferred embodiment of the present invention, in steps S115 and/or S118 and/or S1103, all the calculated values thereof are arranged from large to small.
In a preferred embodiment of the present invention, the actual input character is replaced with other identical or different characters in the entry code input box, and the other identical or different characters are all characters excluding the entry of the entry code character.
In conclusion, due to the adoption of the technical scheme, the data can be inquired and changed after the mobile intelligent handheld terminal logs in the cloud intelligent platform.
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 representation of the present invention.
FIG. 3 is a schematic representation of the present invention.
FIG. 4 is a schematic representation of the present invention.
FIG. 5 is a schematic representation of the present invention.
FIG. 6 is a schematic representation of the present invention.
FIG. 7 is a schematic representation of the present invention.
FIG. 8 is a schematic representation of the present invention.
FIG. 9 is a schematic representation of the present invention.
FIG. 10 is a schematic representation 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 discloses a working method for executing an operation instruction of a smart city through a big data platform, which comprises the following steps as shown in figure 1:
s1, logging in the cloud intelligent platform through the mobile intelligent handheld terminal;
s2, judging whether the login is successful:
if the login is successful, go to step S3;
if the login fails, returning to the step S1;
and S3, after the login is successful, inquiring and changing the data by using the mobile intelligent handheld terminal.
In a preferred embodiment of the present invention, step S3 includes the following steps:
s31, obtaining the input query words or query terms:
if the following operations are performed on the query word:
Qw＝MD(Query Word)，
wherein, MD () represents a hashing algorithm using MD 5;
query Word represents a Query Word;
qw represents a Query Word obtained after the Query Word is processed by the Hash algorithm of MD 5;
if the query word comprises the following steps:
s311, separating the query words into single query words G 1 、G 2 、G 3 、……、G g G is the number of the query words in the query word; g is a positive integer greater than or equal to 2; g 1 1 st query word G after representing query word separation 2 2 nd query word G after representing query word separation 3 Indicating the 3 rd query word, … …, G after the query word is separated g Representing the g-th query word after the separation of the query words; if the query word is G 1 G 2 G 3 With separate individual query words as G 1 、G 2 、G 3 If the query word is G 1 G 2 With separate individual query words of G 1 、G 2 If the query word is G 1 G 2 G 3 G 4 With separate individual query words as G 1 、G 2 、G 3 、G 4 。
S312, performing permutation and combination on all the separated query words to obtain a permutation and combination set; e.g. all the separated query words are G 1 、G 2 、G 3 Obtaining a combination of permutation groups as G 1 、G 2 、G 3 、G 1 G 2 、G 2 G 1 、G 1 G 3 、G 3 G 1 、G 2 G 3 、G 3 G 2 、G 1 G 2 G 3 、G 1 G 3 G 2 、G 2 G 1 G 3 、G 2 G 3 G 1 、G 3 G 1 G 2 、G 3 G 2 G 1 (ii) a All the separated query words are G 1 、G 2 Obtaining a combination of permutation groups as G 1 、G 2 、G 1 G 2 、G 2 G 1 (ii) a E.g. all the separated query words are G 1 、G 2 、G 3 、G 4 Obtaining a combination of permutation groups as G 1 、G 2 、G 3 、G 4 、G 1 G 2 、G 2 G 1 、G 1 G 3 、G 3 G 1 、G 2 G 3 、G 3 G 2 、G 1 G 4 、G 4 G 1 、G 2 G 4 、G 4 G 2 、G 3 G 4 、G 4 G 3 、
G 1 G 2 G 3 、G 1 G 3 G 2 、G 2 G 1 G 3 、G 2 G 3 G 1 、G 3 G 1 G 2 、G 3 G 2 G 1 、G 1 G 2 G 4 、G 1 G 4 G 2 、G 2 G 1 G 4 、G 2 G 4 G 1 、G 3 G 1 G 4 、G 3 G 4 G 1 、G 1 G 3 G 4 、G 1 G 4 G 3 、G 3 G 1 G 4 、G 3 G 4 G 1 、G 4 G 1 G 3 、G 4 G 3 G 1 、G 2 G 3 G 4 、G 2 G 4 G 3 、G 3 G 2 G 4 、G 3 G 4 G 2 、G 4 G 2 G 3 、G 4 G 3 G 2 、G 1 G 2 G 3 G 4 、G 1 G 2 G 4 G 3 、G 1 G 3 G 4 G 2 、G 1 G 3 G 2 G 4 、G 1 G 4 G 2 G 3 、G 1 G 4 G 3 G 2 、G 2 G 1 G 3 G 4 、G 2 G 1 G 4 G 3 、G 2 G 3 G 1 G 4 、G 2 G 3 G 4 G 1 、G 2 G 4 G 1 G 3 、G 2 G 4 G 3 G 1 、G 3 G 1 G 2 G 4 、G 3 G 1 G 4 G 2 、G 3 G 2 G 4 G 1 、G 3 G 2 G 1 G 4 、G 3 G 4 G 1 G 2 、G 3 G 4 G 2 G 1 、G 4 G 1 G 2 G 3 、G 4 G 1 G 3 G 2 、G 4 G 2 G 3 G 1 、G 4 G 2 G 1 G 3 、G 4 G 3 G 1 G 2 、G 4 G 3 G 2 G 1 。
S313, executing the following operations on the elements in the permutation and combination set thereof:
Figure GDA0003783382370000091
wherein, MD () represents a hashing algorithm using MD 5;
Query term η representing the eta element in the permutation and combination set;
qt represents the η th element Query term in the permutation and combination set η Obtaining a query word code after the processing by using a Hash algorithm of MD 5;
s32, using the inquiry word code or inquiry word code to inquire the cloud intelligent platform, and judging whether the check times are more than or equal to the preset check times:
if the checking times are larger than or equal to the preset checking times, reserving the query results, and displaying the reserved query results on the mobile intelligent handheld terminal in sequence from the maximum checking times to the minimum checking times;
and if the checking times are less than the preset checking times, screening out the query result.
In a preferred embodiment of the present invention, in step S11, the method for inputting the registration code includes the steps of:
s111, judging whether the input registration code triggering command is received:
if receiving the input registration code triggering command, executing step S112;
if the input login code triggering command is not received, returning to the step S111;
s112, displaying a login code character input display frame on the mobile intelligent handheld terminal, wherein the login code character input display frame comprises login code character keys, all the login code character keys are all characters input by login code characters, and the characters displayed on each login code character key are different and comprise one or any combination of numbers, capital letters and lowercase letters; the numbers comprise one or any combination of 0, 1, 2, 3, … … and 9, the capital letters comprise one or any combination of A, B, C, D, … … and Z, and the lowercase letters comprise one or any combination of a, b, c, d, … … and Z; let ζ be 2;
s113, counting the number of all login code character keys in a login code character input display frame and marking the number as psi after receiving the input of the 1 st login code character; respectively are a login code character No. 1 key, a login code character No. 2 key, a login code character No. 3 key, … … and a login code character No. psi key;
s114, obtaining the characters displayed on the 1 st key, the 2 nd key, the 3 rd key, … … and the psi th key of the login code character, and performing the following operations:
Figure GDA0003783382370000111
wherein, MD 2 () A hashing algorithm denoted as performing MD5 2 times;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
τ ξ a character indicating the displayed on the xi key of the login code character; ξ ═ 1, 2, 3, … …, ψ;
ζ ξ,2 character tau displayed on xi key of character of indicating registration code ξ Performing 2 times of operation to obtain an operation value;
s115, all the operation values are arranged from small to large or from large to small to obtain tau 1 ′、τ 2 ′、τ 3 ′、……、τ β '; wherein, tau 1 ' the operation value at bit 1 is arranged from small to large or from large to small for all operation values, τ 2 ' the operation value at the 2 nd bit is arranged from small to large or from large to small for all the operation values, τ 3 ' the operation value at the 3 rd bit is arranged from small to large or from large to small for all the operation values, … …, tau ψ ' arranging operation values at the psi-th bit from small to large or from large to small for all operation values;
s116, arranging all the operation values from small to large or from large to small to be in the operation value tau of the 1 st bit 1 ' the corresponding character is displayed on the 1 st key of the registration code character, and all the operation values are arranged from small to large or from large to small in the 2 nd bit operation value tau 2 ' the corresponding character is displayed on the 2 nd key of the registration code character, and all the operation values are arranged from small to large or from large to small to be in the 3 rd bit operation value tau 3 ' the corresponding character is displayed on the No. 3 key of the registration code character … …, all the calculated values are arranged from small to large or from large to small in the calculated value tau at the phi-th position ψ ' the corresponding character is displayed on the key of the psi key of the login code character;
s117, upon receiving input of the ζ th registration code character, performs the following operations:
Figure GDA0003783382370000121
wherein, MD ζ+1 () A hash algorithm representing ζ +1 times MD 5;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD ζ () A hash algorithm representing performing ζ times MD 5;
MD ζ-1 () A hashing algorithm representing performing ζ -1 times MD 5;
MD ζ-2 () A hashing algorithm representing performing ζ -2 times MD 5;
Figure GDA0003783382370000122
represents a total of ζ + 1;
MD () represents a hashing algorithm that performs MD 5;
τ ξ a character indicating that the xi key of the login code character is displayed in step S114; ξ ═ 1, 2, 3, … …, ψ;
ζ ξ,ζ+1 character tau displayed on xi key of character of indicating registration code ξ The result value obtained by zeta +1 operation;
s118, arranging all the operation values from small to large or from large to small to obtain tau 1 ″、τ 2 ″、τ 3 ″、……、τ ψ "; wherein, tau 1 "all result values are arranged from small to large or from large to small in the 1 st bit, τ 2 "is the result value at the 2 nd bit is arranged from small to large or from large to small for all result values, τ 3 "is the result value at the 3 rd bit arranged from small to large or from large to small for all result values, … …, τ ψ "arranging the result values at the ψ -th bit for all the result values from small to large or from large to small;
s119, arranging the result values tau at the 1 st bit from small to large or from large to small 1 "the corresponding character is displayed on the 1 st key of the login code character, all the result values are arranged from small to large or from large to small in the 2 nd bit result value tau 2 "the corresponding character is displayed on the 2 nd key of the registration code character, and all the characters are displayedThe result value is arranged from small to large or from large to small in the result value tau at the 3 rd bit 3 "the corresponding character is displayed on the No. 3 key of the registration code character, … …, all the result values are arranged from small to large or from large to small in the result value tau of the ψ th position ψ "the corresponding character is displayed on the key of the psi < th > key of the login code character; ζ +1, return to step S117; until the input of the login code character is finished.
In a preferred embodiment of the present invention, step S110 is included before step S111, and step S110 includes steps S1101 to S1104;
s1101, arranging all the characters input by the login code characters, sequentially numbering the characters, and marking the characters as B 1 、B 2 、B 3 、……、B β ；B 1 A 1 st character representing the arrangement of all characters input by the entry code character, B 2 2 nd bit character representing the arrangement of all characters input by the entry code character, B 3 A 3 rd digit character … …, B indicating that all characters input by the registration code character are arranged β A beta-bit character representing a character array of all characters inputted by the login code character;
s1102, performing the following operations on the arranged characters:
Figure GDA0003783382370000131
wherein, MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
Figure GDA0003783382370000132
a beta' bit character representing that all characters input by the login code character are arranged; β ″ ═ 1, 2, 3, … …, β;
Figure GDA0003783382370000133
indicating character entry of entry codeBeta-th bit character B after all characters are arranged β "presented value obtained by performing 1 operation;
s1103, arranging all the presentation values from small to large or from large to small to obtain tau 1 ″′、τ 2 ″′、τ 3 ″′、……、τ β "; wherein, tau 1 "' is the presentation value at bit 1, τ, with all presentation values arranged from small to large or from large to small 2 "' is the presentation value at position 2 in descending order or ascending order of all presentation values, τ 3 "' is the presentation value at position 3, with all presentation values arranged from small to large or from large to small, … …, τ β "' is the presentation value at the beta-th position of all presentation values arranged from small to large or from large to small;
s1104, arranging all the presentation values from small to large or from large to small in the presentation value tau at the 1 st bit 1 The character corresponding to' is displayed on the No. 1 key of the login code character, all the presentation values are arranged from small to large or from large to small to be in the 2 nd bit presentation value tau 2 The character corresponding to' is displayed on the 2 nd key of the login code character, all the presentation values are arranged from small to large or from large to small to be at the presentation value tau of the 3 rd bit 3 The character corresponding to ""' is displayed on the No. 3 key of the registration code character, … …, all the presentation values are arranged from small to large or from large to small in the presentation value tau at the beta position β The character corresponding to ""' is displayed on the beta-th key of the login code character.
In a preferred embodiment of the present invention, in steps S115, S118, and S1103, all of the calculation values thereof are arranged from large to small;
or/and replacing the actual input character with other same or different characters in the login code input box, wherein the other same or different characters are all characters which do not comprise the input of the login code characters.
In a preferred embodiment of the present invention, in step S12, the following operations are performed on the acquired login name:
ε GALU ＝MD(GALU)，
wherein, MD () represents a hashing algorithm for performing MD 5;
GALU represents the login name;
ε GALU the sign-in name GALU is processed to obtain a processed sign-in name;
or/and in step S12, the following operations are performed on the acquired login code:
ε GALP ＝MD(GALP)，
wherein, MD () represents a hashing algorithm for performing MD 5;
GALP represents the registration code;
ε GALP indicating that the registration code GALP is processed to obtain a processed registration code.
Or/and in step S2, the verification method comprises the following steps:
the first step, the cloud intelligent platform judges whether the login name received by the cloud intelligent platform exists in the cloud intelligent platform:
if the received login name exists in the cloud intelligent platform, listing the login code corresponding to the login name in a login code library form, wherein the login code library comprises mu login codes, mu is a positive integer greater than or equal to 2, and executing the next step;
if the received login name does not exist in the cloud intelligent platform, the cloud intelligent platform sends feedback information, and the feedback information indicates that the login name does not exist in the cloud intelligent platform and requests for registration of the login name;
secondly, judging whether the login code exists in a login code library:
if the login code exists in the login code library, the verification is passed;
if the login code does not exist in the login code library, the verification fails and feedback information is sent, wherein the feedback information is that the login code is wrong, and the correct login code is required to be input again.
In a preferred embodiment of the present invention, step S1 includes the steps of:
s11, inputting a login name and a login code through the mobile intelligent handheld terminal;
and S12, processing the login name and the login code, and sending the processed login name and login code to the cloud intelligent platform.
In a preferred embodiment of the present invention, in step S11, the method for inputting a login name includes the steps of:
s111, judging whether the input login name triggering command is received:
if receiving the input login name triggering command, executing step S112;
if the input login name triggering command is not received, returning to the step S111;
s112, displaying a login name character input display frame on the mobile intelligent handheld terminal, wherein the login name character input display frame comprises login name character keys, all the login name character keys are all characters input by the login name characters, and the characters displayed on each login name character key are different and comprise one or any combination of numbers, capital letters and lowercase letters; the numbers comprise one or any combination of 0, 1, 2, 3, … … and 9, the capital letters comprise one or any combination of A, B, C, D, … … and Z, and the lowercase letters comprise one or any combination of a, b, c, d, … … and Z; let α be 2;
s113, if a character is displayed on a key after the 1 st login name character input is received, if the key is triggered, the character displayed by the key is received, the number of all login name character keys in a login name character input display frame is counted and recorded as beta; respectively a login name character No. 1 key, a login name character No. 2 key, a login name character No. 3 key, … … and a login name character No. beta key;
s114, acquiring the characters displayed on the 1 st key, the 2 nd key, the 3 rd key, … … and the β th key of the login character, and performing the following operations:
Figure GDA0003783382370000161
wherein, MD 2 () RepresentPerforming a hashing algorithm for MD5 2 times;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
χ δ a character indicating that the login name character is displayed on the δ -th key; δ — 1, 2, 3, … …, β;
ε δ,2 character x displayed on delta key representing character of login name δ Performing 2 times of operation to obtain an operation value;
s115, arranging all the operation values from small to large or from large to small to obtain the χ 1 ′、χ 2 ′、χ 3 ′、……、χ β '; wherein, χ 1 ' arranging the operation value at the 1 st bit from small to large or from large to small for all operation values, χ 2 ' arranging the operation value in the 2 nd bit from small to large or from large to small for all operation values, χ 3 ' the operation value at the 3 rd bit is arranged from small to large or from large to small for all the operation values, … …, χ β ' arranging the operation values at the beta-th bit from small to large or from large to small for all the operation values;
s116, arranging all the operation values in the 1 st bit of the operation values according to the descending or descending order 1 ' the corresponding character is displayed on the No. 1 key of the login name character, and all the operation values are arranged into the 2 nd bit operation value x from small to large or from large to small 2 ' the corresponding character is displayed on the 2 nd key of the login name character, and all the operation values are arranged in the 3 rd bit operation value x from small to large or from large to small 3 ' the corresponding character is displayed on the No. 3 key of the login name character … …, all the calculated values are arranged from small to large or from large to small in the beta-th calculated value χ β ' the corresponding character is displayed on the beta-th key of the login name character; from small to large as x 1 ′、χ 2 ′、χ 3 ′、……、χ β-2 ′、χ β-1 ′、χ β ' in turn equals ε β,2 、ε β-1,2 、ε β-2,2 、……、ε 3,2 、ε 2,2 、ε 1,2 The characters are arranged from small to big in sequence β Displayed on the beta-th key, character χ β-1 Displayed on the beta-1 th key, character χ β-2 Is displayed on the beta-2 key, … …, character x 3 Displayed on the 3 rd key, character x 2 Displayed on the 2 nd key, character χ 1 Displayed on the 1 st key.
S117 displaying a certain character on the key, if the key is triggered, receiving the character displayed on the key, and if the α -th login name is received, performing the following operations:
Figure GDA0003783382370000171
wherein, MD α+1 () A hashing algorithm denoted α +1 times MD 5;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD α () A hash algorithm representing performing MD5 a times;
MD α-1 () A hashing algorithm denoted alpha-1 times MD 5;
MD α-2 () A hashing algorithm representing performing MD5 a-2 times;
Figure GDA0003783382370000172
represents a total of α + 1;
MD () represents a hashing algorithm that performs MD 5;
χ δ a character indicating that the login name character δ -th key is displayed in step S114; δ — 1, 2, 3, … …, β;
ε δ,α+1 character x displayed on delta key representing character of login name δ Carrying out alpha +1 times of operation to obtain a result value;
s118, arranging all the operation values from small to large or from large to small to obtain the χ 1 ″、χ 2 ″、χ 3 ″、……、χ β "; wherein, χ 1 "is the result value in bit 1 arranged from small to large or from large to small for all result values, χ 2 "is the result value in the 2 nd bit arranged from small to large or from large to small for all result values, χ 3 "is the result value at the 3 rd bit arranged from small to large or from large to small for all the result values, … …, χ β "is the result value at the beta-th position in all the result values arranged from small to large or from large to small;
s119, arranging the result values X at the 1 st bit from small to large or from large to small 1 "the corresponding character is displayed on the No. 1 key of the login name character, all the result values are arranged from small to large or from large to small in the 2 nd bit result value χ 2 "the corresponding character is displayed on the 2 nd key of the login name character, all the result values are arranged from small to large or from large to small in the 3 rd bit result value χ 3 "the corresponding character is displayed on the No. 3 key of the login name character, … …, all the result values are arranged in the beta-th order of the result value χ from small to large or from large to small β "the corresponding character is displayed on the beta-th key of the login name character; α +1, return to step S117; until the character input of the login name is finished. From small to large as χ 1 ″、χ 2 ″、χ 3 ″、……、χ β-2 ″、χ β-1 ″、χ β "in turn equals ε β,3 、ε β-1,3 、ε β-2,3 、……、ε 3,3 、ε 2,3 、ε 1,3 X, then character β Displaying the characters X on the beta-th key in turn from small to big β-1 Displayed on the beta-1 th key, character χ β-2 Is displayed on the beta-2 key, … …, character x 3 Displayed on the 3 rd key, character x 2 Displayed on the 2 nd key, character χ 1 Displayed on the 1 st key.
In a preferred embodiment of the present invention, step S110 is included before step S111, and step S110 includes steps S1101 to S1104;
s1101, arranging all characters input by the login name symbols, sequentially numbering the characters, and marking as A 1 、A 2 、A 3 、……、A β ；A 1 A 1 st digit character indicating that all characters of the entry name character are arranged, A 2 2 nd bit character, A, indicating that all characters of the entry name character are arranged 3 … …, A as the 3 rd digit character indicating the arrangement of all characters entered by the characters of the entry name β A second character indicating that all characters input by the login name character are arranged;
s1102, performing the following operations on the arranged characters:
Figure GDA0003783382370000191
wherein, MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
Figure GDA0003783382370000192
a beta' -th character representing a character in which all characters input by the login name character are arranged; β' ═ 1, 2, 3, … …, β;
Figure GDA0003783382370000193
a beta' -th character representing the arrangement of all characters input by the entry name character
Figure GDA0003783382370000194
Performing 1 operation to obtain a display value;
s1103, arranging all the display values from small to large or from large to small to obtain χ 1 ″′、χ 2 ″′、χ 3 ″′、……、χ β "; wherein, χ 1 "' is the display value of 1 st digit, χ 2 "' is allIs arranged in order from small to large or from large to small at the display value of 2 nd bit, χ 3 "' is the display value in the 3 rd digit of all display values arranged from small to large or from large to small, … …, χ β "' is the display value of the beta bit of all display values arranged from small to large or from large to small;
s1104, arranging all display values from small to large or from large to small to display value χ at 1 st bit 1 The character corresponding to' is displayed on the No. 1 key of the login name character, all display values are arranged in the No. 2 display value χ from small to large or from large to small 2 The character corresponding to' is displayed on the 2 nd key of the login name character, all display values are arranged in the 3 rd bit display value χ from small to large or from large to small 3 The character corresponding to the' is displayed on the No. 3 key of the login name character, … …, all the display values are arranged from small to large or from large to small to be in the display value χ of the beta position β The character corresponding to ""' is displayed on the betath key of the login name character. From small to large as x 1 ″′、χ 2 ″′、χ 3 ″′、……、χ β-2 ″′、χ β-1 ″′、χ β Is equal to
Figure GDA0003783382370000195
Figure GDA0003783382370000196
The characters A are sequentially changed from small to large β Displayed on the beta-th key, character A β-1 Displayed on the beta-1 th key, character A β-2 Displayed on the beta-2 key, … …, character A 3 Displayed on the 3 rd key, character A 2 Displayed on the 2 nd key, character A 1 Displayed on the 1 st key.
A specific embodiment is given below, and the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key and the login name character 5 th key are sequentially arranged from left to right; the total characters entered by the login name characters are A, B, C, D, E, and the login name is BBCE.
In the first step, A, B, C, D, E is arranged as: B. a, D, C, E, respectively; namely A 1 、A 2 、A 3 、A 4 、A 5 In turn, B, A, D, C, E; a. the 1 ＝B，A 2 ＝A，A 3 ＝D，A 4 ＝C，A 5 ＝E。
In the second step, the first step is that,
Figure GDA0003783382370000201
Figure GDA0003783382370000202
Figure GDA0003783382370000203
Figure GDA0003783382370000204
Figure GDA0003783382370000205
thirdly, arranging all the display values from small to large to obtain chi 1 ″′、χ 2 ″′、χ 3 ″′、……、χ β ' in turn corresponds to
Figure GDA0003783382370000206
The fourth step is that the first step is that,
Figure GDA0003783382370000207
the corresponding characters are C, E, A, B, D, and the characters C, E, A, B, D correspond to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key and the login nameThe character is displayed on the 5 th key as shown in fig. 2.
Fifthly, if the input of the 1 st login name character (namely B) is received, the following operations are carried out:
Figure GDA0003783382370000211
Figure GDA0003783382370000212
Figure GDA0003783382370000213
Figure GDA0003783382370000214
Figure GDA0003783382370000221
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 4,2 、ε 5,2 、ε 2,2 、ε 1,2 、ε 3,2 。
Sixth step, ε 4,2 、ε 5,2 、ε 2,2 、ε 1,2 、ε 3,2 The characters corresponding in this order are B, D, E, C, A, and a character B, D, E, C, A is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 3.
Seventhly, if the 2 nd login name character (namely B) is received, the following operations are carried out:
Figure GDA0003783382370000222
Figure GDA0003783382370000223
Figure GDA0003783382370000231
Figure GDA0003783382370000232
Figure GDA0003783382370000233
Figure GDA0003783382370000234
Figure GDA0003783382370000241
Figure GDA0003783382370000242
Figure GDA0003783382370000243
Figure GDA0003783382370000244
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 3,3 、ε 2,3 、ε 5,3 、ε 4,3 、ε 1,3 。
Eighth step, ε 3,3 、ε 2,3 、ε 5,3 、ε 4,3 、ε 1,3 The corresponding characters in this order are A, E, D, B, C, and a character A, E, D, B, C is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 4.
Ninthly, if the 3 rd login name character (namely C) is received, the following operations are carried out:
Figure GDA0003783382370000251
Figure GDA0003783382370000252
Figure GDA0003783382370000253
Figure GDA0003783382370000261
Figure GDA0003783382370000262
Figure GDA0003783382370000263
Figure GDA0003783382370000271
Figure GDA0003783382370000272
Figure GDA0003783382370000273
Figure GDA0003783382370000281
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 4,4 、ε 1,4 、ε 3,4 、ε 5,4 、ε 2,4 。
Tenth step, ε 4,4 、ε 1,4 、ε 3,4 、ε 5,4 、ε 2,4 The corresponding characters in this order are B, C, A, D, E, and a character B, C, A, D, E is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 5.
As a tenth step, after receiving the input of the 4 th entry name character (i.e., E), the following operations are performed:
Figure GDA0003783382370000282
Figure GDA0003783382370000291
Figure GDA0003783382370000292
Figure GDA0003783382370000301
Figure GDA0003783382370000302
Figure GDA0003783382370000311
Figure GDA0003783382370000312
Figure GDA0003783382370000321
Figure GDA0003783382370000322
Figure GDA0003783382370000331
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 4,5 、ε 3,5 、ε 2,5 、ε 1,5 、ε 5,5 。
A twelfth step of e 4,5 、ε 3,5 、ε 2,5 、ε 1,5 、ε 5,5 The corresponding characters in this order are B, A, E, C, D, and a character B, A, E, C, D is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 6. The characters displayed by the input keys are different, and safety protection is enhanced.
And step thirteen, finishing the input of the 4-bit login name character.
In a preferred embodiment of the present invention, in steps S115, S118, and S1103, all the calculation values thereof are arranged from small to large;
or/and replacing the actual input character with other same or different characters in the login name input box, wherein the other same or different characters are all characters which do not comprise the input of the login name character.
Another specific embodiment is given below, which is that the 1 st key of the login name character, the 2 nd key of the login name character, the 3 rd key of the login name character, the 4 th key of the login name character and the 5 th key of the login name character are sequentially arranged from left to right; all characters entered by the login name characters are A, B, C, D, E, the login name is BBCE, and the displayed login name is replaced with.
In the first step, A, B, C, D, E is arranged as follows: B. a, D, C, E, respectively; namely A 1 、A 2 、A 3 、A 4 、A 5 In turn, B, A, D, C, E; a. the 1 ＝B，A 2 ＝A，A 3 ＝D，A 4 ＝C，A 5 ＝E。
In the second step, the first step is that,
Figure GDA0003783382370000341
Figure GDA0003783382370000342
Figure GDA0003783382370000343
Figure GDA0003783382370000344
Figure GDA0003783382370000345
thirdly, arranging all the display values from small to large to obtain chi 1 ″′、χ 2 ″′、χ 3 ″′、……、χ β ' in turn corresponds to
Figure GDA0003783382370000346
The fourth step is that the first step is that,
Figure GDA0003783382370000347
the corresponding characters in this order are C, E, A, B, D, and the character C, E, A, B, D is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 1.
Fifthly, if the input of the 1 st login name character (namely B, which shows x) is received, the following operations are carried out: epsilon 1,2 ＝297e7ca127d2eef674c119331fe30dff，
ε 2,2 ＝1925294ef4492da4b990901ebab5396e，
ε 3,2 ＝7fc56270e7a70fa81a5935b72eacbe29，
ε 4,2 ＝01b7c90b02081ae53119957e0697b081，
ε 5,2 ＝0c554e24da6263f40dbc6aabe26f354d，
All the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "in turn correspond to ε 4,2 、ε 5,2 、ε 2,2 、ε 1,2 、ε 3,2 。
Sixth step, ε 4,2 、ε 5,2 、ε 2,2 、ε 1,2 、ε 3,2 The corresponding characters in this order are B, D, E, C, A, and a character B, D, E, C, A is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 7.
Seventhly, if the 2 nd login name character (namely B, displaying) is received, the following operations are carried out:
ε 1,3 ＝dc79ebf62a4e1174b800dede4387db83，
ε 2,3 ＝085604d6283a0e8684d73e9b97444c90，
ε 3,3 ＝01484f32e1eae8c021a3bd2fb3d1062f，
ε 4,3 ＝d1670092d8ba29909a5522d369f6b87c，
ε 5,3 ＝0e578f3df143ddbf9bea0b80a26fcfdc，
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 3,3 、ε 2,3 、ε 5,3 、ε 4,3 、ε 1,3 。
Eighth step, ε 3,3 、ε 2,3 、ε 5,3 、ε 4,3 、ε 1,3 The corresponding characters in this order are A, E, D, B, C, and a character A, E, D, B, C is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 8.
Ninthly, if the input of the 3 rd login name character (namely, C, display) is received, the following operations are carried out:
ε 1,4 ＝287e1bad918671acbed1fee599cd505e，
ε 2,4 ＝74545c8c2974ec7b75e37e1f4638e632，
ε 3,4 ＝5eed7cf4fa6ac7f52226d3af23b5be2b，
ε 4,4 ＝1597dd3950b6ec77f0962b26ea6ca4a5，
ε 5,4 ＝71827e65d14efba2a7d2afc6f22240e5，
all the calculated values are arranged from small to large to obtain the chi 1 ″、χ 2 ″、χ 3 ″、……、χ β "sequentially correspond to ε 4,4 、ε 1,4 、ε 3,4 、ε 5,4 、ε 2,4 。
Tenth step, ε 4,4 、ε 1,4 、ε 3,4 、ε 5,4 、ε 2,4 The characters corresponding in this order are B, C, A, D, E, and a character B, C, A, D, E is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 9.
As a tenth step, after receiving the 4 th entry character (i.e., E, display), the following operations are performed:
ε 1,5 ＝f38ea8b5a97c3bf1f9f123a40659cec1，
ε 2,5 ＝71aa778898173c34d7d2faf7302500c2，
ε 3,5 ＝34df0b4fb03ed989d3d2a61e1b45ee67，
ε 4,5 ＝2cc52748677ae83a4badc0cfc620c82b，
ε 5,5 ＝f7d556efacd347eb42d2f9bc19d25180，
all the calculated values are arranged from small to large to obtain the x 1 ″、χ 2 ″、χ 3 ″、……、χ β "in turn correspond to ε 4,5 、ε 3,5 、ε 2,5 、ε 1,5 、ε 5,5 。
A twelfth step,. epsilon 4,5 、ε 3,5 、ε 2,5 、ε 1,5 、ε 5,5 The corresponding characters in this order are B, A, E, C, D, and a character B, A, E, C, D is displayed corresponding to the login name character 1 st key, the login name character 2 nd key, the login name character 3 rd key, the login name character 4 th key, and the login name character 5 th key, as shown in fig. 10.
And step thirteen, finishing the input of the 4-bit login name character.
In a preferred embodiment of the present invention, in step S3, when the cloud smart platform log information file is queried, the modifying step includes the following steps:
s31, sending a control command for changing the cloud intelligent platform log information file to the cloud intelligent platform through the mobile intelligent handheld terminal;
s32, the cloud intelligent platform judges whether the cloud intelligent platform receives a control command for changing the log information file of the cloud intelligent platform:
if the cloud intelligent platform receives a control command for changing the log information file of the cloud intelligent platform, executing the next step;
if the cloud intelligent platform does not receive the control command for changing the cloud intelligent platform log information file, returning to the step S32;
s33, copying and pasting the inquired cloud intelligent platform log information file to generate a cloud intelligent platform log information file copy; a log safety lock is arranged on the generated cloud intelligent platform log information file copy, under the condition of the log safety lock, other processes cannot access the cloud intelligent platform log information file copy, and other processes do not comprise a control command process for changing the cloud intelligent platform log information file, so that the integrity and the safety of the cloud intelligent platform log information file copy can be ensured;
s34, changing the generated copy of the cloud intelligent platform log information file by using the control command to obtain a changed copy of the cloud intelligent platform log information file; and cancel its log safety lock;
and S35, replacing the cloud intelligent platform log information file with the cloud intelligent platform log information file change copy obtained in the step S34, and changing the cloud intelligent platform log information file. Under the condition of downtime or power failure, the change of the log is prevented from causing the cloud intelligent platform to crash.
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 (6)

1. A working method for executing smart city operation instructions through a big data platform is characterized by comprising the following steps:
s1, logging in the cloud intelligent platform through the mobile intelligent handheld terminal;
s2, judging whether the login is successful:
if the login is successful, go to step S3;
if the login fails, returning to the step S1;
s3, after the login is successful, the mobile intelligent handheld terminal is used for inquiring and changing the data;
the query for data in step S3 includes the steps of:
s31, obtaining the input query words or query terms:
if the following operations are performed on the query word:
Qw＝MD(Query Word)，
wherein, MD () represents a hash algorithm using MD 5;
query Word represents a Query Word;
qw represents a Query Word obtained after the Query Word is processed by the Hash algorithm of MD 5;
if the query word comprises the following steps:
s311, separating the query words into single query words which are G respectively 1 、G 2 、G 3 、……、G g G is the number of the query words in the query word; g is a positive integer greater than or equal to 2; g 1 1 st query word G after representing query word separation 2 2 nd query word G after representing query word separation 3 Representing the 3 rd query word … …, G after the separation of the query words g Representing the g-th query word after the separation of the query words;
s312, carrying out permutation and combination on all the separated query words to obtain a permutation and combination set;
s313, executing the following operations on the elements in the permutation and combination set thereof:
Figure FDA0003783382360000011
wherein, MD () represents a hashing algorithm using MD 5;
Query term η representing the eta in the permutation and combination setAn element;
qt represents the η -th element Query term in the permutation and combination set η Obtaining a query word code after processing by using a hash algorithm of MD 5;
s32, using the inquiry word code or inquiry word code to inquire the cloud intelligent platform, and judging whether the check times are more than or equal to the preset check times:
if the checking times are larger than or equal to the preset checking times, reserving the query results, and displaying the reserved query results on the mobile intelligent handheld terminal in sequence from the maximum checking times to the minimum checking times;
if the checking times are smaller than the preset checking times, screening the query result;
in step S3, when the cloud smart platform log information file is found, the modifying step includes the following steps:
s31, sending a control command for changing the cloud intelligent platform log information file to the cloud intelligent platform through the mobile intelligent handheld terminal;
s32, the cloud intelligent platform judges whether the cloud intelligent platform receives a control command for changing the log information file of the cloud intelligent platform:
if the cloud intelligent platform receives a control command for changing the log information file of the cloud intelligent platform, executing the next step;
if the cloud intelligent platform does not receive the control command for changing the cloud intelligent platform log information file, returning to the step S32;
s33, copying and pasting the inquired cloud intelligent platform log information file to generate a cloud intelligent platform log information file copy; a log safety lock is arranged on the generated cloud intelligent platform log information file copy, under the condition of the log safety lock, other processes cannot access the cloud intelligent platform log information file copy, and other processes do not comprise a control command process for changing the cloud intelligent platform log information file, so that the integrity and the safety of the cloud intelligent platform log information file copy can be ensured;
s34, changing the generated copy of the cloud intelligent platform log information file by using the control command to obtain a changed copy of the cloud intelligent platform log information file; and cancel its log safety lock;
and S35, replacing the cloud intelligent platform log information file with the cloud intelligent platform log information file change copy obtained in the step S34, and changing the cloud intelligent platform log information file.
2. The working method of executing the smart city operation instructions through the big data platform as claimed in claim 1, wherein the step S1 includes the steps of:
s11, inputting a login name and a login code through the mobile intelligent handheld terminal;
and S12, processing the login name and the login code, and sending the processed login name and login code to the cloud intelligent platform.
3. The work method for executing the smart city operation command via the big data platform as claimed in claim 2, wherein the method for inputting the registration code in step S11 includes the steps of:
s111, judging whether the input registration code triggering command is received:
if receiving the input registration code triggering command, executing step S112;
if the input login code triggering command is not received, returning to the step S111;
s112, displaying a login code character input display frame on the mobile intelligent handheld terminal, wherein the login code character input display frame comprises login code character keys, all the login code character keys are all characters input by login code characters, and the characters displayed on each login code character key are different and comprise one or any combination of numbers, capital letters and lowercase letters; the number of the Chinese character comprises one or any combination of 0, 1, 2, 3, … … and 9, the capital letters comprise one or any combination of A, B, C, D, … … and Z, and the lowercase letters comprise one or any combination of a, b, c, d, … … and Z; let ζ be 2;
s113, counting the number of all login code character keys in a login code character input display frame and marking the number as psi after receiving the input of the 1 st login code character; respectively are a login code character No. 1 key, a login code character No. 2 key, a login code character No. 3 key, … … and a login code character No. psi key;
s114, obtaining the characters displayed on the 1 st key, the 2 nd key, the 3 rd key, … … and the psi th key of the login code character, and performing the following operations:
Figure FDA0003783382360000041
wherein, MD 2 () A hashing algorithm denoted as performing MD5 2 times;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
τ ξ a character indicating the displayed on the xi key of the login code character; ξ — 1, 2, 3, … …, ψ;
Figure FDA0003783382360000042
character tau displayed on the xi key of character of registration code ξ Performing 2 times of operation to obtain an operation value;
s115, all the operation values are arranged from small to large or from large to small to obtain tau 1 ′、τ 2 ′、τ 3 ′、……、τ β '; wherein, tau 1 ' the operation value at bit 1 is arranged from small to large or from large to small for all operation values, τ 2 ' the operation value at the 2 nd bit is arranged from small to large or from large to small for all the operation values, τ 3 ' the operation value at the 3 rd bit is arranged from small to large or from large to small for all the operation values, … …, tau ψ ' arranging operation values at the psi-th bit from small to large or from large to small for all operation values;
s116, all the calculated values are calculated according toArranging the operation value tau at the 1 st bit from small to large or from large to small 1 ' the corresponding character is displayed on the 1 st key of the registration code character, and all the operation values are arranged from small to large or from large to small at the 2 nd bit operation value tau 2 ' the corresponding character is displayed on the 2 nd key of the registration code character, and all the calculated values are arranged from small to large or from large to small to be in the calculated value tau of the 3 rd bit 3 ' the corresponding character is displayed on the No. 3 key of the registration code character … …, all the calculated values are arranged from small to large or from large to small in the calculated value tau at the phi-th position ψ ' the corresponding character is displayed on the key of the psi key of the login code character;
s117, upon receiving input of the ζ th registration code character, performs the following operations:
Figure FDA0003783382360000051
wherein, MD ζ+1 () A hashing algorithm representing performing ζ +1 times MD 5;
MD 1 () A hashing algorithm representing performing MD5 1 time;
MD ζ () A hash algorithm representing performing ζ times MD 5;
MD ζ-1 () A hashing algorithm representing performing ζ -1 times MD 5;
MD ζ-2 () A hashing algorithm representing performing ζ -2 times MD 5;
Figure FDA0003783382360000052
represents a total of ζ + 1;
MD () represents a hash algorithm for MD 5;
τ ξ a character indicating that the xi key of the login code character is displayed in step S114; ξ ═ 1, 2, 3, … …, ψ;
Figure FDA0003783382360000053
to representCharacter tau displayed on xi key of login code character ξ Carrying out zeta +1 operation to obtain a result value;
s118, arranging all the operation values from small to large or from large to small to obtain tau 1 ″、τ 2 ″、τ 3 ″、……、τ ψ "; wherein, tau 1 "all result values are arranged from small to large or from large to small in the 1 st bit, τ 2 "is the result value at the 2 nd bit is arranged from small to large or from large to small for all result values, τ 3 "is the result value at the 3 rd bit arranged from small to large or from large to small for all result values, … …, τ ψ "arranging the result values at the ψ -th bit for all the result values from small to large or from large to small;
s119, arranging the result values tau at the 1 st bit from small to large or from large to small 1 "the corresponding character is displayed on the 1 st key of the registration code character, all the result values are arranged from small to large or from large to small at the 2 nd bit result value tau 2 "the corresponding character is displayed on the 2 nd key of the login code character, all the result values are arranged from small to large or from large to small in the 3 rd bit result value tau 3 "the corresponding character is displayed on the No. 3 key of the registration code character, … …, all the result values are arranged from small to large or from large to small in the result value tau at the phi position ψ "the corresponding character is displayed on the key of the psi key of the login code character; ζ +1, return to step S117; until the input of the login code character is finished.
4. The working method of executing smart city operation instructions through big data platform according to claim 3, wherein step S111 is preceded by step S110, and step S110 includes steps S1101-S1104;
s1101, arranging all the characters input by the login code characters, sequentially numbering the characters, and marking the characters as B 1 、B 2 、B 3 、……、B β ；B 1 Indicating that the entry code character is to be entered1 st digit character, B after all the characters are arranged 2 2 nd bit character representing the arrangement of all characters input by the entry code character, B 3 A 3 rd digit character … …, B indicating that all characters input by the registration code character are arranged β A beta-bit character representing a character array of all characters inputted by the login code character;
s1102, performing the following operations on the arranged characters:
Figure FDA0003783382360000061
wherein, MD 1 () A hashing algorithm representing performing MD5 1 time;
MD () represents a hashing algorithm that performs MD 5;
B β "means a beta" bit character in which all characters inputted by the entry code character are arranged; β ″ -1, 2, 3, … …, β;
υ Bβ "beta" bit character B indicating that all characters inputted by the entry code character are arranged β "presented value obtained by performing 1 operation;
s1103, arranging all the presentation values from small to large or from large to small to obtain tau 1 ″′、τ 2 ″′、τ 3 ″′、……、τ β "; wherein, tau 1 "' is the presentation value at the 1 st bit, τ, with all presentation values arranged from small to large or from large to small 2 "' is the presentation value at bit 2, with all presentation values arranged from small to large or from large to small, τ 3 "' is the presentation value at position 3, with all presentation values arranged from small to large or from large to small, … …, τ β "' is the presentation value at the beta-th position of all presentation values arranged from small to large or from large to small;
s1104, arranging all the presentation values in a 1 st bit presentation value tau from small to large or from large to small 1 The character corresponding to' is displayed on the No. 1 key of the character of the registration code, and all the presented values are changed from small to large orArranging the presentation value tau at the 2 nd bit from large to small 2 The character corresponding to' is displayed on the 2 nd key of the login code character, all the presentation values are arranged from small to large or from large to small to be at the presentation value tau of the 3 rd bit 3 The character corresponding to ""' is displayed on the No. 3 key of the registration code character, … …, all the presentation values are arranged from small to large or from large to small in the presentation value tau at the beta position β The character corresponding to ""' is displayed on the beta-th key of the login code character.
5. The work method for executing smart city operation instructions through big data platform according to claim 4, wherein in step S115 or/and S118 or/and S1103, all its operation values are arranged from big to small.
6. The working method of executing smart city operation instructions through big data platform according to claim 4, characterized in that other same or different characters are used to replace the actual input characters in the login code input box, and the other same or different characters are all characters that do not include the input of login code characters.
CN202110298065.9A 2021-03-19 2021-03-19 Working method for executing smart city operation instruction through big data platform Active CN113162916B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110298065.9A CN113162916B (en) 2021-03-19 2021-03-19 Working method for executing smart city operation instruction through big data platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110298065.9A CN113162916B (en) 2021-03-19 2021-03-19 Working method for executing smart city operation instruction through big data platform

Publications (2)

Publication Number Publication Date
CN113162916A CN113162916A (en) 2021-07-23
CN113162916B true CN113162916B (en) 2022-09-09

Family

ID=76887703

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110298065.9A Active CN113162916B (en) 2021-03-19 2021-03-19 Working method for executing smart city operation instruction through big data platform

Country Status (1)

Country Link
CN (1) CN113162916B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7367063B1 (en) * 2002-09-17 2008-04-29 Cisco Technology, Inc. Methods and apparatus for providing security to a computerized device
CN106330925A (en) * 2016-08-26 2017-01-11 重庆蓝盾电子技术服务公司 Working method for controlling a vehicle management and check test system on cloud
EP3436988A1 (en) * 2016-03-31 2019-02-06 WiseTech Global Limited "methods and systems for database optimisation"
CN111026798A (en) * 2019-12-05 2020-04-17 苏州中车建设工程有限公司 Electromechanical equipment database system and control method thereof
CN111858657A (en) * 2020-07-21 2020-10-30 威讯柏睿数据科技(北京)有限公司 Method and equipment for accelerating data parallel query based on high-frequency data processing

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7367063B1 (en) * 2002-09-17 2008-04-29 Cisco Technology, Inc. Methods and apparatus for providing security to a computerized device
EP3436988A1 (en) * 2016-03-31 2019-02-06 WiseTech Global Limited "methods and systems for database optimisation"
CN106330925A (en) * 2016-08-26 2017-01-11 重庆蓝盾电子技术服务公司 Working method for controlling a vehicle management and check test system on cloud
CN111026798A (en) * 2019-12-05 2020-04-17 苏州中车建设工程有限公司 Electromechanical equipment database system and control method thereof
CN111858657A (en) * 2020-07-21 2020-10-30 威讯柏睿数据科技(北京)有限公司 Method and equipment for accelerating data parallel query based on high-frequency data processing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
An Index Structure for Similarity Join Based on High-Frequency Queries;Kamolwan Kunanusont;《2014 International Computer Science and Engineering Conference (ICSEC)》;20141206;全文 *

Also Published As

Publication number Publication date
CN113162916A (en) 2021-07-23

Similar Documents

Publication Publication Date Title
JP5785315B2 (en) Method, computer system and computer program for retrieving protected data
US20040139072A1 (en) System and method for locating similar records in a database
CN107181600B (en) Password login authentication method and system, user equipment and authentication server
WO2017035823A1 (en) Password generation with key and derivation parameter
US20130298223A1 (en) Methods and computing devices for password verification
WO1997024675A9 (en) Method and apparatus for controlling access to encrypted data files in a computer system
EP0976049A1 (en) Method and apparatus for controlling access to encrypted data files in a computer system
CN109598334B (en) Sample generation method and device
Kroll et al. Automated cryptanalysis of bloom filter encryptions of health records
CN108416229B (en) Data desensitization method for category information
CN106941400A (en) A kind of fuzzy safety box authentication method based on SRAM PUF
CA2006230C (en) Method and apparatus for validating character strings
CN113162916B (en) Working method for executing smart city operation instruction through big data platform
EP0450049B1 (en) Character encoding
CN113179246B (en) Working method for carrying out government affair data fusion safety through four-in-one network
US20150156209A1 (en) Process Using Universal Sanitization to Prevent Injection Attacks
CN113132354B (en) Working method for carrying out file processing optimization configuration by remotely logging in government affair data network
CN105593876B (en) Validation in serialized streams
CN113128504A (en) OCR recognition result error correction method and device based on verification rule
Chvátal Lecture notes on the new AKS sorting network
CN111342959A (en) Password security setting and identification method, system, equipment and storage medium
Gladkikh et al. Noiseless coding algorithm based on cognitive processing of biometric data in system of digital identification of passengers
CN107239693B (en) Analysis method and system based on password coding rule
AU5546500A (en) Data processors
CN106230593A (en) ID generates method and device

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