Analyzing and comparing Montgomery multiplication algorithms CK Koc, T Acar, BS Kaliski Jr Micro, IEEE 16 (3), 26-33, 1996 | 834 | 1996 |
Predicting secret keys via branch prediction O Acıicmez, CK Koc, JP Seifert Topics in Cryptology–CT-RSA 2007, 225-242, 2006 | 467 | 2006 |
Montgomery multiplication in GF (2k) CK Koc, T Acar Designs, Codes and Cryptography 14 (1), 57-69, 1998 | 415 | 1998 |
High-speed RSA implementation CK Koc Technical Report TR-201, RSA Laboratories, 1994 | 408 | 1994 |
On the power of simple branch prediction analysis O Aciicmez, CK Koc, JP Seifert Proceedings of the 2nd ACM symposium on Information, computer and …, 2007 | 378 | 2007 |
A brief introduction to modern cryptography F Rodriguez-Henriquez, AD Perez, NA Saqib, CK Koc Cryptographic Algorithms on Reconfigurable Hardware, 7-33, 2007 | 365 | 2007 |
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields CK Koc, B Sunar IEEE Transactions on Computers 47 (3), 353-356, 1998 | 329 | 1998 |
Cryptographic Algorithms on Reconfigurable Hardware F Rodriguez-Henriquez, NA Saqib, A Dıaz-Perez, CK Koc Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006 | 321 | 2006 |
A scalable architecture for modular multiplication based on Montgomery's algorithm AF Tenca, CK Koc Computers, IEEE Transactions on 52 (9), 1215-1221, 2003 | 316 | 2003 |
About Cryptographic Engineering CK Koc Cryptographic Engineering, 1-4, 2009 | 288 | 2009 |
A Scalable Architecture for Montgomery Multiplication AF Tenca, CK Koc Cryptographic Hardware and Embedded Systems 1717, 94-108, 1999 | 286 | 1999 |
Mastrovito multiplier for all trinomials B Sunar, CK Koc IEEE Transactions on Computers 48 (5), 522-527, 1999 | 266 | 1999 |
Cache based remote timing attack on the AES O Acıicmez, W Schindler, CK Koc Topics in Cryptology–CT-RSA 2007, 271-286, 2006 | 263 | 2006 |
Trace-driven cache attacks on AES O Aciicmez, CK Koc Information and Communications Security, ICISCS 2006, 8th International …, 2006 | 244* | 2006 |
A scalable and unified multiplier architecture for finite fields GF (p) and GF (2 m) E Savas, AF Tenca, CK Koc Cryptographic Hardware and Embedded Systems—CHES 2000, 277-292, 2000 | 240 | 2000 |
An efficient optimal normal basis type II multiplier B Sunar, CK Koc Computers, IEEE Transactions on 50 (1), 83-87, 2001 | 237 | 2001 |
Mastrovito multiplier for general irreducible polynomials A Halbutogullari, CK Koc Computers, IEEE Transactions on 49 (5), 503-518, 2000 | 214 | 2000 |
Analysis of sliding window techniques for exponentiation CK Koc Computers & Mathematics with Applications 30 (10), 17-24, 1995 | 204 | 1995 |
RSA Hardware Implementation CK Koc RSA Laboratories, August, 1995 | 197 | 1995 |
The Montgomery modular inverse-revisited E Savas, CK Koc Computers, IEEE Transactions on 49 (7), 763-766, 2000 | 187 | 2000 |