John Steinberger

Currently teaching: Mathematics for Computer Science (spring 2016)
Previously taught:  Convex Optimization (fall 2015)
 Mathematics for Computer Science (spring 2015)
 Mathematics for Computer Science (spring 2014)
 Convex Optimization (fall 2013)
 Fundamentals of Cryptography (spring 2013)
 Fundamental Ideas in Theoretical Computer Science (fall 2012)
 Fundamentals of Cryptography (spring 2012)
 Fundamental Ideas in Theoretical Computer Science (fall 2011)
 Introduction to Computer Science
 Math 253
 Matrix Algebra
 Differential Equations
 Linear Algebra
 Precalculus
 Discrete Math for Computer Science
 Differential Calculus
My CV.
My Quals Talk.
My 4CT Talk.
My PhD also in PS.
Papers/Preprints:
Indifferentiability of 8-Round Feistel Networks
Yuanxi Dai and John Steinberger, IACR preprint.
PDFPS
Indifferentiability of 10-Round Feistel Networks
Yuanxi Dai and John Steinberger, IACR preprint.
PDFPS
Indifferentiability of Confusion-Diffusion Networks
Yevgeniy Dodis, Tianren Liu, Martijn Stam and John Steinberger, IACR preprint.
PDFPS
Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
Peter Gazi, Jooyoung Lee, Yannick Seurin, John Steinberger and Stefano Tessaro, FSE 2015, Istanbul, Turkey, March 8-11, 2015. LNCS 9054, Springer.
PDF
Minimizing the Two-Round Even-Mansour Cipher
Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin and John Steinberger, Crypto 2014, LNCS 8616, Springer, 39-56.
PDF
The Security of Multiple Encryption in the Ideal Cipher Model
Yuanxi Dai, Jooyoung Lee, Bart Mennink and John Steinberger, Crypto 2014, LNCS 8616, Springer, 20-38.
PDF
Tight security bounds for Multiple Encryption
Yuanxi Dai and John Steinberger, IACR preprint (accepted to CRYPTO 2014, see merged paper above).
PDFPS
Tight security bounds for Key-Alternating Ciphers
Shan Chen and John Steinberger, Eurocrypt 2014, LNCS 8441, Springer, 327-350.
PDFPS
On the indifferentiability of key-alternating ciphers
Elena Andreeva, Andrey Bogdanov, Yevgeniy Dodis, Bart Mennink and John Steinberger, CRYPTO 2013, LNCS 8042, Springer, 531-550.
PDFPS
The distinguishability of product distributions by read-once branching programs
John Steinberger, CCC (Conference on Computational Complexity) 2013.
PDFPS
Improved security bounds for key-alternating ciphers via Hellinger distance
John Steinberger, IACR preprint.
PDFPS
To Hash or Not to Hash Again? (In)differentiability results for H2 and HMAC
Yevgeniy Dodis, Thomas Ristenpart, John Steinberger and Steffano Tessaro, CRYPTO 2012, LNCS 7417, Springer, 348-366.
PDF
Stam's Conjecture and Threshold Phenomena in Collision Resistance
John Steinberger, Xiaoming Sun and Zhe Yang, CRYPTO 2012, LNCS 7417, Springer 384-405.
PDFPS
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Francois-Xavier Standaert, Elmar Tischhauser and John Steinberger, Eurocrypt 2012, LNCS 7237, Springer, 45-62.
PDF
The preimage security of double-block length compression functions
Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee, Martijn Stam and John Steinberger, Asiacrypt 2011, LNCS 7073, Springer, 233-251.
PDFPS
The collision security of Tandem-DM in the ideal cipher model
Jooyoung Lee, Martijn Stam and John Steinberger, Crypto 2011, LNCS 6841, Springer, 316-333.
PDFPS
Domain extension for MACs beyond the birthday barrier
Yevgeniy Dodis and John SteinbergerEurocrypt 2011, LNCS 6632, Springer, 323-342.
PDFPS
Stam's collision resistance conjecture
John Steinberger, Eurocrypt 2010, LNCS 6610, Springer, 597-615.
PDFPS
Multi-property-preserving domain extension using polynomial-based modes of operation
Jooyoung Lee and John Steinberger, Eurocrypt 2010, LNCS 6610, Springer, 573-596.
PDFPS
Coset arrays and nonnegative integer linear combinations
John Steinberger, preprint.
PDFPS
Message authentication codes from unpredictable blockciphers
Yevgeniy Dodis and John Steinberger, Crypto 2009, LNCS 5677, Springer, 267-285.
PDFPS
An unavoidable set of D-reducible configurations
John Steinberger, Transactions of the American Mathematical Society, 362 (2010), 6633-6661.
PDF PS FILES
Constructing cryptographic hash functions from fixed-key blockciphers
Phillip Rogaway and John Steinberger, Crypto 2008, LNCS 5157, Springer, 433-450
PDFPS
Security/efficiency tradeoffs for permutation-based hashing
Philip Rogaway and John Steinberger, Eurocrypt 2008, LNCS 4965, Springer, 220-236
PDFPS
The collision intractability of MDC-2 in the ideal cipher model
John Steinberger, Eurocrypt 2007, LNCS 4515, Springer, 34-51
PDFPS
The lowest-degree polynomial with nonnegative coefficients divisible by the n-th cyclotomic polynomial  
John Steinberger, Electronic Journal of Combinatorics, Volume 19, Issue 4 (2012).
PDFPS
Tilings of the integers can have superpolynomial periods
John Steinberger, Combinatorica, volume 29 (2009), 503-509
PDFPS
On the entry sum of cyclotomic arrays
Don Coppersmith and John Steinberger, INTEGERS: the Electronic Journal of Combinatorial and Additive Number Theory, 6 (2006)
PDF
 
PS
 
Minimal vanishing sums of roots of unity with large coefficients
John Steinberger, Proceedings of the London Mathematical Society, 97 No. 3 (2008), 689-717
PDFPS
Quasiperiodic group factorizations
John Steinberger, Resultate der Mathematik, 51 (2008), 319-338
PDF PS
Indecomposable tilings of the integers with exponentially long periods
John Steinberger, Electronic Journal of Combinatorics, 12 (2005)
PDF
 
PS
 
Multiple tilings of Z with long periods, and tiles with many-generated level semigroups
John Steinberger, New York Journal of Mathematics, 11 (2005), 445-456
PDF
 
PS
 
A class of prototiles with doubly generated level semigroups
John Steinberger, Journal of Combinatorial Theory, Series A, 106 No. 1 (2004)
PDF
 
PS