Question: Using hashlib.scrypt(), find the following: 1. a value for n where r=64 and p=2 that falls in the same 0.050.001 time window to compute. 2.
Using hashlib.scrypt(), find the following:
1. a value for n where r=64 and p=2 that falls in the same 0.050.001 time window to compute.
2. What the maximum value for n is if r=64 and p=2 before the library throws a ValueError?
3. Adjust maxmem to pow(1024,3) and see how large of a value you can get for n. How long does this take to compute?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
