International Association
for Cryptologic Research

This work fall within the cadre of Cryptanalysis. Because, under

certain condition, we would give a fairly simple method to solve

the CDHP (the Problem Computational of Diffie and Hellman) and

others problems associated to it. Since, solving this problem, will help

us to provide a solution to the BDH (Problem Bilinear of Diffie and

Hellman). The CDHP and BDHP are the heart of many cryptosystems

in the point of view security, so solving it may be a threat to this

cryptosystem\'s. To elucidate this, we use a concept of geometry

algebraic named Tate Pairing.

This work is purely theoretical, we give firstly an overview on the

idea and we illustrate it by an examples to see its efficiency.