I am the Cryptography Incubation Team lead in the Security and Cryptography Incubations team of the eXtreme Computing Group. This is an applied cryptography research group working on various cryptography mechanisms and architectures in operating systems and cloud computing platforms.
I completed my B.S. (summa cum laude) and M.Sc. (cum laude) at the Istanbul Technical University in 1992 and 1994, and my Ph.D. at the Oregon State University in December of 1998, respectively. I designed and implemented a multi-tasking operating system on Intel 386 systems entirely in assembly language. Halfway through my B.S. thesis, I had heard of an open-source project going on somewhere in Finland and swiftly ignored it after discovering that my system was well ahead of what was to become Linux. In my master's thesis, I created new image compression, edge detection, and surface reconstruction algorithms based on non-convex optimization techniques. I had also setup the computer science department's first working network with CAT5 cables running across hallways intermingled with the coaxial bus cables and various other antiquity.
My PhD thesis focused on high-speed software and hardware architectures for number-theoretical cryptographic algorithms. Most of my graduate work was sponsored by grants from Intel, RSA DSI, and US Navy Research Labs across several projects. These projects include high-performance core cryptographic and math libraries on Intel Pentium and MMX, Sparc V8/V9, and TMS320C16 architectures. I was proud to have the fastest and meanest modular exponentiation implementation. I proposed several new SIMD instructions to speed up cryptographic algorithms in integer rings and characteristic 2 fields. Some of them appeared in later MMX versions now known as SSE.
I worked at Novell from 1997 through 2003 on various aspects of cryptography and authentication, and joined Microsoft in January of 2004 as a developer in Windows Security. At Microsoft, I worked as a Developer, Developer Lead, and Program Manager in Windows Core Security and Online Services groups. I moved to CSRO Incubations to start the Cryptography Incubation group within Security Incubations, which later was moved into Microsoft Research and eXtreme Computing Group in 2009.
- Tolga Acar, Kristin Lauter, Michael Naehrig, and Daniel Shumow, Affine Pairings on ARM, no. 2011/43, International Association for Cryptologic Research, 16 May 2011
- Lan Nguyen and Tolga Acar, Homomorphic Proofs and Applications, in Public Key Cryptography (PKC 2011), International Association for Cryptologic Research, 6 March 2011
- Tolga Acar and Lan Nguyen, Revocation for Delegatable Anonymous Credentials, no. MSR-TR-2010-170, 22 December 2010
- Tolga Acar, Karen Easterbrook, and Brian LaMacchia, Implementing Fiber-based Steganography for Pairings, International Association for Cryptologic Research, 17 August 2010
- Tolga Acar, Mira Belenkiy, Lan Nguyen, and Carl Ellison, Key Management In Distributed Systems, no. MSR-TR-2010-78, 17 June 2010
- Tolga Acar, Mira Belenkiy, Mihir Bellare, and David Cash, Cryptographic Agility and its Relation to Circular Encryption, in EUROCRYPT 2010, Springer Verlag, May 2010
- Tolga Acar and Dan Shumow, Modular Reduction without Pre-computation for Special Moduli, 2010
- Tolga Acar and John R. Michener, Risks in Features vs. Assurance, in CACM, vol. 45, no. 8, pp. 146, Association for Computing Machinery, Inc., August 2002
- John R. Michener and Tolga Acar, Security domains: Key management in large-scale systems, in IEEE Software, vol. 17, no. 5, pp. 52–58, IEEE Computer Society, September 2000
- John R. Michener and Tolga Acar, Managing system and active-content integrity, in IEEE Computer, IEEE Computer Society, July 2000
- Tolga Acar, High-Speed Algorithms & Architectures For Number-Theoretic Cryptosystems, Oregon State University/Oregon State University, Corvallis, OR, June 1998
- Cetin K. Koc and Tolga Acar, Montgomery multiplication in GF(2^k), in Designs, Codes and Cryptography, vol. 14, pp. 57–69, Kluwer Academic , April 1998
- Cetin K. Koc and Tolga Acar, High-Speed Algorithms & Architectures For Number-Theoretic Cryptosystems, December 1997
- Cetin K. Koc and Tolga Acar, Fast software exponentiation in GF(2^k), in 13th Symposium on Computer Arithmetic, IEEE Computer Society, Asilomar, California, July 1997
- Cetin K. Koc and Tolga Acar, Montgomery Multiplication in GF(2^k), in Third Annual Workshop on Selected Areas in Cryptography, Springer Verlag, Queen's University, Ontario, Canada, 15 August 1996
- Cetin K. Koc and Tolga Acar, Analyzing and Comparing Montgomery Multiplication Algorithms, in IEEE Micro, vol. 16, pp. 26–33, IEEE Computer Society, 1996
- Muhittin Gokmen and Tolga Acar, Multiscale Edge Integration by Weighted Accumulation, in International Symposium on Computer and Information Sciences, Kusadasi, Turkey, 30 October 1995
- Nalini Ratha, Tolga Acar, Muhittin Gokmen, and Anil K. Jain, A Distributed Edge Detection And Surface Reconstruction Algorithm, in Computer Architectures for Machine Perception (CAMP95), IEEE, Como, Italy, September 1995
- Tolga Acar, Nonstandard Regularization for Selected Image Processing and Computer Vision Problems, September 1994
- Tolga Acar and Muhittin Gokmen, Image coding using weak membrane model of images, in Proc. Vis. Comm. and Image Processing, 1994



