Skip to main content
Erschienen in:
Buchtitelbild

2020 | OriginalPaper | Buchkapitel

Looking Back—My Life as a Mathematician and Cryptographer

verfasst von : Douglas R. Stinson

Erschienen in: Selected Areas in Cryptography – SAC 2019

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
I did have to memorize the multiplication table, but this did not bother me.
 
2
This quote is from the Wikipedia article “Conway’s Soldiers” (https://​en.​wikipedia.​org/​wiki/​Conway’s_​Soldiers), which is released under the Creative Commons Attribution-Share-Alike License 3.0.
 
3
This quote is from the Wikipedia article “Murray S. Klamkin” (https://​en.​wikipedia.​org/​wiki/​Murray_​S.​_​Klamkin), which is released under the Creative Commons Attribution-Share-Alike License 3.0.
 
4
This is sometimes called a Minkowski diagram.
 
5
Gus was another important influence on my career.
 
6
Unconditional security is basically the same thing as being secure against an infinitely powerful adversary.
 
7
I attribute this amusing term to Curt Lindner.
 
8
This quote is from the Wikipedia article “Computers and Intractability” (https://​en.​wikipedia.​org/​wiki/​Computers_​and_​Intractability), which is released under the Creative Commons Attribution-Share-Alike License 3.0.
 
9
There is apparently no source to substantiate the claim that Einstein actually said this, but it is still a good quote.
 
10
I should emphasize that I am not specifically criticizing the wording and notation in this definition. I am just using it to illustrate how complicated cryptographic definitions have become in recent years.
 
Literatur
1.
Zurück zum Zitat Bellovin, S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35, 203–222 (2011)CrossRef Bellovin, S.M.: Frank Miller: inventor of the one-time pad. Cryptologia 35, 203–222 (2011)CrossRef
2.
Zurück zum Zitat Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17, 210–229 (1988)MathSciNetCrossRef Bennett, C.H., Brassard, G., Robert, J.-M.: Privacy amplification by public discussion. SIAM J. Comput. 17, 210–229 (1988)MathSciNetCrossRef
3.
Zurück zum Zitat 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)MathSciNetCrossRef 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)MathSciNetCrossRef
4.
Zurück zum Zitat Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing for general access structures. Cryptology ePrint Archive: Report 2019/602 Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing for general access structures. Cryptology ePrint Archive: Report 2019/602
5.
Zurück zum Zitat Brickell, E.F.: A few results in message authentication. Congressus Numerantium 43, 141–154 (1984)MathSciNetMATH Brickell, E.F.: A few results in message authentication. Congressus Numerantium 43, 141–154 (1984)MathSciNetMATH
6.
Zurück zum Zitat Delsarte, P.: The association schemes of coding theory. Ph.D. thesis, Université Catholique de Louvain, June 1973 Delsarte, P.: The association schemes of coding theory. Ph.D. thesis, Université Catholique de Louvain, June 1973
7.
Zurück zum Zitat Dinitz, J.H., Stinson, D.R.: A fast algorithm for finding strong starters. SIAM J. Algebraic Discrete Methods 2, 50–56 (1981)MathSciNetCrossRef Dinitz, J.H., Stinson, D.R.: A fast algorithm for finding strong starters. SIAM J. Algebraic Discrete Methods 2, 50–56 (1981)MathSciNetCrossRef
8.
Zurück zum Zitat Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)MATH Garey, M.R., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)MATH
9.
Zurück zum Zitat Honsberger, R.: Ingenuity in Mathematics. Mathematical Association of America, Washington, DC (1975)MATH Honsberger, R.: Ingenuity in Mathematics. Mathematical Association of America, Washington, DC (1975)MATH
10.
Zurück zum Zitat Honsberger, R.: Mathematical Morsels. Mathematical Association of America, New York (1979) MATH Honsberger, R.: Mathematical Morsels. Mathematical Association of America, New York (1979) MATH
11.
Zurück zum Zitat Mullin, R.C., Stinson, D.R., Wallis, W.D.: Concerning the spectrum of skew room squares. Ars Combinatoria 6, 277–291 (1978)MathSciNetMATH Mullin, R.C., Stinson, D.R., Wallis, W.D.: Concerning the spectrum of skew room squares. Ars Combinatoria 6, 277–291 (1978)MathSciNetMATH
12.
Zurück zum Zitat Ryser, H.: Combinatorial Mathematics. Mathematical Association of America, New York (1963)CrossRef Ryser, H.: Combinatorial Mathematics. Mathematical Association of America, New York (1963)CrossRef
14.
Zurück zum Zitat Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, Piscataway (1992)MATH Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, Piscataway (1992)MATH
16.
Zurück zum Zitat Stinson, D.R.: Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92, 105–110 (1993)MathSciNet Stinson, D.R.: Resilient functions and large sets of orthogonal arrays. Congressus Numerantium 92, 105–110 (1993)MathSciNet
17.
Zurück zum Zitat 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)CrossRef 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)CrossRef
19.
Zurück zum Zitat van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)CrossRef van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)CrossRef
Metadaten
Titel
Looking Back—My Life as a Mathematician and Cryptographer
verfasst von
Douglas R. Stinson
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-38471-5_1