Gábor Ivanyos

Institute for Computer Science and Control — Hungary

Computer Science · Physical Sciences

18h-index1.2kcitations117works1.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Coding theory and cryptography(65), Quantum Computing Algorithms and Architecture(32), Complexity and Algorithms in Graphs(28), graph theory and CDMA systems(19), Cryptography and Data Security(18)

Publications117 total

Faster Isomorphism Testing of <i>p</i> -Groups of Frattini Class 2
SIAM Journal on Computing·2025
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
arXiv (Cornell University)·2025Open Access
Faster Isomorphism Testing of $p$-Groups of Frattini Class 2
2024· 2 cited
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
Designs Codes and Cryptography·2024· 5 citedOpen Access
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
arXiv (Cornell University)·2024Open Access
Zero sum subsequences and hidden subgroups
Quantum Information Processing·2024Open Access
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
arXiv (Cornell University)·2023Open Access
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH
arXiv (Cornell University)·2023Open Access
Zero sum subsequences and hidden subgroups
arXiv (Cornell University)·2023Open Access
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions
Society for Industrial and Applied Mathematics eBooks·2023· 1 cited
Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH
Lecture notes in computer science·2023· 9 citedOpen Access
An exact quantum hidden subgroup algorithm and applications to solvable groups
Quantum Information and Computation·2022· 1 cited
An exact quantum hidden subgroup algorithm and applications to solvable groups
arXiv (Cornell University)·2022Open Access
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
Discrete logarithm and Diffie-Hellman problems in identity black-box groups
arXiv (Cornell University)·2019· 1 citedOpen Access
Discrete logarithm and Diffie-Hellman problems in identity black-box\n groups
arXiv (Cornell University)·2019Open Access
Explicit equivalence of quadratic forms over <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mrow><mml:mi mathvariant="double-struck">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math>
Finite Fields and Their Applications·2018· 8 cited
On learning linear functions from subset and its applications in quantum computing
arXiv (Cornell University)·2018· 1 citedOpen Access
Constructive non-commutative rank computation is in deterministic polynomial time
Computational Complexity·2018· 57 cited
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing
Society for Industrial and Applied Mathematics eBooks·2018· 2 citedOpen Access
page 1 of 6Next →

Frequent Co-authors

Miklós Sántha(15), Youming Qiao(10), K. V. Subrahmanyam(7), Lajos Rónyai(6), Katalin Friedl(5), Marek Karpiński(5), Frédéric Magniez(4), Nitin Saxena(3), Arjeh M. Cohen(3), Luc Sanselme(3), Péter Kutas(3), Pranab Kumar Sen(2), Yves F. Verhoeven(2), Willem A. de Graaf(2), Muhammad Imran(2), László Babai(1), Robert Beals(1), Jin‐Yi Cai(1), Eugene M. Luks(1), A. L. Chistov(1)