Rich Schroeppel
I'm presently exploring the use of cryptography to implement secure network protocols.
My research interests include most things mathematical or computical.

Education: BS math MIT '68.

Somos Sequence Near-Addition Formulas and Modular Theta Functions
Bill Gosper has found some near-addition formulas for Somos sequences.
Plus my foray into defining theta functions mod 43.

2004 Experimental Math Talk (slides)
http://richard.schroeppel.name:8015/expmath04-schroeppel-talk.pdf
Modular Dilogarithms, Counting PolyHypercubes, Counting PolyPolygons, The Post Tag Problem,
A Boolean Quickie -- Minimal Circuits, UltraPrecision & UltracomputableNumbers, Conway's Game of Life.
2004 Experimental Math Forecast (slides) http://richard.schroeppel.name:8015/expmath04-schroeppel-panel.pdf
Reckless predictions for the next decade.

Modular Dilogarithms http://richard.schroeppel.name:8015/dilog-paper-020402
The classical dilogarithm function can be generalized to Mod P.

The Hasty Pudding Cipher http://richard.schroeppel.name:8015/hpc
A tasty morsel!

Elliptic Curves and Fast Galois Field Arithmetic http://richard.schroeppel.name:8015/ecrv
Find out about the wonderful world of GF[2^K], where 2=0, plus is minus,
and squaring is a linear operator. And why they are called elliptic curves.

Hilbert Speech http://richard.schroeppel.name:8015/hilbert-speech
The mathematician David Hilbert, in a 1900 speech, proposed 23 problems.
Many new areas of mathematics have evolved since 1900, but Hilbert's problems
still have some influence. The equations are best viewed in a fixed-width font.

Hunting Big Game in the Theory of Numbers http://richard.schroeppel.name:8015/biggame4
Derrick N. Lehmer's classic 1933 article about using an electromechanical sieve
for factoring and primality testing.

The Hasty Pudding Cipher, Elliptic Curves, and Multiperfect Numbers.
http://richard.schroeppel.name:8015/ftp/index.html

Phone: 801-423-7998 / Email: rcs@cs.arizona.edu