rosulek

Crypto problems need to be hard on average. That is, a randomly chosen instance of the problem should be hard, except with very low probability. NP-completeness is a notion of worst-case hardness. And it is unlikely that cryptography can be based on NP-completeness. There are several papers on the topic, one of which is this one.

What's your favorite theorem (and/or favorite proof)?

I'm sure the science that came out of the Cassini mission has been great, but from a lay-perspective the photography has been absolutely stunning. I always thought that being the "mission photographer" (planning the camera activity) for a planetary probe would be probably the best job in the world.

• What is the thought process for balancing scientific value vs purely aesthetic/outreach value in how the cameras are used? If there's a chance for a really spectacular shot, is the team willing to alter the orbit? That kind of thing.

• What kind of stunning photography can we expect from the final approach?

The map is not the territory.

What projects do you have coming up in the future? Smaller scale things like the latest book, or another huge Bible-scale work?