Feb. 12, 2024, 2:06 a.m. |

IACR News www.iacr.org

ePrint Report: Breaking the decisional Diffie-Hellman problem in totally non-maximal imaginary quadratic orders

Antonio Sanso

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.

algorithm breaking diffie eprint report factor hellman knowledge non prime problem report single

Deputy Chief Information Security Officer

@ United States Holocaust Memorial Museum | Washington, DC

Humbly Confident Security Lead

@ YNAB | Remote

Information Technology Specialist II: Information Security Engineer

@ WBCP, Inc. | Pasadena, CA.

Director of the Air Force Cyber Technical Center of Excellence (CyTCoE)

@ Air Force Institute of Technology | Dayton, OH, USA

Senior Cyber Security Analyst

@ Valley Water | San Jose, CA

Embedded Security Analyst

@ Sibylline Ltd | Mountain View, California, United States