University of Southern California

USC News logo

Under Lock & Key

04/16/03
USC professor Leonard Adleman wins the Turing Award, the top honor in computer science, for contributions to cryptography. Adleman collaborated on an algorithm that makes private communication over electronic networks more secure.
by Eric Mankin


Leonard M. Adleman, holder of USC’s Henry Salvatori Chair in Computer Science, is a co-winner of the Association for Computing Machinery’s 2002 A. M. Turing Award.

Named after computer pioneer Alan Turing, the award is given for contributions to public key cryptography and is considered the most prestigious in computer science.

It carries a $100,000 prize, with funding provided by Intel Corp.

At MIT in 1977, Adleman worked with Ronald L. Rivest and Adi Shamir to develop the RSA code, which has become the foundation of an entire generation of technology security products. It also has inspired important work in both theoretical computer science and mathematics.

RSA is an algorithm -- named for Rivest, Shamir and Adleman -- that uses a number theory to provide a pragmatic approach to secure transactions.

It is today’s most widely used encryption method, with applications in Internet browsers and servers, electronic transactions in the credit card industry and products providing e-mail services.

The RSA scheme provides secure communications over distances between parties that have not previously met, reversing historical conventions that required the parties to exchange secret keys prior to communication.

Because the new key exchange algorithm eliminated this inconvenient and often insecure step, it provided the ideal mechanism for private communications over electronic networks.

RSA gained widespread attention when it was published in a detailed paper in Communications of the ACM, in February 1978.

Rivest, Shamir and Adleman shared the 1996 ACM Paris Kanallakis Award for Theory and Practice, together with professors Whitfield Diffie, Martin Hellman and Ralph Merkle, who pioneered the concept of public-key cryptography.

The Kanellakis Award honors specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing.

Robert E. Kahn, chairman, president and CEO of the Corporation for National Research Initiatives, headed the 2002 Turing Award committee.

He said the committee quickly agreed on Rivest, Shamir and Adleman as this year's honorees.

“We had a large number of highly qualified candidates, but what impressed us was the combination of their theoretical contribution and its widespread practical application,” Kahn said.

“They clearly deserved this recognition for their well-known seminal work in advancing the theory and application of public key cryptography,” he said.

Adleman, also a professor of molecular biology, earned a bachelor of science degree in mathematics and a Ph.D. in computer science from UC Berkeley.

Rivest is the Viterbi Professor of Computer Science in MIT's department of electrical engineering and computer science. Shamir is the Borman Professor in the applied math department of the Weizmann Institute of Science in Israel.

ACM will present the Turing Award at the annual ACM Awards Banquet on June 7, 2003, at the Town and Country Conference Center in San Diego. The event will be held in conjunction with the Federated Computing Research Conference.

Contact Eric Mankin at (310) 448-9112 or (213) 821-1887.