A Less Recursive Variant of Karatsuba-Ofman Algorithm for Multiplying Operands of Size a Power of Two. - Serdar Süer Erdem; Çetin Kaya Koç (IEEE Symposium on Computer Arithmetic, 2003)

Fast Finite Field Multiplication. - Serdar Süer Erdem; Tugrul Yanik; Çetin Kaya Koç (Cryptographic Engineering, 2009)

Design and implementation of robust embedded processor for cryptographic applications. - Kazim Yumbul; Serdar Süer Erdem; Erkay Savas (SIN, 2010)

On Protecting Cryptographic Applications Against Fault Attacks Using Residue Codes. - Kazim Yumbul; Serdar Süer Erdem; Erkay Savas (FDTC, 2011)

On Selection of Modulus of Quadratic Codes for the Protection of Cryptographic Operations against Fault Attacks. - Kazim Yumbul; Serdar Süer Erdem; Erkay Savas (IEEE Trans. Computers, 2014)

Versatile digit serial multipliers for binary extension fields. - Bilal Uslu; Serdar Süer Erdem (Comput. Electr. Eng., 2015)

A General Digit-Serial Architecture for Montgomery Modular Multiplication. - Serdar Süer Erdem; Tugrul Yanik; Anil Çelebi (IEEE Trans. Very Large Scale Integr. Syst., 2017)

A fast digit based Montgomery multiplier designed for FPGAs with DSP resources. - Erdem Ozcan; Serdar Süer Erdem (Microprocess. Microsystems, 2018)

A High Performance Full-Word Barrett Multiplier Designed for FPGAs with DSP Resources. - Erdem Ozcan; Serdar Süer Erdem (PRIME, 2019)