 Hello everyone. My name is Jun Xu. I'm from Institute of Information Engineering, Chinese Academy of Science. Next, I will give an introduction for our paper. The title is Improven Bounce on Elliptic Coal Hidden Lumber Problem for ECDH King Exchange. At Iron Crypt, 271, Belay, Helaway, and Hall Gravegram, first introduced Elliptic Coal Hidden Lumber Problem for short ECHMP in order to expect the result of bid secrecy for ECDH King Exchange on a fixed Coal. At PKC 2017, Shanning gave a Divi Herman version of ECHMP called Shanning's ECHMP. Shanning used this version to get the faster rigorous bid secrecy result of ECDH on a fixed Coal. Shanning's ECHMP can be viewed as an Elliptic Coal analogy of the Hidden Lumber Problem for short HMP. Similar to the HMP Problem, Shanning's ECHMP can be also used for practical cryptocurrencies of ECDH King Exchange in the case of side channel attacks. In this work, we revisited the Corpusmith method to save the system of modular polynomial equations. From Shanning's ECHMP, we concede the compilation of original polynomial under constructed enough help for polynomials for the Corpusmith method compared to previous work. We showed that Shanning's ECHMP can be solved for any constant output functions in polynomial time. Before this work, the best result is that Shanning's ECHMP can be solved in polynomial time when the output function equals 1 over 2, which is a typical result use the Corpusmith method in other words, we significantly improve the bound because of the heuristic involved in the Corpusmith method. We do not get the rigorous bid secrecy for ECDH King Exchange on a fixed Coal. We verified the heuristic on Lister Curves use experiments for small-dimension netties. That's all. Thanks for your listening.