Erkay Savaş

He received his B.S. (1989) and M.S. (1994) degrees in Electrical Engineering from the Electronics and Communications Engineering Department at Istanbul Technical University.

Erkay was a Senior Researcher at MRC (Marmara Research Center) of TUBITAK between June 1993 and September 1997. He worked on various projects related to cryptography and information security. His main interest was design, analysis, and evaluation of stream cipher algorithms.

Erkay's research interests are in cryptography, data and communication security, and high performance computing. He is currently working as an Assistant Professor at Sabanci University in Istanbul, Turkey.

Contact Information

Selected Publications

• M. Aydos, E. Savas, and C. K. Koc. Implementing network security protocols based on elliptic curve cryptography. Proceedings of the Fourth Symposium on Computer Networks, S. Oktug, B. Orencik, and E. Harmanci, editors, pages 130-139, Istanbul, Turkey, May 20-21, 1999.   Abstract   Paper
• C. K. Koc and E. Savas. Cryptographic Methods and Apparatus using Word-Wise Montgomery Multiplication. US Patent Application, August 17, 1999.   Abstract
• E. Savas and C. K. Koc. Efficient methods for composite field arithmetic. Technical Report, Electrical and Computer Engineering, Oregon State University, 19 pages, December 1999.   Abstract Report
• C. K. Koc, E. Savas, A. F. Tenca. A Scalable and Unified Multiplier for Finite Fields. US Patent Application, February 29, 2000.   Abstract
• E. Savas. Implementation Aspects of Elliptic Curve Cryptography. Ph.D. Thesis, Department of Electrical & Computer Engineering, Oregon State University, June 20, 2000.   Abstract Thesis
• C. K. Koc, T. Yanik, and E. Savas. Incomplete Modular Arithmetic. US Patent Application, June 20, 2000.   Abstract
• E. Savas and C. K. Koc. The Montgomery modular inverse - revisited. IEEE Transactions on Computers, 49(7):763-766, July 2000.   Abstract   Paper
• E. Savas, A. F. Tenca, and C. K. Koc. A scalable and unified multiplier architecture for finite fields GF(p) and GF(2^m). Cryptographic Hardware and Embedded Systems - CHES 2000, C. K. Koc and C. Paar, editors, Second International Workshop, Worcester, MA, USA, pages 277-292, Springer Verlag, LNCS Nr. 1965, August 17-18, 2000. Abstract   Paper
• E. Savas, T. A. Schmidt, and C. K. Koc. Generating elliptic curves of known order. Cryptographic Hardware and Embedded Systems - CHES 2001, C. K. Koc, D. Naccache, and C. Paar, editors, Third International Workshop, Paris, France, pages 142-158, Springer Verlag, LNCS Nr. 2162, May 14-16, 2001. Abstract Paper
• T. Yanik, E. Savas, and C. K. Koc. Incomplete reduction in modular arithmetic. IEE Proceedings - Computers and Digital Techniques, 149(2):46-52, March 2002.   Abstract   Paper
• E. Savas and C. K. Koc. Architectures for unified field inversion with applications in elliptic curve cryptography. The 9th IEEE International Conference on Electronics, Circuits and Systems - ICECS 2002, volume 3, pages 1155-1158, Dubrovnik, Croatia, September 15-18, 2002.   Abstract   Paper
• A. A.-A. Gutub, A. F. Tenca, E. Savas, and C. K. Koc. Scalable and unified hardware to compute Montgomery inverse in GF(p) and GF(2^n). Cryptographic Hardware and Embedded Systems - CHES 2002, B. S. Kaliski Jr., C. K. Koc, and C. Paar, editors, 4th International Workshop, Redwood Shores, CA, USA, pages 484-499, Springer Verlag, LNCS Nr. 2523, August 13-15, 2002.   Abstract   Paper
• B. Sunar, E. Savas, and C. K. Koc. Constructing composite field representations for efficient conversion. IEEE Transactions on Computers, 52(11):1391-1398, November 2003.   Abstract   Paper
• E. Savas, A. F. Tenca, and C. K. Koc. Dual-field multiplier architecture for cryptographic applications Thirty-Seventh Asilomar Conference on Signals, Systems, and Computers, pages 374-378, IEEE Press, Pacific Grove, California, November 9-12, 2003.   Abstract   Paper
• E. Savas, A. F. Tenca, M. E. Ciftcibasi, and C. K. Koc. Novel multiplier architectures for GF(p) and GF(2^n). IEE Proceedings - Computers and Digital Techniques, 151(2):147-160, March 2004.   Abstract   Paper
• A. F. Tenca, E. Savas, and C. K. Koc. A design framework for scalable and unified multipliers in GF(p) and GF(2^m). International Journal of Computer Research, 13(1):68-83, 2004.   Abstract   Paper
  This paper is also published in Embedded Cryptographic Hardware: Methodologies and Architectures, N. Nedjah and L. de M. Mourelle, editors, Nova Science Publishers, 2004.
• E. Savas, M. Naseer, A. A.-A. Gutub, and C. K. Koc. Efficient unified Montgomery inversion with multibit shifting. IEE Proceedings - Computers and Digital Techniques, to appear, 2004.   Abstract   Paper