Discussion point:

What types of differences exist between men and women in negotiation?

Read the above discussion point and write the response in 300 words, APA format, no plagiarism, provide references.

Assignment 4: Computer Forensic Tools
Due Week 9 and worth 50 points

You have been recently hired to assist with purchasing computer forensics tools and resources for a major corporation. Using the concepts that you learned in chapters nine (9) through twelve (12) recommend specific tools that can be used for computer forensics investigation.

Write a 3-4 page paper in which you:

1. Compare and contrast features and costs of at least two (2) programs that can be used to recover deleted files.  Include the success rates and specific functions each program offers. 
2. Specify the costs associated with purchasing two (2) tools that can be used to gather digital evidence from a cell phone.  Include specific hardware or additional devices that will be required.
3. Identify hourly costs associated with specific certified computer experts that can be used for forensics purposes and suggest a certified computer professional, you think, would be effective for a court case.
4. Summarize a current event article based on how an expert’s deposition helped the case at trial.  Include specifics on how the deposition was delivered and what was done to ensure that it was provided truthfully and concisely.
5. Use at least four (4) quality resources in this assignment. Note: Wikipedia and similar Websites do not qualify as quality resources.

Your assignment must follow these formatting requirements:

• Be typed, double spaced, using Times New Roman font (size 12), with one-inch margins on all sides; citations and references must follow APA or school-specific format. Check with your professor for any additional instructions.
• Include a cover page containing the title of the assignment, the student’s name, the professor’s name, the course title, and the date. The cover page and the reference page are not included in the required assignment page length.

10-1 Final Project Two Submission: Memo

To complete this assignment, review the prompt and grading rubric in the Final Project Two Guidelines and Rubric document. Be sure to use the memo template to help structure this assignment. When you have finished your work, submit the assignment here for grading and instructor feedback.

ISE 640 Final Project Two Guidelines and Rubric 

Overview Final Project Two is the creation of a memo to non-technical stakeholders. While these stakeholders will have access to the report you created, they are looking for your expertise in extracting the most salient information for their purposes. They are coordinating with the legal team on next steps for the company and the creation of a press release that will position this incident for the public.  

In this assignment, you will demonstrate your mastery of the following course outcome:  

 ISE-640-03: Demonstrate the use of appropriate reporting techniques in communicating the results of forensic investigations to non-expert stakeholders 

Prompt Write an audience-appropriate internal memo to non-technical stakeholders to communicate findings of a forensic investigation (reported on in the technical report from Final Project One, submitted in Module Nine). 

Specifically, you must address the critical elements listed below. Most of the critical elements align with a particular course outcome (shown in brackets).  

Your memo should include: 

I. Key Details: Describe how the results from the forensic investigation assisted you with resolving the incident and identifying security impacts. [ISE-64003] II. Implications for Legal Action: Describe the accuracy, validity, and defensibility of the investigative steps that were taken. [ISE-640-03] III. Audience Appropriate: Your entire internal memo should employ brevity and consumable language while presenting the necessary information. [ISE640-03] 

Milestones You have one milestone activity prior to the final submission of this memo. Additionally, several of the activities you have completed throughout the duration of this course will assist you in creating the memo. In particular, your notes from your non-graded investigative journal will be a valuable resource when formulating this memo to non-technical stakeholders. 

Milestone Two: Memo Draft In Module Seven, you will submit a complete draft of this memo. This milestone will be graded with the Milestone Two Rubric.  

Final Submission: Memo to Non-Technical Stakeholders In Module Ten, you will submit your final project. It should be a complete, polished artifact containing all of the critical elements of the final product. It should reflect the incorporation of feedback gained throughout the course. This submission will be graded with the Final Project Two Rubric. 

Final Project Two Rubric Guidelines for Submission: Your memo must be 3- 5 pages in length including a cover page and references and must be written in APA format. Use double-spacing, 12-point Times New Roman font, and one-inch margins. Include at least three references cited in APA format.  

Read the following article on Scalable Methods for Conducting Cyber Threat Hunt Operations.  Write a 3-page paper, make sure your submissions are original work with cited sources and make sure your paraphrase your sources along with proper APA formatting; Title page, Running, In Text Citations, Page Numbers, and Reference page.

You are to provide a critical analysis of this paper.  Compare and contrast this authors methodology of:

1. Create a Hypothesis
2. Investigate via Tools and Techniques
3. Uncover new Patters and Tactics, Techniques, and Procedures (TTPs)
4. Informa and Enrich Analytics

Against the STRIDE method and DREAD method.  Discuss the advantages and disadvantages of this three.  Also provide which method you would choose and why.  

Refer to this example

http://billmill.org/bloomfilter-tutorial/

1) Using the 2 of the 9 hash functions you have, duplicate the process found in the above example.

2) Next create a file with random inputs and use all 9 hashes this time

http://pages.cs.wisc.edu/~cao/papers/summary-cache/node8.html

3) Choose several spots in the table with 9 hashes and confirm results with your program.

False Positive -> (1-e^(-km/n))^k where

n is the bit vector size

k are the number of hashes

m are the number of keys used in the hash to fill the vector.

code c++

HashTest.cpp

#include <iostream> //iostrem
#include <string>   //string
#include <vector>   //vector
#include “GeneralHashFunctions.h”

