Implementation And Application Of Dynamic One-way Trapdoor Function

With the increasingly widespread of network application pattern likee-commerce， and e-government， the problem about how to clarify the useridentification in the internet has been a key problem. There are some certificationsystems，and they are mainly in the way of IBC or CBC. Compare to CBC，theadvantage of IBC is to simplify authorize and management progress of certificationsystem. However，the existing IBC authentication method always bind user public keynaturally with its identification，and the disadvantage of it is “public key dead”. Thispaper propose a definition of Dynamic One-way Trapdoor Function based on that ofOne-way Trapdoor Function，this method is convenient to bind two objects. On thecontrary，the IBC authentication method can bind its identification with public keythrough user’s public key instead of user’s identification. Therefore, the “public keydead” problem existed in the IBC can be solved.This paper propose the definition of Dynamic One-way Trapdoor Function toprevent the problem. As the (D-OWTF), it means a pairs of functionf (z, x),t (z)，and to put any givenz into D-OWTF。There will be：1. it is simple to compute for2. it is unfeasible to compute3. if the t0=t (z0)has already been known, it is simple to compute x=f1D-OWTF is a set of OWTF，and each OWTF in set can be set by z. Put [f(z,x),t(z)] as the public key and private key of AA (Authentication Authority). For (z0, y0), AA compute x0to get y0=fz0(x0), then x0can be seen as the "signatures" of binding relation (z0, y0) of AA.Using D-OWTF, it is simple for AA to bind any pair of attributes (z,y)> and can pass the public key certification from users for anyone. Applying the attributes of D-OWTF above can prevent the "public key dead" problem effectively during the application.This paper present a D-OWTF construction program based on the HFMS-PKC. HFMS-PKC is proposed based on the difficulty of BMQ problem. And BMQ problem is to solve the Bisectional Multivariate Quadratic equations solving problem on the finite field. It is a special case in MQ problem. It is known that the3-coloring problem is fully NP on G, and the3-coloring problem can be approximate as the equation group E, and the BMQ problem is also fully NP. Therefore, the HFMS-PKC is credible.According to the D-OWTF construction program proposed in this paper, the author will apply it in the railway ticket system to certify that this program is more convenient to bind the ticket information and the passenger information together, and the D-OWTF can verify the identification of passengers through the ticket information while the passengers information will also be protected safely to some extent.