CN112948799B - Verification method of graphic verification code and related device thereof - Google Patents
Verification method of graphic verification code and related device thereof Download PDFInfo
- Publication number
- CN112948799B CN112948799B CN202110120379.XA CN202110120379A CN112948799B CN 112948799 B CN112948799 B CN 112948799B CN 202110120379 A CN202110120379 A CN 202110120379A CN 112948799 B CN112948799 B CN 112948799B
- Authority
- CN
- China
- Prior art keywords
- transformation
- graph
- graphic
- checked
- verification
- 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
Links
- 238000012795 verification Methods 0.000 title claims abstract description 104
- 238000000034 method Methods 0.000 title claims abstract description 58
- 230000009466 transformation Effects 0.000 claims abstract description 144
- 238000010586 diagram Methods 0.000 claims description 14
- 238000012545 processing Methods 0.000 abstract description 12
- 238000005336 cracking Methods 0.000 abstract description 6
- 238000000844 transformation Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 230000001131 transforming effect Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000004590 computer program Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003973 irrigation Methods 0.000 description 1
- 230000002262 irrigation Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000007639 printing Methods 0.000 description 1
- 210000002268 wool Anatomy 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/31—User authentication
- G06F21/36—User authentication by graphic or iconic representation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2133—Verifying human interaction, e.g., Captcha
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
The application discloses a verification method of a graphic verification code, namely a related device thereof, wherein the verification method comprises the following steps: performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation; processing the operation code to obtain an operation bit; sending the graph to be checked and the operation bit to the terminal, and receiving an operation code corresponding to the current operation bit returned by the terminal; verifying whether the operation code is identical to the operation code recorded when the graphic transformation is performed for the first time. By the method, the graph to be checked and the operation code are verified, so that the cracking difficulty and the cost are increased, and the verification safety is improved.
Description
Technical Field
The invention relates to the technical field of verification code verification, in particular to a verification method of a graphic verification code and a related device thereof.
Background
The verification code (CAPTCHA) is an abbreviation of Completely Automated Public Turing test to tell Computers and Humans Apart (full-automatic computer and human figure test) and is a common man-machine identification means, which can prevent malicious registration and login, library collision, wool pulling, irrigation and the like.
In the age of rapid network development, the verification code is becoming more and more common and important as a first threshold for defending a server, and also becomes a first gateway which a hacker must attack. The most common verification codes on the market include: character graphic verification codes, slider verification codes, short message verification codes, voice verification codes, and the like. The short message and voice verification codes need to be intervened by a third-party operator, the cracking difficulty is relatively high, but the cost is relatively high, so that the graph and slider verification codes with low cost become the primary choice of many scenes. Meanwhile, along with the rapid development of the technologies such as computer computing power, machine learning and the like, the breaking cost of the verification codes such as graphics and sliding blocks is gradually reduced, and the simple verification codes on the market gradually lose their value.
Disclosure of Invention
The technical problem that this application mainly solves is to provide a verification method and its relevant device of figure verification code to increase the difficulty and the cost of cracking, improve verification security.
In order to solve the technical problem, a first technical scheme adopted by the application is to provide a verification method of a graphic verification code, which comprises the following steps: performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation; processing the operation code to obtain an operation bit; sending the graph to be checked and the operation bit to the terminal, and receiving an operation code corresponding to the current operation bit returned by the terminal; verifying whether the operation code is identical to the operation code recorded when the graphic transformation is performed for the first time.
Wherein, the step of processing the operation code to obtain the operation bit further comprises: performing graphic transformation for a second set number of times on the graphic to be checked, and sequentially recording operation codes corresponding to each graphic transformation; combining operation codes corresponding to each graphic transformation to obtain operation bits; wherein each graphical transformation comprises a first set number of graphical transformations and a second set number of graphical transformations.
Wherein, the step of processing the operation code to obtain the operation bit comprises the following steps: sequencing the operation codes to obtain operation bits; wherein the operation bits include a graphics transformation corresponding to the operation code.
In order to solve the technical problem, a second technical scheme adopted in the application is to provide a verification method of a graphic verification code, which comprises the following steps: obtaining a graph to be verified and an operation bit, wherein the graph to be verified is obtained by transforming an initial graph, and the operation bit comprises an operation code corresponding to graph transformation of the graph to be verified; acquiring the operation of a user on the operation bit, and transmitting an operation code corresponding to the operation bit to a server for verification; and receiving a graphic verification success prompt returned by the server.
The step of obtaining the operation of the user on the operation bit and sending the current graphic transformation code of the operation bit to the server for graphic verification comprises the following steps: acquiring position information of a mobile operation bit of a user, and arranging a graph to be verified according to the position information of the operation bit; recording an operation code corresponding to the position information of the operation bit, and sending the operation code corresponding to the current position information of the operation bit to a server for verification.
In order to solve the technical problem, a third technical scheme adopted in the application is to provide a verification method of a graphic verification code, which comprises the following steps: performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation; processing the operation code to obtain an operation bit; displaying the graph to be checked and the operation position; acquiring the operation of a user on an operation bit, and verifying an operation code corresponding to the operation bit; verifying whether the operation code is identical to the operation code recorded when the graphic transformation is performed for the first time.
In order to solve the above technical problem, a fourth technical solution adopted in the present application is to provide a graphic verification apparatus, the graphic verification apparatus includes: the image transformation module is used for carrying out image transformation on the initial image for a first set number of times to obtain an image to be checked; the operation bit generation module is used for recording operation codes corresponding to each graphic transformation and processing the operation codes to obtain operation bits; and the verification module is used for acquiring the operation code corresponding to the current operation bit and verifying whether the operation code is consistent with the operation code recorded by the first graphic transformation.
Wherein the graphic verification apparatus includes: and the display module is used for displaying the graph to be verified and the operation position.
The graphic transformation module is also used for performing graphic transformation on the graphic to be verified for a second set number of times.
In order to solve the above technical problems, a fifth technical solution adopted in the present application is to provide an intelligent terminal, where the intelligent terminal includes a memory and a processor, the memory is used to store program instructions, and the processor is used to execute the program instructions to implement the method for verifying the graphic verification code in any one of the method embodiments.
The beneficial effects of this application are: performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation; processing the operation code to obtain an operation bit; sending the graph to be checked and the operation bit to the terminal, and receiving an operation code corresponding to the current operation bit returned by the terminal; and verifying whether the operation code is consistent with the operation code recorded when the graphic transformation is performed for the first time, so that the cracking difficulty and the cost are increased, and the verification safety is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow chart of a first embodiment of a method for verifying a graphic verification code according to the present application;
FIG. 2 is a schematic diagram of the initial numbering structure of the initial graph of the present application;
FIG. 3 is a diagram of the structure of the figure numbers after the first transformation of the initial figure;
FIG. 4 is a diagram of the structure of the figure numbers after the second transformation of the initial figure;
FIG. 5 is a diagram of the structure of the figure number after the third transformation of the initial figure;
FIG. 6 is a flowchart of a second implementation method of the verification method of the graphic verification code of the present application;
FIG. 7 is a flowchart of a third implementation method of the verification method of the graphic verification code of the present application;
FIG. 8 is a schematic diagram of an embodiment of a graphical verification apparatus of the present application;
fig. 9 is a schematic structural diagram of an embodiment of the smart terminal of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The terminology used in the embodiments of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in this application and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise, the "plurality" generally includes at least two, but does not exclude the case of at least one.
It should be understood that the term "and/or" as used herein is merely one relationship describing the association of the associated objects, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
It should be understood that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
Referring to fig. 1, fig. 1 is a flowchart of a first embodiment of a verification method for a graphic verification code according to the present application. As shown in fig. 1, the verification method of the graphic verification code includes:
step S11: and carrying out graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation.
In this step, before the first set number of image transformations is performed on the initial image, selecting a picture from the database or the image library, and splitting the selected image into a plurality of small pictures, for example, m×n small pictures, to obtain the initial image. The initial pattern is a pattern composed of m×n pictures.
The step is completed by the server, specifically, the server randomly generates a number A, performs random transformation operation on the initial graph for A times to obtain a graph to be verified, and sequentially records operation codes of random transformation operation each time, specifically, A-1, … and 1.
Step S12: and processing the operation code to obtain the operation bit.
The method also comprises the following steps before the step: and performing graphic transformation for the second set times on the graphics to be verified, and sequentially recording operation codes corresponding to each graphic transformation. Specifically, the graph to be verified is subjected to K-A random transformation operation, and the operation codes are recorded as A+1, A+2, … and K in sequence.
In another embodiment, after obtaining the graph to be verified, performing a second set number of graph transformations on the initial graph, and sequentially recording operation codes corresponding to each graph transformation.
And arranging and combining the operation codes corresponding to the graphic conversion of the first set times and the operation codes corresponding to the graphic conversion of the second set times to obtain operation bits. Specifically, the reverse order of the operation codes corresponding to the first-set number of graphic transformations is aligned and combined with the positive order of the operation codes corresponding to the second-set number of graphic transformations. Specifically, operation bits with operation codes of 1, …, A, … and K are obtained. In this embodiment, the operation bit is a slidable progress bar or a clickable operation key, which is not limited herein. And the graphics to be checked can be changed into normal graphics or initial graphics by sequentially operating the operation bits.
In the present embodiment, the first setting times and the second setting times are positive integers, and the first setting times and the second setting times may be the same or different, and are not limited herein. After the graph is transformed for the second set times, the initial graph (normal graph) is transformed into the non-initial graph (abnormal graph), so that the graph is firstly transformed from the graph to be verified into the initial graph and then is transformed into the abnormal graph in the transformation process of the graph from 1 to K, the graph to be verified is transformed into the initial graph in the process of operating the operation position, and the graph to be verified is transformed into the initial graph when the operation position is not dragged to the end position, and the reliability of decoding is improved.
Step S13: and sending the graph to be checked and the operation bit to the terminal, and receiving the operation code corresponding to the current operation bit returned by the terminal.
In this step, the user performs the graphic transformation on the graphic to be verified by moving or clicking the operation bit displayed by the terminal, specifically, the operation bit includes the operation code of the graphic transformation, the graphic is transformed by clicking the operation code included in the operation bit in turn, and the graphic to be verified sequentially performs the transformation of the set order on the graphic according to the operation code corresponding to the operation bit.
And obtaining an operation code corresponding to the current graphic transformation until the graphic to be verified is transformed into a normal graphic or an initial graphic, and sending the operation code to a server for verification.
Step S14: verifying whether the operation code is identical to the operation code recorded when the graphic transformation is performed for the first time.
If the operation code corresponding to the current operation bit is consistent with the operation code recorded in the first graphic transformation, the verification is successful, and an authentication success interface is entered; if the operation code corresponding to the current operation bit is inconsistent with the operation code recorded in the first graphic transformation, the verification fails and the user continues to stay on the interface to be verified of the current graphic.
To more clearly illustrate the graphics transformation operation in steps S11-S13, please further refer to fig. 2-5, assuming that the selected initial graphics include 2×3=6 pictures; the initial pattern is subjected to 5 pattern transformations. The specific implementation steps are as follows:
the first step is to randomly select an initial pattern, split the initial pattern into 6 small pictures and number the small pictures, in this embodiment, the number can be shown in fig. 2, and fig. 2 is a schematic diagram of an initial number structure of the initial pattern in the application.
And secondly, randomly generating a number A=3, sequentially performing 3 times of graph transformation operation on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation.
Specifically, for example, when the operation code is a: 1 and 3, please refer to fig. 3, fig. 3 is a schematic diagram of a graphic numbering structure after the initial graphic is subjected to the first graphic transformation. When the operation code is b: 4 and 5, please refer to fig. 4, fig. 4 is a schematic diagram of the graphic numbering structure after the initial graphic is subjected to the second graphic transformation. When the operation code is c: 2 and 5, please refer to fig. 5, fig. 5 is a schematic diagram of the figure numbering structure after the initial figure is subjected to the third figure transformation.
Thirdly, continuing to perform 2 random transformation operations on the graph, wherein the random transformation operations are respectively 'operation codes d': 3 and 6, and "sum" operation code e:2 and 4, see in particular the transformation process shown in fig. 2-5, which is not further illustrated here.
And fourthly, sequencing the operation codes corresponding to the second step of graphic transformation and the operation codes corresponding to the third step of graphic transformation to obtain operation bits with the sequence codes of c, b, a, d, e.
And fifthly, sending the graph to be checked and the operation bit to a terminal and displaying, wherein in the embodiment, the display result is shown in fig. 5.
In this embodiment, the decoding process includes: the user sequentially slides the operation bits or sequentially clicks the operation bits containing the operation codes to perform graphic transformation on the graphic displayed by the terminal until the graphic is changed into a normal graphic or an initial graphic, and sends the operation codes corresponding to the current operation bits to the server for verification, wherein the operation bits comprise the operation codes, and the graphic transformation corresponding to the current operation codes can be performed on the graphic by moving the operation bits. Specifically, the figure number obtained after the figure transformation with the operation code of c is shown as 4, the figure number obtained after the figure transformation with the operation code of b is shown as 3, the figure number obtained after the figure transformation with the operation code of a is shown as 2, namely, an initial figure is obtained, and the operation code a corresponding to the current figure transformation is sent to a server for verification.
If the operation code corresponding to the current graphic transformation is not a, the verification fails, and the operation code can be retransmitted for verification.
The beneficial effects of this embodiment are: and carrying out graphic transformation on the initial graphic to obtain a random graphic to be verified, carrying out graphic transformation operation on the graphic to be verified, recording an operation code corresponding to the graphic transformation, verifying the operation code after the graphic transformation, if the operation code to be verified is consistent with the operation code recorded when the graphic transformation is carried out for the first time, successfully verifying, otherwise, failing to verify. By verifying the operation code, the cracking difficulty and the cost are increased, and the verification safety is improved. In this embodiment, the machine obtains the initial pattern through image recognition and cannot obtain the operation code corresponding to the first pattern transformation, so that the security of verification is improved.
The present application further provides a flow chart of a second embodiment of the method for verifying a graphic verification code, as shown in fig. 6, and fig. 6 is a flow chart of a second embodiment of the method for verifying a graphic verification code of the present application. The execution main body of the verification method is used for the user terminal, and the verification method of the graphic verification code comprises the following steps:
step S21: and obtaining the graph to be verified and the operation bit.
The graphics to be verified are obtained by performing graphics transformation on the initial graphics, which may be random graphics transformation or graphics transformation according to a set sequence in this embodiment, and are not limited herein. And the operation bit is used for carrying out operation coding corresponding to graphic transformation on the graphic to be verified.
In particular, the operation bits may encode operations that transform the graphic to be verified into the original graphic.
Specifically, the method for obtaining the operation bit is described with reference to the first embodiment. And sequentially recording operation codes corresponding to each graphic transformation, and arranging and combining the operation codes to obtain operation bits, wherein the operation bits comprise the operation codes corresponding to the graphic transformation. In this embodiment, the user obtains the operation code corresponding to the current operation bit by moving the operation bit, and performs graphics transformation on the currently displayed graphics according to the operation code corresponding to the current operation bit. In another embodiment, the user clicks the operation code corresponding to the operation bit, and performs graphics transformation on the graphics to be verified according to the current operation code, which is not limited herein.
In this embodiment, the operation bit is operated, and the graph to be verified is subjected to graph transformation according to the operation until the graph to be verified is changed into a normal graph or into an initial graph. Specifically, the graphic transformation is performed according to the operation code corresponding to the current operation bit.
Step S22: and acquiring the operation of the user on the operation bit, and transmitting the operation code corresponding to the operation bit to the server for verification.
Specifically, position information of a mobile operation bit of a user is obtained, a graph to be verified is arranged according to the position information of the operation bit, an operation code corresponding to a position where the current operation bit stops is sent to a server until the graph to be verified is converted into a normal graph, and the operation code corresponding to the graph to be verified of the current terminal is verified through the server. If the transmitted operation code is consistent with the operation code when the initial graph is subjected to graph transformation for the first time, the verification is successful, and if the transmitted operation code is inconsistent with the operation code when the initial graph is subjected to graph transformation for the first time, the verification is failed. Wherein, the operation code generated when the initial pattern is subjected to the first pattern transformation in the present embodiment is random, specifically, the operation code is randomly generated and recorded.
Step S23: and receiving a graphic verification success prompt returned by the server.
The method also comprises the step of receiving a prompt of failed graphic verification returned by the server. Specifically, after receiving a graphic verification success prompt returned by the server, entering a graphic verification success interface; if the verification fails, receiving an image verification failure prompt returned by the server, and continuously staying on the current interface to be verified.
The beneficial effects of this embodiment are: the method comprises the steps of performing graph transformation on a graph to be verified until the graph to be verified becomes an initial graph, obtaining an operation code corresponding to the initial graph, and sending the operation code to a server for verification, wherein in the embodiment, the server stores the operation code corresponding to the first graph transformation of the graph to be verified, and judging whether the current graph transformation accords with an operation specification and becomes the initial graph or not by judging whether the operation code is consistent with the operation code corresponding to the first graph transformation or not through verifying whether the operation code is consistent with the operation code corresponding to the first graph transformation or not, so that whether verification is successful or not is judged. The verification method in the embodiment increases the cracking difficulty and the cost and improves the verification safety.
In this application, the generation process and the decoding process of the graphic verification code may also be completed by an intelligent terminal, and specifically, the application further discloses a flow chart of a third embodiment of the verification method of the graphic verification code, as shown in fig. 7, and fig. 7 is a flow chart of a third embodiment of the verification method of the graphic verification code of the application. The verification method of the graphic verification code comprises the following steps:
step S31: and carrying out graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation.
Specifically, a picture is randomly selected and divided into a plurality of small pictures to obtain an initial graph. In this embodiment, the initial pattern may be any picture, such as a rectangle, a circle, a trapezoid, an ellipse, a triangle, etc., which is not limited herein, and the randomly divided small pictures have the same or different shapes and sizes, which is also not limited herein.
The method also comprises the steps of randomly generating a first set number of times, carrying out graph transformation on the initial graph for the first set number of times, checking the graph to be checked, and recording operation codes corresponding to each graph transformation.
Step S32: and processing the operation code to obtain the operation bit.
Specifically, each operation code generated by performing the graphic transformation for the first set number of times is reversely sequenced to obtain operation bits. In this embodiment, by moving the operation bits, the graphics transformation corresponding to the operation code is sequentially performed on the graphics to be verified, where the operation code is the operation code corresponding to the current operation bit.
The method further comprises the following steps: and randomly generating a second set number of times, carrying out graphic transformation of the initial graphic or the graphic to be verified for the second set number of times, and recording operation codes corresponding to each graphic transformation. And sequencing the operation codes generated by the graphic transformation of the first set times and the operation codes generated by the graphic transformation of the second set times to generate operation bits. Specifically, the operation codes generated by the first set times of graphic transformation are reversely arranged and combined with the operation codes generated by the second set times of graphic transformation arranged in positive sequence to obtain operation bits. In this embodiment, the operation transformation is performed on the graphics for the second set number of times, so that when the user moves the operation bit, and when the graphics are sequentially subjected to the operation transformation according to the operation code corresponding to the operation bit, the graphics to be verified are converted into the initial graphics and then into the random graphics, thereby improving the security of the operation code verification.
Step S33: and displaying the graph to be checked and the operation position.
In this embodiment, the graphics to be verified is transformed by moving the operation bit until the graphics are transformed into the normal graphics, so that the user can determine whether the graphics to be verified are changed into the normal graphics according to the displayed graphics, and when the graphics to be verified are transformed into the normal graphics, the transformation operation for continuing to transform the graphics to be verified is stopped.
Step S34: and acquiring the operation of the user on the operation bit, and verifying the operation code corresponding to the operation bit.
And transforming the graphics to be checked sequentially according to the sequence of the operation codes by moving operation of the operation bits by a user, wherein the operation bits comprise the sequence of the operation codes in the embodiment. And acquiring the position information of the mobile operation position of the user, transforming the graph, and displaying the transformed graph. And acquiring an operation code corresponding to the position of the current operation bit, and verifying the operation code of the current operation bit.
Step S35: verifying whether the operation code is identical to the operation code recorded when the graphic transformation is performed for the first time.
If the obtained operation code is consistent with the operation code recorded when the graphic transformation is performed for the first time, the verification is successful, and an interface of the verification success is entered; if the obtained operation code is inconsistent with the operation code recorded when the graphic transformation is performed for the first time, the verification fails, and the operation code is continued to stay on the interface to be verified of the graphic.
The present application further provides a graphic verification apparatus, as shown in fig. 8, and fig. 8 is a schematic structural diagram of an embodiment of the graphic verification apparatus 80 of the present application. The graphic verification apparatus 80 includes: the graphic transformation module 81 is used for performing graphic transformation for a first set number of times on the initial graphic to obtain a graphic to be checked; an operation bit generation module 82, configured to record an operation code corresponding to each graphic transformation, and process the operation code to obtain an operation bit; and the verification module 83 is configured to obtain an operation code corresponding to the current operation bit, and verify whether the operation code is consistent with the operation code recorded when the graphic transformation is performed for the first time. In this embodiment, the graphics transformation module 81 is further configured to perform graphics transformation of a second set number of times on the graphics to be checked, and the operation bit generation module 82 is further configured to combine the operation code generated by the graphics transformation of the first set number of times with the operation code generated by the graphics transformation of the second set number of times to generate the operation bit. In this embodiment, the graphic verification device 80 further includes a display device for displaying the graphic to be verified and the operation bit, and the display device is further configured to obtain the operation of the operation bit by the user and display the transformed graphic according to the operation of the operation bit.
Referring to fig. 9, fig. 9 is a schematic structural diagram of an embodiment of the intelligent terminal 90, as shown in fig. 9, the intelligent terminal 90 includes a memory 92 and a processor 91, the memory 92 is used for storing computer program instructions, and the processor 91 is used for executing the program instructions to implement a verification method of the graphic verification code in the above method embodiment. The intelligent terminal 90 may further include a touch screen, a printing component, a communication circuit, etc. in addition to the above-mentioned processor 91 and memory 92, according to requirements, and is not limited herein.
In particular, the processor 91 is configured to control itself and the memory 92 to implement the steps of any of the consumer 300 file sharing method embodiments described above. The processor 91 may also be referred to as a CPU (Central Processing Unit ). The processor 91 may be an integrated circuit chip with signal processing capabilities. The processor 91 may also be a general purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a Field programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. In addition, the processor 91 may be commonly implemented by a plurality of integrated circuit chips.
In particular, the integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application, or a part or all of the technical solution contributing to the prior art, may be embodied in the form of a software product stored in a computer-readable storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of the embodiments of the present application. And the computer-readable storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
In the several embodiments provided in the present application, it should be understood that the disclosed methods and apparatus may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of modules or units is merely a logical functional division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical, or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all or part of the technical solution contributing to the prior art or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods of the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing description is only of embodiments of the present application, and is not intended to limit the scope of the patent application, and all equivalent structures or equivalent processes using the descriptions and the contents of the present application or other related technical fields are included in the scope of the patent application.
Claims (5)
1. A method for verifying a graphical verification code, the method comprising:
performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation;
performing graphic transformation for a second set number of times on the graphic to be checked, and sequentially recording operation codes corresponding to each graphic transformation;
arranging and combining the reverse sequence of the operation codes corresponding to each graphic transformation of the first set times and the positive sequence of the operation codes corresponding to each graphic transformation of the second set times to obtain operation bits;
sending the graph to be checked and the operation bit to a terminal, and receiving an operation code corresponding to the current operation bit returned by the terminal; the operation codes corresponding to the current operation bits comprise operation codes corresponding to the operation bits when a user operates the operation bits on the terminal until the diagram to be checked is changed into the initial diagram;
and verifying whether the operation code corresponding to the current operation bit is consistent with the operation code recorded when the graphic transformation is performed for the first time.
2. A method for verifying a graphical verification code, the method comprising:
performing graph transformation for a first set number of times on the initial graph to obtain a graph to be checked, and sequentially recording operation codes corresponding to each graph transformation;
performing graphic transformation for a second set number of times on the graphic to be checked, and sequentially recording operation codes corresponding to each graphic transformation;
arranging and combining the reverse sequence of the operation codes corresponding to each graphic transformation of the first set times and the positive sequence of the operation codes corresponding to each graphic transformation of the second set times to obtain operation bits;
displaying the graph to be checked and the operation position;
obtaining the operation of a user on the operation position, and carrying out graphic transformation on the graph to be checked according to the operation until the graph to be checked is changed into the initial graph, so as to obtain an operation code corresponding to the current operation position;
and verifying whether the operation code corresponding to the current operation bit is consistent with the operation code recorded when the graphic transformation is performed for the first time.
3. A graphic verification apparatus, characterized in that the graphic verification apparatus comprises:
the image transformation module is used for carrying out image transformation on the initial image for a first set number of times to obtain an image to be checked; the graphic transformation module is also used for carrying out graphic transformation for the graphic to be checked for a second set number of times;
the operation bit generation module is used for recording operation codes corresponding to each graphic transformation of the first set times and operation codes corresponding to each graphic transformation of the second set times, and arranging and combining the reverse order of the operation codes corresponding to the image transformation of the first set times and the positive order of the operation codes corresponding to the graphic transformation of the second set times to obtain operation bits;
and the verification module is used for acquiring the operation of a user on the operation bit, carrying out graph transformation on the graph to be verified according to the operation until the graph to be verified is transformed into the initial graph, obtaining an operation code corresponding to the current operation bit, and verifying whether the operation code corresponding to the current operation bit is consistent with the operation code recorded by graph transformation for the first time.
4. A graphical verification apparatus as claimed in claim 3, wherein said graphical verification apparatus further comprises:
and the display module is used for displaying the graph to be checked and the operation position.
5. A smart terminal, characterized in that it comprises a memory for storing program instructions and a processor for executing the program instructions to implement the method of verifying a graphical passcode according to claim 1 or 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110120379.XA CN112948799B (en) | 2021-01-28 | 2021-01-28 | Verification method of graphic verification code and related device thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110120379.XA CN112948799B (en) | 2021-01-28 | 2021-01-28 | Verification method of graphic verification code and related device thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112948799A CN112948799A (en) | 2021-06-11 |
| CN112948799B true CN112948799B (en) | 2024-02-27 |
Family
ID=76238868
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110120379.XA Active CN112948799B (en) | 2021-01-28 | 2021-01-28 | Verification method of graphic verification code and related device thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112948799B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104104514A (en) * | 2014-07-25 | 2014-10-15 | 小米科技有限责任公司 | Method and device for identifying by using verification code |
| CN104580104A (en) * | 2013-10-24 | 2015-04-29 | 深圳市腾讯计算机系统有限公司 | Method, device and system for identity verification |
| CN107563181A (en) * | 2017-10-24 | 2018-01-09 | 百望电子发票数据服务有限公司 | A kind of verification method and system for clicking graphical verification code |
| CN108460268A (en) * | 2017-02-20 | 2018-08-28 | 阿里巴巴集团控股有限公司 | Verification method and device |
| CN110298164A (en) * | 2019-07-03 | 2019-10-01 | 中国工商银行股份有限公司 | Identifying code processing method and processing device |
| CN111447207A (en) * | 2020-03-24 | 2020-07-24 | 咪咕文化科技有限公司 | Verification code verification method, electronic device and storage medium |
-
2021
- 2021-01-28 CN CN202110120379.XA patent/CN112948799B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580104A (en) * | 2013-10-24 | 2015-04-29 | 深圳市腾讯计算机系统有限公司 | Method, device and system for identity verification |
| CN104104514A (en) * | 2014-07-25 | 2014-10-15 | 小米科技有限责任公司 | Method and device for identifying by using verification code |
| CN108460268A (en) * | 2017-02-20 | 2018-08-28 | 阿里巴巴集团控股有限公司 | Verification method and device |
| CN107563181A (en) * | 2017-10-24 | 2018-01-09 | 百望电子发票数据服务有限公司 | A kind of verification method and system for clicking graphical verification code |
| CN110298164A (en) * | 2019-07-03 | 2019-10-01 | 中国工商银行股份有限公司 | Identifying code processing method and processing device |
| CN111447207A (en) * | 2020-03-24 | 2020-07-24 | 咪咕文化科技有限公司 | Verification code verification method, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112948799A (en) | 2021-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9690923B2 (en) | Method, apparatus and system for verifying terminal | |
| CA2753694C (en) | System and methods for automatically accessing a web site on behalf of a client | |
| CN108650226B (en) | A kind of login validation method, device, terminal device and storage medium | |
| US9009814B1 (en) | Systems and methods for generating secure passwords | |
| TWI787211B (en) | Verification method and device | |
| US10448247B2 (en) | Method and apparatus for information verification | |
| EP3140978A1 (en) | Method and system for generating verification codes | |
| CN110224811B (en) | Internet of things encryption processing method, device and system | |
| CN114266033A (en) | Verification code generation method and device, verification code login system and electronic equipment | |
| CN105245489A (en) | Verification method and verification device | |
| CN110457916B (en) | Electronic contract encryption method and device and terminal equipment | |
| CN109166199B (en) | Password generation method, device and equipment | |
| CN107948177B (en) | Method and device for generating verification questionnaire | |
| CN112948799B (en) | Verification method of graphic verification code and related device thereof | |
| CN107231330B (en) | Password determination and login verification method and device | |
| CN111753280A (en) | Verification code verification method and device and electronic equipment | |
| CN111859322A (en) | Identity verification method and device and electronic equipment | |
| CN110414243B (en) | Two-dimensional code encryption method and device and two-dimensional code decryption method and device | |
| CN113158167B (en) | Verification code implementation method, electronic equipment and computer readable storage medium | |
| CN110730152A (en) | Login verification method and device and electronic equipment | |
| CN116707844A (en) | Behavior tracking method and device based on public account number, electronic equipment and medium | |
| CN109347640B (en) | Data processing method and terminal based on block chain dynamic intelligent contract | |
| CN113422687A (en) | Verification method, verification server and verification system | |
| CN108959901B (en) | Verification code prompting method based on picture carousel | |
| CN112199482A (en) | Dialog generation method, device, equipment and readable storage medium |
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 |