French
DeutschBurt Kaliski
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Burt Kaliski | |
|---|---|
| Born | Burt Kaliski |
| Education | Massachusetts Institute of Technology (BS, MS, PhD) |
| Occupation | Cryptographer |
Burton S. "Burt" Kaliski, Jr. is a cryptographer, who is currently the chief technology officer (CTO) and senior vice president at Verisign.[1] Before joining Verisign in 2011, he was the founding director of the EMC Innovation Network at EMC Corporation since its 2006 acquisition of RSA Security where he was Chief Scientist for RSA Laboratories. His notable work includes the development of such public key cryptography standards as PKCS[2] and IEEE P1363,[3] the extension of linear cryptanalysis to use multiple approximations, and the design of the block cipher Crab.
Kaliski received his B.S., M.S., and Ph.D. degrees in Computer Science from MIT, where his research was on cryptography.[4] He was a visiting assistant professor of computer engineering at Rochester Institute of Technology before joining RSA Security.[5]
He was also a guest professor and member of the international advisory board of Peking University, School of Software and Microelectronics.[5]
References
[edit]- ^ Dr. Burt Kaliski Jr., Verisign Senior Vice President and Chief Technology Officer
- ^ PKCS #7: Cryptographic Message Syntax (RFC2315)
- ^ "Ford and Kaliski, IEEE P1363.2: Password-Based Public-Key Cryptography". Archived from the original on 2013-10-19. Retrieved 2014-01-16.
- ^ Burt Kaliski at the Mathematics Genealogy Project
- ^ a b Bio at RSA Laboratories Archived December 30, 2006, at the Wayback Machine
External links
[edit]- Bio: Burt Kaliski, The New Face of Technology Symposium, Georgia Tech College of Computing.
- Profile at the AMS-SIAM Mathematics Careers Bulletin Board (archived 2009)
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This article about a cryptographer is a stub. You can help Wikipedia by expanding it. |