Pages that link to "Item:Q2349096"
From MaRDI portal
The following pages link to Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096):
Displayed 5 items.
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property (Q2333818) (← links)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)