1. D. Boucher, W. Geiselmann, and F. Ulmer, Skew-cyclic codes, Appl. Algebra Engrg. Comm. Comput. 18 (2007), no. 4, 379–389.[MR/arXiv]
  2. 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.
  3. 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]
  4. Willi Geiselmann and Rainer Steinwandt, Cryptanalysis of a knapsack-like cryptosystem, Period. Math. Hungar. 45 (2002), no. 1-2, 35–41.[MR]
  5. Willi Geiselmann and Rainer Steinwandt, A redundant representation of GF(qn) for designing arithmetic circuits, IEEE Trans. Comp 52 (2003), no. 7, 848–853.
  6. Willi Geiselmann and Rainer Steinwandt, A short comment on the affine parts of SFLASHv3, IACR (2003).[eprint]
  7. 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]
  8. 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.
  9. 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]
  10. 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]
  11. 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.
  12. Rainer Steinwandt, Willi Geiselmann, and Regine Endsuleit, Attacking a polynomial-based cryptosystem: polly cracker, Int. J. Inf. Secur. 1 (2002), no. 3, 143-148.
  13. 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]