ArticleslgStudy

computer science

Kevin McCurley (cryptographer)

Kevin McCurley (cryptographer) is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Kevin McCurley (cryptographer) rather than just read about it. In short: Kevin Snow McCurley is a mathematician, computer scientist, and cryptographer, and a former research scientist at Google. He has written publications about information retrieval, algorithms, parallel computing, cryptography, and number theory.

Key takeaways

  • Kevin McCurley (cryptographer) belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Kevin McCurley (cryptographer) to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Kevin McCurley (cryptographer) from memory before moving on to harder problems.

Reference excerpt

Kevin Snow McCurley is a mathematician, computer scientist, and cryptographer, and a former research scientist at Google. He has written publications about information retrieval, algorithms, parallel computing, cryptography, and number theory.

Early life and education When he was a child, McCurley had built model planes and cars, and he enjoyed making things with his hands. McCurley attended a high school in San Jose, California. There, one of his teachers, Judy Jones, showed him that "mathematics really could be fun and interesting" and encouraged him to attend mathematical contests. In his first year at Santa Clara University, McCurley had Jerry Anderson, a former president of the MAA, as his professor in calculus; Anderson told "interesting stories" and was able to "relate the mathematics to history and to activities that were meaningful". He started out as a mathematician, but he later retrained himself as a computer scientist. In 1981, McCurley received his Ph.D. in mathematics from the University of Illinois at Urbana-Champaign. His dissertation in analytic number theory was titled Explicit Estimates for Functions of Primes in Arithmetic Progressions, and his advisor was Paul Trevier Bateman. He also received a master's in statistics there. In the fall of 1995, McCurley taught an undergraduate course on cryptology at the University of New Mexico. After he was a post-doc at Michigan State University, McCurley took a job at USC (Los Angeles), where he published some papers with Leonard Adleman about algorithms and complexity.

Career Before 2005, McCurley worked at IBM Almaden Research Center, Sandia National Laboratories, and at the University of Southern California. McCurley worked in a cryptography group at Sandia National Laboratories, where he worked on applying number theory to cryptography and parallel computing. He then worked at IBM Research in California on digital rights management, where he wrote a few patents; he was there in January 1999. A former president of the International Association for Cryptologic Research, McCurley was selected as an IACR Fellow in 2005 for his "exemplary service as IACR President and essential leadership in IACR information systems". From 2005 to at least 2009 McCurley was a research scientist at Google Research. There, he worked on search, advertisements, and Android.

Miscellany In 2000, McCurley suggested, while speaking at Financial Cryptography '00 conference, that, as a countermeasure against email spam, recipients of email from unknown senders should request that the message include a first name, a few dollars, or a donation to a specific charity as compensation. He also suggested that this be formalized in an open standard.

Bets about P vs NP McCurley has made three bets with Ron Fagin about the outcome of the P versus NP problem. In each bet, the outcome P = NP would require Fagin to pay McCurley $50, whereas P != NP would require McCurley to pay Fagin $10. The first bet had a deadline of 31 December 2010, the second a deadline of 31 December 2020, and the third (made in 2021) a deadline of 31 December 2030.

References

External links Kevin McCurley's personal home page Selected publications

Worked examples

Example 1 — a first encounter with Kevin McCurley (cryptographer)

Start with the simplest possible case. Write down what Kevin McCurley (cryptographer) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Kevin McCurley (cryptographer) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Kevin McCurley (cryptographer) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Kevin McCurley (cryptographer)

In research
Kevin McCurley (cryptographer) appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Kevin McCurley (cryptographer) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Kevin McCurley (cryptographer) is common in secondary-school and first-year university syllabi. It links to neighbouring topics 20th-century American mathematicians, 21st-century American mathematicians, American computer scientists, so understanding it makes those chapters shorter.
In everyday life
Look for Kevin McCurley (cryptographer) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Kevin McCurley (cryptographer)” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Kevin McCurley (cryptographer) in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Kevin McCurley (cryptographer) means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Kevin McCurley (cryptographer) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Kevin McCurley (cryptographer) in simple terms?

Kevin Snow McCurley is a mathematician, computer scientist, and cryptographer, and a former research scientist at Google. He has written publications about information retrieval, algorithms, parallel computing, cryptography, and number theory.

Why does Kevin McCurley (cryptographer) matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Kevin McCurley (cryptographer)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Kevin McCurley (cryptographer).

Tags

  • 20th-century American mathematicians
  • 21st-century American mathematicians
  • American computer scientists
  • American cryptographers
  • American number theorists
  • Google people
  • International Association for Cryptologic Research fellows
  • Living people
  • Modern cryptographers
  • University of Illinois Urbana-Champaign alumni

Keep exploring