As of 2024, he has authored 92 journal articles and 13 book chapters.[2] His publications also include 5 co-authored books including Cryptographic Algorithms on Reconfigurable Hardware, Cryptographic Engineering, Open Problems in Mathematics and Computational Science, Cyber-Physical Systems Security, and Partially Homomorphic Encryption. According to the Stanford PLOS study, he ranks 103 among 17,080 computer science researchers[3] and was ranked 96,710 among 200,000 highly cited scientists in an Elsevier study. Furthermore, he has received the International Fellowship for Outstanding Researchers award as well as the Outstanding and Sustained Research Leadership award.[4]
Koç is elected as an IEEE Fellow (2007) and IEEE Life Fellow (2023) for his contributions to cryptographic engineering.[5] He has served as a guest co-editor for several issues of the IEEE Transactions on Computers[6] and is the founding editor-in-chief for the Journal of Cryptographic Engineering.[7] Koç co-founded, with Christof Paar, the Cryptographic Hardware and Embedded System Conference in 1999.[8]
Koç served as an assistant professor at the University of Houston from 1988 to 1992,[10] then progressed to roles of assistant, associate, and full professor at Oregon State University from 1992 to 2007. His work includes co-founding conferences including the Conference on Cryptographic Hardware and Embedded Systems in 1999.[11] He also established the International Workshop on the Arithmetic of Finite Fields (WAIFI), Security Proofs for Embedded Systems (PROOFS), and Attacks and Solutions in Hardware Security (ASHES) to address various aspects of cryptographic hardware and software, finite fields, and security methodologies.[12][13] Furthermore, he created the Information Security Laboratory at Oregon State University in 2001.[14]
During his tenure at RSA Labs from 1991 to 1997, Koç collaborated with Ron Rivest, Taher ElGamal, and Burt Kaliski in developing cryptographic software implementations. He contributed to over 50 cryptographic software and hardware systems,[15] including cryptographic layers for RSAREF and BSAFE, PGP (Pretty Good Privacy), CDSA (Intel), and TOR (The Onion Routing).[16]
Works
Koç co-authored books on cryptography and computational sciences. His publication Cryptographic Algorithms on Reconfigurable Hardware, focused on efficient FPGAalgorithm implementation,[17] and Cryptographic Engineering detailed design techniques for cryptographic hardware and software.[18] In Open Problems in Mathematics and Computational Science, he compiled unresolved challenges in mathematical and computational sciences,[19] while exploring next-gen system issues in Cyber-Physical Systems Security.[20] He alongside Funda Özdemir and Zeynep Ödemiş Özger co-authored Partially Homomorphic Encryption exploring encryption functions using unified notation and established algorithms.[21]
Research
Koç's research primarily focuses on developing cryptographic systems implementations to provide secure and authenticated communication as well as encompassing machine learning, and homomorphic encryption. He holds 13 US patents co-authored with collaborators.[22]
Cryptographic engineering
Since 1988, Koç has been developing cryptography and security technologies and products. He established CryptoCode with his PhD advisees, specializing in cryptographic engineering.[14] Furthermore, in a presentation on cryptographic engineering, he emphasized the importance of understanding how cryptographic algorithms are realized in software and hardware.[23] While discussing the significance of efficient finite field arithmetic in cryptography, he provided insights into designing architectures for fast execution of cryptographic operations and maximizing resource utilization.[24]
Montgomery multiplication
Koç's studies on Montgomery multiplication methods contributed to the development of high-speed and efficient algorithms. He explored Montgomery multiplication methods, examining operations and presenting high-speed, space-efficient algorithms for computing MonPro(a, b), analyzing their time and space requirements, and introducing new techniques.[25] Alongside Tolga Acar, he demonstrated that the multiplication operation in GF(2^k) can be implemented faster in software using a special fixed element r, similar to Montgomery multiplication for integer modular multiplication.[26] He further introduced a scalable architecture for modular multiplication, leveraging the Montgomery multiplication (MM) algorithm, which provided flexibility in word size and parallelism to optimize performance based on available resources and desired outcomes.[27]
Branch prediction
Koç, in collaboration with Onur Aciiçmez and Jean-Pierre Seifert, introduced a new software side-channel attack exploiting branch prediction in modern CPUs, demonstrating its effectiveness on real systems like OpenSSL and Linux.[28] The trio also introduced the Simple Branch Prediction Analysis (SBPA) attack, which allowed for the extraction of almost all secret key bits from an RSA process with just one execution.[29]
Personal life
Koç was born and raised in Ağrı, in the northeastern corner of Turkey bordering Iran and Armenia. The town of Ağrı is known for its long and cold winters.[30]
Awards and honors
2001 – Outstanding and Sustained Research Leadership, Oregon State University
2007 – Fellow, Institute of Electrical and Electronics Engineers
2023 – Life Fellow, Institute of Electrical and Electronics Engineers[5]
Bibliography
Selected books
Cryptographic Algorithms on Reconfigurable Hardware (2007) ISBN 978-1441941565
Cryptographic Engineering (2008) ISBN 978-1441944177
Open Problems in Mathematics and Computational Science (2014) ISBN 978-3319106823
Cyber-Physical Systems Security (2018) ISBN 978-3319989341
Partially Homomorphic Encryption (2021) ISBN 978-3030876289
Selected articles
Koç, Ç. K. (1994). High-Speed RSA Implementation. RSA Laboratories, RSA Data Security Inc.
Koç, Ç. K., Acar, T., & Kaliski, B. S. (1996). Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro, 16(3), 26–33.
Koç, Ç. K., & Acar, T. (1998). Montgomery multiplication in GF (2k). Designs, Codes and Cryptography, 14, 57–69.
Aciiçmez, O., Koç, Ç. K., & Seifert, J. P. (2006). Predicting secret keys via branch prediction. In Topics in Cryptology–CT-RSA 2007: The Cryptographers’ Track at the RSA Conference 2007, San Francisco, CA, USA, February 5–9, 2007. Proceedings (pp. 225–242).
Aciiçmez, O., Koç, Ç. K., & Seifert, J. P. (2007). On the power of simple branch prediction analysis. In Proceedings of the 2nd ACM symposium on Information, Computer and Communications Security (pp. 312–320).
