Anna-Lena Horlemann
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Crypto×2Info Theory×2
Frequent co-authors
Research Timeline
2026
The Power of Power Codes: New Classes of Easy Instances for the Linear Equivalence Problem
This paper identifies new, algebraically weak classes of instances for the Linear Equivalence Problem (LEP) by generalizing techniques from the Permutation Equivalence Problem (PEP) using power codes and Frobenius automorphisms.
Distinguishers for Skew and Linearized Reed-Solomon Codes
The paper proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random codes.
Highlighted terms show continued research focus across papers
Papers
cs.CRcs.ITRecentApr 14, 2026
Distinguishers for Skew and Linearized Reed-Solomon Codes
The paper proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random code…
View →
cs.CRcs.ITRecentMar 24, 2026