Problem
Research questions and friction points this paper is trying to address.
Stickel-type key exchange
hidden subspaces
witness-finding cryptanalysis
public subspaces
matrix multiplication
Stickel-type key exchange with hidden subspaces
🤖 AI Summary
Stickel-type key exchange schemes are vulnerable to polynomial-time attacks due to their reliance on public subspaces. This work proposes a novel key establishment protocol that circumvents existing subspace-analysis attacks by generating the shared key through a privately conjugated hidden subspace. The approach introduces, for the first time, the technique of subspace conjugation hiding into key agreement protocols and demonstrates that its underlying hard problem—the witness-finding problem—is reducible to Edmonds’ problem, which is NP-hard. By leveraging bilateral multiplication over n×n matrices over finite fields and employing rigorous complexity-theoretic reductions, the proposed scheme not only resists known attacks but also enjoys a solid foundation in computational complexity theory.
📝 Abstract
We give a witness-finding cryptanalysis of Stickel-type key exchange schemes, which involve two-sided multiplication of $n \times n$ matrices over $\mathbb{F}_p$, where these matrices are drawn from public subspaces with a particular commuting structure. This analysis covers Stickel's original proposal , Shpilrain's polynomial extension of that scheme, Nager's algebraic extension of that scheme, and more generally all Stickel-type approaches using public subspaces over matrix algebra in finite fields: all such schemes can be broken in polynomial time. We also describe a new key establishment scheme using two-sided matrix multiplication in which the commuting subspaces used to form the key are hidden via conjugation by private terms, blocking this specific public-subspace analysis; the witness-finding problem in this new scheme has a direct reduction from a standard NP-hard problem (Edmonds' problem).
Innovation
Methods, ideas, or system contributions that make the work stand out.
Stickel-type key exchange
hidden subspaces
witness-finding cryptanalysis
matrix conjugation
Edmonds' problem
🔎 Similar Papers
No similar papers found.
