Question (Use Sage):
The following describes the simple hash function:
Choose p, q primes and compute N = pq.
Choose g relatively prime to N and less than N.
Then a number n is hashed as follows:
H = gn mod N
If there is an m that hashes to the same value as n, then
gm ≡ gn mod N
gm-n ≡ 1 mod N
which implies that
m –n ≡ 0 mod φ (N)
So breaking this amounts to finding a multiple of φ (N), which is the hard problem in RSA.
Write a function that takes a bit length n and generates a modulus N of bitlength n and g less than N and relatively prime to it.
Show the output of your function from part (a) for a few outputs.
Using N, g, n as arguments write a function to perform the hashing.
For the following parts (a)-(d) compute the simple hash:
N = 600107, g = 154835, n = 239715
N = 548155966307, g = 189830397891, n = 44344313866
N = 604766153, g = 12075635, n = 443096843
Write a function that creates a collision given p and q. Show that your function works for a couple of examples.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.Read more
Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.Read more
Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.Read more
Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.Read more
By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.Read more