The Isomorphism of Polynomials Problem is a computational problem in multivariate cryptography that consists in determining whether two sets of multivariate quadratic polynomials are related by an invertible linear transformation of variables, serving as a foundational hardness assumption for the security of certain cryptosystems.
27
Publications
1.1K
Citations
39
Authors
28
Institutions
Publications per year
2017–2026
1
Publications
27
The Isomorphism Problem for Hyperbolic Groups I
Zlil Sela · Annals of Mathematics · 1995 · 127 citations
On two conjectures about polynomial rings
Narasimha Kumar · Inventiones mathematicae · 1978 · 99 citations
Algebraic properties of cryptosystem PGM
Spyros S. Magliveras, Nasir Memon · Journal of Cryptology · 1992 · 59 citations · Full text
1–5 of 27
Authors
39
- NK
2
h-index
- MM
2
h-index
- KK
1
h-index
- ZS
1
h-index
- SC
1
h-index
1–5 of 39
Institutions
28
Bar-Ilan University
Ramat Gan, Israel
2 h-index
2 publications
64 citations
Tata Institute of Fundamental Research
Mumbai, India
1 h-index
1 publications
99 citations
Laboratoire de Géologie de l’École Normale Supérieure
Paris, France
1 h-index
2 publications
28 citations
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
25 citations
Université de Lille
Lille, France
1 h-index
1 publications
30 citations
The Ohio State University
Columbus, United States
1 h-index
1 publications
38 citations
The University of Melbourne
Melbourne, Australia
1 h-index
1 publications
17 citations
University of Houston
Houston, United States
1 h-index
1 publications
38 citations
1–8 of 28
Venues
- Journal of Pure and Applied Algebra
3 publications · 93 citations
3
h-index
- Discrete Mathematics
2 publications · 64 citations
2
h-index
- Proceedings of the Japan Academy Series A Mathematical Sciences
1 publications · 13 citations
1
h-index
- Future Generation Computer Systems
FGCS · 1 publications · 11 citations
1
h-index
- Journal of Mathematical Cryptology
JMC · 1 publications · 14 citations
1
h-index
1–5