REplys

Order ready-to-submit essays. No Plagiarism Guarantee!

Note: Our papers are 100% human-written, not AI-generated. 

We Write Essays for Students

Tell us about your assignment and we will find the best writer for your paper

Get Help Now!

REplys

Reply needed 1 Network forensics can be explained as a process to capture, recording and analysis of network packets in order to determine the source of network security attacks. The major goal of network forensics is to collect evidence. To analyze network traffic data, which is collected from different sites and different network equipment, such as firewalls and IDS.

Network forensics is also the process of detecting intrusion patterns, focusing on attacker activity.

Network data collection can be achieved using a brute force “catch it as you can” and a more intelligent “stop look listen” method.

Network forensics analysis, like any other forensic investigation presents many challenges. The first challenge is related to traffic data sniffing. Depending on the network configuration and security measures where the sniffer is deployed, the tool may not capture all desired traffic data. To solve this issue, the network administrator should use a span port on network devices in multiple places of the network.

In conclusion, network forensics provides methods to predict future attacks by correlating attack patterns from previous records of intrusion traffic data. This facilitates the presentation of admissible evidence in a court of law.

Reference:

Casey, Eoghan (2004). Digital Evidence and Computer Crime, Second Edition. Elsevier. ISBN 0-12-163104-4 .

Reply needed 2 Network data collection should be a balanced strategy of maximizing the potential to collect data that can be used as evidence versus the ability to minimize the costs of investigative work. In most organizations, this strategy seems to work well. Network data collection should be collected in advance of a crime on notice of foul intent if possible.

Defined enterprise policies and requirements are a key component to having data collection readiness. Included in these policies should be tools designed to capture the data as it plays out over the network system. These tools can be defined as an overall network data collection process that includes but are not limited to;

· Training

· Retaining the information

· Prevention of unknown activities

· Protecting the evidence

· Speedy investigative processes

A network model can be developed in order to incorporate these processes into a data collection and analysis process that can be fine-tuned into an efficient and effective network data collection system that produces results. Processes and Policies should be constantly reviewed for efficiency and effectiveness and changed as needed in order to collect accurate answers in forensic science.

References:

Rowlingson, Robert. (2004). A Ten Step Process for Forensic Readiness. Retrieved March 2, 2020, from: https://www.utica.edu/academic/institutes/ecii/publications/articles/A0B13342-B4E0-1F6A-156F501C49CF5F51.pdf

Reply needed 3 In most situations where large amounts data traverse such an ISP the logs/data is only kept for at most a couple of weeks due to the immense amount of data. The only way this can be changed without driving up the costs for data storage hubs is to invest some type of mass storage techniques which allow for saving grater amounts of data in smaller areas at cheaper costs. We know from Moore’s Law that we can only go so small with the components such as transistors and the smaller they are the closer together they are and the more issues we have with heat. We must find an alternative solution that does not involve microtransistors. Just looking at the amount of entertainment videos that get downloaded each day is tremendous now that we have Netflix, Amazon, Disney, etc. There may be an option where such well known files can be assigned a hash value and then excluded from the other data being saved. This is often done in forensics tools such as Encase and FTK.

Source: Wasim Ahmad Bhat. (2018). Long-term preservation of big data: prospects of current storage technologies in digital libraries. Library Hi Tech, 36(3), 539–555. https://doi-org.ezproxy.umuc.edu/10.1108/LHT-06-2017-0117

Reply 4 needed CRACKING DES

The “Data Encryption Standard” is a symmetric-key satisfying determine written by the Nation’s Constitute involving Criteria together with Technology. “DES” may be a use of the latest “Feistel Cipher”. It again incorporates 16 around “Feistel” hypothesis. The block size is “64-bit”. However, key length is “64-bit”, “DES” has a compelling key length of “56 bits” since the encryption calculation does not utilize 8 of the 64 bits of the key. The correct approach to crack “DES” is with extraordinary reason equipment.

There are commonsense breaking points to the crucial sizes which can be broken by savage constrain seeking, yet since “NSA” intentionally restricted the key size of “DES” to “56 bits”, back in the “1970’s” the point at which it planned, “DES” is crackable by animal compel. Today’s innovation won’t have the capacity to break different figures with “64-bit or 128-piece” keys or it may. No one will distinguish pending they have attempted, and distributed the subtle elements of the logical investigation. Most such figures have altogether different inner structure than DES (Foundation, 1998).

