A hybrid guess-and-solve algebraic attack recovers an equivalent Gabidulin decoding key for all proposed EGMC encryption parameter sets, cutting one 128-bit security claim to about 35 bits.
In: International Conference on the Theory and Application of Cryptology and Information Security
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.CR 1years
2026 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes
A hybrid guess-and-solve algebraic attack recovers an equivalent Gabidulin decoding key for all proposed EGMC encryption parameter sets, cutting one 128-bit security claim to about 35 bits.