(this is me!)
This is a homepage for me, Joshua Hill. This is a site that I use to
accumulate links to items that I wrote or find interesting.
You can find out about me by reading my
curriculum vitæ .
If you're all social media-y, you can also view my or my google profile.
You can find out about my academic genealogy here. My Erdős Number is 4.
I've written a few technical papers:
I've translated (with help from Google Translate) Saburô Uchiyama's Sur le Nombre des Valeurs Distinctes d'un Polynôme à Coefficients dans un Corps Fini. My translation is The Number of Distinct Values of a Polynomial with Coefficients in a Finite Field
I've developed a few write ups for various classes that I've taught / TAed:
I have a few papers in (sometimes perpetual) draft:
I've made several public presentations on computer security, cryptography, and mathematics.
- A presentation that I gave in 1999 titled The Zen of Information Security.
- A presentation that I gave in 2000, titled Securing a Linux Box: It's mine, and You Can't Use It., which was in turn based on another presentation that I gave in 1998. As such, a fair bit of this is somewhat dated.
- A presentation I gave in 2002, titled Network Security: A Quick Overview.
- A presentation I gave in 2008, titled Cryptographic Foibles and Missteps.
- A presentation I gave in 2010 on Coppersmith's Theorem: Background, Generalizations and Applications.
- My advancement presentation in 2011 on Weil Image Sums.
- My ANTS X 2012 presentation on Counting Value Sets: Algorithm and Complexity
- A presentation that I gave in 2012 on Block Ciphers: Modes of Use, DES and AES
- A presentation that I gave in 2013 on Random Bit Generation: Theory and Practice
- A presentation that I gave in 2013 on The Dual Elliptic Curve Deterministic RBG
- A presentation that I gave in 2013 that includes a summary of various computational approaches to the discrete logarithm problem, including two very recent approaches by Joux. Joux's Recent Index Calculus Results
- A presentation that I gave in 2013 outlining the analysis of substitution ciphers. Substitution Ciphers
- A presentation that I gave in 2014 that includes a summary of various averaging results produced by David Harvey, et al. This includes the best known point counting algorithm on general purpose arithmetic schemes. Harvey's Average Polynomial Time Algorithms
- A presentation that I gave in 2014 on use of LaTeX in mathematics publishing. LaTeX for Mathy Endeavors: (Somewhat) Advanced LaTeX (and Related Matters)
Here are some programs that I find useful or generally neat:
- Solar Designer and the Openwall Project team pulled all his great tools together and made a hardened linux distribution called Owl.
- Fydor wrote a port scanner that you can use to audit your machine. It is called nmap.
- If you need to test the reasonableness of an PRNG, you can do large scale statistical testing on it. NIST has developed a series of tests documented in the excellent NIST SP800-22 (rev. 1a). NIST stopped support for the UNIX version of the test tool, but I've continued to support it here: sts.
I have a few other pieces of software that I've written over the years. Some of them are even still useful.
A horrifying and uproariously funny description of How To Publish a Scientific Comment (in 123 easy steps) by Prof. Rick Trebino at Georgia Institute of Technology. (a local copy is here.)
Mail josh (dash) web (at) untruth.org with comments, questions, etc.