Trace Zero Varieties in Cryptography: Optimal Representation and Index Calculus. (Variétés de trace zero en cryptographie : représentation efficace et calcul d'indices). - Maike Massierer (2013)

Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves. - Maike Massierer (IACR Cryptol. ePrint Arch., 2014)

Index calculus in the trace zero variety. - Elisa Gorla; Maike Massierer (Adv. Math. Commun., 2015)

Point compression for the trace zero subgroup over a small degree extension field. - Elisa Gorla; Maike Massierer (Des. Codes Cryptogr., 2015)

Computing -series of geometrically hyperelliptic curves of genus three. - David Harvey; Maike Massierer; Andrew V. Sutherland (LMS J. Comput. Math., 2016)

Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. - Sean Ballentine; Aurore Guillevic; Elisa Lorenzo García; Chloe Martindale; Maike Massierer; Benjamin Smith 003; Jaap Top (CoRR, 2017)

An optimal representation for the trace zero subgroup. - Elisa Gorla; Maike Massierer (Des. Codes Cryptogr., 2017)

Ramanujan graphs in cryptography. - Anamaria Costache; Brooke Feigon; Kristin E. Lauter; Maike Massierer; Anna Puskás (IACR Cryptol. ePrint Arch., 2018)

Feature-based software architecture analysis to identify safety and security interactions. - Priyadarshini; Simon Greiner; Maike Massierer; Oum-El-Kheir Aktouf (ICSA, 2023)

Software architecture based inter-feature analysis of safety and security interactions. - Priyadarshini; Simon Greiner; Maike Massierer; Oum-El-Kheir Aktouf (EDCC, 2024)