Optimal Marginal Mixing for Transvection-Based Trapdoored Matrices over Large Fields

Reported by arXiv cs.CR (Mark Braverman, Aayush Jain, Stephen Newman)

Summary by Cyber Security News5 Nov 2026, 06:00 CET

About this summary. This is a short excerpt from the description that arXiv cs.CR published with its article. Cyber Security News did not report or verify the underlying story. Read the original: https://arxiv.org/abs/2611.05573

arXiv:2611.05573v1 Announce Type: new Abstract: \emph{Trapdoored matrices} are pseudorandom matrices admitting a fast matrix-vector multiplication algorithm given the secret key. We study a candidate family of such matrices: matrices generated by short random \emph{transvection walks} on \(\mathrm{SL}_n(\mathbb{F}_q)\), whose steps are given by adding a random multiple of a random row of the current state to another.

Read the full article at arXiv cs.CR →

Source attribution: headline and facts are from arXiv cs.CR (arxiv.org). Summary method: excerpt of the source description. See our source attribution policy.

Related coverage

🏴☠️ Dark project has just published a new victim : Custom Bakehouse

U.S. Charges Canadian Man in Alleged Hack of University Supercomputers

🏴☠️ Thegentlemen has just published a new victim : Airdrie Christian Academy

AQUA - A Modular Authentication Quality Modeling Framework

Constraint-Aware Evaluation of Reinforcement Learning and Unsupervised Anomaly Detection for Security Operations Alert Triage

Private Vulnerability Testing for User Oversharing