Password: Sensitive information is present in every system or network and it requires authentication to open. The authorization is provided by entering the password, identification number, and so on. Password can be a string of character or number and it protects the system from the access of the unauthorized person. Rule for creating a password: The rules for creating password are: Password should be changed often. Password should not be guessable such as first name, last name and so on. The length of the password should be minimum 8 characters or more in length. It is good, if it has uppercase letters, lowercase letters, numbers, and special characters. It should not be a familiar word or pharse. It should not be common numbers like birth date and social security number. Password should not be shared with others. Example of Weak password: The examples of weak password are “FirstName_123”, “mypassword”, “mobile_number” and “123456789”. Example of strong password: The password with the combination of uppercase letters, lowercase letters, numbers, and special characters are considered as strong password.

Question

Want to see the full answer?

Answer 1

Question

Chapter 1.7, Problem 3SGDQ

Program Plan Intro

Password:

Sensitive information is present in every system or network and it requires authentication to open.

The authorization is provided by entering the password, identification number, and so on.

Password can be a string of character or number and it protects the system from the access of the unauthorized person.

Rule for creating a password:

The rules for creating password are:

Password should be changed often.

Password should not be guessable such as first name, last name and so on.

The length of the password should be minimum 8 characters or more in length.

It is good, if it has uppercase letters, lowercase letters, numbers, and special characters.

It should not be a familiar word or pharse.

It should not be common numbers like birth date and social security number.

Password should not be shared with others.

Example of Weak password:

The examples of weak password are “FirstName_123”, “mypassword”, “mobile_number” and “123456789”.

Example of strong password:

The password with the combination of uppercase letters, lowercase letters, numbers, and special characters are considered as strong password.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.

Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?

Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justification