Note on Fast Computation of Secret RSA Exponents. - Wieland Fischer; Jean-Pierre Seifert (ACISP, 2002)

Increasing the Bitlength of a Crypto-Coprocessor. - Wieland Fischer; Jean-Pierre Seifert (CHES, 2002)

Fault attacks on RSA with CRT: Concrete Results and Practical Countermeasures. - Christian Aumüller; Peter Bier; Peter Hofreiter; Wieland Fischer; Jean-Pierre Seifert (IACR Cryptol. ePrint Arch., 2002)

Parallel scalar multiplication on general elliptic curves over Fp hedged against Non-Differential Side-Channel Attacks. - Wieland Fischer; Christophe Giraud 001; Erik Woodward Knudsen; Jean-Pierre Seifert (IACR Cryptol. ePrint Arch., 2002)

Unfolded Modular Multiplication. - Wieland Fischer; Jean-Pierre Seifert (ISAAC, 2003)

High-Speed Modular Multiplication. - Wieland Fischer; Jean-Pierre Seifert (CT-RSA, 2004)

Masking at Gate Level in the Presence of Glitches. - Wieland Fischer; Berndt M. Gammel (CHES, 2005)

Duality between Multiplication and Modular Reduction. - Wieland Fischer; Jean-Pierre Seifert (IACR Cryptol. ePrint Arch., 2005)

Differential Power Analysis of Stream Ciphers. - Wieland Fischer; Berndt M. Gammel; O. Kniffler; Joachim Velten (CT-RSA, 2007)

Aspects of the Development of Secure and Fault-Resistant Hardware. - Wieland Fischer (FDTC, 2008)

Differential Fault Analysis on Grøstl. - Wieland Fischer; Christian A. Reuter (FDTC, 2012)

Introduction to the CHES 2017 special issue. - Wieland Fischer; Naofumi Homma (J. Cryptogr. Eng., 2018)