Consider a hash function H, which outputs the leading 80 bits of the SHA3-512 digest. Given two html files G.html and H.html, we want to find two files G1.html and H1.html such that• H(G1.html) = H(H1.html)• Semantic of G.html and G1.html are the same. That it, both ren- der the same content in browser. Similarly, semantic of H.html and H1.html are the same.The sizes of G.html and H.html are large. When divided into SHA3 blocks, each consists of around 215 blocks. The file folder include an example of G.html.
(a) Give a practical algorithm that find G1.html and H1.html. Practical in the sense that it can be implemented and run in a typical high performance desktop.(b) Suppose the machine is able to compute hashes of 220 blocks in one second, estimate the time taken by you algorithm. You have to take into account housekeeping task if they are significant compare to the hash computation. In such cases, give a reasonable estimate of the time taken by the housekeeping1. Take special note that SHA3 is an iterative hash.
According to https://en.wikipedia.org/wiki/SHA-3, implementations of SHA3 take around 50 cycles per byte on single core. For blocksize of 32 bytes, seems reasonable to assume 220 blocks per second on a typical 3GHz machine.
We always make sure that writers follow all your instructions precisely. You can choose your academic level or professional level, and we will assign a writer who has a respective degree.
We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.
If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document.
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension.A 100% refund is guaranteed.
We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text.
Tutorpro support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
At Tutorpro, we have top rated masters and PhD writers who will help you tacke that homework and score A+ grade. Tutorpro services covers all levels of education : high school, college, university undergraduate, masters and PhD academic level.
No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.
An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.
Tutorpro academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.
If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. This is free because we want you to be completely satisfied with the service offered.