| Breaking ONE.FIVIUM by AIDA an Algebraic IV Differential Attack M Vielhaber IACR Cryptol. ePrint Arch. 2007 (413), 2007 | 172 | 2007 |
| Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles H Niederreiter, M Vielhaber Journal of Complexity 13 (3), 353-383, 1997 | 53 | 1997 |
| AIDA Breaks BIVIUM (A&B) in 1 Minute Dual Core CPU Time. M Vielhaber IACR Cryptol. ePrint Arch. 2009, 402, 2009 | 31 | 2009 |
| Simultaneous shifted continued fraction expansions in quadratic time H Niederreiter, M Vielhaber Applicable Algebra in Engineering, Communication and Computing 9 (2), 125-138, 1998 | 13 | 1998 |
| Structural and computational complexity of isometries and their shift commutators MPC Chacón, M Vielhaber Electronic Colloquium on Computational Complexity, ECCC TR04–057, 2004 | 10 | 2004 |
| Computation of functions on n bits by asynchronous clocking of cellular automata M Vielhaber Natural Computing 12 (3), 307-322, 2013 | 9 | 2013 |
| Speeding up AIDA the algebraic IV differential attack by the fast Reed-Muller transform M VIELHABER Intelligent Decision Making Systems, 504-513, 2010 | 9 | 2010 |
| An algorithm for shifted continued fraction expansions in parallel linear time H Niederreiter, M Vielhaber Theoretical computer science 226 (1-2), 93-104, 1999 | 9 | 1999 |
| Tree complexity and a doubly exponential gap between structured and random sequences H Niederreiter, M Vielhaber Journal of Complexity 12 (3), 187-198, 1996 | 9 | 1996 |
| A unified view on sequence complexity measures as isometries M Vielhaber International Conference on Sequences and Their Applications, 143-153, 2004 | 7 | 2004 |
| Computing by temporal order: asynchronous cellular automata M Vielhaber arXiv preprint arXiv:1208.2762, 2012 | 6 | 2012 |
| Improved results on the probabilistic theory of the joint linear complexity of multisequences H Niederreiter, M Vielhaber, LP Wang Science China Information Sciences 55, 165-170, 2012 | 5 | 2012 |
| Moments for generalized Farey-Brocot partitions N Moshchevitin, M Vielhaber Functiones et Approximatio Commentarii Mathematici 38 (2), 131-157, 2008 | 5 | 2008 |
| Continued Fraction Expansion as Isometry – The Law of the Iterated Logarithm for Linear, Jump, and-Adic Complexity M Vielhaber IEEE transactions on information theory 53 (11), 4383-4391, 2007 | 4 | 2007 |
| Reduce-by-Feedback: Timing resistant and DPA-aware Modular Multiplication plus: How to Break RSA by DPA M Vielhaber Cryptographic Hardware and Embedded Systems–CHES 2012: 14th International …, 2012 | 3 | 2012 |
| On the fractal nature of the set of all binary sequences with almost perfect linear complexity profile H Niederreiter, M Vielhaber Communications and Multimedia Security: Proceedings of the IFIP TC6, TC11 …, 1995 | 3 | 1995 |
| Projektorientierte Studieneingangsphase: Das Berufsbild der Informatik und Wirtschaftsinformatik schärfen K Vosseberg, S Czernik, U Erb, M Vielhaber HDI 2014–Gestalten von Übergängen: 6. Fachtagung Hochschuldidaktik der …, 2015 | 2 | 2015 |
| Shamir’s “cube attack”: A remake of aida, the algebraic iv differential attack M Vielhaber | 2 | 2009 |
| The asymptotic normalized linear complexity of multisequences M Vielhaber, MPC Chacón Journal of Complexity 24 (3), 410-422, 2008 | 2 | 2008 |
| Kettenbrüche, Komplexitätsmaße und die Zufälligkeit von Symbolfolgen M Vielhaber na, 1997 | 2 | 1997 |
