CN114640446A - Password peep-proof method and device - Google Patents
Password peep-proof method and device Download PDFInfo
- Publication number
- CN114640446A CN114640446A CN202210300739.9A CN202210300739A CN114640446A CN 114640446 A CN114640446 A CN 114640446A CN 202210300739 A CN202210300739 A CN 202210300739A CN 114640446 A CN114640446 A CN 114640446A
- Authority
- CN
- China
- Prior art keywords
- password
- characters
- character
- random
- peeping
- 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
- 238000000034 method Methods 0.000 title claims abstract description 36
- 208000008918 voyeurism Diseases 0.000 claims abstract description 69
- 230000002265 prevention Effects 0.000 claims abstract description 16
- 244000144985 peep Species 0.000 claims abstract description 9
- 238000004590 computer program Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0877—Generation of secret information including derivation or calculation of cryptographic keys or passwords using additional device, e.g. trusted platform module [TPM], smartcard, USB or hardware security module [HSM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/08—Randomization, e.g. dummy operations or using noise
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephone Function (AREA)
Abstract
The embodiment of the application discloses a password peeping prevention method and a password peeping prevention device, wherein the method comprises the following steps: the method comprises the steps of receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, each character of the M characters comprises a random character in front of the character and/or each character comprises a random character behind the character, and the anti-peeping password comprising the actual password and a plurality of random characters is displayed in a password display area. Therefore, the random characters are added before and after each character of the actual password, the probability that the password is contrasted and decoded after being seen is reduced by increasing the length and the randomness of the input password, the password peep prevention can be realized, and the password security of the encryption equipment is improved.
Description
Technical Field
The application relates to the field of computers, in particular to a password peeping prevention method and device.
Background
With the development of computer technology, higher requirements are also put on the encryption protection of data or systems. For example, when a user logs in an encryption device, since the key adopts a multi-component management mode, multiple persons are required to sequentially insert component key fobs and input passwords corresponding to the component key fobs so as to log in the encryption device.
However, when logging in an encryption device, there are many users present, and it is difficult to prevent leakage such as peeping.
Disclosure of Invention
The application provides a password peep-proof method and device, which can achieve password peep-proof and improve password security of encryption equipment.
The embodiment of the application provides a password peeping prevention method, which comprises the following steps:
receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, and each character of the M characters comprises a random character in front of the character and/or a random character behind the character;
and displaying an anti-peeping password comprising the actual password and a plurality of random characters in the password display area.
Optionally, each character of the M characters includes X random characters before and/or Y random characters after, where X + Y is N, the number of N is fixed, N is greater than or equal to 1, and the number of characters of the anti-peeping password is M (N + 1).
Optionally, each character of the M characters except for the last character includes X random characters and/or includes Y random characters after each character, where X + Y is N, the value of N is fixed, and N is greater than or equal to 1;
the last character of the M characters comprises L random characters and/or K random characters behind each character, wherein L + K is P, the numerical value of P is fixed, N is larger than or equal to P and larger than or equal to 0, and the number of the characters of the anti-peeping password is (M-1) (N +1) + (P + 1).
Optionally, the method further comprises:
and determining whether the actual passwords in the correct sequence are included in the peep-proof passwords, if so, prompting that the passwords are input successfully, and if not, prompting that the passwords are input wrongly.
Optionally, the determining whether the peep-proof password includes an actual password in a correct sequence, if so, prompting that the password input is successful, and if not, prompting that the password input is wrong includes:
determining whether the first character of the M characters is from the 1 st bit to the N +1 st bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error;
determining whether the ith character of the M characters is located from the (i-1) (N +1) +1 bit to the (i (N +1) bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error, wherein M-1 is more than or equal to i and more than or equal to 1;
and determining whether the last character in the M characters is from (M-1) (N +1) +1 bit to the last bit of the anti-peeping password, if so, prompting that the password is successfully input, and if not, prompting that the password is wrongly input.
Optionally, if the number of characters of the peep-proof password is (M-1) (N +1) + (P + 1);
the determining whether a last character of the M characters is from (M-1) (N +1) +1 bit to a last bit of the peep-proof password comprises:
determining whether a last character of the M characters is located from (M-1) (N +1) +1 to (M-1) (N +1) + (P +1) of the peep-proof password.
The embodiment of the application provides a password peep-proof device, the device includes:
the system comprises a receiving unit and a processing unit, wherein the receiving unit is used for receiving an anti-peeping password input by a user, the anti-peeping password comprises an actual password, the actual password comprises M characters, and each character of the M characters comprises a random character in front of the character and/or comprises a random character behind the character;
and the display unit is used for displaying the anti-peeping password comprising the actual password and a plurality of random characters in the password display area.
Optionally, each character of the M characters includes X random characters before and/or Y random characters after, where X + Y is N, the number of N is fixed, N is greater than or equal to 1, and the number of characters of the anti-peeping password is M (N + 1).
Optionally, each character of the M characters except for the last character includes X random characters and/or includes Y random characters after each character, where X + Y is N, the value of N is fixed, and N is greater than or equal to 1;
the last character of the M characters comprises L random characters and/or K random characters behind each character, wherein L + K is P, the numerical value of P is fixed, N is larger than or equal to P and larger than or equal to 0, and the number of the characters of the anti-peeping password is (M-1) (N +1) + (P + 1).
Optionally, the apparatus further comprises:
and the determining unit is used for determining whether the actual passwords in the correct sequence are included in the peep-proof passwords, if so, prompting that the passwords are input successfully, and if not, prompting that the passwords are input incorrectly.
The embodiment of the application provides a password peeping prevention method, which comprises the following steps: the method comprises the steps of receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, each character of the M characters comprises a random character in front of the character and/or each character comprises a random character behind the character, and the anti-peeping password comprising the actual password and a plurality of random characters is displayed in a password display area. Therefore, the random characters are added before and after each character of the actual password, the probability that the password is contrasted and decoded after being seen is reduced by increasing the length and the randomness of the input password, the password peep prevention can be realized, and the password security of the encryption equipment is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a flowchart of login of an encryption device provided in the present application;
fig. 2 is a flowchart of a password peep prevention method according to an embodiment of the present application;
fig. 3 is a flowchart of decryption of an anti-peeping password according to an embodiment of the present disclosure;
fig. 4 is a block diagram of a password peep-proof device according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
With the development of computer technology, higher requirements are also put on the encryption protection of data or systems. For example, when a user logs in an encryption device, since the key is managed in multiple components, multiple users are required to sequentially insert component key fobs and input the passwords corresponding to the component key fobs to log in the encryption device, as shown in fig. 1.
When the encryption equipment is specifically logged in, firstly inputting a user name, when the user is the ith user, displaying a display area to display a component key fob i which is required to be inserted, then inserting the component key fob i by the user, inputting a password of the key fob, judging whether the password is correct or not, if not, re-inputting the password of the key fob, if so, judging whether all the component key fobs are verified or not, if not, changing to a step that the ith-i +1 user continues to insert the component key fob, and if so, logging in successfully.
However, when logging in an encryption device, there are many users present, and it is difficult to prevent leakage such as peeping.
Based on this, the embodiment of the present application provides a password peep prevention method, which includes: the method comprises the steps of receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, each character of the M characters comprises a random character in front of the character and/or each character comprises a random character behind the character, and the anti-peeping password comprising the actual password and a plurality of random characters is displayed in a password display area. Therefore, the random characters are added before and after each character of the actual password, the probability that the password is contrasted and decoded after being seen is reduced by increasing the length and the randomness of the input password, the password peep prevention can be realized, and the password security of the encryption equipment is improved.
Referring to fig. 2, the figure is a flowchart of a password peep prevention method provided in the embodiment of the present application. The password peep-proof method provided by the embodiment can be applied to a server, and the function of realizing password peep-proof of the server can be integrated in an encryption device.
The password peeping prevention method provided by the embodiment comprises the following steps:
and S101, receiving the peep-proof password input by the user.
In the embodiment of the application, the anti-peeping password input by the user is received, wherein the anti-peeping password comprises an actual password, and the actual password comprises M characters. M is an integer, M being at least greater than 1.
As an example, the actual password may be a1a2a3…am-1am。
And adding a random character in front of each character of the M characters of the actual password and/or adding a random character behind each character to form the anti-peeping password.
In the embodiment of the application, a random character is added before each character of M characters of an actual password or a random character is added after each character. That is, a random character may be added before each character, a random character may be added after each character, and a random character may be added before and after each character.
As a possible implementation, the total number of random characters added before or after the M characters is fixed. Specifically, X random characters may be added before or after each character of M characters, where X + Y is N, the number of N is fixed, N is greater than or equal to 1, and the number of characters of the anti-peeping password obtained by adding random characters to the actual password is M (N + 1). The length and the randomness of the input password are increased, and the possibility that the password is contrastively decoded after being seen can be reduced.
As another possible implementation manner, the total number of random characters added before or after each character of the last character in the M characters is fixed, and the number of characters added before or after the last character is not fixed, so that the length of the input password is further not fixed, and the possibility of the password being decrypted is further reduced. Specifically, X random characters are added before each character except the last character in the M characters or Y random characters are added after each character, where X + Y is N, the numerical value of N is fixed, N is greater than or equal to 1, L random characters are added before the last character in the M characters or K random characters are added after each character, L + K is P, the numerical value of P is fixed, N is greater than or equal to P is greater than or equal to 0, that is, the number of random characters added in the last character is less than or equal to the number of random characters added in other characters, and the number of characters of the peep-proof password obtained by adding random characters in the actual password is (M-1) (N +1) + (P + 1).
As an example, the total number of the random characters needing to be added before and after each character in the actual password is n (n is more than or equal to 1), x (0 is more than or equal to x and less than or equal to n) random characters are added in front of each actual password character, and the random characters are marked as a1x1a1x2...a1xx-1a1xxAdding y (y is more than or equal to 0 and less than or equal to n) random characters behind each actual password character, and recording the random characters as a1y1a1y2...a1yy-1a1yyThe number x and y of the random characters added before and after each actual password character is not fixed, but x + y is equal to n, and particularly for the last actual password character, the number of the added random characters is set as p (p is more than or equal to 0 and less than or equal to n), so that the length and the characters of the input password are not fixed, and the possibility of deciphering the password is reduced.
Except the last character, after adding random characters to each actual password, n +1 possibilities exist:
(1) if x is 0 and y is n, then it is trueFirst character a of password1After adding the random characters, it can become: a is a1a1y1a1y2a1y3…a1y-1a1yy。
(2) If x is 1 and y is n-1, the first character a of the actual password1After adding the random characters, it can become: a is1x1a1a1y1a1y2a1y3…a1yy-1a1yy。
(3) If x is 2 and y is n-2, the first character a of the actual password1After adding the random characters, it can become: a is1x1a1x2a1a1y1a1y2a1y3…a1yy-1a1yy。
By analogy, the following results are obtained:
(n) if x is n-1 and y is 1, the first character a of the actual password is1After adding the random characters, it can become: a is1x1a1x2…a1xx-1a1xxa1a1y1。
(n +1) if x is n and y is 0, the first character a of the actual password1After adding the random characters, it can become: a is1x1a1x2…a1xx-1a1xxa1。
For the last actual cipher, since 0 ≦ p ≦ n, there are a total of (n +1) + n + (n-1) +. +2+1 ═ n +2) (n +1)/2 possibilities:
(1) if p ═ n, then there are n +1 possibilities.
(2) If p is n-1, there are n possibilities.
(3) If p ═ n-2, then there are n-1 possibilities.
By analogy, the following results are obtained:
(n-1) if p is 2, there are 3 possibilities.
(n) if p is 1, there are 2 possibilities.
(n +1) if p is 0, there are 1 possible.
Therefore, the combination of the anti-peeping password obtained by adding random characters into the actual password is totally (n +1)m-1*(n+2)(n+1)/2=(n+1)m(n +2)/2, it can be seen thatThe complexity of the password increases exponentially with the length m of the actual password.
S102, displaying the anti-peeping password comprising the actual password and a plurality of random characters in the password display area.
In the embodiment of the application, the anti-peeping password added with the random characters in the actual password can be displayed in the password display area, so that the actual password is prevented from being peeped.
As an example, the number of characters of the actual password is 6, that is, m is 6, when n is 3, random characters are added before and after the entire actual password, and there are only 19 password combinations, but with the method provided in the embodiment of the present application, the password combination reaches 465/2 is 10240, so that the cracking difficulty is greatly reduced.
In addition, because the number of random characters added before and after each actual password character is relatively variable, the number of characters added at the last bit is not fixed, the password length can also be changed, if the password is seen for many times, the actual password is not easy to match through many times of comparison, and therefore the possibility of being decoded by the found rule is reduced.
In the embodiment of the application, after receiving the anti-peeping password, the encryption device can decrypt the anti-peeping password to obtain the actual password.
After the anti-peeping password is received, whether the actual password in the correct sequence is included in the anti-peeping password is determined, if yes, the password is prompted to be input successfully, and if not, the password is prompted to be input wrongly. That is, to determine whether the characters of the actual password are included in the peep-proof password, the character order of the actual password is also determined.
Specifically, whether the first character in the M characters is from the 1 st bit to the N +1 th bit of the anti-peeping password is determined, if yes, the subsequent steps are continued, and if not, a password input error is prompted.
And determining whether the ith character in the M characters is from the (i-1) (N +1) +1 bit to the (i (N +1) bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error, wherein M-1 is more than or equal to i and more than or equal to 1.
And determining whether the last character in the M characters is from (M-1) (N +1) +1 bit to the last bit of the anti-peeping password, if so, prompting that the password is successfully input, and if not, prompting that the password is wrongly input.
If the number of characters of the anti-peeping password is (M-1) (N +1) + (P +1), that is, the number of random characters added before and after the last actual password is not fixed, it can be determined whether the last character of the M characters is (M-1) (N +1) +1 to (M-1) (N +1) + (P +1) of the anti-peeping password.
As an example, referring to FIG. 3, taking the 1 st bit to the n +1 th bit of the input password, comparing the first character of the actual password, if the first character of the actual password exists in the 1 st bit to the n +1 th bit, starting to match the second character, otherwise prompting the password input error, then taking the n +2 to 2(n +1) th bits of the input password, comparing the second character of the actual password, if the second character of the actual password exists in the n +2 to 2(n +1) th bits, starting to match the third character, otherwise prompting the password input error, and so on, taking the (i-1) (n +1) +1 to i (n +1) th bits of the input password, comparing the ith character of the actual password, if the ith character exists in the (i-1) (n +1) +1 to i (n +1) th bits, and starting to match the (i +1) th character (i is more than or equal to 1 and less than or equal to m-1), otherwise prompting that the password is input wrongly, finally taking the (m-1) (n +1) +1 to (m-1) (n +1) + (p +1) th bit of the input password, comparing the last character of the actual password, if the last character of the actual password exists in the (m-1) (n +1) +1 to (m-1) (n +1) + (p +1) th bit, successfully matching, prompting that the password is correct, or else prompting that the password is wrong.
The embodiment of the application is mainly used for logging in the encryption equipment, each key fob component administrator inserts a component key fob, when the corresponding password of the component key fob is input, the actual password characters are not input, a set number of random characters are added before or after each actual password character, the length of the input password is increased, and the subsequent encryption equipment identifies the actual password characters in the subsequent encryption equipment by a preset method. Therefore, the possibility that the password is peeped and leaked and is cracked by trial and error can be greatly reduced.
The embodiment of the application provides a password peeping prevention method, which comprises the following steps: the method comprises the steps of receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, each character of the M characters comprises a random character in front of the character and/or each character comprises a random character behind the character, and the anti-peeping password comprising the actual password and a plurality of random characters is displayed in a password display area. Therefore, the random characters are added before and after each character of the actual password, the probability that the password is contrasted and decoded after being seen is reduced by increasing the length and the randomness of the input password, the password peep prevention can be realized, and the password security of the encryption equipment is improved.
Based on the password peep-proof method provided by the embodiment, the embodiment of the application also provides a password peep-proof device, and the working principle of the password peep-proof device is described in detail below by combining the attached drawings.
Referring to fig. 4, this figure is a block diagram of a password peep-proof device provided in the embodiment of the present application.
The password peep prevention device 400 provided by the embodiment comprises:
a receiving unit 410, configured to receive a peep-proof password input by a user, where the peep-proof password includes an actual password, the actual password includes M characters, and each of the M characters includes a random character in front of the character and/or includes a random character behind the character;
a display unit 420, configured to display, in the password display area, a peep-proof password including the actual password and a plurality of random characters.
Optionally, each character of the M characters includes X random characters before and/or Y random characters after, where X + Y is N, the number of N is fixed, N is greater than or equal to 1, and the number of characters of the anti-peeping password is M (N + 1).
Optionally, each character of the M characters except for the last character includes X random characters and/or includes Y random characters after each character, where X + Y is N, the value of N is fixed, and N is greater than or equal to 1;
the last character of the M characters comprises L random characters and/or K random characters behind each character, wherein L + K is P, the numerical value of P is fixed, N is larger than or equal to P and larger than or equal to 0, and the number of the characters of the anti-peeping password is (M-1) (N +1) + (P + 1).
Optionally, the apparatus further comprises:
and the determining unit is used for determining whether the actual passwords in the correct sequence are included in the peep-proof passwords, if so, prompting that the passwords are input successfully, and if not, prompting that the passwords are input incorrectly.
Optionally, the determining unit is specifically configured to:
determining whether the first character of the M characters is from the 1 st bit to the (N +1) th bit of the peep-proof password, if so, continuing the subsequent steps, and if not, prompting a password input error;
determining whether the ith character of the M characters is located from the (i-1) (N +1) +1 bit to the (i (N +1) bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error, wherein M-1 is more than or equal to i and more than or equal to 1;
and determining whether the last character in the M characters is from (M-1) (N +1) +1 bit to the last bit of the anti-peeping password, if so, prompting that the password is successfully input, and if not, prompting that the password is wrongly input.
Optionally, if the number of characters of the peep-proof password is (M-1) (N +1) + (P + 1);
the determining unit is specifically configured to:
determining whether a last character of the M characters is located from (M-1) (N +1) +1 to (M-1) (N +1) + (P +1) of the peep-proof password.
When introducing elements of various embodiments of the present application, the articles "a," "an," "the," and "said" are intended to mean that there are one or more of the elements. The terms "comprising," "including," and "having" are intended to be inclusive and mean that there may be additional elements other than the listed elements.
It should be noted that, as one of ordinary skill in the art would understand, all or part of the processes of the above method embodiments may be implemented by a computer program to instruct related hardware, where the computer program may be stored in a computer readable storage medium, and when executed, the computer program may include the processes of the above method embodiments. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points. The above-described apparatus embodiments are merely illustrative, and the units and modules described as separate components may or may not be physically separate. In addition, some or all of the units and modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The foregoing is directed to embodiments of the present application and it is noted that numerous modifications and adaptations may be made by those skilled in the art without departing from the principles of the present application and are intended to be within the scope of the present application.
Claims (10)
1. A password peep prevention method, the method comprising:
receiving an anti-peeping password input by a user, wherein the anti-peeping password comprises an actual password, the actual password comprises M characters, and each character of the M characters comprises a random character in front of the character and/or a random character behind the character;
and displaying the anti-peeping password comprising the actual password and a plurality of random characters in the password display area.
2. The method according to claim 1, wherein each character of the M characters comprises X random characters before and/or Y random characters after, wherein X + Y is N, the numerical value of N is fixed, N is greater than or equal to 1, and the number of characters of the anti-peeping password is M (N + 1).
3. The method according to claim 1, wherein each character of the M characters except the last character comprises X random characters before and/or Y random characters after each character, wherein X + Y is N, the value of N is fixed, and N is more than or equal to 1;
the last character of the M characters comprises L random characters and/or K random characters behind each character, wherein L + K is P, the numerical value of P is fixed, N is larger than or equal to P and larger than or equal to 0, and the number of the characters of the anti-peeping password is (M-1) (N +1) + (P + 1).
4. A method according to claim 2 or 3, characterized in that the method further comprises:
and determining whether the actual passwords in the correct sequence are included in the peep-proof passwords, if so, prompting that the passwords are input successfully, and if not, prompting that the passwords are input wrongly.
5. The method of claim 4, wherein determining whether the anti-peeping password comprises an actual password in a correct sequence prompts a password input to be successful if the actual password comprises the correct sequence, and prompts a password input error if the actual password comprises the following steps:
determining whether the first character of the M characters is from the 1 st bit to the N +1 st bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error;
determining whether the ith character of the M characters is located from the (i-1) (N +1) +1 bit to the (i (N +1) bit of the anti-peeping password, if so, continuing the subsequent steps, and if not, prompting a password input error, wherein M-1 is more than or equal to i and more than or equal to 1;
and determining whether the last character in the M characters is from (M-1) (N +1) +1 bit to the last bit of the anti-peeping password, if so, prompting that the password is successfully input, and if not, prompting that the password is wrongly input.
6. The method according to claim 5, wherein if the number of characters of the peep-proof password is (M-1) (N +1) + (P + 1);
the determining whether a last character of the M characters is in (M-1) (N +1) +1 bit to a last bit of the peep-proof password comprises:
determining whether a last character of the M characters is located from (M-1) (N +1) +1 to (M-1) (N +1) + (P +1) of the peep-proof password.
7. A password privacy protecting device, said device comprising:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving an anti-peeping password input by a user, the anti-peeping password comprises an actual password, the actual password comprises M characters, and each character of the M characters comprises a random character in front of the character and/or a random character behind the character;
and the display unit is used for displaying the anti-peeping password comprising the actual password and a plurality of random characters in the password display area.
8. The device according to claim 7, wherein each character of the M characters comprises X random characters before and/or Y random characters after, wherein X + Y is N, the value of N is fixed, N is larger than or equal to 1, and the number of characters of the anti-peeping password is M (N + 1).
9. The device according to claim 7, wherein each character of the M characters except the last character comprises X random characters before and/or Y random characters after each character, wherein X + Y is N, the value of N is fixed, and N is more than or equal to 1;
the last character of the M characters comprises L random characters and/or K random characters behind each character, wherein L + K is P, the numerical value of P is fixed, N is larger than or equal to P and larger than or equal to 0, and the number of the characters of the anti-peeping password is (M-1) (N +1) + (P + 1).
10. The apparatus of claim 8 or 9, further comprising:
and the determining unit is used for determining whether the actual passwords in the correct sequence are included in the peep-proof passwords, if so, prompting that the passwords are input successfully, and if not, prompting that the passwords are input incorrectly.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210300739.9A CN114640446A (en) | 2022-03-25 | 2022-03-25 | Password peep-proof method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202210300739.9A CN114640446A (en) | 2022-03-25 | 2022-03-25 | Password peep-proof method and device |
Publications (1)
Publication Number | Publication Date |
---|---|
CN114640446A true CN114640446A (en) | 2022-06-17 |
Family
ID=81950043
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202210300739.9A Pending CN114640446A (en) | 2022-03-25 | 2022-03-25 | Password peep-proof method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114640446A (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101604366A (en) * | 2009-07-13 | 2009-12-16 | 中山爱科数字科技有限公司 | A kind of password separate dynamic verification method and system |
CN101702191A (en) * | 2009-10-31 | 2010-05-05 | 浙江德施曼机电有限公司 | Device and method for verifying passwords |
CN108701183A (en) * | 2016-02-16 | 2018-10-23 | 工程409株式会社 | Utilize junk data whether consistent user authen method and Verification System |
WO2020095120A1 (en) * | 2019-04-03 | 2020-05-14 | 苏云 | Password generation method which simultaneously satisfies security and usability |
-
2022
- 2022-03-25 CN CN202210300739.9A patent/CN114640446A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101604366A (en) * | 2009-07-13 | 2009-12-16 | 中山爱科数字科技有限公司 | A kind of password separate dynamic verification method and system |
CN101702191A (en) * | 2009-10-31 | 2010-05-05 | 浙江德施曼机电有限公司 | Device and method for verifying passwords |
CN108701183A (en) * | 2016-02-16 | 2018-10-23 | 工程409株式会社 | Utilize junk data whether consistent user authen method and Verification System |
WO2020095120A1 (en) * | 2019-04-03 | 2020-05-14 | 苏云 | Password generation method which simultaneously satisfies security and usability |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8997177B2 (en) | Graphical encryption and display of codes and text | |
Bojinov et al. | Kamouflage: Loss-resistant password management | |
US5664099A (en) | Method and apparatus for establishing a protected channel between a user and a computer system | |
US7644433B2 (en) | Authentication system and method based upon random partial pattern recognition | |
US7577987B2 (en) | Operation modes for user authentication system based on random partial pattern recognition | |
CA2649015C (en) | Graphical image authentication and security system | |
US20080263361A1 (en) | Cryptographically strong key derivation using password, audio-visual and mental means | |
US20070277224A1 (en) | Methods and Systems for Graphical Image Authentication | |
CN111917535B (en) | Data encryption storage method and device and server | |
US9590808B2 (en) | Obfuscated passwords | |
US20070271465A1 (en) | Method of Authentication by Challenge-Response and Picturized-Text Recognition | |
WO2009023422A1 (en) | System and method for generating and displaying a keyboard comprising a random layout of keys | |
EP3691177B1 (en) | Interception-proof authentication and encryption system and method | |
CA2763860C (en) | System, architecture and method for secure encryption and decryption | |
Gabor et al. | Security issues related to e-learning education | |
US9684784B2 (en) | Systems and methods for securely storing data | |
US20090044284A1 (en) | System and Method of Generating and Providing a Set of Randomly Selected Substitute Characters in Place of a User Entered Key Phrase | |
US20140304789A1 (en) | Convenient one-time password | |
KR20090007944A (en) | Method for protecting exposure of private character string using fake round | |
CN114640446A (en) | Password peep-proof method and device | |
CN111092721B (en) | Method and device for setting access password | |
CN115080987A (en) | Password management method, device, system, storage medium and computer equipment | |
Modugula | A Hybrid approach for Augmenting password security using Argon2i hashing and AES Scheme. | |
CN116566623B (en) | Method, system and electronic equipment for acquiring anonymous digital certificate | |
Cisar et al. | Password-a form of authentication |
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 |