All posts by : chebby

Learn About creating good password security.

An IT Security consultant has made three primary recommendations regarding passwords:

1. Prohibit guessable passwords
   • such as common names, real words, numbers only
   • require special characters and a mix of caps, lower case and numbers in passwords
2. Reauthenticate before changing passwords
   • user must enter old pw before creating new one
3. Make authenticators unforgeable 
   • do not allow email or user ID as password

Using WORD, write a brief paper of 200-300 words explaining each of these security recommendations.  Do you agree or disagree with these recommendations. Would you change, add or delete any of these?  Add additional criteria as you see necesarry.

Note your Safe Assign score. Continue submitting until your Safe Assign score is less than 25. You have three attempts to complete your assignment.

Attach your WORD doc and then hit SUBMT.

Explain the rationale for post-quantum cryptography and describe its relevance with different types of cryptographic algorithms.

**Required 300 words**

*2 references**

**No direct questions**

Each student will prepare a final project on a digital forensic topic or on a criminal investigation that involved digital forensics.

Final Project :

1)Submit your final project topic here. Include a short paragraph describing your project and how you intend to research it.

2)Submit a brief abstract describing your final project.(250 words)

3)A 500-700 word, double spaced paper, written in APA format, showing sources and a bibliography

4)Presentation materials (PPT, handouts, etc)  

Discussion (Chapter 5): What is the relationship between Naïve Bayes and Bayesian networks? What is the process of developing a Bayesian networks model?

Note: The first post should be made by Wednesday 11:59 p.m., EST. I am looking for active engagement in the discussion. Please engage early and often.

Your response should be 100-300 words. Respond to two postings provided by your classmates.

Employees want to be mobile, having the ability to move from their desks to meetings and back again. How do you ensure that the data they are accessing follows the rules for CIA?

In a 500- to 750-word essay, develop a plan for securing an enterprise level wireless network, such as the private WGCUSECURE WiFi Network used here on campus. Make sure to address the following:

1. Which Wireless Security options would you deploy, preventing typical wireless attack vectors? Should you use a layered security approach? Why?
2. Describe the strategy for your design.
3. Include a network diagram. Use Microsoft Visio or online network diagraming tools, as identified in the required readings to visualize your design.

 After reading chapter 13, analyze the advantages and disadvantages of digital signatures. 

 In today’s fast-paced, agile software development environment, how can we make sure security is implemented into the design? What are some of the key strategies?

Use facts and examples to support your answer. Any outside sources should be cited using APA style.

 Need an brief description about the current attached file along with a high end or detailed Network architecture diagram covering the main points mentioned in attached document. Due date : Next 2 hours. Time: 8:30 PM CST 

Discuss how business use Access Control to protect their information, describe the how a business will the Control Process.

Length, 2 – 3 pages.

All paper are written in APA formatting, include title and references pages (not counted). Must use at least two references and citations.

Please reference the rubric for grading.

All paper are checked for plagiarism using SafeAssign, you can review your score.

I have attachedd a template you can use to write your paper.

 An array A contains n integers taken from the interval [0,4n], with repetitions allowed. Describe an efficient algorithm for determining an integer value k that occurs the most often in A. What is the running time of your algorithm? 2. An array A contains n−1 unique integers in the range [0,n−1], that is, there is one number from this range that is not in A. Design an O(n)-time algorithm for finding that number. You are allowed to use additional space besides the array A itself 3. In steps, find the computational complexity of the following loops: (i) for ( c = 1, i = 1 ; i <= n ; i *= 2) for (j =1 ; j <= n ; j++)  c++; (ii) for (cc = 1, i = 1 ; i <= n ; i *= 2) for (j = 1; j <= i ; j++) cc++;