In this paper, we propose a practical signature scheme based on the alternating trilinear
form equivalence problem. Our scheme is inspired by the Goldreich-Micali-Wigderson's zero …

The group isomorphism problem determines whether two groups, given by their Cayley
tables, are isomorphic. For groups with order n, an algorithm with n (log n+ O (1)) running …

Many isomorphism problems for tensors, groups, algebras, and polynomials were recently
shown to be equivalent to one another under polynomial-time reductions, prompting the …

In this article, we study some classical complexity-theoretic questions regarding Group
Isomorphism (GpI). We focus on p-groups (groups of prime power order) with odd p, which …

We study the problems of testing isomorphism of polynomials, algebras, and multilinear
forms. Our first main results are average-case algorithms for these problems. For example …

At Eurocrypt 2022, Tang et al proposed a practical digital signature scheme in the context of
post-quantum cryptography. The construction of that scheme is based on the assumed …

Let p be an odd prime. From a simple undirected graph G, through the classical procedures
of Baer (1938), Tutte (1947) and Lovász (1989), there is a p-group PG of class 2 and …

Left-right and conjugation actions on matrix tuples have received considerable attention in
theoretical computer science due to their connections with polynomial identity testing, group …

An isomorphism problem asks whether two combinatorial or algebraic structures are
essentially the same. Based on the assumed hardness of an isomorphism problem, there is …

Group action based cryptography was formally proposed in the seminal paper of Brassard
and Yung (Crypto 1990). Based on one-way group action, there is a well-known digital …