Welcome to the resource topic for 2024/201
Breaking the decisional Diffie-Hellman problem in totally non-maximal imaginary quadratic orders
Authors: Antonio SansoAbstract:
This paper introduces an algorithm to efficiently break the Decisional Diffie-Hellman (DDH) assumption in totally non-maximal imaginary quadratic orders, specifically when \Delta_1 = 3, and f is non-prime with knowledge of a single factor. Inspired by Shanks and Dedekind’s work on 3-Sylow groups, we generalize their observations to undermine DDH security.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .