New Section on Brassard Hoyer Tapp (BHT) Algorithm

[Gopal-Dahale]

What should the reader gain from this new content?

After reading this chapter, the student will understand the application of Grover's search in finding collisions in cryptographic hash functions. The student will learn how efficient this is and also its limitations. The student will understand that not every quantum algorithm described is the best suitable and sometimes classical algorithms with the help of parallelization can outperform them (in this case it is the Parallel Rho algorithm).

Where do you expect this new content to fit in with the current content?

Either in Chapter 4, section 4.2 Implementations of Recent Quantum Algorithms, or a separate section needs to be created in chapter 4 specifically for applications of quantum algorithms in cryptanalysis.

What material should this new content be based on?

The content is based of the paper by Gilles Brassard, Peter HØyer & Alain Tapp namely Quantum cryptanalysis of hash and claw-free functions. Also, Analysis of several algorithms for the collision problem by Bernstein will be used to discuss the limitations of the BHT algorithm.

Are you proposing to write this new content? (y/n)

Yes, I have studied applications of Grover's algorithm in quantum cryptanalysis in depth during a course called "Quantum Symmetric-key cryptanalysis" in my BTech at IIT Bhilai.