regular expression to validate the password

Question

3.00/5 (2 votes)

See more:

Dear Friends,

am working on asp.net c# project

Can any one help me to write a regular expression to validate the password
entered on the text field in ASP.NET.
The rules for the password are:

1) There must be Upper case letters in the password.
2) There must be lower case letters in the password.
3)There must be numbers in the password.
4) Password must be minimum 8 characters
5) Password cannot contain illegal characters, such as =, <, >, ;, :, '
, " or comma (equal sign, greater sign, less than sign, semicolon, colon,
single quote, double quotes, comma).

Please help me,

Thanks in @dvance.

Posted 2-Oct-13 20:56pm

Software Engineer 892

Add a Solution

4 solutions

Solution 5

visit here....

http://www.mkyong.com/regular-expressions/how-to-validate-password-with-regular-expression/[^]

Posted 2-Oct-13 22:55pm

Rakesh Meel

Solution 2

Hi, I have a post on CP on the same topic. Please have a look at this: Strong Password Validation[^]

Posted 2-Oct-13 21:07pm

tanweer

Solution 4

XML

<asp:TextBox ID="txtPassword" runat="server"></asp:TextBox>
        <asp:RegularExpressionValidator ID="revPassword" runat="server" ErrorMessage="Invalid Password Charecters"
        ValidationExpression="^(?=.*\d)(?=.*[a-z])(?=.*[A-Z]).{8}$" ControlToValidate="txtPassword" ForeColor="Red" ></asp:RegularExpressionValidator>

Matches Cases

11aaaAAA

111111aA

1aaaaaaA

Posted 2-Oct-13 22:18pm

Ranesh M Raj

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Accepted Answer · 2013-10-02T21:08:00

This is one of the typical examples where using Regex would be extremely inconvenient, because you would have to foresee all possible permutation, which is nearly impossible: the order of characters is not constrained and maximum length is not limited.

The solution is much simpler than that: scan all characters in the loop and classify them all into 4 (#4 is not used, check up the length in the very beginning) categories you described. You would need to remember only the number of occurences. Then, for each category, apply your criteria on multiplicity: in #1, #2 and #3, must be greater then zero, in #5, should be zero. For #5, instead of "such as", list all and write it in one string, to calculate that a character is not found in that string.

These methods will help you:
http://msdn.microsoft.com/en-us/library/dy85x1sa.aspx[^] (for rule #5, check "not contains"),
http://msdn.microsoft.com/en-us/library/system.char.aspx[^]:
http://msdn.microsoft.com/en-us/library/d1x97616.aspx[^],
http://msdn.microsoft.com/en-us/library/yk2b3t2y.aspx[^],
http://msdn.microsoft.com/en-us/library/9s91f3by.aspx[^].

—SA