Preprint
Sep 2026
The planted tensor problem over finite fields: algorithms and cryptography
Inspired by the planted clique problem for random graphs, we introduce the planted totally-isotropic space problem for random tensors as follows. Let $U\cong \mathbb{F}_q^n$ and $W\cong \mathbb{F}_q^m$ be finite-dimensional vector spaces over a finite field $\mathbb{F}_q$. Given $d\in \mathbb{N}$, choose a random \(d\)...
Yuxuan Liu, You-Ming Qiao, Gang Tang et al.
· 1 citation