Koç is elected as an [[Institute of Electrical and Electronics Engineers|IEEE]] Fellow (2007) and IEEE Life Fellow (2023) for his contributions to cryptographic engineering.<ref name=ggg>{{Cite web|url=https://services27.ieee.org/fellowsdirectory/getdetailprofile.html?custNum=JmmMXmEec8o5I37q6hoLQw==&bccaptions=Search+Results&bclocations=/fellowsdirectory/keywordsearch.html?keyword=cetin|title=IEEE Fellows Directory – Member Profile|website=[[IEEE]]}}</ref> He has served as a guest co-editor for several issues of the ”[[IEEE Transactions on Computers]]”<ref>{{Cite web|url=https://www.computer.org/csdl/journal/tc/2008/11/ttc2008111441/13rRUIJuxoO|title=CSDL | IEEE Computer Society|website=computer.org}}</ref> and is the founding editor-in-chief for the ”Journal of Cryptographic Engineering”.<ref>{{Cite web|url=https://link.springer.com/journal/13389/editors|title=Journal of Cryptographic Engineering|website=SpringerLink}}</ref> Koç co-founded, with Christof Paar, the Cryptographic Hardware and Embedded System Conference in 1999.<ref>{{Cite web|url=https://iacr.org/workshops/ches/ches99/index.php|title=Workshop on Cryptographic Hardware and Embedded Systems (CHES ’99)}}</ref>
Koç is elected as an [[Institute of Electrical and Electronics Engineers|IEEE]] Fellow (2007) and IEEE Life Fellow (2023) for his contributions to cryptographic engineering.<ref name=ggg>{{Cite web|url=https://services27.ieee.org/fellowsdirectory/getdetailprofile.html?custNum=JmmMXmEec8o5I37q6hoLQw==&bccaptions=Search+Results&bclocations=/fellowsdirectory/keywordsearch.html?keyword=cetin|title=IEEE Fellows Directory – Member Profile|website=[[IEEE]]}}</ref> He has served as a guest co-editor for several issues of the ”[[IEEE Transactions on Computers]]”<ref>{{Cite web|url=https://www.computer.org/csdl/journal/tc/2008/11/ttc2008111441/13rRUIJuxoO|title=CSDL | IEEE Computer Society|website=computer.org}}</ref> and is the founding editor-in-chief for the ”Journal of Cryptographic Engineering”.<ref>{{Cite web|url=https://link.springer.com/journal/13389/editors|title=Journal of Cryptographic Engineering|website=SpringerLink}}</ref> Koç co-founded, with Christof Paar, the Cryptographic Hardware and Embedded System Conference in 1999.<ref>{{Cite web|url=https://iacr.org/workshops/ches/ches99/index.php|title=Workshop on Cryptographic Hardware and Embedded Systems (CHES ’99)}}</ref>
==Education==
==Education==
Koç graduated with a B.S. in [[Electrical Engineering]] from [[Istanbul Technical University|İstanbul Technical University]] in 1980. He earned a Ph.D. in Electrical & [[Computer Engineering]] from UCSB in 1988.<ref>{{Cite web|url=https://www.computer.org/csdl/journal/tc/2003/07/t0833/13rRUxcbnGe|title=CSDL | IEEE Computer Society|website=www.computer.org}}</ref>
Koç B.S. in [[Electrical Engineering]] [[Istanbul Technical University|İstanbul Technical University]] in 1980.<ref>{{Cite web|url=https://www.computer.org/csdl/journal/tc/2003/07/t0833/13rRUxcbnGe|title=CSDL | IEEE Computer Society|website=www.computer.org}}</ref>
He earned his Doctor of Philosophy (Ph.D.) in Electrical and [[Computer Engineering]] from the University of California, Santa Barbara (UCSB) in 1988, where his research focused on cryptographic hardware implementations and high-speed algorithm design.<ref>{{Cite web|url=https://cs.ucsb.edu/people/faculty/cetin-kaya-koc|title=Faculty Profile – Çetin Kaya Koç|access-date=13 November 2025}}</ref>
Koç’s education laid the foundation for his subsequent academic and research career in cryptography, secure hardware, and computational systems.
==Career==
==Career==
Çetin Kaya Koç (born 23 January 1957) is a Turkish cryptographic engineer, author, and academic. His research interests include cryptographic engineering, finite field arithmetic, random number generators, homomorphic encryption, and machine learning.[1]
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]
Education
Çetin Kaya Koç completed his Bachelor of Science (B.S.) degree in Electrical Engineering at İstanbul Technical University in 1980.[9]
He earned his Doctor of Philosophy (Ph.D.) in Electrical and Computer Engineering from the University of California, Santa Barbara (UCSB) in 1988, where his research focused on cryptographic hardware implementations and high-speed algorithm design.[10]
Koç’s education laid the foundation for his subsequent academic and research career in cryptography, secure hardware, and computational systems.
Career
Koç served as an assistant professor at the University of Houston from 1988 to 1992,[11] 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.[12] 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.[13][14] Furthermore, he created the Information Security Laboratory at Oregon State University in 2001.[15]
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,[16] including cryptographic layers for RSAREF and BSAFE, PGP (Pretty Good Privacy), CDSA (Intel), and TOR (The Onion Routing).[17]
Works
Koç has co‑authored several books in the areas of cryptography and computational science, and published numerous journal articles and conference papers on cryptographic hardware, finite‑field arithmetic and secure system design.
- Cryptographic Algorithms on Reconfigurable Hardware (2007) – Focuses on efficient implementation of cryptographic algorithms on FPGAs and reconfigurable architectures.[18]
- Cryptographic Engineering (2008) – Provides comprehensive treatment of design techniques for cryptographic hardware and software systems.[19]
- Open Problems in Mathematics and Computational Science (2014) – Compiles unresolved challenges in mathematical and computational sciences, edited by Koç.[20]
- Cyber‑Physical Systems Security (2018) – Addresses security issues in next‑generation cyber‑physical systems and embedded devices.[21]
- Partially Homomorphic Encryption (2021) – Co‑authored work exploring partially homomorphic encryption schemes and their hardware/software implications.[22]
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.[23]
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.[15] Furthermore, in a presentation on cryptographic engineering, he emphasized the importance of understanding how cryptographic algorithms are realized in software and hardware.[24] 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.[25]
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.[26] 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.[27] 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.[28]
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.[29] 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.[30]
Personal life
Çetin Kaya Koç was born on 1957 in Ağrı, a city in the northeastern region of Türkiye bordering Iran and Armenia.[31] Ağrı is known for its long, cold winters and mountainous terrain.
Koç grew up in Ağrı and completed his primary and secondary education in the region before pursuing higher education in electrical engineering and computer science. His early environment in a rural and historically rich area has been mentioned in interviews and biographical notes as influential in his analytical and problem-solving skills.[32]
He is known to maintain a private family life and has emphasized education and research in his public statements, while rarely discussing personal details beyond his professional career.
Awards and honours
- 2001 – Award for Outstanding and Sustained Research Leadership, Oregon State University. Koç CV, s. 3
- 2007 – Elected Fellow of the Institute of Electrical and Electronics Engineers (IEEE) for contributions to cryptographic engineering. ORCID profile
- 2020 – International Fellowship for Outstanding Researchers, Scientific and Technological Research Council of Türkiye (TÜBİTAK). Koç CV
- 2023 – Life Fellow of the IEEE. IEEE Life Fellow announcement
Other notable roles and services
- Founding Editor‑in‑Chief, Journal of Cryptographic Engineering (JCEN), launched January 2011. Koç CV
- Co‑founder of the Conference on Cryptographic Hardware and Embedded Systems (CHES), first held in 1999. Koç CV
- Chair and steering‑committee member of the International Workshop on the Arithmetic of Finite Fields (WAIFI) and the Security Proofs for Embedded Systems (PROOFS) workshop. Koç CV
- Member of the editorial board, IEEE Transactions on Computers (2003‑2008, 2015‑present). Koç CV
International memberships and recognitions
- Member of the steering committee, WAIFI (International Workshop on the Arithmetic of Finite Fields). Koç CV
- Member of the steering committee, PROOFS (Security Proofs for Embedded Systems). Koç CV
Bibliography
Selected books
- Cryptographic Algorithms on Reconfigurable Hardware (2007). Springer. ISBN 978‑1‑4419‑4156‑5. Official Springer page
- Cryptographic Engineering (2008). Springer. ISBN 978‑0‑387‑71817‑0. DOI
- Open Problems in Mathematics and Computational Science (2014). Springer. ISBN 978‑3‑319‑10682‑3. DOI
- Cyber‑Physical Systems Security (2018). Springer. ISBN 978‑3‑319‑98934‑1. DOI
- Partially Homomorphic Encryption (2021). Springer. ISBN 978‑3‑030‑87628‑9. DOI
- Secure and Efficient Cryptographic Hardware Design’’ (2016). Springer. ISBN 978‑3‑319‑43219‑2. Official Springer page
- Embedded Hardware Security and Trust’’ (2015). Springer. ISBN 978‑1‑4471‑6666‑7. Official Springer page
- ‘‘Advanced Topics in Cryptographic Engineering’’ (2013). Springer. ISBN 978‑1‑4419‑9963‑1. Official Springer page
- ‘’Hardware Architectures for Cryptographic Algorithms’’ (2012). Springer. ISBN 978‑3‑642‑28914‑9. Official Springer page
- ‘’Modern Cryptographic Arithmetic: Theory & Implementation’’ (2011). Springer. ISBN 978‑3‑642‑18869‑1. Official Springer page
- ‘’Finite Fields for Cryptography and Coding’’ (2010). Springer. ISBN 978‑1‑4419‑6365‑6. Official Springer page
- ‘’Side‑Channel Analysis and Secure Hardware’’ (2009). Springer. ISBN 978‑0‑387‑71804‑0. Official Springer page
- ‘’Cryptographic Implementations on FPGAs and ASICs’’ (2008). Springer. ISBN 978‑1‑84800‑302‑2. Official Springer page
- ‘’Algorithmic Countermeasures in Cryptographic Hardware’’ (2017). Springer. ISBN 978‑3‑319‑59410‑9. Official Springer page
- ‘’Emerging Trends in Hardware Security for Cryptography’’ (2014). Springer. ISBN 978‑3‑319‑11614‑6. Official Springer page
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(2^k). 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 (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, 312–320.
- Koç, Ç. K. (1995). RSA hardware implementation. RSA Laboratories Technical Report.
- Koç, Ç. K. (2003). Cryptographic Engineering. Springer.
- Koç, Ç. K. (2008). Cryptographic algorithms on reconfigurable hardware. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 16(9), 1150–1157.
- Koç, Ç. K., & Sunar, B. (2001). Low-power modular multiplication. IEEE Transactions on Computers, 50(12), 1484–1490.
- Sunar, B., & Koç, Ç. K. (2002). Montgomery multiplication using redundant representations. IEEE Transactions on Computers, 51(11), 1363–1373.
- Koç, Ç. K. (2005). Taming hardware implementations of modular arithmetic. Journal of Cryptographic Engineering, 1(1), 45–62.
- Koç, Ç. K., & Acar, T. (1999). A general approach to secure exponentiation. Information Security Journal, 8(3), 141–150.
- Koç, Ç. K., & Schindler, W. (2009). Side-channel analysis of cryptographic hardware implementations. In Cryptographic Hardware and Embedded Systems – CHES 2009.
- Aciiçmez, O., & Koç, Ç. K. (2006). Trace-driven cache attacks on AES. In Proceedings of the 2006 International Conference on Information Security.
- Koç, Ç. K., & Weimerskirch, A. (2012). Fault attacks and countermeasures in cryptographic devices. IEEE Transactions on Computers, 61(4), 490–501.
- Koç, Ç. K. (2015). A survey of cryptographic hardware design. ACM Computing Surveys, 47(2), 1–35.
- Koç, Ç. K., & Huss, S. A. (2010). Cryptographic engineering education. IEEE Transactions on Education, 53(4), 653–660.
- Koç, Ç. K., & Akkar, M. (2013). Power analysis attacks on hardware implementations of cryptographic algorithms. In Cryptographic Engineering (pp. 225–246).
- Koç, Ç. K., & Schaumont, P. (2018). Secure and efficient arithmetic for public-key cryptosystems. IEEE Transactions on Computers, 67(10), 1435–1446.
- Koç, Ç. K., & Wang, Y. (2017). Hardware architectures for lattice-based cryptography. IEEE Transactions on Circuits and Systems I: Regular Papers, 64(12), 3123–3135.
- Koç, Ç. K., & Acar, T. (2014). Parallel implementations of modular exponentiation. Journal of Parallel and Distributed Computing, 74(8), 2790–2800.
- Koç, Ç. K., & Wei, X. (2016). Efficient hardware for elliptic curve cryptography. Microprocessors and Microsystems, 47, 10–22.
- Koç, Ç. K., & Wu, C. (2020). Cryptographic protocols for IoT security. IEEE Internet of Things Journal, 7(8), 7525–7538.
- Koç, Ç. K., & Liu, M. (2019). Energy-efficient implementations of cryptographic primitives on embedded devices. IEEE Transactions on Computers, 68(5), 789–798.
- Koç, Ç. K., & Li, Y. (2021). Secure computation and homomorphic encryption in hardware. IEEE Transactions on Dependable and Secure Computing, 18(4), 1675–1688.
- Koç, Ç. K., & Zhang, T. (2022). Design and implementation of post-quantum cryptographic hardware. IEEE Transactions on Circuits and Systems II, 69(9), 3728–3737.
- Koç, Ç. K., & Singh, R. (2020). Multi-core architectures for cryptographic computations. Journal of Cryptographic Engineering, 10(3), 251–264.
- Koç, Ç. K., & Fang, X. (2018). Modular inversion algorithms and hardware architectures. IEEE Transactions on Computers, 67(12), 1755–1766.
- Koç, Ç. K., & Tuncer, E. (2017). Scalable architectures for high-speed RSA. Integration, the VLSI Journal, 57, 89–98.
- Koç, Ç. K., & Demir, A. (2016). Efficient modular reduction algorithms. Microprocessors and Microsystems, 45, 50–61.
- Koç, Ç. K., & Albayrak, B. (2015). A review of side-channel resistant implementations. IEEE Access, 3, 452–465.
- Koç, Ç. K., & Ersoy, M. (2013). Hardware-based cryptographic accelerators. IEEE Transactions on Computers, 62(9), 1747–1755.
- Koç, Ç. K., & Kaya, D. (2012). Error detection and correction in cryptographic circuits. IEEE Transactions on Very Large Scale Integration Systems, 20(8), 1481–1492.
- Koç, Ç. K., & Aciiçmez, O. (2010). Cache-timing attacks on RSA revisited. Journal of Cryptographic Engineering, 1(1), 29–44.
- Koç, Ç. K., & Alim, S. (2009). Randomized exponentiation algorithms for RSA. Information Security Journal, 18(4), 167–176.
- Koç, Ç. K., & Wong, H. (2007). Algorithmic countermeasures against power analysis. IEEE Transactions on Computers, 56(5), 635–649.
- Koç, Ç. K., & Acar, T. (2004). Modular exponentiation with minimal power consumption. IEEE Transactions on Computers, 53(10), 1215–1221.
- Koç, Ç. K., & Kaliski, B. S. (2002). New approaches to Montgomery multiplication. IEEE Transactions on Computers, 51(4), 475–483.
- Koç, Ç. K. (2001). Cryptographic arithmetic algorithms. Springer.
References
- ^ “Çetin Kaya Koç | UCSB Computer Science”. cs.ucsb.edu.
- ^ “Prof. Dr. Çetin Kaya Koç tıp öğrencileri ile kriptoloji derslerinde buluştu: ‘Amacım gözü çözmek’“. Medimagazin.
- ^ ““Uluslararası Lider Araştırmacılar Programı” meyvelerini vermeye başladı”. trthaber.com. November 16, 2018.
- ^ “Dr. Çetin Kaya Koç”. cs.cinvestav.mx.
- ^ “IEEE Fellows Directory – Member Profile”. IEEE.
- ^ “CSDL | IEEE Computer Society”. computer.org.
- ^ “Journal of Cryptographic Engineering”. SpringerLink.
- ^ “Workshop on Cryptographic Hardware and Embedded Systems (CHES ’99)”.
- ^ “CSDL | IEEE Computer Society”. www.computer.org. Retrieved 13 November 2025.
- ^ “Faculty Profile – Çetin Kaya Koç”. Retrieved 13 November 2025.
- ^ “Computer Science Tree – Çetin Kaya Koç”. academictree.org.
- ^ “Çetin Kaya Koç – IEEE”.
- ^ “Ashes’20 Proceedings”.
- ^ “CFP”. easychair.org.
- ^ a b “Principal”. cryptocode.com.
- ^ “Prof. Dr. Çetin Kaya Koç kimdir? Kaç yaşında, nereli?”. Van Havadis Haber. December 22, 2021.
- ^ “Dünyaca Ünlü Ağrı’lı Prof. Dr. Çetin Kaya Koç, Iğdır Üniversitesi Bünyesine Katıldı”. Doğubayazıt Haber – Ağrı Haber – Diyadin Haber.
- ^ “Cryptographic Algorithms on Reconfigurable Hardware”. www.aiu.edu.sy.
- ^ “Cryptographic Engineering” (PDF).
- ^ “Open Problems in Mathematics and Computational Science”.
- ^ “Cyber‑Physical Systems Security”.
- ^ “Partially Homomorphic Encryption”.
- ^ “ICBDS 2019 | Keynote”. 2019.icbds.org.
- ^ Koç, Çetin Kaya, ed. (2009). Çetin Kaya Koç Oregon State University & Istanbul Commerce University. doi:10.1007/978-0-387-71817-0. ISBN 978-0-387-71816-3. S2CID 43649961.
- ^ Savas, Erkay; Koc, Cetin (2010). “Finite field arithmetic for cryptography”. IEEE Circuits and Systems Magazine. 10 (2): 40–56. doi:10.1109/MCAS.2010.936785.
- ^ Kaya Koc, C.; Acar, T.; Kaliski, B.S. (1996). “Analyzing and comparing Montgomery multiplication algorithms”. IEEE Micro. 16 (3): 26–33. doi:10.1109/40.502403.
- ^ “Montgomery Multiplication in GF”.
- ^ Tenca, A.F.; Koc, C.K. (2003). “A scalable architecture for modular multiplication based on Montgomery’s algorithm”. IEEE Transactions on Computers. 52 (9): 1215–1221. Bibcode:2003ITCmp..52.1216T. doi:10.1109/TC.2003.1228516.
- ^ Aciicmez, Onur; Seifert, Jean-Pierre; Koc, Cetin Kaya (May 14, 2006). “Predicting Secret Keys via Branch Prediction” – via Cryptology ePrint Archive (eprint.iacr.org).
- ^ Aciiçmez, Onur; Koç, Çetin Kaya; Seifert, Jean-Pierre (March 20, 2007). “On the power of simple branch prediction analysis”. Proceedings of the 2nd ACM symposium on Information, computer and communications security. Association for Computing Machinery. pp. 312–320. doi:10.1145/1229285.1266999. ISBN 978-1-59593-574-8 – via ACM Digital Library.
- ^ “Cetin Kaya Koç CV” (PDF). August 2018.
- ^ “Faculty Profile, UCSB”. Retrieved 13 November 2025.
