CN109614786A - A kind of anti-brush method of identifying code - Google Patents
A kind of anti-brush method of identifying code Download PDFInfo
- Publication number
- CN109614786A CN109614786A CN201811287805.3A CN201811287805A CN109614786A CN 109614786 A CN109614786 A CN 109614786A CN 201811287805 A CN201811287805 A CN 201811287805A CN 109614786 A CN109614786 A CN 109614786A
- Authority
- CN
- China
- Prior art keywords
- node
- pel
- picture
- value
- axis
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/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
Abstract
The present invention provides a kind of anti-brush methods of identifying code, it is related to Internet technical field, it include: that verifying picture and reference picture corresponding with the verifying picture are generated on the client end interface for need to input identifying code, the verifying picture and the reference picture respectively include multiple nodes and pel corresponding with each node, the each node and the pel of the verifying picture are laid out according to preset layout format, and each pel of the verifying picture is dynamic graphical component；The dynamic graphical component includes mutually converting between each pel of preset time of interval；It obtains in the picture track of the verifying picture, successively extracts each node in picture track, and according to the node extracted, generate node listing；When the node listing of generation is identical as the node listing in the reference picture, indicate that identifying code inputs successfully.The success rate that identifying code is cracked by software can be effectively reduced in the present invention, improve the safety of identifying code.
Description
Technical field
The present invention relates to Internet technical field more particularly to a kind of anti-brush methods of identifying code.
Background technique
With the development of computer technology and the continuous improvement of hacking technique, website and forum prevent from disliking by identifying code
Meaning decryption, application for registration, forum pour water.Picture validation code of the identifying code from pure Digital verification code to distortion is used
Family needs meeting information and completing manual keyboard input in naked eyes identification figure, carries out identifying code matching judgment by program.With
The development of the technologies such as OCR (Optical Character Recognition, optical character identification) and artificial intelligence, tradition
Identifying code be easy to be cracked.
Summary of the invention
The present invention provides a kind of anti-brush method of identifying code in view of the deficiencies of the prior art, and it is soft identifying code to be effectively reduced
The success rate that part cracks improves the safety of identifying code.
The present invention provides a kind of anti-brush methods of identifying code, comprising:
Verifying picture and corresponding with the verifying picture is generated on the client end interface for need to input identifying code
Reference picture, the verifying picture and the reference picture respectively include multiple nodes and corresponding with each node scheme
Member, each node and the pel of the verifying picture are laid out according to preset layout format, described
The each pel for verifying picture is dynamic graphical component；The dynamic graphical component includes phase interconversion between each pel of preset time of interval
It changes；Different coordinates can be corresponded to before and after each node transformation in the verifying picture, when mutually converting between each pel, respectively
The corresponding node of a pel remains unchanged；
According to putting in order for each pel in the reference picture, obtain in the picture track of the verifying picture,
Each node in picture track is successively extracted, and according to the node extracted, produces node listing；The picture track be
Node corresponding to the pel successively chosen in verifying picture is formed by track；
When the node listing of generation is identical as the node listing in the reference picture, indicate that identifying code inputs successfully.
Further, it is mutually converted between each pel of the interval preset time, comprising:
Node and coordinate value of each pel in layout format are obtained, is converted and is corresponded to according to preset mapping mode
Pel on coordinate, so that the node of each pel transformation front and back is constant.
Further, the preset mapping mode, comprising: by each pel in the verifying picture in coordinate X
The value in value and Y-axis on axis is exchanged.
Further, the preset mapping mode, comprising:
By the value Y in Y-axisnValue X on identical all pels and the corresponding current X-axis of nodenIt is obtained according to preset formula
Value X ' in new X-axisn, value X ' in the new X-axisnWith the value Y in the Y-axisnIt is transformed that combination forms corresponding pel
Coordinate value (X 'n、Yn)；Wherein,
When n, m are positive integer, and work as XnWhen+n≤m, X 'n=Xn+n；
When n, m are positive integer, and work as XnWhen+n > m, X 'n=Xn+n-m；
When n is negative integer, m is positive integer, and works as Xn| n | when≤0, X 'n=Xn-|n|+m；
When n is negative integer, m is positive integer, and works as Xn| n | when > 0, X 'n=Xn-|n|；
Wherein, m is the number of the value in the layout format in X-axis.
Further, the preset mapping mode, further includes:
By the value X in X-axisnValue Y on identical all pels and the corresponding current Y-axis of nodenIt is obtained according to preset formula
Value Y ' in new Y-axisn, value Y ' in the new X-axisnWith the value X in the X-axisnIt is transformed that combination forms corresponding pel
Coordinate value (Y 'n, Xn)；Wherein,
When n, m are positive integer, and work as YnWhen+n≤m, Y 'n=Yn+n；
When n, m are positive integer, and work as YnWhen+n > m, Y 'n=Yn+n-m；
When n is negative integer, m is positive integer, and works as Yn| n | when≤0, Y 'n=Yn-|n|+m；
When n is negative integer, m is positive integer, and works as Yn| n | when > 0, Y 'n=Yn-|n|；
Wherein, m is the number of the value in the layout format in Y-axis.
Further, the dynamic graphical component further includes showing pel in a manner of Dynamically Announce on present co-ordinate position.
Further, the verifying picture is the picture for supporting mouse and touch manner interaction.
Further, in the reference picture, at least one described pel is equipped with interference pixel.
Compared with prior art, the invention has the following advantages:
Identifying code of the invention from the time, position and in shape be disposed as dynamic, with identifying code in the prior art
It compares, identifying code of the invention has very high identification difficulty, can effectively prevent software automatic identification and cracks, improves identifying code
Security performance.
Detailed description of the invention
Fig. 1 is the implementation flow chart of verifying code imput method provided in an embodiment of the present invention；
Fig. 2 is the preferable sample figure of table-layout in practical applications provided in an embodiment of the present invention.
Fig. 3 is one of verifying picture sample figure provided in an embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
As shown in Figure 1-3, a kind of anti-brush method of identifying code, comprising:
Step S01, on the client end interface for need to input identifying code generate verifying picture and with the verifying picture
Corresponding reference picture, the verifying picture and the reference picture respectively include multiple nodes and with each node
Corresponding pel, each node and the pel of the verifying picture are carried out according to preset layout format
Each pel of layout, the verifying picture is dynamic graphical component；The dynamic graphical component includes the interval each pel of preset time
Between mutually convert；Different coordinates can be corresponded to before and after each node transformation in the verifying picture, when phase between each pel
Mutually when transformation, the corresponding node of each pel is remained unchanged.
Wherein, the layout format includes but is not limited to table-layout and circular layout, and table-layout can be the table of A*B
Lattice layout, wherein A is the integer greater than 1, and wherein B is the integer greater than 1.What the value of A and B can determine at random for system,
It can be fixed up by internal system.Preferably, the value of A and B is equal.In the present embodiment, by taking table-layout as an example, proof diagram
Piece is the layout format of an A*B, and wherein A is 3, B 3, forms the verifying picture an of nine grids.As shown in Figure 2.Table cloth
Each table in office corresponds to a unique node, each node can fill only one pel.Table-layout
In each pel between can mutually convert, when each pel mutually converts, the corresponding node of each pel is remained unchanged,
The coordinate of each pel transformation correspondence is different, i.e., each node in transformation front and back corresponds to different coordinates.
Step S02 obtains the picture in the verifying picture according to putting in order for each pel in the reference picture
Each node in picture track is successively extracted in figure track, and according to the node extracted, generates node listing；The picture
Track is that node corresponding to the picture successively chosen is formed by track in verifying picture.The node listing is according to mentioning
The node listing of the chronological order arrangement taken.
Step S03 indicates that identifying code is defeated when the node listing of generation is identical as the node listing in the reference picture
Enter success.Specifically, user can putting in order according to each pel in the reference picture, successively point be selected in the verifying
Several pels on picture, to obtain several nodes.All pels on several described pels and the reference picture
It corresponds.Then node listing is generated according to the chronological order that user clicks pel.Finally, by the node listing of generation
It is compared with the node listing in the reference picture, when two lists are identical, indicates that identifying code inputs successfully.
In step S01, mutually converted between each pel of the interval preset time, comprising:
Node and coordinate value of each pel in layout format are obtained, interval preset time is interior according to preset change
The pel in mode conversion respective coordinates is changed, so that the node of each pel transformation front and back remains unchanged.Wherein, the coordinate is
Two-dimensional rectangular coordinate system, including with the X-axis of horizontal direction parallel, the Y-axis vertical with the X-axis.The preset time can be with
It is set at random for system, or be manually set.
In example 1, the preset mapping mode, comprising: each pel in the verifying picture exists
The value in value and Y-axis in coordinate X-axis is exchanged.Specifically, the verifying picture is arranged in rectangular coordinate system first, so that
Each pel and node in verifying picture all have a unique coordinate value；Then it obtains all in the verifying picture
The present coordinate values of pel, such as: (X1, Y1), (X2, Y2) ... (Xn, Yn)；Then by X in the present coordinate values of each pel
The value in value and Y-axis on axis is respectively exchanged, and transformed new coordinate value is obtained, it may be assumed that (Y1, X1), (Y2, X2) ... (Yn,
Xn).Each pel and node will be verified according to new coordinate value auto-changing to corresponding coordinate position by using this kind of mode
The position of each pel and node in picture converts.In the process, the layout format for verifying picture is constant, Er Qiebu
Node corresponding to each pel transformation front and back remains unchanged in office's format.
In example 2, the preset mapping mode, comprising: the verifying picture is arranged at right angle first
In coordinate system, so that each pel and node in verifying picture all have a unique coordinate value；Then will have in Y-axis
Identical value YnThe corresponding current X-axis of all pels on value XnThe value X ' in new X-axis is obtained according to preset formulan, described
Value X ' in new X-axisnWith the value Y in the Y-axisnCombination forms the corresponding transformed new coordinate value (X ' of peln、Yn)；Its
In,
When n, m are positive integer, and work as XnWhen+n≤m, X 'n=Xn+n；
When n, m are positive integer, and work as XnWhen+n > m, X 'n=Xn+n-m；
When n is negative integer, m is positive integer, and works as Xn| n | when≤0, X 'n=Xn-|n|+m；
When n is negative integer, m is positive integer, and works as Xn| n | when > 0, X 'n=Xn-|n|；
Wherein, m is the number of the value in the layout format in X-axis.Wherein, n refers in linear transformation, each pel
N unit is differed between value and transformed value before transformation.For example, as shown in figure 3, in the table-layout of 4*4, m 4,
Before transformation: node a1Coordinate value be (Isosorbide-5-Nitrae), node a2Coordinate value be (2,4), node a3Coordinate value be (3,4), node
a4Coordinate value be (4,4).If n is set as -2, node a1, node a2, node a3, node a4Transformed new coordinate value difference
Are as follows: (3,4), (4,4), (1,4) (2,4).Then according to the new coordinate value, by node a1, node a2, node a3, node a4Become
It changes on corresponding coordinate position, obtains pel and the constant new verifying picture of node.
In the third embodiment, the preset mapping mode, further includes: the verifying picture is arranged straight first
In angular coordinate system, so that each pel and node in verifying picture all have a unique coordinate value；Then will have in X-axis
There is identical value XnAll pels and the corresponding current Y-axis of node on value YnThe value in new Y-axis is obtained according to preset formula
Y′n, value Y ' in the new X-axisnWith the value X in the X-axisnCombination forms the corresponding transformed new coordinate value (Y ' of peln,
Xn)；Wherein,
When n, m are positive integer, and work as YnWhen+n≤m, Y 'n=Yn+n；
When n, m are positive integer, and work as YnWhen+n > m, Y 'n=Yn+n-m；
When n is negative integer, m is positive integer, and works as Yn| n | when≤0, Y 'n=Yn-|n|+m；
When n is negative integer, m is positive integer, and works as Yn| n | when > 0, Y 'n=Yn-|n|；
Wherein, m is the number of the value in the layout format in X-axis.Wherein, n refers in linear transformation, each pel
N unit is differed between value and transformed value before transformation.Changing method in Y-axis is similar in a upper embodiment,
This is repeated no more.
Technical solution of the present invention is explained in detail in order to become apparent from, by taking embodiment two as an example, as shown in figure 3,4*4's
In table-layout, m 4, system selectes four pels at random and is combined into reference picture, four pels institute according to sequencing
Corresponding node is respectively as follows: node a1, node a2, node a3, node a4, while being given birth to automatically according to the sequencing of each node
At node listing L.At this point, node a1, node a2, node a3, node a4The corresponding initial coordinate values difference in rectangular coordinate system
Are as follows: (1,4), (2,4), (3,4), (4,4).User needs successively to choose node a in 16 pels of verifying picture1, node
a2, node a3, node a4Four corresponding pels, to obtain corresponding node listing L '.In the process, user is clicking
Coordinate value be respectively (Isosorbide-5-Nitrae), (2,4) pel when, system obtains node a corresponding to coordinate value (Isosorbide-5-Nitrae), (2,4) automatically1With
Node a2.Hereafter, preset time reach, under the transformation of preset mapping mode, each pel of proof diagram on piece and
Position of the node on coordinate system changes.Preferably, if n is set as 2, after above-mentioned formula converts: node a1It is new
Coordinate value is (3,4), node a2New coordinate value be (4,4), node a3New coordinate value be (Isosorbide-5-Nitrae), node a4New coordinate value
For (2,4).At this point, user goes to click new coordinate value to be respectively (Isosorbide-5-Nitrae), (2,4) according to other two pel in reference picture
When pel, system obtains node a corresponding to new coordinate value (Isosorbide-5-Nitrae), (2,4) automatically3With node a4.Then, the section that will acquire
Point a1, node a2, node a3With node a4Node listing L ' is generated according to the chronological order of acquisition.Finally by the section of generation
Point list L ' is compared with the node listing L selected in reference picture.Node listing L ' and node listing L in this embodiment
It is identical, it represents identifying code and inputs successfully.
Preferably, the dynamic graphical component further includes that each pel is shown in a manner of Dynamically Announce on present co-ordinate position
Pel.Dynamic display types between each pel can be identical, can not also be identical.The mode of the Dynamically Announce include but
Be not limited to: effect, the presentation effect of checkerboard type, the presentation effect for waving formula etc. is presented in the dynamic of shutter.
Preferably, the verifying picture is the picture for supporting mouse and touch manner interaction.The pel includes but unlimited
In: Chinese character, circle, triangle, trapezoidal, rectangle, prismatic etc., the embodiment of the present invention are preferably Chinese character.In the verifying picture
All Chinese characters can determine at random for system, and an a fairly large number of character set, Ge Getu can also be fixed by internal system
Member is randomly generated from the character set.
Preferably, in the reference picture, at least one described pel is equipped with interference pixel, and the present invention is preferably each
The interference pixel is equipped on a pel, to further increase the reliability of the reference picture, after further enhancing
The safety of continuous input identifying code.The interference pixel be arranged on pel, prevent take up node and coordinate, can be to user's shape
The some pixels interfered at vision.The interference pixel includes but is not limited to pattern, shape, color etc., and the present embodiment is preferably
Shape, such as horizontal line.
Identifying code of the invention from the time, position and in shape be disposed as dynamic, with identifying code in the prior art
It compares, identifying code of the invention has very high identification difficulty, can effectively prevent software automatic identification and cracks, improves identifying code
Security performance.
The above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to the foregoing embodiments
Invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each implementation
Technical solution documented by example is modified or equivalent replacement of some of the technical features；And these modification or
Replacement, the protection scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (8)
1. a kind of anti-brush method of identifying code characterized by comprising
Verifying picture and reference corresponding with the verifying picture are generated on the client end interface for need to input identifying code
Picture, the verifying picture and the reference picture respectively include multiple nodes and figure corresponding with each node
Member, each node and the pel of the verifying picture are laid out according to preset layout format, described
The each pel for verifying picture is dynamic graphical component；The dynamic graphical component includes phase interconversion between each pel of preset time of interval
It changes；Different coordinates can be corresponded to before and after each node transformation in the verifying picture, when mutually converting between each pel, respectively
The corresponding node of a pel remains unchanged；
According to putting in order for each pel in the reference picture, obtain in the picture track of the verifying picture, successively
Each node in picture track is extracted, and according to the node extracted, generates node listing；The picture track is to verify
Node corresponding to the pel successively chosen in picture is formed by track；
When the node listing of generation is identical as the node listing in the reference picture, indicate that identifying code inputs successfully.
2. a kind of anti-brush method of identifying code according to claim 1, which is characterized in that the interval preset time is each
It is mutually converted between pel, comprising:
Node and coordinate value of each pel in layout format are obtained, respective coordinates are converted according to preset mapping mode
On pel so that each pel transformation front and back node it is constant.
3. a kind of anti-brush method of identifying code according to claim 2, which is characterized in that the preset transformation side
Formula, comprising: exchange value of each pel in the verifying picture in the value and Y-axis in coordinate X-axis.
4. a kind of anti-brush method of identifying code according to claim 2, which is characterized in that the preset transformation side
Formula, comprising:
By the value Y in Y-axisnValue X on identical all pels and the corresponding current X-axis of nodenIt is obtained according to preset formula new
Value X ' in X-axisn, value X ' in the new X-axisnWith the value Y in the Y-axisnCombination forms the corresponding transformed coordinate of pel
It is worth (X 'n、Yn)；Wherein,
When n, m are positive integer, and work as XnWhen+n≤m, X 'n=Xn+n；
When n, m are positive integer, and work as XnWhen+n > m, X 'n=Xn+n-m；
When n is negative integer, m is positive integer, and works as Xn| n | when≤0, X 'n=Xn-|n|+m；
When n is negative integer, m is positive integer, and works as Xn| n | when > 0, X 'n=Xn-|n|；
Wherein, m is the number of the value in the layout format in X-axis.
5. a kind of anti-brush method of identifying code according to claim 2, which is characterized in that the preset transformation side
Formula, further includes:
By the value X in X-axisnValue Y on identical all pels and the corresponding current Y-axis of nodenIt is obtained according to preset formula new
Value Y ' in Y-axisn, value Y ' in the new X-axisnWith the value X in the X-axisnCombination forms the corresponding transformed coordinate of pel
It is worth (Y 'n, Xn)；Wherein,
When n, m are positive integer, and work as YnWhen+n≤m, Y 'n=Yn+n；
When n, m are positive integer, and work as YnWhen+n > m, Y 'n=Yn+n-m；
When n is negative integer, m is positive integer, and works as Yn| n | when≤0, Y 'n=Yn-|n|+m；
When n is negative integer, m is positive integer, and works as Yn| n | when > 0, Y 'n=Yn-|n|；
Wherein, m is the number of the value in the layout format in Y-axis.
6. a kind of anti-brush method of identifying code according to claim 2, which is characterized in that the dynamic graphical component further include
Pel is shown on present co-ordinate position in a manner of Dynamically Announce.
7. a kind of anti-brush method of identifying code according to claim 1, which is characterized in that the verifying picture is to support mouse
The picture of mark and touch manner interaction.
8. a kind of anti-brush method of identifying code according to claim 1-7, which is characterized in that described referring to figure
In piece, at least one described pel is equipped with interference pixel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811287805.3A CN109614786A (en) | 2018-10-31 | 2018-10-31 | A kind of anti-brush method of identifying code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811287805.3A CN109614786A (en) | 2018-10-31 | 2018-10-31 | A kind of anti-brush method of identifying code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109614786A true CN109614786A (en) | 2019-04-12 |
Family
ID=66002059
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811287805.3A Pending CN109614786A (en) | 2018-10-31 | 2018-10-31 | A kind of anti-brush method of identifying code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109614786A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103488934A (en) * | 2013-09-24 | 2014-01-01 | 刘雪英 | Method, device and system for inputting verification codes |
| CN104660549A (en) * | 2013-11-19 | 2015-05-27 | 深圳市腾讯计算机系统有限公司 | Identity verification method and device |
-
2018
- 2018-10-31 CN CN201811287805.3A patent/CN109614786A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103488934A (en) * | 2013-09-24 | 2014-01-01 | 刘雪英 | Method, device and system for inputting verification codes |
| CN104660549A (en) * | 2013-11-19 | 2015-05-27 | 深圳市腾讯计算机系统有限公司 | Identity verification method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108389257B (en) | Generating a three-dimensional model from a scanned object | |
| CN101197678B (en) | Picture identifying code generation method and generation device | |
| TW201123083A (en) | Method and system for providing augmented reality based on marker tracing, and computer program product thereof | |
| WO2018032947A1 (en) | Method for realizing three-dimensional model authentication code and device thereof | |
| CN102622593B (en) | Text recognition method and system | |
| CN111223053A (en) | Data enhancement method based on depth image | |
| CN103729610B (en) | Two-dimension code focusing displaying method and system | |
| TWI738717B (en) | Verification processing method and device based on verification code | |
| CN101201939B (en) | Method and system for generating picture identifying code | |
| CN101739720A (en) | Method and device for generating three-dimensional dynamic verification code | |
| KR101759188B1 (en) | the automatic 3D modeliing method using 2D facial image | |
| KR101829733B1 (en) | Conversion Method For A 2D Image to 3D Graphic Models | |
| CN104580883B (en) | Image processing apparatus, image processing method and recording medium | |
| KR20170064026A (en) | The way of a smart education services for 3D astronomical educational services, using virtual reality, augmented reality-based immersive interface | |
| CN102426509A (en) | Method, device and system for displaying hand input | |
| CN102760308A (en) | Method and device for node selection of object in three-dimensional virtual reality scene | |
| CN106971370B (en) | System and method for taking picture as background picture plane vector diagram | |
| CN107203961B (en) | Expression migration method and electronic equipment | |
| JP2023541351A (en) | Character erasure model training method and device, translation display method and device, electronic device, storage medium, and computer program | |
| JP2023109570A (en) | Information processing device, learning device, image recognition device, information processing method, learning method, and image recognition method | |
| CN102148686B (en) | Character deformation-based graphical password authentication method | |
| CN109614786A (en) | A kind of anti-brush method of identifying code | |
| CN111464512A (en) | Mobile phone token MFA scheme based on visual password | |
| CN113298687B (en) | Watermark image adding method and device | |
| CN101853385A (en) | Method for extracting central colored fringe from De Bruijn colored structural light image |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190412 |
|
| RJ01 | Rejection of invention patent application after publication |