Tolga Acar
Tolga Acar received his B.S. (1992) and M.S. (1994) degrees
in Control and Computer Engineering from
Istanbul Technical University.
He completed his Ph.D. in Electrical and
Computer Engineering at Oregon State University
in December 1997 under the supervision of
Prof. Çetin K. Koç.
Tolga is now working as a Security Architect for
Microsoft Research.
His research interests include cryptography, computer security software,
software development & testing, computer and network security, computer
arithmetic, operating systems, software engineering, image processing and
computer vision. He is a member of IEEE
and IEEE Computer Society.
Contact Information
Phone: (801) 861 2320
E-mail: t.acar@computer.org
Selected Publications
- C. K. Koc, T. Acar, and B. S. Kaliski Jr. Analyzing and comparing
Montgomery multiplication algorithms. IEEE Micro, 16(3):26-33, June
1996.
Abstract
Paper
- C. K. Koc and T. Acar. Montgomery multiplication in GF(2^k).
Proceedings of Third Annual Workshop on Selected Areas in
Cryptography, pages 95-106, Queen's University, Kingston, Ontario,
Canada, August 15-16, 1996.
Abstract
Paper
- C. K. Koc and T. Acar. A Methodology for High-Speed Software
Implementations of Number-Theoretic Cryptosystems.
Technical Report, Electrical and Computer Engineering,
Oregon State University, 12 pages, May 1997.
Abstract
Report
- C. K. Koc and T. Acar. Fast software exponentiation in GF(2^k).
Proceedings, 13th Symposium on Computer Arithmetic, T. Lang, J.-M.
Muller, and N. Takagi, editors, pages 225-231, Asilomar, California, July
6-9, 1997, Los Alamitos, CA: IEEE Computer Society Press.
Abstract
Paper
- C. K. Koc and T. Acar. Montgomery multiplication in GF(2^k).
Designs, Codes and Cryptography, 14(1):57-69, April 1998.
Abstract
Paper
- J. R. Michener and T. Acar. Managing system and active-content
integrity. IEEE Computer, July 2000.
Abstract
Paper
- J. R. Michener and T. Acar. Security domains: Key management in
large-scale systems. IEEE Software, 17(5):52-58, September/October
2000.
Abstract
|
