Ruhr-Uni-Bochum
HGI

Copyright: HGI, stock.adobe.com: chinnarach

CASA Invited Talk with Elena Kirshanova (Technology Innovation Institute, Abu Dhabi, UAE)

A quasi-polynomial time quantum algorithm for the extrapolated dihedral coset problem

Porträt Frau mit braunen kinnlangen Haaren vor unscharfem Hintergrund. Es handelt sich dabei um Elena Kirshanova.

Copyright: Kirshanova

We cordially invite you to our next CASA Invited Talk on July 21, 2026. Talks typically run for about an hour and are followed by an open discussion with the audience. The talks aim to encourage dialogue and open new perspectives in cybersecurity research.

When: July 21, 2026, 2 PM

Where: Building MC, Open Space (ground floor)

Online Participation: Zoom

Abstract: In this talk I will present a quantum algorithm for the Extrapolated Dihedral Coset Problem (EDPC) — a quantum variant of the Learning with Errors problem. The algorithm has quasi-polynomial time and sample complexity, which is the fastest way to solve EDCP for some interesting parameters. I will touch upon challenges in extending this result to the ring- and module- setting. The talk is largely based on the joint work with Shi Bai, Hansraj Jangir, Tran Ngo, and William Youmans.

Bio: Elena Kirshanova is a lead cryptographer in Cryptography Research Center at Technology Innovation Institute. She received her PhD from Ruhr University Bochum advised by Prof. Dr. Alexander May and was a Postdoc at ENS Lyon in AriC team supervised by Prof. Dr. Damien Stehlé. Her work encompasses classical and quantum algorithms for lattice- and code-based problems, as well as efficient implementations of lattice-based attacks.

General note: In case of using gender-assigning attributes we include all those who consider themselves in this gender regardless of their own biological sex.