Implement a program that tries successive values of r, i.e., r = 0, 1, 2, 3, . . ., computes H(s||r), compares it with t and halts whenever H(s||r) < t, with the output r. You need to provide the program and the output r. (b) Modify the program from part (a) by adding i to s, where i = 0 to 999 inclusive, and for each i computing the hash until the value falls before the target. What is the average number of attempts (over 1,000) before you found the target? You need to provide your program. (c) If you drew random values between 0 and 2255 inclusive, how many attempts on average it would take before you find a value below the target? What does it tell you about SHA-256?

Implement a program that tries successive values of r, i.e., r = 0, 1, 2, 3, . . ., computes H(s||r), compares it with t and halts whenever H(s||r) < t, with the output r. You need to provide the program and the output r. (b) Modify the program from part (a) by adding i to s, where i = 0 to 999 inclusive, and for each i computing the hash until the value falls before the target. What is the average number of attempts (over 1,000) before you found the target? You need to provide your program. (c) If you drew random values between 0 and 2255 inclusive, how many attempts on average it would take before you find a value below the target? What does it tell you about SHA-256?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Implement the following function in C programming language that get a string, and compute an array of non-empty tokens of the string containing only lower-case letters. For example: ● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"]. ● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"]. ● For a string "abc 12EFG hi ", the list of such tokens is ["ab","hi"]. ● For a string " abc ", the list of such tokens is ["abc"]. ● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at the tokens with lower-case letters only . The function get_tokens gets a string str, and returns the array with the tokens containing only lower-case letters in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str); For example:● get_tokens("abcEFaG…
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
We have to create a program in java in which the below mentioned things should be there- You have been given the head to a singly linked list of integers. Write a function check to whetherthe list given is a 'Palindrome' or not.Input Format:Elements of linked listOutput Format:True or FalseSample Input 1:9 3 2 2 3 9Sample Output 1:trueSample Input 2:0 2 3 2 5Sample Output 2:false
• Develop a Java program for Universal Hashing to solve the following problem with the help of any E-learning resources. • Add appropriate comments and explanations in your program. Give the above Input and show the Output. •
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following(attached) is the expected output:
What is the conceptual problem with the following snippet of Apache Sparkcode meant to work on very large data. Note that the collect() function returnsa Java collection, and Java collections (from Java 8 onwards) support map andreduce functions.JavaRDD<String< lines = sc.textFile("logDirectory");int totalLength = lines.collect().map(s −> s.length()).reduce(0,(a,b) −> a+b);
Interpreter.java is missing these methods in the code so make sure to add them: -print, printf: Exist, marked as variadic, call Java functions -getline and next: Exist and call SplitAndAssign -gsub, match, sub, index, length, split, substr, tolower, toupper: Exist, call Java functions, correct return Below is interpreter.java import java.util.ArrayList; import java.util.HashMap; import java.util.List; public class Interpreter { private HashMap<String, InterpreterDataType> globalVariables; private HashMap<String, FunctionDefinitionNode> functions; private class LineManager { private List<String> lines; private int currentLineIndex; public LineManager(List<String> inputLines) { this.lines = inputLines; this.currentLineIndex = 0; } public boolean splitAndAssign() { if (currentLineIndex < lines.size()) { String currentLine = lines.get(currentLineIndex);…
Java Programming In your program, you will demonstrate an understanding of all these concepts by developing your own priority queue, node, binary tree, array and/or linked list, and use of recursion to support the Huffman Code encryption algorithm. Read through the theory of the Huffman Code in the text and then write a program that can take a String and encrypt it. For example, given a String “Hello World”, the program should apply the Huffman Code algorithm on that String to create the corresponding encrypted code sequence. In addition, you must be able to show the various components that support creating the encrypted String. For the Huffman Code, this requires the following: Creating a frequency table for each character of the String (I suggest this to be an array but can be done as a linked list) Creating a Huffman Tree from the frequency table (This will require use of a priority queue and a binary tree) Creating the Huffman Code table (This should be an array and will…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
In Python, The function concatAltChars takes a string parameter s and a boolean parameter even; the function concatenates together either the even-position characters of s or the odd-position characters of s, depending on whether even is True, or False, respectively. The accumulated string is returned. For example, the even-indexed characters of "HANOVER" are at indexes 0, 2, 4, and 6: H N V R. So, concatAltChars("HANOVER", True) returns the string result "HNVR". But concatAltChars("HANOVER", False) returns the string result "AOE". For example: Test Result s = "goldfinches" print(concatAltChars(s, True)) glfnhs s = "A" print(concatAltChars(s, True)) A s = "A" print(concatAltChars(s, False))
Write a program that animates quadratic probing,as shown in Figure . You can change the initial size of the hash-table in theprogram. Assume the load-factor threshold to be 0.8.
Answer the given question with a proper explanation and step-by-step solution. (Java) Write methods called sum and average that return the sum of all values in the list and the average value as a real number, respectively. For example, if a variable called list stores [11, –7, 3, 42, 0, 14], the call of list.sum() should return 63 and the call of list.average() should return 10.5. If the list is empty, sum should return 0 and average should return 0.0.