int main(int argc, char* argv[])
{
   const std::string key = “abcdefghijklmnopqrstuvwxyz1234567890”;

   std::cout << “General Purpose Hash Function Algorithms Test” << std::endl;
   std::cout << “By Arash Partow – 2002        ” << std::endl;
   std::cout << “Key: ”                          << key           << std::endl;
   std::cout << ” 1. RS-Hash Function Value:   ” << RSHash (key) << std::endl;
   std::cout << ” 2. JS-Hash Function Value:   ” << JSHash (key) << std::endl;
   std::cout << ” 3. PJW-Hash Function Value: ” << PJWHash (key) << std::endl;
   std::cout << ” 4. ELF-Hash Function Value: ” << ELFHash (key) << std::endl;
   std::cout << ” 5. BKDR-Hash Function Value: ” << BKDRHash(key) << std::endl;
   std::cout << ” 6. SDBM-Hash Function Value: ” << SDBMHash(key) << std::endl;
   std::cout << ” 7. DJB-Hash Function Value: ” << DJBHash (key) << std::endl;
   std::cout << ” 8. DEK-Hash Function Value: ” << DEKHash (key) << std::endl;
   std::cout << ” 9. FNV-Hash Function Value: ” << FNVHash (key) << std::endl;
   std::cout << “10. BP-Hash Function Value:   ” << BPHash (key) << std::endl;
   std::cout << “11. AP-Hash Function Value:   ” << APHash (key) << std::endl;

   return 1;
}

GeneralHashFunctions.cpp

#include “GeneralHashFunctions.h”

unsigned int RSHash(const std::string& str)
{
   unsigned int b    = 378551;
   unsigned int a    = 63689;
   unsigned int hash = 0;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = hash * a + str[i];
      a    = a * b;
   }

   return hash;
}
/* End Of RS Hash Function */

unsigned int JSHash(const std::string& str)
{
   unsigned int hash = 1315423911;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash ^= ((hash << 5) + str[i] + (hash >> 2));
   }

   return hash;
}
/* End Of JS Hash Function */

unsigned int PJWHash(const std::string& str)
{
   unsigned int BitsInUnsignedInt = (unsigned int)(sizeof(unsigned int) * 8);
   unsigned int ThreeQuarters     = (unsigned int)((BitsInUnsignedInt * 3) / 4);
   unsigned int OneEighth         = (unsigned int)(BitsInUnsignedInt / 8);
   unsigned int HighBits          = (unsigned int)(0xFFFFFFFF) << (BitsInUnsignedInt – OneEighth);
   unsigned int hash              = 0;
   unsigned int test              = 0;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = (hash << OneEighth) + str[i];

      if((test = hash & HighBits) != 0)
      {
         hash = (( hash ^ (test >> ThreeQuarters)) & (~HighBits));
      }
   }

   return hash;
}
/* End Of P. J. Weinberger Hash Function */

unsigned int ELFHash(const std::string& str)
{
   unsigned int hash = 0;
   unsigned int x    = 0;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = (hash << 4) + str[i];
      if((x = hash & 0xF0000000L) != 0)
      {
         hash ^= (x >> 24);
      }
      hash &= ~x;
   }

   return hash;
}
/* End Of ELF Hash Function */

unsigned int BKDRHash(const std::string& str)
{
   unsigned int seed = 131; // 31 131 1313 13131 131313 etc..
   unsigned int hash = 0;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = (hash * seed) + str[i];
   }

   return hash;
}
/* End Of BKDR Hash Function */

unsigned int SDBMHash(const std::string& str)
{
   unsigned int hash = 0;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = str[i] + (hash << 6) + (hash << 16) – hash;
   }

   return hash;
}
/* End Of SDBM Hash Function */

unsigned int DJBHash(const std::string& str)
{
   unsigned int hash = 5381;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = ((hash << 5) + hash) + str[i];
   }

   return hash;
}
/* End Of DJB Hash Function */

unsigned int DEKHash(const std::string& str)
{
   unsigned int hash = static_cast(str.length());

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = ((hash << 5) ^ (hash >> 27)) ^ str[i];
   }

   return hash;
}
/* End Of DEK Hash Function */

unsigned int BPHash(const std::string& str)
{
   unsigned int hash = 0;
   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash = hash << 7 ^ str[i];
   }

   return hash;
}
/* End Of BP Hash Function */

unsigned int FNVHash(const std::string& str)
{
   const unsigned int fnv_prime = 0x811C9DC5;
   unsigned int hash = 0;
   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash *= fnv_prime;
      hash ^= str[i];
   }

   return hash;
}
/* End Of FNV Hash Function */

unsigned int APHash(const std::string& str)
{
   unsigned int hash = 0xAAAAAAAA;

   for(std::size_t i = 0; i < str.length(); i++)
   {
      hash ^= ((i & 1) == 0) ? ( (hash << 7) ^ str[i] * (hash >> 3)) :
                               (~((hash << 11) + (str[i] ^ (hash >> 5))));
   }

   return hash;
}
/* End Of AP Hash Function */

GeneralHashFunctions.h

#ifndef INCLUDE_GENERALHASHFUNCTION_CPP_H
#define INCLUDE_GENERALHASHFUNCTION_CPP_H

#include

typedef unsigned int (*HashFunction)(const std::string&);

unsigned int RSHash (const std::string& str);
unsigned int JSHash (const std::string& str);
unsigned int PJWHash (const std::string& str);
unsigned int ELFHash (const std::string& str);
unsigned int BKDRHash(const std::string& str);
unsigned int SDBMHash(const std::string& str);
unsigned int DJBHash (const std::string& str);
unsigned int DEKHash (const std::string& str);
unsigned int BPHash (const std::string& str);
unsigned int FNVHash (const std::string& str);
unsigned int APHash (const std::string& str);

#endif