Unix systems use a hash algorithm to hide passwords. One weakness to this system is the brute force or dictionary attack. To make the system stronger, a added to the entered password before hashing. A/ is

Implement a hash table and write a function to find the most frequently occurring word in a large text file.

Find out what risks are involved with the various authentication techniques and suggest a way to deal with the following situation.Bob uses a cryptographic hash function to check a password against a cache of other hashes.Bob performs a cryptographic hash on a password and checks it against a database of previously double-hashed passwords.

You are employed by the NSA (National Security Agency) and you have received the following   message that contains the following text:   “George Smiley arrived in Prague on Friday evening at 10:50 PM. ……”          See TTS.txt   A quick analysis of text can be achieved by storing each word  in a hash table.  After storing all words in a hash table you will then be able to print all the words stored in each row of the hash table. Requirements:     Create a hash key value (int Key) and init to a prime value (13)     Create an array of string pointers S_ptr[13]     Each string pointer, S_ptr[i], should allocate on the heap an array of strings (size 35)     Initialize all row elements of hash table with ‘#’     Read the text, one word a time, and compute its hash index value (int Hash(string Word)     The Hash function should take the numerical sum of all the characters in the Word and calculate (Sum%Key )which is then output to the program as an Index.  Recognize that output Index can…

You are given an array prices where prices[i] is the price of a given stock on the ith day.   You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.   Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.       Example 1:   Input: prices = [7,1,5,3,6,4] Output: 5 Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5. Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell. Example 2:   Input: prices = [7,6,4,3,1] Output: 0 Explanation: In this case, no transactions are done and the max profit = 0.   Please solve it in Java

9:05 Part 2: Encryption Details: description Objective: Develop a program that encrypts a plaintext file by XORing 128-bit blocks of the file with a key repeatedly until the entire file is encrypted. • The plaintext file will be a book from Project Gutenberg. Note: Done • The encryption method should use the XOR operation on the file, 128 bits at a time, with the key. • Each 128-bit block is XORed with the same key. • The program should work from the command line and accept three parameters: o The name of the key file Usage: o The name of the plaintext file o The desired name of the resulting ciphertext file This encryption method is not supposed to be secure. ( $ ./bad_streamcipher_enc kf pt ct