Looking Back—My Life as a Mathematician and Cryptographer

  • Douglas R. StinsonEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11959)


In this paper, I look back at my career as a mathematician and mathematical cryptographer, mainly concentrating on my student days and the early parts of my career. I also discuss my research philosophy and what I mean by the term “combinatorial cryptography.” Along the way, I recall some influential people, books and papers.


  1. 1.
    Bellovin, S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35, 203–222 (2011)CrossRefGoogle Scholar
  2. 2.
    Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17, 210–229 (1988)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Blake, I.F., Fuji-Hara, R., Mullin, R.C., Vanstone, S.A.: Computing logarithms in finite fields of characteristic two. SIAM J. Algebraic Discrete Methods 5, 276–285 (1984)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing for general access structures. Cryptology ePrint Archive: Report 2019/602Google Scholar
  5. 5.
    Brickell, E.F.: A few results in message authentication. Congressus Numerantium 43, 141–154 (1984)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Delsarte, P.: The association schemes of coding theory. Ph.D. thesis, Université Catholique de Louvain, June 1973Google Scholar
  7. 7.
    Dinitz, J.H., Stinson, D.R.: A fast algorithm for finding strong starters. SIAM J. Algebraic Discrete Methods 2, 50–56 (1981)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  9. 9.
    Honsberger, R.: Ingenuity in Mathematics. Mathematical Association of America, Washington, DC (1975)zbMATHGoogle Scholar
  10. 10.
    Honsberger, R.: Mathematical Morsels. Mathematical Association of America, New York (1979) zbMATHGoogle Scholar
  11. 11.
    Mullin, R.C., Stinson, D.R., Wallis, W.D.: Concerning the spectrum of skew room squares. Ars Combinatoria 6, 277–291 (1978)MathSciNetzbMATHGoogle Scholar
  12. 12.
    Ryser, H.: Combinatorial Mathematics. Mathematical Association of America, New York (1963)CrossRefGoogle Scholar
  13. 13.
    Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, Piscataway (1992)zbMATHGoogle Scholar
  15. 15.
    Stinson, D.R.: Some constructions and bounds for authentication codes. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 418–425. Springer, Heidelberg (1987). Scholar
  16. 16.
    Stinson, D.R.: Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92, 105–110 (1993)MathSciNetGoogle Scholar
  17. 17.
    Stinson, D.R., Massey, J.L.: An infinite class of counterexamples to a conjecture concerning non-linear resilient functions. J. Cryptol. 8, 167–173 (1995)CrossRefGoogle Scholar
  18. 18.
    Stinson, D.R., Vanstone, S.A.: A combinatorial approach to threshold schemes. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 330–339. Springer, Heidelberg (1988). Scholar
  19. 19.
    van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)CrossRefGoogle Scholar
  20. 20.
    Wilson, R.M.: Constructions and uses of pairwise balanced designs. In: Hall, M., van Lint, J.H. (eds.) Combinatorics. ASIC, vol. 16, pp. 19–42. (1975). Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations