Crypto Galore!

I discuss three aspects of mathematical cryptography that have been themes of Mike Fellows' work: applications of parameterized complexity, combinatorial systems, and Kid Krypto. At times my treatment is anecdotal, and on occasion it veers toward the impractical, fanciful, and even downright goofy.

[1]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[2]  Neal Koblitz,et al.  Random Curves: Journeys of a Mathematician , 2007 .

[3]  Shu Lin,et al.  Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 1999, Lecture Notes in Computer Science.

[4]  Michael R. Fellows,et al.  Fixed-Parameter Complexity and Cryptography , 1993, AAECC.

[5]  Rainer Steinwandt,et al.  Attacking a polynomial-based cryptosystem: Polly Cracker , 2002, International Journal of Information Security.

[6]  Gilles Brassard,et al.  A note on the complexity of cryptography (Corresp.) , 1979, IEEE Trans. Inf. Theory.

[7]  Alfred Menezes,et al.  Another look at security definitions , 2013, Adv. Math. Commun..

[8]  Paul C. van Oorschot.  A Comparison of Practical Public Key Cryptosystems Based on Integer Factorization and Discrete Logarithms , 1990, CRYPTO.

[9]  Michael R. Fellows,et al.  Kid Krypto , 1992, CRYPTO.

[10]  Ian H. Witten,et al.  Explaining cryptographic systems to the general public , 1999 .

[11]  Neal Koblitz.  Secret Codes and Online Security: A Seminar for Entering Students , 2010, Cryptologia.

[12]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[13]  Henri Gilbert,et al.  Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30 - June 3, 2010. Proceedings , 2010, EUROCRYPT.

[14]  Ann Hibner Koblitz,et al.  A Convergence of Lives-Sofia Kovalevskaia: Scientist, Writer, Revolutionary , 1984 .

[15]  Yevgeniy Dodis,et al.  Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model , 2009, CRYPTO.

[16]  Vinod Vaikuntanathan,et al.  Signature Schemes with Bounded Leakage Resilience , 2009, ASIACRYPT.

[17]  Harold W. Thimbleby,et al.  Explaining cryptographic systems , 2003, Comput. Educ..

[18]  Aggelos Kiayias,et al.  BiTR: Built-in Tamper Resilience , 2011, IACR Cryptol. ePrint Arch..

[19]  Ernest F. Brickell,et al.  Breaking Iterated Knapsacks , 1985, CRYPTO.

[20]  Moni Naor,et al.  Public-Key Encryption in the Bounded-Retrieval Model , 2010, EUROCRYPT.

[21]  Giovanni Di Crescenzo,et al.  Perfectly Secure Password Protocols in the Bounded Retrieval Model , 2006, TCC.

[22]  David Cash,et al.  Intrusion-Resilient Key Exchange in the Bounded Retrieval Model , 2007, TCC.

[23]  Stefan Dziembowski,et al.  Intrusion-Resilience Via the Bounded-Storage Model , 2006, TCC.

[24]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[25]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[26]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[27]  Shai Halevi.  Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings , 2009, CRYPTO.

[28]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[29]  Adi Shamir,et al.  A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[30]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[31]  Neal Koblitz.  Cryptography as a Teaching Tool , 1997, Cryptologia.

[32]  Ernest F. Brickell,et al.  Advances in Cryptology — CRYPTO’ 92 , 2001, Lecture Notes in Computer Science.