Ugrás a tartalomra

Publikációk

2023

LECTURE NOTES IN COMPUTER SCIENCE, 14440, pp. 99-130. ISSN 0302-9743

Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH

Szerzők
Chen, M
Imran, Muhammad
Ivanyos, Gábor
Kutas, Péter
Leroux, A
Petit, C
Tovább
2023

CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 2023 ISSN 1073-0486

Discrete logarithm and Diffie-Hellman problems in identity black-box groups

Szerzők
Ivanyos, Gábor
Joux, Antoine
Santha, Miklos
Tovább
2023

In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) Society for Industrial and Applied Mathematics, Philadelphia (PA), pp. 4115-4126.

On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions

Szerzők
Ivanyos, Gábor
Qiao, Youming
Tovább
2019

SIAM JOURNAL ON COMPUTING, 48 (3)., pp. 926-963. ISSN 0097-5397

Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing

Szerzők
Ivanyos, Gábor
Qiao, Y
Tovább
2019

FINITE FIELDS AND THEIR APPLICATIONS, 55, pp. 33-63. ISSN 1071-5797

Explicit equivalence of quadratic forms over Fq ( t )

Szerzők
Ivanyos, Gábor
Kutas, Péter
Rónyai, Lajos
Tovább
2018

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 92, pp. 48-64. ISSN 0022-0000

On the complexity of trial and error for constraint satisfaction problems

Szerzők
Ivanyos, Gábor
Kulkarni, R
Qiao, YM
Santha, M
Sundaram, A
Tovább
2018

ERCIM NEWS (112)., pp. 28-29. ISSN 0926-4981

Chevalley-Warning Theorem in Quantum Computing

Szerzők
Ivanyos, Gábor
Rónyai, Lajos
Tovább
2018

ALGORITHMICA, 80 (2)., pp. 560-575. ISSN 0178-4617

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Szerzők
Ivanyos, Gábor
Karpinski, M
Santha, M
Saxena, N
Shparlinski, IE
Tovább
2018

COMPUTATIONAL COMPLEXITY, 27 (4)., pp. 561-593. ISSN 1016-3328

Constructive non-commutative rank computation is in deterministic polynomial time

Szerzők
Ivanyos, Gábor
Qiao, Y.
Subrahmanyam, K.V.
Tovább
2018

In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2357-2376.

Algorithms based on ∗-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

Szerzők
Ivanyos, Gábor
Qiao, Y.
Tovább