That “Electric Frontier Cornerstone” created a machine to kick “DES” just by broad imperative inquiry. This specific appliance had been useful to fathom a “RSA DES II” Challenge Contest, sweepstakes inside of “3 days”. Equal to selling price to make sure you go over the device had been within “$250.000”. That ideas for this purpose embark together with the vast outlines on the DES Christmas cracker depict found in the hem eBooks `Cracking DES, Secrets of Layer Groundwork, Wiretap Governmental policies and then Processor Style and design (Foundation, 1998).

Machines worked out of “FPGAs” really exist in the commercial flaunt to get utilization in reenacting big brand-new chip shot packages vendor chip shot manufacturer. A acquiring in numerous typically minimal “FPGA” chips are usually built to help you reenact an individual particularly competent tailor-made chip shot, with hurt that the from 1/tenth or possibly “1/100th” with the swiftness that you’re bound to happen tailor-made chip shot would keep on running.

This approach proficiency will be as used by chip shot game makers to the office all the “glitches” from the chip shot prior to when looking at all the high-priced not to mention cumbersome footstep in developing body chips because of their plan.

Reference

Foundation, E. F. (1998). Cracking DES: secrets of encryption research, wiretap politics & chip design. Electronic Frontier Foundation.

Reply 5 needed In order to brute force crack DES, 2^55 keys need to be tested (Tate, 2018). For today’s strongest computing speeds, that’s hardly an issue and can be done quickly enough to render DES as weak and unsafe to use. However, in the 1970s when it first debuted, DES seemed like one of the strongest ciphers. For example, the first mainstream computer introduced in 1978, the Vax 11/780, was capable of 1 million operations per second and could test around 2,500 keys per second (Tate, 2018). At this speed, it would take the Vax up to half a million years to brute force the DES encryption (Tate, 2018). But as computing speed increased, brute force attacks became more and more of an issue. In 1998, the Electronic Frontier Foundation built a computer named “Deep Crack” to brute force the DES within three days (Tate, 2018). At the time Deep Crack cost around $250,000 but recently the price came down to as little as $10,000 to create (Tate, 2018).

References:

Tate, S. R. (2018, February 1). The advanced encryption standard. [PDF file]. Retrieved from https://www.uncg.edu/cmp/faculty/srtate/580/aeshandout.pdf

Reply 6 needed: Researching attempts to crack AES isn’t the easiest quest because most analysts know AES is unlikely to be cracked any time in the near future (at least with our foreseeable computational abilities). But in order for a “break” to be published, and algorithm simply needs to be proven that it can be exploited in a way that is faster than a standard brute-force. This does not dictate whether the algorithm is safe to use, just that there are methods to crack it faster.

We can start by stating definitively that AES has not been cracked; however, in 2011, Microsoft did uncover a vulnerability that would reduce the time it takes to crack AES by a factor of 3-5 times (Jackson, 2011). This was known as the Biclique Cryptanalysis method. This is a key recovery attack that works on all three variants of AES: 128, 192, and 256 (Kotfu, 2011). But this is theoretical and mathematical; it cannot be put to use due to its complexity and practicality. The published paper itself states that the complexity of the attacks doesn’t threaten AES in any way (Bogdanov, Khovratovich, Rechberger, 2011).

To put it in perspective, this method reduces the computations to break AES from 2^128 down to 2^126.1. In practice, in 2011, that was a reduction from > 1 quadrillion years to ~300+ trillion years. A large reduction mathematically but without real impact to the practical applications of AES. Still it points to the idea that attack methods exist and they do improve.

In the end AES is safe. Even quantum computing may not have enough computational power to brute-force AES in any reasonable time. But algorithms don’t last forever and eventually AES will be officially “cracked” and not just shown to have these small vulnerabilities.

References:

Bogdanov, A. Khovratovich, D. & Rechberger, C. (2011). Biclique Cryptanalysis of the Full AES. Retrieved from https://eprint.iacr.org/2011/449.pdf

Jackson, J. (2011). AES proved vulnerable by Microsoft researchers. Retrieved from https://www.computerworld.com/article/2510510/aes-proved-vulnerable-by-microsoft-researchers.html

Kotfu. (2011). What does it take to hack AES? Retrieved from https://www.kotfu.net/2011/08/what-does-it-take-to-hack-aes/

Reply 7 needed: Breaking the DES algorithm is a very challenging proposition but it can be done. In 1998, during a money challenge, Rocke Verser, with the help of team leaders Matt Curtin and Justin Dolske decided to tackle the challenge of cracking the DES algorithm . They theorized that attempting different algorithms and eliminating the failed algorithms, they would eventually crack the DES algorithm. They were eventually successful in their attempt by linking many computers together and a team of computing resources to process and eliminate all the wrong algorithms. Their attempt is known as Brute Force attacking where a challenger attempts different algorithms until the specific algorithm is found to encipher the challenge phrase.

This is a way to crack the DES and has been proven successful but is not very practical for everyday use. Other challengers have attempted the same process and have cracked the algorithm in a quicker time since the original attempt, but still it was completed through impractical practices.

References:

Scott, Jerry. (1997). The RSA Secret-Key Challenge. Retrieved March 2, 2020, from: https://www.tjscott.net/crypto/des.hack.htm

Welcome to originalessaywriters.com, our friendly and experienced essay writers are available 24/7 to complete all your assignments. We offer high-quality academic essays written from scratch to guarantee top grades to all students. All our papers are 100% plagiarism-free and come with a plagiarism report, upon request

Tell Us “Write My Essay for Me” and Relax! You will get an original essay well before your submission deadline.