Cyptanalysis CDHP , BDHP and Tate pairing under certain conditions The Tate pairing is less secure than Weil

Rkia Aouinatou; Mostafa Belkasmi

Paper 2012/277

Cyptanalysis CDHP , BDHP and Tate pairing under certain conditions The Tate pairing is less secure than Weil

Rkia Aouinatou and Mostafa Belkasmi

Abstract

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.

Note: I would like to test this work by your committee

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Not published
Keywords: CDHP BDHP Tate Pairing Function Rational Order of Point Divisor and algorithm of Miller.
Contact author(s): rkiaaouinatou @ yahoo fr
History: 2012-05-29: received
Short URL: https://ia.cr/2012/277
License: CC BY

BibTeX

@misc{cryptoeprint:2012/277,
      author = {Rkia Aouinatou and Mostafa Belkasmi},
      title = {Cyptanalysis {CDHP} , {BDHP} and Tate pairing under certain conditions The Tate pairing is less secure than Weil},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/277},
      year = {2012},
      url = {https://eprint.iacr.org/2012/277}
}