1. Thomas Beth, Jörn Müller-Quade, and Rainer Steinwandt, Computing restrictions of ideals in finitely generated k-algebras by means of Buchberger's algorithm, J. Symbolic Comput. 41 (2006), no. 3-4, 372–380.[MR]
  2. Jens-Matthias Bohli, Stefan Röhrich, and Rainer Steinwandt, Key substitution attacks revisited: Taking into account malicious signers, International Journal of Information Security 5 (2006), no. 1, 30–36.
  3. Jens-Matthias Bohli, Rainer Steinwandt, María Isabel González Vasco, and Consuelo Martínez, Weak keys in MST1, Des. Codes Cryptogr. 37 (2005), no. 3, 509–524.[MR]
  4. Willi Geiselmann, Willi Meier, and Rainer Steinwandt, An attack on the isomorphisms of polynomials problem with one secret, Int. J. Inf. Secur. (2003), no. 2, 59-64.
  5. Willi Geiselmann, Jörn Müller-Quade, and Rainer Steinwandt, Comment on: "A new representation of elements of finite fields GF(2m) yielding small complexity arithmetic circuits" by G. Drolet, IEEE Trans. Comput. 51 (2002), no. 12, 1460–1461.[MR]
  6. Willi Geiselmann and Rainer Steinwandt, Cryptanalysis of a knapsack-like cryptosystem, Period. Math. Hungar. 45 (2002), no. 1-2, 35–41.[MR]
  7. Willi Geiselmann and Rainer Steinwandt, A redundant representation of GF(qn) for designing arithmetic circuits, IEEE Trans. Comp 52 (2003), no. 7, 848–853.
  8. Willi Geiselmann and Rainer Steinwandt, A short comment on the affine parts of SFLASHv3, IACR (2003).[eprint]
  9. Willi Geiselmann and Rainer Steinwandt, Yet another sieving device, Topics in Cryptology—CT-RSA 2004, Lecture Notes in Comput. Sci., vol. 2964, Springer, Berlin, 2004, pp. 278–291.[MR]
  10. Willi Geiselmann and Rainer Steinwandt, Cryptanalysis of a hash function proposed at ICISC 2006, Information Security and Cryptology - ICISC 2007, Lecture Notes in Computer Science, vol. 4817/2007, Springer Berlin / Heidelberg, 2007, pp. 1–10.
  11. Willi Geiselmann and Rainer Steinwandt, Non-wafer-scale sieving hardware for the NFS: another attempt to cope with 1024-bit, Advances in cryptology—EUROCRYPT 2007, Lecture Notes in Comput. Sci., vol. 4515, Springer, Berlin, 2007, pp. 466–481.[MR/link]
  12. Willi Geiselmann, Rainer Steinwandt, and Thomas Beth, Attacking the affine parts of SFLASH, Cryptography and Coding, Lecture Notes in Comput. Sci., vol. 2260, Springer, Berlin, 2001, pp. 355–359.[MR]
  13. Willi Geiselmann, Rainer Steinwandt, and Thomas Beth, Revealing the affine parts of SFLASHv1, SFLASHv2, and FLASH, Actas de la VII Reunisn Espaqola de Criptologma y Seguridad de la Informacisn, vol. 7, 2002, pp. 305-314.
  14. María Isabel González Vasco, Martin Rötteler, and Rainer Steinwandt, On minimal length factorizations of finite groups, Experiment. Math. 12 (2003), no. 1, 1–12.[MR]
  15. María Isabel González Vasco and Rainer Steinwandt, Clouds over a public key cryptosystem based on Lyndon words, Inform. Process. Lett. 80 (2001), no. 5, 239–242.[MR]
  16. María Isabel González Vasco and Rainer Steinwandt, Obstacles in two public key cryptosystems based on group factorizations, Tatra Mt. Math. Publ. 25 (2002), 23–37.[MR]
  17. Markus Grassl, Ivana Ilić, Spyros Magliveras, and Rainer Steinwandt, Cryptanalysis of the Tillich–Zémor hash function, J. Cryptology online first (2010), 1-9.[doi/eprint]
  18. Markus Grassl and Rainer Steinwandt, Cryptanalysis of an authentication scheme using truncated polynomials, IACR (2008), 4 pages.[eprint]
  19. Markus Grassl and Rainer Steinwandt, Cryptanalysis of an authentication scheme using truncated polynomials, Inform. Process. Lett. Article in Press (2009).
  20. Anja Groch, Dennis Hofheinz, and Rainer Steinwandt, A practical attack on the root problem in braid groups, Algebraic methods in cryptography, Contemp. Math., vol. 418, Amer. Math. Soc., Providence, RI, 2006, pp. 121–131.[MR/link]
  21. Jörn Müller-Quade and Rainer Steinwandt, Basic algorithms for rational function fields, J. Symbolic Comput. 27 (1999), no. 2, 143–170.[MR]
  22. Jörn Müller-Quade and Rainer Steinwandt, Gröbner bases applied to finitely generated field extensions, J. Symbolic Comput. 30 (2000), no. 4, 469–490.[MR]
  23. Jörn Müller-Quade and Rainer Steinwandt, Recognizing simple subextensions of purely transcendental field extensions, Appl. Algebra Engrg. Comm. Comput. 11 (2000), no. 1, 35–41.[MR]
  24. Michael Schmid, Rainer Steinwandt, Jörn Müller-Quade, Martin Rötteler, and Thomas Beth, Decomposing a matrix into circulant and diagonal factors, Linear Algebra Appl. 306 (2000), no. 1-3, 131–143.[MR]
  25. Rainer Steinwandt, Decomposing systems of polynomial equations, Computer Algebra in Scientific Computing—CASC'99 (Munich), Springer, Berlin, 1999, pp. 387–407.[MR]
  26. Rainer Steinwandt, On computing a separating transcendence basis, SIGSAM Bulletin 34 (2000), no. 4.
  27. Rainer Steinwandt, Loopholes in two public key cryptosystems using the modular group, Public Key Cryptography (Cheju Island, 2001), Lecture Notes in Comput. Sci., vol. 1992, Springer, Berlin, 2001, pp. 180–189.[MR]
  28. Rainer Steinwandt, Implicitizing without tag variables, Proceedings of the 8th Rhine Workshop on Computer Algebra, 2002, pp. 217-224.
  29. Rainer Steinwandt, A ciphertext-only attack on Polly Two, Appl. Algebra Engrg. Comm. Comput. 21 (2010), no. 2, 85–92.[MR/doi]
  30. Rainer Steinwandt and Regine Endsuleit, A note on timing attacks based on the evaluation of polynomials, Preprint (2000), 9 pages.
  31. Rainer Steinwandt, Willi Geiselmann, and Regine Endsuleit, Attacking a polynomial-based cryptosystem: polly cracker, Int. J. Inf. Secur. 1 (2002), no. 3, 143-148.
  32. Rainer Steinwandt, Markus Grassl, Willi Geiselmann, and Thomas Beth, Weakness in the SL2(F2n) hashing scheme, Advances in Cryptology—CRYPTO 2000 (Santa Barbara, CA), Lecture Notes in Comput. Sci., vol. 1880, Springer, Berlin, 2000, pp. 287–299.[MR]
  33. Rainer Steinwandt and Jörn Müller-Quade, Freeness, linear disjointness, and implicitization—a classical approach, Beiträge Algebra Geom. 41 (2000), no. 1, 57–66.[MR]
  34. Rainer Steinwandt and Viktória I. Villányi, A one-time signature using run-length encoding, Inform. Process. Lett. 108 (2008), no. 4, 179–185.[MR]